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.

169,341 papers · 148 categories

Trend · papers per month

1122 · Jun 202019922001200920182026
13 results for Safe-Optimization

Safe-Optimization algorithm shows participants' preference for safe outcomes over optimal points.

problem Exploration-exploitation in functions with safety constraints.
method Safe-Optimization algorithm based on Gaussian Processes, tested in two experiments.
result Participants prioritize safety over optimization, showing a homeostatic strategy.

SODA-RL learns diverse treatment options for hypotension from data.

problem Identifying the best treatment for acute hypotension from observational data.
method SODA-RL: Safely Optimized, Diverse, and Accurate Reinforcement Learning.
result SODA-RL identifies distinct, plausible treatment options from observational data.

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.

Paper optimizes industrial refrigeration using adaptive exploration.

problem Challenges in optimizing real-time industrial processes with unknown characteristics and safety constraints.
method Adaptive and explorative real-time optimization framework with Gaussian process uncertainty quantification.
result Approach increases energy efficiency of refrigeration process, approximating complete information solutions.

Safe reinforcement learning with stability guarantees for real-world systems.

problem Lack of safety guarantees in reinforcement learning for real-world applications.
method Combines control theory with statistical models to ensure stability and safety.
result Proven ability to safely optimize neural network policies without system failure.

LineBO tackles high-dimensional Bayesian optimization by solving 1D subproblems.

problem Bayesian optimization struggles in high dimensions due to complex acquisition steps.
method LineBO restricts high-dimensional problems to 1D subproblems iteratively solved efficiently.
result LineBO converges globally and achieves a fast local rate for strongly convex functions.

ESRL uses uncertainty quantification to learn safe, optimal policies in offline RL.

problem Challenges in interpreting and measuring uncertainty of learned policies in offline RL.
method Expert-Supervised Reinforcement Learning (ESRL) framework that uses hypothesis testing and posterior distributions.
result The framework can learn safe and optimal policies with theoretical guarantees and independent sample efficiency.

StageOpt efficiently optimizes safe decisions by separating safety and utility stages.

problem Optimizing unknown utility with safety constraints in sequential decisions.
method Develops StageOpt, a two-stage safe Bayesian optimization algorithm.
result StageOpt is more efficient and applicable to broader problems than existing methods.

Bayesian optimization sped up with model approximations for safe online system optimization.

problem Efficiently optimize systems with safety guarantees under noisy conditions.
method Incorporate reduced physical models into Bayesian optimization, using Markov chain Monte Carlo for robust safety bounds.
result Significant acceleration of optimization for expensive functions with robust safety guarantees.

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.

This paper tackles safe global optimization of noisy functions with a Lipschitz condition.

problem Safe global maximization of expensive, noisy, Lipschitz functions.
method Develops a δ-Lipschitz framework and two algorithms to ensure safety constraints are met.
result The proposed methods ensure safety constraints are met before evaluating noisy functions.