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

Trend · papers per month

3867711,1571,542 · Jun 202019922001200920172026
48 results for closed-loop learning

Framework learns robust control policies from expert demonstrations.

problem Adversarial robustness and closed-loop generalization in feedback control policies.
method Lipschitz-constrained loss minimization for certified robustness and generalization.
result Finite sample bound on policy learning error and robust closed-loop stability.

Study on parameter dynamics in exponential families under closed-loop learning.

problem Understanding and preventing convergence to biased absorbing states in model parameter estimation.
method Derived equations of motion for parameter dynamics in exponential families. Showed convergence to biased states under maximum likelihood estimation and proposed solutions.
result Closed-loop learning can lead to biased parameter estimates, but can be mitigated by using maximum a posteriori estimation or regularisation.

Formula adjusts steady-state models for control confounding.

problem Learning steady-state models from operational data can be flawed due to control confounding.
method Derives a formula to adjust for control confounding using structural dynamical causal models.
result Estimates a causal steady-state model from closed-loop operational data.

Data-efficient learning in continuous state-action spaces using very high-dimensional observations remains a key challenge in developing fully autonomous systems. In this paper, we consider one instance of this challenge, the pixels to torques problem, where an agent must learn a closed-loop control policy from pixel i…

2015-02-08abs ↗pdf ↗

This work discusses a closed-loop control strategy for complex systems utilizing scarce and streaming data. A discrete embedding space is first built using hash functions applied to the sensor measurements from which a Markov process model is derived, approximating the complex system's dynamics. A control strategy is t…

2016-04-11abs ↗pdf ↗

Geometrically characterizes virtual nonlinear nonholonomic constraints using symplectic methods.

problem Characterizing virtual nonlinear nonholonomic constraints geometrically.
method Geometric characterization using symplectic structures and Chetaev equations.
result A unique control law exists to satisfy virtual constraints, and closed-loop dynamics are projections of uncontrolled dynamics.

Analyzes how learning algorithms affect and are affected by data manipulation.

problem Characterizing the closed-loop behavior of learning algorithms in the presence of decision-dependent data.
method Analyzes repeated risk minimization as perturbed gradient flows of performative risk minimization, considering multiple local minimizers.
result Characterizes the region of attraction for various equilibria and introduces performative alignment.

DQN outperforms static policies in a dynamic fee environment for automated market makers.

problem How automated market makers (AMMs) perform under dynamic fees is unknown.
method Constructed a closed-loop simulator with dynamic fees, noise flow, and arbitrage.
result A small DQN policy outperforms static policies in a dynamic fee environment.

This paper uses NLDT to find interpretable control rules from complex DRL policies.

problem Complex, non-interpretable policies from black-box AI methods.
method Evolutionary optimization of NLDT for hierarchical control rules.
result Interpretable control rules with similar performance to black-box DRL.

New budget quantifies drift in closed-loop learning, improving reproducibility.

problem Characterizing statistical learning under distributional drift in closed-loop settings.
method Introduces an intrinsic drift budget CTC_T quantifying cumulative information-geometric motion of the data distribution.
result Proves a drift-feedback bound of order T1/2+CT/TT^{-1/2}+C_T/T for prequential reproducibility, up to controlled second-order remainder terms.

Paper predicts recycling bin full events to reduce RVM downtime.

problem Predicting bin full events to increase RVM uptime.
method Hybrid approach combining machine learning and statistical approximation.
result Forecasting leads to less downtime and costs compared to emptying strategies.

Sequential learning of tasks using gradient descent leads to an unremitting decline in the accuracy of tasks for which training data is no longer available, termed catastrophic forgetting. Generative models have been explored as a means to approximate the distribution of old tasks and bypass storage of real data. Here …

2018-11-03abs ↗pdf ↗

AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.

problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.

CLQT benchmarks LLM portfolio managers by evaluating their decision-making process, not just returns.

