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

167334501668 · Jun 202019922001200920172026
48 results for linear quadratic systems

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

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.

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.

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.

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.

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.

Regularized least-squares approaches have been successfully applied to linear system identification. Recent approaches use quadratic penalty terms on the unknown impulse response defined by stable spline kernels, which control model space complexity by leveraging regularity and bounded-input bounded-output stability. T…

2013-09-30abs ↗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 ↗

QENDy learns quadratic dynamics from nonlinear systems data.

problem Identifying governing equations of highly nonlinear dynamical systems.
method QENDy embeds nonlinear dynamics into a quadratic feature space, requiring trajectory data and preselected basis functions.
result QENDy accurately identifies quadratic dynamics and outperforms SINDy and deep learning methods.

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 ↗

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 ↗

This paper concerns the problem of learning control policies for an unknown linear dynamical system to minimize a quadratic cost function. We present a method, based on convex optimization, that accomplishes this task robustly: i.e., we minimize the worst-case cost, accounting for system uncertainty given the observed …

2019-06-04abs ↗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 a general time-inconsistent stochastic linear-quadratic differential game. The time-inconsistency arises from the presence of quadratic terms of the expected state as well as state-dependent term in the objective functionals. We define an equilibrium strategy, which is different from the classical one, and …

2016-07-03abs ↗pdf ↗

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.

Given a space it is easy to obtain the system of geodesic equations on it. In this paper the inverse problem of reconstructing the space from the geodesic equations is addressed. A procedure is developed for obtaining the metric tensor from the Christoffel symbols. The procedure is extended for determining if a second …

2007-11-08abs ↗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 consider the fundamental problem of solving quadratic systems of equations in nn variables, where yi=ai,x2y_i = |\langle \boldsymbol{a}_i, \boldsymbol{x} \rangle|^2, i=1,,mi = 1, \ldots, m and xRn\boldsymbol{x} \in \mathbb{R}^n is unknown. We propose a novel method, which starting with an initial guess computed by means of a …

2015-05-19abs ↗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 ↗

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.

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 ↗

Learning to make decisions from observed data in dynamic environments remains a problem of fundamental importance in a number of fields, from artificial intelligence and robotics, to medicine and finance. This paper concerns the problem of learning control policies for unknown linear dynamical systems so as to maximize…

2018-06-01abs ↗pdf ↗

We propose a model of inter-bank lending and borrowing which takes into account clearing debt obligations. The evolution of log-monetary reserves of NN banks is described by coupled diffusions driven by controls with delay in their drifts. Banks are minimizing their finite-horizon objective functions which take into a…

2016-07-21abs ↗pdf ↗

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.

New algorithm learns LQR with O(T)O(\sqrt{T}) regret using Langevin dynamics and excitation.

problem Learning LQR with a O(T)O(\sqrt{T}) regret bound.
method Thompson sampling with Langevin dynamics and excitation mechanism.
result Achieved O(T)O(\sqrt{T}) regret bound for LQR learning.

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.

The main challenge for adaptive regulation of linear-quadratic systems is the trade-off between identification and control. An adaptive policy needs to address both the estimation of unknown dynamics parameters (exploration), as well as the regulation of the underlying system (exploitation). To this end, optimism-based…

2017-11-20abs ↗pdf ↗

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.

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.

Study task-guided exploration in linear dynamical systems, improving sample complexity.

problem Efficiently learning about an environment to complete a specific task.
method Proposed a computationally efficient experiment-design based exploration algorithm.
result Optimally explores the environment, collecting precise information needed to complete the task.

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.

Policy gradient methods converge for LQR problems with noisy state dynamics.

problem Finding optimal policies in noisy LQR problems over finite time horizons.
method Policy gradient methods with convergence guarantees for finite time and stochastic state dynamics.
result Global linear convergence for policy gradient methods in LQR problems with weak assumptions.

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.