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

119237356474 · Jun 202019922001200920172026
48 results for Convergence Control

The abstract discusses convergent realizations of Lie subalgebras in control theory.

problem Characterizing Lie subalgebras that can be realized as convergent vector fields.
method Generalizations and reformulations of algebraic properties for output realization.
result Recovery and clarification of previous results on control-affine systems and realization of Chen-Fliess series.

The paper analyzes deep neural networks using control theory to set a time limit for their convergence.

problem Understanding the finite-time convergence of deep neural networks.
method Lyapunov based analysis of the loss function, control theory framework, finite-time control of non-linear systems.
result A priori guarantees of finite-time convergence for deep neural networks are provided.

Paper proves deep learning method for stochastic control converges and outperforms existing algorithms.

problem Formulating and solving stochastic control problems using FBSDE and SMP.
method Deep learning algorithm based on SMP, with convergence proof and error bounds.
result Deep SMP-BSDE algorithm converges and outperforms existing methods in high-dimensional stochastic control problems.

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

Variational inference is increasingly being addressed with stochastic optimization. In this setting, the gradient's variance plays a crucial role in the optimization procedure, since high variance gradients lead to poor convergence. A popular approach used to reduce gradient's variance involves the use of control varia…

2018-10-30abs ↗pdf ↗

Paper studies central bank's strategy to control systemic risk in interbank system.

problem Minimizing average distance between log-monetary reserves and target levels.
method Weak formulation, Ekeland's variational principle, Gamma-convergence, stochastic Fokker-Planck-Kolmogorov equation.
result Proves convergence of optimal strategies as number of banks increases.

Paper revisits set membership estimation for linear systems with relaxed disturbance bounds.

problem Set membership estimation for linear systems with disturbances bounded by convex sets.
method Adopted block-martingale small-ball condition and random perturbed control policies to establish convergence rates.
result Established convergence rates for disturbances bounded by general convex sets.

Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we propose an actor-critic reinforcement learning algorithm that provably converges t…

2014-12-01abs ↗pdf ↗

Optimizes deep learning training by treating it as an optimal control problem.

problem Fragility of deep neural networks to adversarial inputs.
method Formulates adversarial training as a min-max optimization problem and interprets it as an optimal control problem.
result Provides the first convergence analysis of adversarial training algorithm.

Develops neural network framework for risk-reward optimization problems.

problem Multi-period risk-reward optimization with constrained policies.
method Neural network framework with two coupled feedforward networks, parametrizing two-step policies.
result Empirical optimum converges to true optimal value as network capacity and training size increase.

Survey of theoretical foundations for policy optimization in control.

problem Understanding the theoretical properties of gradient-based methods in control and reinforcement learning.
method Interdisciplinary review of optimization landscape, convergence, and sample complexity for various control problems.
result Recent theoretical results on stability and robustness in learning-based control.

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 ↗

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 ↗

Study controlled contagion with state-dependent killing, proving a comparison principle.

problem Analyzing controlled McKean--Vlasov contagion with state-dependent killing.
method Proof of a comparison principle using Wasserstein smooth-gauge comparison and killing-jump absorption estimates.
result Established a comparison principle for the two-population killed-particle HJB.

Study on games with degenerate diffusion matrices, proving value existence and convergence.

problem Zero-sum games between singular controller and stopper with degenerate diffusion.
method Probabilistic approach using parameterized approximations, convergence analysis.
result Existence of value and optimal stopping times for the game with degenerate dynamics.

The paper analyzes convergence of neural SDEs as sample size increases.

problem Understanding the limiting behavior of neural SDEs as sample size grows.
method Analyzes Hamilton-Jacobi-Bellman equation and uses stochastic maximum principle.
result Convergence of minima and optimal parameters of neural SDEs as sample size increases.

Study on PG learning for LQ MFC problems with common noise, proving convergence and sample complexity.

problem Optimal policy learning in LQ MFC problems with common noise and entropy regularization.
method Comprehensive error analysis of PG algorithms in both model-based and model-free settings.
result Global linear convergence and sample complexity of PG algorithms in model-free setting.

The paper examines convergence of distances in Lipschitz structures on manifolds.

problem Convergence of distances in Lipschitz vector fields and norms on manifolds.
method Analysis of convergence of distances associated to converging structures of Lipschitz vector fields and norms.
result Under mild controllability assumption, distances converge locally uniformly to the limit Carnot-Carathéodory distance.

Paper uses Koopman operator and Nyström method for efficient nonlinear control.

problem Control of nonlinear dynamical systems.
method Combines Koopman operator framework with Nyström approximation for kernel methods.
result Theoretical guarantees on the convergence rates of the approximated Riccati operator and regulator objective.

The study analyzes momentum-based optimization algorithms from dynamical systems perspective.

problem Understanding convergence rates of momentum-based optimization algorithms.
method Exploits dynamical systems, control theory, and symplectic perspectives to analyze convergence rates.
result Provides closed-form expressions relating algorithm parameters to convergence rates.

Controlled interacting particle systems such as the ensemble Kalman filter (EnKF) and the feedback particle filter (FPF) are numerical algorithms to approximate the solution of the nonlinear filtering problem in continuous time. The distinguishing feature of these algorithms is that the Bayesian update step is implemen…

2019-10-05abs ↗pdf ↗

EControl improves fast distributed optimization with compression and error control.

problem Stable convergence issues in distributed training with compression.
method Proposes EControl to regulate error compensation and prove fast convergence.
result Proves fast convergence for EControl in various convex settings without additional assumptions.

This paper improves Adam's performance in machine learning tasks.

problem Improving the generalization ability of adaptive gradient methods.
method Develops a control theoretic framework to propose AdamSSM, a new variant of Adam.
result AdamSSM improves generalization accuracy and convergence compared to recent adaptive gradient methods.

Policy gradients methods apply to complex, poorly understood, control problems by performing stochastic gradient descent over a parameterized class of polices. Unfortunately, even for simple control problems solvable by standard dynamic programming techniques, policy gradient algorithms face non-convex optimization pro…

2019-06-05abs ↗pdf ↗

A new family of momentum coefficients improves the convergence rate of accelerated algorithms.

problem Improving the convergence rate of accelerated gradient methods for strongly convex functions.
method Introducing a family of controllable momentum coefficients for forward-backward accelerated methods.
result Established a controllable $O\left(1/k^{2α} ight)$ convergence rate for the NAG-αα method.

Study shows how to learn optimal policies quickly in stochastic control problems.

problem Learning optimal policies in large, continuous state and action spaces with limited data.
method Analyzes three geometric exponents to quantify fast policy regret convergence.
result Shows that fast policy regret convergence is induced by specific geometric structures.

The paper analyzes reg-SGD for convex problems, proving convergence and quantifying the rate of convergence.

problem Minimizing convex, L-smooth functions in a Hilbert space.
method Regularized stochastic gradient descent with decaying regularization.
result Strong convergence to the minimum-norm solution without boundedness assumptions.

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.

BBVI with STL converges geometrically under perfect specification, with quadratic variance bound.

problem Convergence rate of BBVI with STL estimator.
method Proved geometric convergence rate with quadratic variance bound for BBVI with STL estimator.
result BBVI with STL converges geometrically under perfect variational family specification.