PyTorchKR Papers

최신 논문

총 1,461편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:2001.10125

Simultaneous State and Unknown Input Set-Valued Observers for Some Classes of Nonlinear Dynamical Systems

In this paper, we propose fixed-order set-valued (in the form of l2-norm hyperballs) observers for some classes of nonlinear bounded-error dynamical systems with unknown input signals that simultaneously find bounded hyperballs of states and unknown inputs that include the true states and inputs. Necessary and sufficient conditions in the form of Linear Matrix Inequalities (LMIs) for the stability (in the sense of quadratic stability) of the proposed observers are derived for ($\mathcal{M},\gamma$)- Quadratically Constrained (($\mathcal{M},\gamma$)-QC) systems, which includes several classes of nonlinear systems: (I) Lipschitz continuous, (II) ($\mathcal{A},\gamma$)-QC* and (III) Linear Parameter-Varying (LPV) systems. This new quadratic constraint property is at least as general as the incremental quadratic constraint property for nonlinear systems and is proven in the paper to embody a broad range of nonlinearities. In addition, we design the optimal $\mathcal{H}_{\infty}$ observer among those that satisfy the quadratic stability conditions and show that the design results in Uniformly Bounded-Input Bounded-State (UBIBS) estimate radii/error dynamics and uniformly bounded sequences of the estimate radii. Furthermore, we provide closed-form upper bound sequences for the estimate radii and sufficient condition for their convergence to steady state. Finally, the effectiveness of the proposed set-valued observers is demonstrated through illustrative examples, where we compare the performance of our observers with some existing observers.

arXiv:2001.05439

System Energy-Efficient Hybrid Beamforming for mmWave Multi-user Systems

This paper develops energy-efficient hybrid beamforming designs for mmWave multi-user systems where analog precoding is realized by switches and phase shifters such that radio frequency (RF) chain to transmit antenna connections can be switched off for energy saving. By explicitly considering the effect of each connection on the required power for baseband and RF signal processing, we describe the total power consumption in a sparsity form of the analog precoding matrix. However, these sparsity terms and sparsity-modulus constraints of the analog precoding make the system energy-efficiency maximization problem non-convex and challenging to solve. To tackle this problem, we first transform it into a subtractive-form weighted sum rate and power problem. A compressed sensing-based re-weighted quadratic-form relaxation method is employed to deal with the sparsity parts and the sparsity-modulus constraints. We then exploit alternating minimization of the mean-squared error to solve the equivalent problem where the digital precoding vectors and the analog precoding matrix are updated sequentially. The energy efficiency upper bound and a heuristic algorithm are also examined for comparison purposes. Numerical results confirm the superior performances of the proposed algorithm over benchmark energy-efficiency hybrid precoding algorithms and heuristic ones.

arXiv:2001.03767

Closed-Form Bit Error Probabilities for FBMC Systems

This paper analyses the data reconstruction effects emerged from the deployment of non-perfect prototype filters in Filter Bank MultiCarrier (FBMC) systems operating over Additive White Gaussian Noise (AWGN) and frequency-flat Rayleigh channels considering frequency-flatness for each subcarrier. This goal is attained by studying the Bit Error Rate (BER) effects of the prototype filters, increasing the scenario complexity progressively. Despite the complexity, both exact and approximate Bit Error Probability (BEP) expressions portray the BER degradation analytically for any FBMC prototype filter. Numerical results demonstrate that the proposed BEP expressions match perfectly with the simulated BER performance for FBMC systems, regardless of the prototype filter choice.

arXiv:1912.12611

Credit Risk: Simple Closed Form Approximate Maximum Likelihood Estimator

We consider discrete default intensity based and logit type reduced form models for conditional default probabilities for corporate loans where we develop simple closed form approximations to the maximum likelihood estimator (MLE) when the underlying covariates follow a stationary Gaussian process. In a practically reasonable asymptotic regime where the default probabilities are small, say 1-3% annually, the number of firms and the time period of data available is reasonably large, we rigorously show that the proposed estimator behaves similarly or slightly worse than the MLE when the underlying model is correctly specified. For more realistic case of model misspecification, both estimators are seen to be equally good, or equally bad. Further, beyond a point, both are more-or-less insensitive to increase in data. These conclusions are validated on empirical and simulated data. The proposed approximations should also have applications outside finance, where logit-type models are used and probabilities of interest are small.

arXiv:1912.05438

Closed form optimal exercise boundary of the American put option