problem Most benchmarks rank LLMs by returns, ignoring their decision-making process and potential for look-ahead leakage.
method CLQT reframes evaluation as diagnosis, using a closed-loop, cost-aware, strategy-consistent environment with a five-stage cycle.
result CLQT provides a durable map of agent competencies and limitations, separating outcome from process.

Reinforcement Learning optimizes low-thrust interplanetary trajectories under disturbances.

problem Designing robust interplanetary trajectories in the presence of disturbances.
method Reformulated as a Markov Decision Process, RL algorithm Proximal Policy Optimization trained on a deep neural network.
result Deep neural network provides robust nominal trajectory and guidance law.

The paper tackles performative risk optimization under weak convexity assumptions.

problem Optimizing performative risk in a closed-loop prediction system with weak convexity.
method Relaxing convexity assumptions to maintain optimization feasibility.
result Iterative optimization methods remain applicable even with weakened convexity conditions.

New framework optimizes forecasting and decision-making in dynamic systems.

problem Optimizing forecasting and decision-making processes in dynamic systems.
method Closed-loop framework using bilevel optimization.
result The proposed methodology yields consistently better performance than the standard open-loop approach.

Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.

problem Time-inconsistent stochastic control problems with mean and higher-order moments.
method Developed closed-loop and open-loop Nash equilibrium controls using PDEs and maximum principles.
result Identical closed-loop and open-loop Nash equilibria controls, independent of state value and random path.

A geometric approach to differential game theory is illustrated. The parallel pursuit is considered as a two-player zero-sum differential game. The optimal strategies of each player is designed based on Riemann-Finsler geometry. Our approach incorporates a closed loop optimal control and the presentation is familiar wi…

2011-01-10abs ↗pdf ↗

The paper provides guarantees for feedback control with sensor errors.

problem Certifying performance and safety in feedback control systems with sensor errors.
method Solving a supervised learning problem to characterize sensor errors and providing uniform error bounds.
result Finite-time convergence rate on sub-optimality of using a regressor in closed-loop for waypoint tracking.

We present an alternative local definition of the writhe of a self-avoiding closed loop which differs from the traditional non-local definition by an integer. When studying dynamics this difference is immaterial. We employ a formula due to Aldinger, Klapper and Tabor for the change in writhe and propose a set of local,…

1997-03-13abs ↗pdf ↗

Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an …

2000-08-03abs ↗pdf ↗

Deep RL improves blood glucose control for T1D patients.

problem Managing blood glucose levels for people with type 1 diabetes.
method Developed deep reinforcement learning techniques for automated blood glucose control.
result Deep RL approach outperforms baseline control algorithms, reducing glycemic risk and hypoglycemia.

Iterative method learns unknown constraints for MPC control.

problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.

TIE framework detects out-of-distribution samples and estimates uncertainty without external datasets.

problem Detecting and estimating uncertainty for out-of-distribution samples in neural networks.
method TIE framework extends a classifier to an (n+1)-class model, iteratively refining through training, inversion, and exclusion.
result Unified and interpretable framework for robust anomaly detection and calibrated uncertainty estimation.

Combines Gaussian processes and polynomial chaos for stochastic control.

problem Uncertainties in dynamic models lead to performance issues in predictive control.
method Combines Gaussian processes with polynomial chaos expansions to estimate probability distributions of nonlinear functions.
result Demonstrates accurate approximation and closed-loop performance in stochastic nonlinear model predictive control.

Co-adaptation is a special form of on-line learning where an algorithm A\mathcal{A} must assist an unknown algorithm B\mathcal{B} to perform some task. This is a general framework and has applications in recommendation systems, search, education, and much more. Today, the most common use of co-adaptive algorithms is …

2016-11-29abs ↗pdf ↗

We propose a sliding surface for systems on the Lie group SO(3)×R3SO(3)\times \mathbb{R}^3 . The sliding surface is shown to be a Lie subgroup. The reduced-order dynamics along the sliding subgroup have an almost globally asymptotically stable equilibrium. The sliding surface is used to design a sliding-mode controller for t…

2019-05-14abs ↗pdf ↗