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

59118176235 · May 202619922001200920172026
48 results for Safe Control

We study the problem of safe learning and exploration in sequential control problems. The goal is to safely collect data samples from operating in an environment, in order to learn to achieve a challenging control goal (e.g., an agile maneuver close to a boundary). A central challenge in this setting is how to quantify…

2019-06-13abs ↗pdf ↗

Safe Bayesian optimization tackles safety constraints in control engineering.

problem Handling safety constraints in parameter tuning of control systems.
method Lipschitz-only Safe Bayesian Optimization (LoSBO) and LoS-GP-UCB.
result SafeBO algorithms can violate safety constraints due to unreliable uncertainty bounds.

Safe learning in uncertain systems with state measurements and optimization.

problem Safe learning in nonlinear control-affine systems with unknown additive uncertainty.
method Model uncertainty as Gaussian noise, learn mean and covariance, use optimization to adjust control input.
result Guaranteed safety with arbitrarily large probability while learning and control proceed simultaneously.

Safe RL in linear systems achieves T\sqrt{T}-regret.

problem Efficiently learning in safety-constrained online reinforcement learning.
method Study of linear quadratic regulator with safety constraints.
result First safe algorithm with ildeOT(T) ilde{O}_T(\sqrt{T})-regret.

This paper proposes a method to safely adjust exploration in RL to satisfy constraints.

problem Unsafe exploration in reinforcement learning violates constraints on controlled object states.
method Automatic adjustment of exploration inputs and variance-covariance matrix for safety.
result The method guarantees satisfaction of joint chance constraints with specified probability.

Safe reinforcement learning framework using optimal transport for robustness.

problem Robustness and safety in deep reinforcement learning with limited data assumptions.
method Optimal transport perturbations to construct worst-case virtual state transitions.
result Significantly improved safety at deployment time compared to standard methods.

Reinforcement learning is a powerful paradigm for learning optimal policies from experimental data. However, to find optimal policies, most reinforcement learning algorithms explore all possible actions, which may be harmful for real-world systems. As a consequence, learning algorithms are rarely applied on safety-crit…

2017-05-23abs ↗pdf ↗

Meta-active learning optimizes control of safety-critical systems by efficiently learning dynamics and configurations.

problem Efficiently learning system dynamics and optimal configurations for safety-critical systems like deep brain stimulation.
method Meta-learning an acquisition function using LSTM, cast as meta-learning, with a mixed-integer linear program policy.
result Achieved a 46% increase in information gain and a 20% speedup in computation time over baselines.

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.

In this work we seek for an approach to integrate safety in the learning process that relies on a partly known state-space model of the system and regards the unknown dynamics as an additive bounded disturbance. We introduce a framework for safely learning a control strategy for a given system with an additive disturba…

2018-11-09abs ↗pdf ↗

This paper addresses the question of how a previously available control policy πsπ_s can be used as a supervisor to more quickly and safely train a new learned control policy πLπ_L for a robot. A weighted average of the supervisor and learned policies is used during trials, with a heavier weight initially on the superv…

2019-01-19abs ↗pdf ↗

Safe offline RL for chemical reactors using input convex neural networks.

problem Safe control of exothermic polymerization reactors using historical data.
method Gymnasium-compatible simulation, behaviour cloning, implicit Q-learning, input convex neural networks (PICNNs).
result Offline RL with convex action correction outperforms traditional control approaches.

This paper addresses error bounds and posterior variance for Gaussian process regression.

problem Deriving performance guarantees for Gaussian process regression without prior knowledge.
method Lipschitz continuity and analysis of posterior variance function.
result Uniform error bounds for Gaussian process regression are derived.

Algorithm safely learns from sub-optimal baseline policies while satisfying constraints.

problem Safe reinforcement learning with constraints when baseline policy is sub-optimal.
method Iterative policy optimization alternating between return maximization, baseline distance minimization, and constraint projection.
result Consistently outperforms baselines, achieving 10x fewer constraint violations and 40% higher reward.

Motivated by vision-based control of autonomous vehicles, we consider the problem of controlling a known linear dynamical system for which partial state information, such as vehicle position, is extracted from complex and nonlinear data, such as a camera image. Our approach is to use a learned perception map that predi…