We present three models of stock price with time-dependent interest rate, dividend yield, and volatility, respectively, that allow for explicit forms of the optimal exercise boundary of the finite maturity American put option. The optimal exercise boundary satisfies the nonlinear integral equation of Volterra type. We choose time-dependent parameters of the model so that the integral equation for the exercise boundary can be solved in the closed form. We also define the contracts of put type with time-dependent strike price that support the explicit optimal exercise boundary.

arXiv:1911.11113

Analytical solution to swing equations in power grids

Objective: To derive a closed-form analytical solution to the swing equation describing the power system dynamics, which is a nonlinear second order differential equation. Existing challenges: No analytical solution to the swing equation has been identified, due to the complex nature of power systems. Two major approaches are pursued for stability assessments on systems: (1) computationally simple models based on physically unacceptable assumptions, and (2) digital simulations with high computational costs. Motivation: The motion of the rotor angle that the swing equation describes is a vector function. Often, a simple form of the physical laws is revealed by coordinate transformation. Methods: The study included the formulation of the swing equation in the Cartesian coordinate system, which is different from conventional approaches that describe the equation in the polar coordinate system. Based on the properties and operational conditions of electric power grids referred to in the literature, we identified the swing equation in the Cartesian coordinate system and derived an analytical solution within a validity region. Results: The estimated results from the analytical solution derived in this study agree with the results using conventional methods, which indicates the derived analytical solution is correct. Conclusion: An analytical solution to the swing equation is derived without unphysical assumptions, and the closed-form solution correctly estimates the dynamics after a fault occurs.

arXiv:1911.10362

Effect of Copper Chemical Form on The Growth of Pseudomonas aeruginosa Isolated from Burned Patients and on Its Cu Uptake

The main object of this investigation was to shed light on the information on the level of Cu uptake by Pseudomonas aeruginosa that has been previously isolated from patients using Gram-negative E. aerogenes ans a Gram-positive Bacillus thuringiensis as a control for Cu uptake measurements. Cu uptake data showed that maximum Cu uptake was obtained by the Pseudomonas aeruginosa. The metal uptake was dependent on the type of biosorbent with different accumulation affinities toward the tested chemical form of the copper. Cells harvested at exponential growth phase showed slightly higher Cu uptake than at stationary phase, which reflect that the Cu uptake is metabolism dependent-process. The increasing order of affinity of the cupric chloride and cupric sulphate towards the three genera were almost constant. However, where cupric nitrate was used, the copper uptake behavior in Pseudomonas aeroginosa was not changed from those results with the other two chemical forms, whereas with E. aerogenes & B. thuringiensis, different Cu uptake behaviors were observed. In B. thuengenesis, the copper uptake rate as a function of initial Cu concentration were shown to increase with increasing the initial concentration of Cu, constantly above 320 ppm as compared with others. In Enterobacter with cupric nitrate, different bahavior was also shown in which the copper uptake decline sharply beyond the 320 ppm. These results reflect that the Cu uptake in P. aeruginosa is with different mechanisms as compared with other tested bacteria.

arXiv:1911.05400

Implicit Higher-Order Moment Matching Technique for Model Reduction of Quadratic-bilinear Systems

We propose a projection based multi-moment matching method for model order reduction of quadratic-bilinear systems. The goal is to construct a reduced system that ensures higher-order moment matching for the multivariate transfer functions appearing in the input-output representation of the nonlinear system. An existing technique achieves this for the first two multivariate transfer functions, in what is called the symmetric form of the multivariate transfer functions. We extend this framework to an equivalent and simplified form, the regular form, which allows us to show moment matching for the first three multivariate transfer functions. Numerical results for three benchmark examples of quadratic-bilinear systems show that the proposed framework exhibits better performance with reduced computational cost in comparison to existing techniques.

arXiv:1910.07689

A Projection Framework for Testing Shape Restrictions That Form Convex Cones

This paper develops a uniformly valid and asymptotically nonconservative test based on projection for a class of shape restrictions. The key insight we exploit is that these restrictions form convex cones, a simple and yet elegant structure that has been barely harnessed in the literature. Based on a monotonicity property afforded by such a geometric structure, we construct a bootstrap procedure that, unlike many studies in nonstandard settings, dispenses with estimation of local parameter spaces, and the critical values are obtained in a way as simple as computing the test statistic. Moreover, by appealing to strong approximations, our framework accommodates nonparametric regression models as well as distributional/density-related and structural settings. Since the test entails a tuning parameter (due to the nonstandard nature of the problem), we propose a data-driven choice and prove its validity. Monte Carlo simulations confirm that our test works well.

arXiv:1908.06890

