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,695 papers · 148 categories

Trend · papers per month

93185278370 · Jun 202019922001200920172026
48 results for iterative control

Iterative method learns unknown constraints for MPC control.

problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.

This work uses QPGPs to improve ILC performance in repetitive tasks.

problem Performance degradation in repetitive motion tasks due to environmental changes and robot wear.
method Incorporates Quasi-Periodic Gaussian Processes into a predictive ILC framework.
result The proposed approach achieves faster convergence and robustness under disturbances.

Adaptive optimal control of nonlinear dynamic systems with deterministic and known dynamics under a known undiscounted infinite-horizon cost function is investigated. Policy iteration scheme initiated using a stabilizing initial control is analyzed in solving the problem. The convergence of the iterations and the optim…

2015-05-20abs ↗pdf ↗

PACE optimizes training for averaged language models, improving performance.

problem How to optimize training for averaged language model iterates.
method Formulated as an optimal-control problem, solved for minimizing error of the average with a penalty on intervention size.
result PACE improves the limiting squared error of the iterate-average estimator by an arbitrarily large factor on some instances.

Generalising the idea of the classical EM algorithm that is widely used for computing maximum likelihood estimates, we propose an EM-Control (EM-C) algorithm for solving multi-period finite time horizon stochastic control problems. The new algorithm sequentially updates the control policies in each time period using Mo…

2016-11-06abs ↗pdf ↗

This paper provides a full controlled version of algebraic KK-theory. This includes a rich array of assembly maps; the controlled assembly isomorphism theorem identifying the controlled group with homology; and the stability theorem describing the behavior of the inverse limit as the control parameter goes to 0. There…

2004-02-24abs ↗pdf ↗

Develops a reinforcement learning algorithm for learning deterministic equilibrium policies in time-inconsistent control problems.

problem Learning equilibrium policies in time-inconsistent control problems.
method Continuous-time model-free reinforcement learning algorithm using deterministic policy gradient approach.
result Learned equilibrium policies in general time-inconsistent control problems.

Gaussian Processes (GPs) are widely employed in control and learning because of their principled treatment of uncertainty. However, tracking uncertainty for iterative, multi-step predictions in general leads to an analytically intractable problem. While approximation methods exist, they do not come with guarantees, mak…

2019-11-29abs ↗pdf ↗

This work is motivated by numerical solutions to Hamilton-Jacobi-Bellman quasi-variational inequalities (HJBQVIs) associated with combined stochastic and impulse control problems. In particular, we consider (i) direct control, (ii) penalized, and (iii) semi-Lagrangian discretization schemes applied to the HJBQVI proble…

2015-10-13abs ↗pdf ↗

New framework calibrates models to control risk under performativity.

problem Calibrating models to ensure reliable decision-making under performativity.
method Iteratively refined calibration process for different risk measures and tail bounds.
result Statistically rigorous risk control under performativity demonstrated.

Optimizes CM for stochastic convex optimization with progressive precision.

problem Stochastic nature of objective function in convex optimization.
method Iterative coordinate minimization with optimal precision control.
result Order-optimal regret performance for strongly convex and nonsmooth functions.

Study efficient iterative method for distribution matching using sliced optimal transport.

problem Efficiently match distributions using sliced optimal transport.
method Slice-matching scheme based on sliced optimal transport, with quantitative non-asymptotic rates derived.
result Derive quantitative non-asymptotic rates for convergence to target distribution.

In this paper, two Q-learning (QL) methods are proposed and their convergence theories are established for addressing the model-free optimal control problem of general nonlinear continuous-time systems. By introducing the Q-function for continuous-time systems, policy iteration based QL (PIQL) and value iteration based…

2014-10-11abs ↗pdf ↗

We prove that the control polygon of a Bezier curve B becomes homeomorphic and ambient isotopic to B via subdivision, and we provide closed-form formulas to compute the number of iterations to ensure these topological characteristics. We first show that the exterior angles of control polygons converge exponentially to …

