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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
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 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 ↗

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 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 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.

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)).

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.

The study sets limits on how well systems can be controlled adaptively.

problem Learning to control unknown linear Gaussian systems with quadratic costs.
method Combining ideas from experiment design, estimation theory, and perturbation bounds of information matrices.
result Regret lower bounds of the order of T\sqrt{T} in the time horizon TT accurately capture control-theoretic parameters.

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 ↗

In this work, we propose a robust approach to design distributed controllers for unknown-but-sparse linear and time-invariant systems. By leveraging modern techniques in distributed controller synthesis and structured linear inverse problems as applied to system identification, we show that near-optimal distributed con…

2019-09-21abs ↗pdf ↗

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.

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.

Non-bilinear observations make optimal control harder, showing non-convex costs and non-affine optimal controllers.

problem Optimal control from bilinear observations in linear systems is challenging.
method Analytical and numerical methods to study the non-convex cost-to-go and non-affine optimal controllers.
result The Separation Principle does not hold for bilinear observations, leading to non-convex costs and non-affine optimal controllers.

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 ↗

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 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.

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.

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.

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.

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.

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.

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.

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.

We study the problem of controlling linear time-invariant systems with known noisy dynamics and adversarially chosen quadratic losses. We present the first efficient online learning algorithms in this setting that guarantee O(T)O(\sqrt{T}) regret under mild assumptions, where TT is the time horizon. Our algorithms rely …

2018-06-19abs ↗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.

We explore a new method for discrete-time control problems using randomization and entropy.

problem Discrete-time linear-exponential quadratic Gaussian (LEQG) control problem.
method Introduce exploration through randomization and apply duality between free energy and relative entropy.
result Reduced LEQG problem to equivalent risk-neutral LQG control problem with entropy regularization.

Finding optimal feedback controllers for nonlinear dynamic systems from data is hard. Recently, Bayesian optimization (BO) has been proposed as a powerful framework for direct controller tuning from experimental trials. For selecting the next query point and finding the global optimum, BO relies on a probabilistic desc…

2017-09-20abs ↗pdf ↗

New method handles robust and adaptive control of linear systems with non-convex costs.

problem Robust and adaptive control of linear systems with unknown parameters.
method Combining non-asymptotic linear regression, interval prediction, and tree-based planning.
result First end-to-end suboptimality analysis for robust and adaptive MPC with non-convex costs.

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 ↗