Advanced Mathematical Business Strategy Formulation Design

This paper deals with the explicit design of strategy formulations to make the best strategic choices from a conventional matrix form of representing strategic choices. The explicit strategy formulation is an analytical model which is targeted to provide a mathematical strategy framework to find the best moment for strategy shifting to prepare rapid market changes. This theoretical model could be adapted into practically any strategic decision making situation when a strategic formulation is described as a matrix form with quantitative measured decision parameters. Analytically tractable results are obtained by using the fluctuation theory and these results are capable to predict the best moments of changing strategies in a matrix form. This research helps strategy decision makers who want to find the optimal moments of shifting present strategies.

arXiv:1908.05556

Probabilistic Verification in Mechanism Design

We introduce a model of probabilistic verification in mechanism design. The principal elicits a message from the agent and then selects a test to give the agent. The agent's true type determines the probability with which he can pass each test. We characterize whether each type has an associated test that best screens out all other types. If this condition holds, then the testing technology can be represented in a tractable reduced form. We use this reduced form to solve for profit-maximizing mechanisms with verification. As the verification technology varies, the solution continuously interpolates between the no-verification solution and full surplus extraction.

arXiv:1907.05348

Distributions of Historic Market Data -- Relaxation and Correlations

We investigate relaxation and correlations in a class of mean-reverting models for stochastic variances. We derive closed-form expressions for the correlation functions and leverage for a general form of the stochastic term. We also discuss correlation functions and leverage for three specific models -- multiplicative, Heston (Cox-Ingersoll-Ross) and combined multiplicative-Heston -- whose steady-state probability density functions are Gamma, Inverse Gamma and Beta Prime respectively, the latter two exhibiting "fat" tails. For the Heston model, we apply the eigenvalue analysis of the Fokker-Planck equation to derive the correlation function -- in agreement with the general analysis -- and to identify a series of time scales, which are observable in relaxation of cumulants on approach to the steady state. We test our findings on a very large set of historic financial markets data.

arXiv:1906.09762

Closed-Form Delay-Optimal Computation Offloading in Mobile Edge Computing Systems

Mobile edge computing (MEC) has recently emerged as a promising technology to release the tension between computation-intensive applications and resource-limited mobile terminals (MTs). In this paper, we study the delay-optimal computation offloading in computation-constrained MEC systems. We consider the computation task queue at the MEC server due to its constrained computation capability. In this case, the task queue at the MT and that at the MEC server are strongly coupled in a cascade manner, which creates complex interdependencies and brings new technical challenges. We model the computation offloading problem as an infinite horizon average cost Markov decision process (MDP), and approximate it to a virtual continuous time system (VCTS) with reflections. Different to most of the existing works, we develop the dynamic instantaneous rate estimation for deriving the closed-form approximate priority functions in different scenarios. Based on the approximate priority functions, we propose a closed-form multi-level water-filling computation offloading solution to characterize the influence of not only the local queue state information (LQSI) but also the remote queue state information (RQSI). A extension is provided from single MT single MEC server scenarios to multiple MTs multiple MEC servers scenarios and several insights are derived. Finally, the simulation results show that the proposed scheme outperforms the conventional schemes.

arXiv:1905.05911

Reduced Form Capital Optimization

We formulate banks' capital optimization problem as a classic mean variance optimization, by leveraging an accurate linear approximation to the Shapely or Constrained Aumann-Shapley (CAS) allocation of max or nested max cost functions. This reduced form formulation admits an analytical solution, to the optimal leveraged balance sheet (LBS) and risk weighted assets (RWA) target of banks' business units for achieving the best return on capital.

arXiv:1904.12085

The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms

The literature specifies extensive-form games in many styles, and eventually I hope to formally translate games across those styles. Toward that end, this paper defines $\mathbf{NCF}$, the category of node-and-choice forms. The category's objects are extensive forms in essentially any style, and the category's isomorphisms are made to accord with the literature's small handful of ad hoc style equivalences. Further, this paper develops two full subcategories: $\mathbf{CsqF}$ for forms whose nodes are choice-sequences, and $\mathbf{CsetF}$ for forms whose nodes are choice-sets. I show that $\mathbf{NCF}$ is "isomorphically enclosed" in $\mathbf{CsqF}$ in the sense that each $\mathbf{NCF}$ form is isomorphic to a $\mathbf{CsqF}$ form. Similarly, I show that $\mathbf{CsqF_{\tilde a}}$ is isomorphically enclosed in $\mathbf{CsetF}$ in the sense that each $\mathbf{CsqF}$ form with no-absentmindedness is isomorphic to a $\mathbf{CsetF}$ form. The converses are found to be almost immediate, and the resulting equivalences unify and simplify two ad hoc style equivalences in Kline and Luckraz 2016 and Streufert 2019. Aside from the larger agenda, this paper already makes three practical contributions. Style equivalences are made easier to derive by [1] a natural concept of isomorphic invariance and [2] the composability of isomorphic enclosures. In addition, [3] some new consequences of equivalence are systematically deduced.

