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

Trend · papers per month

6121824 · Jun 202019922001200920172026
48 results for Non-stationary LQR

Algorithm minimizes control regret for non-stationary LQR systems.

problem Control of non-stationary LQR systems with unknown dynamics.
method Adaptive non-stationarity detection and OLS estimator with small bias.
result Achieves optimal dynamic regret of $ ilde{\mathcal{O}}\left(V_T^{2/5}T^{3/5} ight)$.

Optimal algorithm for LQR control with improved regret bound.

problem Nonstochastic control with quadratic losses (LQR control).
method Online algorithm with optimal dynamic regret of ildeO(extmax{n1/3TV(M1:n)2/3,1}) ilde{O}( ext{max}\{n^{1/3} \mathcal{TV}(M_{1:n})^{2/3}, 1\}).
result Improves the best known rate of ildeO(n(TV(M1:n)+1)) ilde{O}(\sqrt{n (\mathcal{TV}(M_{1:n})+1)} ) for general convex losses.

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.

The paper sets bounds on how much regret is unavoidable in adaptive LQR with unknown B-matrix.

problem Understanding the limits of adaptive LQR with unknown B-matrix.
method Local asymptotic minimax regret lower bounds using van Trees' inequality and Bellman error representation.
result Logarithmic regret is impossible if the parametrization induces an uninformative optimal policy.

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.

New insights into RL efficiency from managing time discretization.

problem The impact of time discretization on RL methods in continuous-time systems.
method Analysis of Monte-Carlo policy evaluation for LQR systems.
result An optimal choice of temporal resolution for a given data budget improves policy evaluation efficiency.

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

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.

Global convergence proved for multi-agent LQRs with hierarchical actor-critic.

problem Challenges in understanding multi-agent reinforcement learning algorithms.
method Developed a hierarchical actor-critic algorithm for partially exchangeable agents.
result Global linear convergence to optimal policy proved.

Optimal trading strategy using LQR framework with price mean-reversion.

problem Developing a dynamic trading strategy in a market with linear and quadratic costs.
method Model Predictive Control (MPC) approach to optimize trading curve with positivity constraints.
result Optimal trading curve reacts opportunistically to price changes while satisfying constraints.

This manuscript surveys reinforcement learning from the perspective of optimization and control with a focus on continuous control applications. It surveys the general formulation, terminology, and typical experimental implementations of reinforcement learning and reviews competing solution paradigms. In order to compa…

2018-06-25abs ↗pdf ↗

New algorithm achieves optimal regret in non-stochastic control, showing stochasticity is not beneficial.

problem Achieving optimal control in non-stochastic systems with adversarial noise.
method Novel online Newton step algorithm adapted to adversarial disturbances, using policy regret bounds.
result Optimal O~(T)\widetilde{\mathcal{O}}(\sqrt{T}) regret achieved in unknown dynamics, poly(logT)\mathrm{poly}(\log T) regret in known dynamics.

New definition resolves ambiguity in non-stationary bandit classification.

problem Ambiguity in classifying non-stationary bandits using existing definitions.
method Introducing a formal definition that resolves ambiguity and provides a unified approach.
result Unified approach applicable to both Bayesian and frequentist formulations, resolves classification issues.

SmoothFBO tackles non-stationary functional bilevel optimization.

problem Current FBO methods are limited to static offline settings and perform poorly in online, non-stationary scenarios.
method SmoothFBO introduces a time-smoothed stochastic hypergradient estimator with a window parameter to handle non-stationarity.
result SmoothFBO achieves sublinear regret and outperforms existing methods in non-stationary hyperparameter optimization and model-based reinforcement learning.

Transformers achieve near-optimal dynamic regret in non-stationary reinforcement learning.

problem Understanding and handling non-stationary environments in reinforcement learning.
method Demonstrated that transformers can achieve nearly optimal dynamic regret bounds in non-stationary settings.
result Transformers can approximate and learn strategies for non-stationary environments, matching or outperforming existing expert algorithms.

New algorithm tackles non-stationary reinforcement learning with general function approximation.

problem Understanding non-stationary MDPs with function approximation.
method Dynamic Bellman Eluder (DBE) dimension for complexity, sliding window mechanism, confidence set design.
result Upper bound on dynamic regret for proposed SW-OPEA algorithm.

New definitions of ESP for quantum reservoir computing handle non-stationary systems.

problem Traditional ESP does not apply to non-stationary systems.
method Introduce two new categories of ESP: non-stationary ESP and subset/subspace ESP.
result Demonstrates correspondence between non-stationary ESP and QRC with NARMA tasks.

Study combines VICReg and TNC for better encoding of non-stationary seismic signals.

problem Ineffective self-supervised learning on non-stationary time series.
method Combines VICReg and Temporal Neighborhood Coding (TNC).
result Effective for self-supervised learning on non-stationary seismic signals.

We propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…

2017-05-24abs ↗pdf ↗

Algorithm adapts to non-stationary rewards without prior knowledge.

problem Optimizing decisions in non-stationary environments without prior knowledge of changes.
method Optimization-based algorithm that restarts when non-stationarity is detected.
result Achieves tighter dynamic regret bound and is nearly minimax optimal.

This paper develops the first method for the exact simulation of reflected Brownian motion (RBM) with non-stationary drift and infinitesimal variance. The running time of generating exact samples of non-stationary RBM at any time tt is uniformly bounded by O(1/γˉ2)\mathcal{O}(1/\barγ^2) where γˉ\barγ is the average drift of…

2013-12-23abs ↗pdf ↗

Unified review of methods for inferring non-stationary process parameters.

problem Inferring parameters of non-stationary processes without a known model.
method Unified review and categorization of algorithms for Parameter Inference from a Non-stationary Unknown Process (PINUP).
result Simple statistical features can perform well on non-stationary systems, highlighting gaps in existing methods.

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.

Develops a deep non-stationary kernel for non-stationary spatio-temporal point processes.

problem Capturing non-stationary dependencies in point process data.
method Approximates the influence kernel with a novel low-rank decomposition and introduces a log-barrier penalty to maintain non-negativity.
result Demonstrates superior performance and computational efficiency compared to state-of-the-art methods.

Paper tackles non-stationary kernelized bandits with near-optimal algorithm.

problem Minimizing regret in a time-varying reward function.
method Near-optimal algorithm with a novel restarting phased elimination with random permutation (R-PERP).
result Regret upper bound matches the lower bound, making the algorithm near-optimal.

The paper provides exact multivariate amplitude distributions for non-stationary Gaussian or algebraic fluctuations.

problem Capturing the statistical properties of fluctuating correlations in non-stationary systems.
method Developed a random matrix model to average multivariate amplitude distributions from short time scales to large time scales.
result Explicit multivariate distributions for non-stationary correlation systems are provided, capturing the degree of non-stationarity.

Efficient GP framework for scalable non-stationary processes.

problem Heavy memory and computational requirements in Gaussian process regression for large data sets.
method Exploits structure in the kernel matrix, uses multiple sets of non-equidistant inducing points, and employs Toeplitz and Kronecker structure for efficient inference.
result Demonstrated scalability on numerical examples and large biomedical datasets.

Flexible GP model improves wind power prediction accuracy.

problem Accurate probabilistic prediction of wind power for grid stability.
method Heteroscedastic non-stationary Gaussian process with generalised spectral mixture kernel.
result The proposed model outperforms conventional GP models in wind power prediction.

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.