2019-07-08abs ↗pdf ↗

Safe exploration method for RL under disturbance ensures safety with probabilistic guarantees.

problem Safe reinforcement learning in real environments with disturbance.
method Uses partial prior knowledge and conservative inputs to ensure state constraint satisfaction.
result Guaranteed safety with pre-specified probability in the presence of stochastic disturbance.

This work improves motion planning for quadcopters by learning and reasoning about controller performance.

problem Improving motion planning for quadcopters with safety margins and execution reliability.
method Introspective learning and reasoning to correct execution bias and improve collision checking.
result Substantial reduction in safety margins for motion actions, leading to safer execution.

Risk control improves EENNs to make faster predictions without sacrificing accuracy.

problem Determining safe times for EENNs to exit early without degrading performance.
method Adapting risk control frameworks to EENNs to tune their exiting mechanism.
result Risk control enables EENNs to make faster predictions while maintaining user-specified performance goals.

Enforcing safety is a key aspect of many problems pertaining to sequential decision making under uncertainty, which require the decisions made at every step to be both informative of the optimal decision and also safe. For example, we value both efficacy and comfort in medical therapy, and efficiency and safety in robo…

2018-06-20abs ↗pdf ↗

Tail-Safe hedging uses reinforcement learning with a safety layer to manage financial risks.

problem Managing financial risks in derivatives trading with robustness and explainability.
method Combines distributional reinforcement learning with a CBF-QP safety layer to enforce financial constraints.
result Improves risk management without degrading central performance and avoids hard constraint violations.

Risk-averse model uncertainty framework for safe reinforcement learning.

problem Safe decision making in uncertain environments.
method Risk-averse perspective towards model uncertainty using coherent distortion risk measures; equivalent to distributionally robust safe reinforcement learning problems; efficient, model-free implementation.
result Demonstrates robust performance and safety across perturbed test environments.

Paper defines ε-Safe Decision Regions for exponential family distributions and approximates them for unbalanced data.

problem Need probabilistic guarantees for reliable predictions in machine learning.
method Formalizes ε-Safe Decision Regions, proves their form for exponential family distributions, and develops Multi Cost SVM for unbalanced data.
result Formal definition and analytical determination of ε-Safe Decision Regions for exponential family distributions.

Bandit algorithms have various application in safety-critical systems, where it is important to respect the system constraints that rely on the bandit's unknown parameters at every round. In this paper, we formulate a linear stochastic multi-armed bandit problem with safety constraints that depend (linearly) on an unkn…

2019-08-16abs ↗pdf ↗

Previous work has shown the unreliability of existing algorithms in the batch Reinforcement Learning setting, and proposed the theoretically-grounded Safe Policy Improvement with Baseline Bootstrapping (SPIBB) fix: reproduce the baseline policy in the uncertain state-action pairs, in order to control the variance on th…

2019-09-11abs ↗pdf ↗

Develops a learning model predictive controller for competitive racing.

problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.

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 ↗

The paper provides a non-asymptotic error bound for linear system identification under nonlinear policies.

problem System identification for linear systems with nonlinear and/or time-varying policies under i.i.d. random excitation noises.
method Least square estimation with non-asymptotic error bound for bounded state and action trajectories.
result The error bound is consistent with linear policies and generalizes existing guarantees.

Paper proposes Vertex Networks for reinforcement learning of control systems with safety guarantees.

problem Challenges in reinforcement learning with hard state and action constraints.
method Vertex Networks incorporate safety constraints into policy network architecture, ensuring safety during exploration.
result Proposed Vertex Networks outperform vanilla reinforcement learning in benchmark control tasks.

Gaussian Processes (GPs) are widely employed in control and learning because of their principled treatment of uncertainty. However, tracking uncertainty for iterative, multi-step predictions in general leads to an analytically intractable problem. While approximation methods exist, they do not come with guarantees, mak…

2019-11-29abs ↗pdf ↗

We study the safe reinforcement learning problem with nonlinear function approximation, where policy optimization is formulated as a constrained optimization problem with both the objective and the constraint being nonconvex functions. For such a problem, we construct a sequence of surrogate convex constrained optimiza…

2019-10-26abs ↗pdf ↗