arXiv:1903.09867

An interim core for normal form games and exchange economies with incomplete information: a correction

We consider the interim core of normal form cooperative games and exchange economies with incomplete information based on the partition model. We develop a solution concept that we can situate roughly between Wilson's coarse core and Yannelis's private core. We investigate the interim negotiation of contracts and address the two situations of contract delivery: interim and ex post. Our solution differs from Wilson's concept because the measurability of strategies in our solution is postponed until the consumption date (assumed with respect to the information that will be known by the players at the consumption date). For interim consumption, our concept differs from Yannelis's private core because players can negotiate conditional on proper common knowledge events in our solution, which strengthens the interim aspect of the game, as we will illustrate with examples.

arXiv:1901.09309

High-dimensional statistical arbitrage with factor models and stochastic control

The present paper provides a study of high-dimensional statistical arbitrage that combines factor models with the tools from stochastic control, obtaining closed-form optimal strategies which are both interpretable and computationally implementable in a high-dimensional setting. Our setup is based on a general statistically-constructed factor model with mean-reverting residuals, in which we show how to construct analytically market-neutral portfolios and we analyze the problem of investing optimally in continuous time and finite horizon under exponential and mean-variance utilities. We also extend our model to incorporate constraints on the investor's portfolio like dollar-neutrality and market frictions in the form of temporary quadratic transaction costs, provide extensive Monte Carlo simulations of the previous strategies with 100 assets, and describe further possible extensions of our work.

arXiv:1901.04094

Optimal decoding of dynamic stimuli encoded by heterogeneous populations of spiking neurons - a closed form approximation

Neural decoding may be formulated as dynamic state estimation (filtering) based on point process observations, a generally intractable problem. Numerical sampling techniques are often practically useful for the decoding of real neural data. However, they are less useful as theoretical tools for modeling and understanding sensory neural systems, since they lead to limited conceptual insight about optimal encoding and decoding strategies. We consider sensory neural populations characterized by a distribution over neuron parameters. We develop an analytically tractable Bayesian approximation to optimal filtering based on the observation of spiking activity, that greatly facilitates the analysis of optimal encoding in situations deviating from common assumptions of uniform coding. Continuous distributions are used to approximate large populations with few parameters, resulting in a filter whose complexity does not grow with the population size, and allowing optimization of population parameters rather than individual tuning functions. Numerical comparison with particle filtering demonstrates the quality of the approximation. The analytic framework leads to insights which are difficult to obtain from numerical algorithms, and is consistent with biological observations about the distribution of sensory cells' preferred stimuli.

arXiv:1812.07803

Closed-form approximations with respect to the mixing solution for option pricing under stochastic volatility

We consider closed-form approximations for European put option prices within the Heston and GARCH diffusion stochastic volatility models with time-dependent parameters. Our methodology involves writing the put option price as an expectation of a Black-Scholes formula and performing a second-order Taylor expansion around the mean of its argument. The difficulties then faced are simplifying a number of expectations induced by the Taylor expansion. Under the assumption of piecewise-constant parameters, we derive closed-form pricing formulas and devise a fast calibration scheme. Furthermore, we perform a numerical error and sensitivity analysis to investigate the quality of our approximation and show that the errors are well within the acceptable range for application purposes. Lastly, we derive bounds on the remainder term generated by the Taylor expansion.

arXiv:1810.11725

Total Power Minimization: Joint Antenna Selection and Beamforming Design

In this paper, we consider the total power minimization problem when we have signal-to-interference-plus-noise ratio (SINR) constraints. The consumed power in the circuits depends on the number of active antennas, which can be modeled using zero-norm. Due to the difficulty of dealing with the non-convex zero-norm, we used the standard alternate weighted one-norm approach. We addressed the total power minimization for a narrowband system with and without per-antenna power constraints (PAPCs). We derived iterative closed-form expressions in both cases. Then we analysed the case when we have multiple bands operating at the same time. Analogous closed-form expressions are provided. Our simulation results show that significant gains can be obtained in terms of the total power required compared to standard methods that do not take into account the circuit power.