2012-11-02abs ↗pdf ↗

Model-free approaches for reinforcement learning (RL) and continuous control find policies based only on past states and rewards, without fitting a model of the system dynamics. They are appealing as they are general purpose and easy to implement; however, they also come with fewer theoretical guarantees than model-bas…

2018-04-17abs ↗pdf ↗

New algorithm achieves logarithmic regret for adversarial online control.

problem Online linear-quadratic control in systems with adversarial disturbances.
method Characterization of optimal offline control law, reduced to online learning with approximate advantage functions.
result First algorithm with logarithmic regret for arbitrary adversarial disturbance sequences.

Investment strategy optimizes risk using a specific risk measure.

problem Optimizing investment with risk controlled by a weighted entropic risk measure.
method Investigation of expected utility maximization and risk minimization problems with solutions provided iteratively.
result Explicit characterization of solutions to optimization problems.

This paper analyzes a simplified strategy for nonlinear control using local linear models and iLQR updates.

problem Nonlinear policy optimization in control systems.
method Iterative estimation of local linear models and iLQR-like policy updates.
result Demonstrates polynomial sample complexity and overcomes exponential problem horizon dependence.

We propose a method for efficient training of Q-functions for continuous-state Markov Decision Processes (MDPs) such that the traces of the resulting policies satisfy a given Linear Temporal Logic (LTL) property. LTL, a modal logic, can express a wide range of time-dependent logical properties (including "safety") that…

2018-09-20abs ↗pdf ↗

We analyze stochastic approximation with Markov noise for reinforcement learning.

problem Asymptotic convergence analysis of stochastic approximation with controlled Markov noise.
method Relating to limiting differential inclusions and ergodic occupation measures.
result First informative error bounds on function approximation for policy evaluation.

We propose a novel reformulation of the stochastic optimal control problem as an approximate inference problem, demonstrating, that such a interpretation leads to new practical methods for the original problem. In particular we characterise a novel class of iterative solutions to the stochastic optimal control problem …

2010-09-20abs ↗pdf ↗

Adaptive optimal control using value iteration (VI) initiated from a stabilizing policy is theoretically analyzed in various aspects including the continuity of the result, the stability of the system operated using any single/constant resulting control policy, the stability of the system operated using the evolving/ti…

2014-12-17abs ↗pdf ↗

Market makers optimize trading with a new implicit scheme for complex inequalities.

problem Optimizing trading in a limit order book with stochastic and impulse control.
method Implicit numerical scheme coupled with policy iteration algorithm.
result Convergence to the unique viscosity solution of the HJBQVI.

Deep learning solves complex stochastic control with jumps.

problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

This work studies the contraction coefficients of Schrödinger bridge problems in linear systems.

problem Optimally controlling the evolution of a system's state density over time.
method Analyzes and improves the convergence rates of dynamic Schrödinger systems via geometric and control-theoretic interpretations.
result New insights into improving computation of worst-case contraction coefficients by preconditioning.

The paper solves complex control problems using neural networks.

problem Solving McKean-Vlasov control problems.
method Mean-field neural networks and algorithms based on dynamic programming and stochastic maximum principle.
result Extensive numerical results show the accuracy of the proposed algorithms.

Neural ODEs simplified using Chen-Fliess series for Rademacher complexity analysis.

problem Analyzing the complexity of neural ODE models.
method Using Chen-Fliess series to frame neural ODEs as infinite-width nets, where weights are signature of control input and features are Lie derivatives.
result Derived compact expressions for the Rademacher complexity of ODE models.

Efficiently compress pretrained models using RSI for improved predictive accuracy.

problem Efficiently compressing large pretrained models for practical deployment.
method Randomized subspace iteration (RSI) for low-rank approximation of pretrained models.
result RSI achieves near-optimal approximation quality and outperforms RSVD in predictive accuracy.

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.