Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

84168252336 · Jun 202019922001200920172026
48 results for discrete-time systems

Discrete-time systems can be characterized by simple flat coordinates and their shifts.

problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.

Paper formulates mutual information optimal control for discrete-time systems.

problem Optimal control of discrete-time linear systems with mutual information.
method Formulates MIOCP as an extension of MEOCP, derives optimal policy and prior, proposes alternating minimization algorithm.
result Proposes an alternating minimization algorithm for MIOCP.

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

Optimizes control of noisy discrete systems without system matrix knowledge.

problem Optimal control of discrete-time systems with additive and multiplicative noises.
method Stochastic Lyapunov and Riccati equations, model-free reinforcement learning.
result Model-free reinforcement learning algorithm converges to optimal control policy.

Study on 2-valued dynamics on complex plane, showing some dynamics can't be group actions.

problem Whether 2-valued dynamics can be defined by the action of a 2-valued group.
method Construction of examples of dynamics that are or are not group actions.
result Some 2-valued dynamics on complex plane cannot be defined by the action of a 2-valued group.

The paper tackles exact linearization and control of flat discrete-time systems.

problem Exact linearization and control of flat nonlinear discrete-time systems.
method Investigates conditions for choosing new inputs and feedbacks that may depend on forward-shifts of the new input.
result Easily verifiable conditions for choosing a feasible input and a new input that minimizes forward-shifts of the flat output.

Defines hybrid systems on principal bundles and studies impact effects.

problem Understanding impact effects in hybrid mechanical systems.
method Defines hybrid systems on principal bundles, studies underlying geometry, and finds conditions for impact preservation.
result Conditions for preservation of both exterior and interior impacts by mechanical connections.

Methods from learning theory are used in the state space of linear dynamical and control systems in order to estimate the system matrices. An application to stabilization via algebraic Riccati equations is included. The approach is illustrated via a series of numerical examples.

2015-07-11abs ↗pdf ↗

We develop a version of the fundamental theorem of asset pricing for discrete-time markets with proportional transaction costs and model uncertainty. A robust notion of no-arbitrage of the second kind is defined and shown to be equivalent to the existence of a collection of strictly consistent price systems.

2014-08-23abs ↗pdf ↗

Paper proposes adaptive control for unknown systems using reinforcement learning.

problem Adaptive control for unknown, linearizable systems.
method On-policy reinforcement learning for discrete-time, stochastic systems.
result Stability and tracking errors concentrate near zero with high probability.

The paper analyzes the probabilistic structure of DDPMs and bounds their sampling error.

problem Understanding and controlling errors in discrete-time DDPMs.
method Structural analysis of score functions, Schrödinger's problem, and FBSDEs.
result Explicit upper bound for total variation distance between sampling and target distributions.

Improved stability analysis of neural network systems using Zames-Falb multipliers.

problem Analyzing stability of linear systems with neural network nonlinearities.
method Using integral quadratic constraints, sector-bounded and slope-restricted structure, and acausal Zames-Falb multipliers.
result Flexible and versatile framework for stability analysis with improved computational efficiency.

We focus on variational inference in dynamical systems where the discrete time transition function (or evolution rule) is modelled by a Gaussian process. The dominant approach so far has been to use a factorised posterior distribution, decoupling the transition function from the system states. This is not exact in gene…

2018-12-14abs ↗pdf ↗

Training a neural network with the gradient descent algorithm gives rise to a discrete-time nonlinear dynamical system. Consequently, behaviors that are typically observed in these systems emerge during training, such as convergence to an orbit but not to a fixed point or dependence of convergence on the initialization…

2018-05-22abs ↗pdf ↗

Study approximates financial market with discrete-time models.

problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.

New discrete-time model shows insider trading dynamics.

problem Modeling insider trading with discrete time and noise traders.
method Formulated as a game with three types of traders, including an insider, noise traders, and a market maker. Proved existence of sequential Kyle equilibrium for various distributions and information flows.
result Equilibria exist in mixed strategies but not in pure strategies, unlike in Kyle's original model.

We briefly review the notion of second order constrained (continuous) system (SOCS) and then propose a discrete time counterpart of it, which we naturally call discrete second order constrained system (DSOCS). To illustrate and test numerically our model, we construct certain integrators that simulate the evolution of …

2013-12-06abs ↗pdf ↗

Constant Proportion Portfolio Insurance (CPPI) is an investment strategy designed to give participation in the performance of a risky asset while protecting the invested capital. This protection is however not perfect and the gap risk must be quantified. CPPI strategies are path-dependent and may have American exercise…

2009-05-18abs ↗pdf ↗

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

Defines speculative bubbles in discrete-time models based on discounted stock price losing mass.

problem Characterizing speculative bubbles in discrete-time models.
method Introduces a new definition based on discounted stock price behavior and provides probabilistic characterizations.
result Speculative bubbles in discrete time are linked to solutions of a linear Volterra integral equation.

Study proves existence and convergence of discrete-time Kyle models with multiple insiders.

problem Existence and convergence of discrete-time Kyle models with multiple informed traders.
method Proves existence and convergence of discrete-time Kyle models with multiple informed traders using mathematical proofs.
result Equilibrium exists and converges to continuous-time equilibrium as the number of trading times increases.

Study infers interaction kernels from multiple particle trajectories.

problem Inferring interaction kernels from multiple particle trajectories in stochastic systems.
method Nonparametric inference approach based on regularized maximum likelihood estimator.
result Consistent estimator with near-optimal learning rate independent of state space dimension.

We present an efficient and practical algorithm for the online prediction of discrete-time linear dynamical systems with a symmetric transition matrix. We circumvent the non-convex optimization problem using improper learning: carefully overparameterize the class of LDSs by a polylogarithmic factor, in exchange for con…

2017-11-02abs ↗pdf ↗

Study shows financial value of weak information converges in discrete vs continuous markets.

problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.

Optimal strategy for liquidating portfolios under discrete time intervals.

problem Optimizing liquidation of portfolios with discrete time constraints and impact effects.
method Modeling portfolio liquidation with N risky assets, using VaR for cost measurement, and deriving an optimal liquidation time.
result The optimal liquidation time is only influenced by temporary price impacts, not permanent ones.