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

57114170227 · May 202619922001200920172026
48 results for linear-quadratic control

LqgOpt learns optimal control in unknown LQG systems with minimal regret.

problem Adaptive control in partially observable linear quadratic Gaussian systems with unknown dynamics.
method Optimism in the face of uncertainty, predictor state evolution, closed-loop system identification, confidence bounds.
result Proves a regret upper bound of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) for LQG systems.

We study the problem of regret minimization in partially observable linear quadratic control systems when the model dynamics are unknown a priori. We propose ExpCommit, an explore-then-commit algorithm that learns the model Markov parameters and then follows the principle of optimism in the face of uncertainty to desig…

2020-01-31abs ↗pdf ↗

We study the performance of the certainty equivalent controller on Linear Quadratic (LQ) control problems with unknown transition dynamics. We show that for both the fully and partially observed settings, the sub-optimality gap between the cost incurred by playing the certainty equivalent controller on the true system …

2019-02-21abs ↗pdf ↗

New algorithms achieve logarithmic regret in learning linear quadratic control systems.

problem Learning in Linear Quadratic Control systems with unknown parameters.
method Efficient algorithms for two scenarios: unknown AA or BB with certain conditions.
result Regret scales logarithmically with the number of steps, not square root.

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

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.

We study the constrained linear quadratic regulator with unknown dynamics, addressing the tension between safety and exploration in data-driven control techniques. We present a framework which allows for system identification through persistent excitation, while maintaining safety by guaranteeing the satisfaction of st…

2018-09-26abs ↗pdf ↗

Study optimizes resource allocation in noisy systems for better control.

problem Limited attention in stochastic systems with multiplicative noise.
method Analytical and numerical methods for optimal attention allocation.
result Effective resource allocation enhances noise estimation and control decisions.

Study shows certainty equivalent policy minimizes regret in continuous-time systems.

problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.

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.

Study solves HJB equations for time-inconsistent control problems.

problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.

Study optimizes trading in multiple assets with cross-effects.

problem Optimizing trade execution in multiple assets with cross-impact effects.
method Formulated as a stochastic control problem, extended to progressively measurable controls, solved using linear-quadratic control theory.
result Cross-hedging effects can be optimal, e.g., trading in an asset without an initial position.

The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.

problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.

Study cost-driven state representation learning for control from partial observations.

problem Learning state representation for control from partial and high-dimensional observations.
method Cost-driven state representation learning via predicting cumulative costs.
result Established finite-sample guarantees for near-optimal representation and controller.

Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.

problem Finding optimal policies in nonlinear control systems with partial information.
method Policy gradient algorithm designed for nearly linear-quadratic regulators with small Lipschitz nonlinear components.
result Policy gradient algorithm converges to globally optimal policy with linear rate.

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.

TSAC achieves optimal frequentist regret in adaptive control of LQRs.

problem Adaptive control of stabilizable linear-quadratic regulators with unknown dynamics.
method Thompson Sampling (TS) for adaptive control of LQRs, with a novel early exploration strategy.
result Achieves ildeO(T) ilde O(\sqrt{T}) regret, optimal for multidimensional systems.

This paper studies how gradient descent in control systems can perform well on unseen data.

problem The extent of a learned controller's ability to extrapolate to unseen initial states.
method Theoretical study of policy gradient in Linear Quadratic Regulator (LQR) problems, focusing on the role of exploration.
result The performance of a learned controller on unseen initial states depends on the degree of exploration induced by the system.

The paper solves TIC LQ control problems using stochastic differential games.

problem Time-inconsistent linear-quadratic stochastic control problems.
method Stochastic differential games, spike variation approach.
result Achieves Nash equilibrium for TIC problems, demonstrating impact of ambiguity aversion.

Study policy gradient for large-agent mean-field control and game in continuous time.

problem Optimal policy learning for large number of agents in continuous-time mean-field systems.
method Policy gradient method applied to linear-quadratic mean-field control and game models.
result Policy gradient converges to optimal solution at a linear rate for both mean-field control and game.

We consider the exploration-exploitation tradeoff in linear quadratic (LQ) control problems, where the state dynamics is linear and the cost function is quadratic in states and controls. We analyze the regret of Thompson sampling (TS) (a.k.a. posterior-sampling for reinforcement learning) in the frequentist setting, i.…

2017-03-27abs ↗pdf ↗

Study learns state representations from observations for control, proving guarantees.

problem Learning state representations from high-dimensional observations for control.
method Cost-driven approach, learning latent state model to predict costs.
result Proves finite-sample guarantees for near-optimal state representation and controller.

In this paper, we formulate a general time-inconsistent stochastic linear--quadratic (LQ) control problem. The time-inconsistency arises from the presence of a quadratic term of the expected state as well as a state-dependent term in the objective functional. We define an equilibrium, instead of optimal, solution withi…

2011-11-03abs ↗pdf ↗

New bounds for adaptive control in high dimensions without fixed state space.

problem Adaptive control of linear systems in high or infinite dimensions.
method Novel perturbation bound for certainty equivalence, scaling with prediction error.
result First regret bounds for LQR in infinite dimensional systems, independent of ambient dimension.

This paper addresses the optimal control problem known as the Linear Quadratic Regulator in the case when the dynamics are unknown. We propose a multi-stage procedure, called Coarse-ID control, that estimates a model from a few experimental trials, estimates the error in that model with respect to the truth, and then d…

2017-10-04abs ↗pdf ↗

This work establishes safe reinforcement learning for LQR with nonlinear baselines.

problem Safe reinforcement learning in LQR with unknown dynamics and safety constraints.
method General framework for nonlinear baselines, focusing on 1D spaces.
result Achieves optimal regret bounds for constrained reinforcement learning.

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.

Efficiently solves exploration-exploitation in LQR using Lagrangian relaxation.

problem Exploration-exploitation dilemma in linear quadratic regulator (LQR) setting.
method Relax optimistic optimization into a constrained extended LQR problem, then solve using Riccati equations.
result Computes εε-optimistic controller efficiently with O(log(1/ε))O\big(\log(1/ε)\big) Riccati equations.

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 ↗

Survey explores geometric aspects of policy optimization in control systems.

problem Understanding the geometric relationships between control design and optimization.
method Geometric perspective on policy optimization, focusing on parameterization and topology.
result Implications of policy geometry on stability and performance of local search algorithms.

Study optimizes investment strategies in markets with contagious price jumps.

problem Optimizing portfolios in financial markets with contagious price jumps.
method Applied stochastic maximum principle, backward stochastic differential equations, and linear-quadratic control techniques.
result Obtained efficient strategy and efficient frontier in semi-closed form.