Urban traffic systems worldwide are suffering from severe traffic safety problems. Traffic safety is affected by many complex factors, and heavily related to all drivers' behaviors involved in traffic system. Drivers with aggressive driving behaviors increase the risk of traffic accidents. In order to manage the safety…
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
48 results for “safety violations”
Safe linear bandits over unknown polytopes avoid safety violations and suboptimal actions.
problem Online approach to linear programming with unknown constraints and risks.
method Doubly-optimistic strategy (DOSS) for safe linear bandits over polytopes.
result DOSS achieves tight bounds on efficacy regret and safety violations.
New algorithm reduces sample complexity for safe reinforcement learning.
problem Safe reinforcement learning in constrained MDPs with performance and safety constraints.
method Model-based primal-dual algorithm balancing regret and bounded constraint violations.
result Proves near-optimal policies with bounded violations or zero violations in CMDPs.
Study evaluates conformal prediction methods for safety in vision models under shifts and long-tailed data.
problem Safety guarantees of conformal prediction methods under distribution shifts and long-tailed data.
method Empirical evaluation of post-hoc and training-based conformal prediction methods on large-scale datasets and models.
result Performance of conformal prediction methods degrades significantly under distribution shifts and long-tailed data.
Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with minor adversarial or even accidental perturbations. Consequences of such errors can …
Measuring the Prevalence of Policy Violating Content with ML Assisted Sampling and LLM Labelingcs.LG
Measures policy-violating content prevalence with ML-assisted sampling and LLM labeling.
problem Accurate measurement of content violations that are often rare and costly to label.
method Design-based measurement system using ML-assisted probability sampling and LLM labeling.
result Produces unbiased prevalence estimates with confidence intervals and dashboard drilldowns.
A new algorithm for identifying the best arm in linear feedback with safety constraints.
problem Identifying the best arm in linear feedback with safety constraints.
method A gap-based algorithm that ensures safety while minimizing sample complexity.
result The algorithm achieves meaningful sample complexity while ensuring safety.
New algorithm for reinforcement learning in uncertain environments with unknown thresholds.
problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of .
Safe reinforcement learning tackles safety constraints with linear approximations.
problem Ensuring safety in reinforcement learning without violating constraints.
method Modeling safety as a linear cost function, developing SLUCB-QVI and RSLUCB-QVI algorithms for MDPs with linear function approximation.
result Achieved a nearly optimal regret bound for safe reinforcement learning, matching state-of-the-art unsafe algorithms.
SafeML: Safety Monitoring of Machine Learning Classifiers through Statistical Difference Measurecs.LG
SafeML monitors ML systems for safety and security risks.
problem Ensuring safety and explainability of ML systems in safety-critical domains.
method Statistical difference measures of ECDF to detect distributional shifts.
result Approach can detect invalid application contexts of ML components.
Safe Bayesian optimization method using information theory.
problem Optimizing unknown functions while respecting safety constraints.
method Information-theoretic exploration criterion for continuous domains.
result The method learns the value of the safe optimum up to arbitrary precision.
Meta-learning priors improves safe Bayesian optimization.
problem Optimizing robot controllers under safety constraints.
method Meta-learning priors from offline data using F-PACOH.
result Meta-learned priors accelerate safe BO convergence.
In order to satisfy safety conditions, an agent may be constrained from acting freely. A safe controller can be designed a priori if an environment is well understood, but not when learning is employed. In particular, reinforcement learned (RL) controllers require exploration, which can be hazardous in safety critical …
Safe Gaussian Process Bandit Optimization with sub-linear regret bounds.
problem Sequential decision-making under uncertainty and safety constraints.
method Developed SGP-UCB, a safe variant of GP-UCB with modifications to respect safety constraints.
result First sub-linear regret bounds for safe Gaussian Process Bandit Optimization.
Logarithmic regret strategies for safe multi-armed bandits with safety risk constraints.
problem Maximizing reward while avoiding unsafe arms under safety risk constraints.
method Doubly optimistic strategies with pseudo-regret formulation.
result Logarithmic regret bounds for safe multi-armed bandits.
Recent successes in reinforcement learning have lead to the development of complex controllers for real-world robots. As these robots are deployed in safety-critical applications and interact with humans, it becomes critical to ensure safety in order to avoid causing harm. A first step in this direction is to test the …
In classical reinforcement learning, when exploring an environment, agents accept arbitrary short term loss for long term gain. This is infeasible for safety critical applications, such as robotics, where even a single unsafe action may cause system failure. In this paper, we address the problem of safely exploring fin…
Canary optimizes VaR-constrained RL problems with a conservative bound using Cantelli's inequality.
problem Optimizing reinforcement learning policies under VaR constraints in dense cost regimes.
method Employing Cantelli's inequality to create a conservative and smooth bound on VaR constraints based on moments of cost returns. Extending trust-region framework for worst-case bounds on policy improvement and constraint violation.
result Canary reliably satisfies VaR constraints with fewest violations and earliest permanent satisfaction, while maintaining reward competitiveness.
SEEDA optimizes dose allocation in clinical trials to balance efficacy and safety.
problem Complex relationships between efficacy and toxicity in new drug trials.
method Adaptive clinical trial methodology that maximizes cumulative efficacy while ensuring safety constraints.
result SEEDA outperforms existing methods in finding optimal doses with higher success rates and fewer patients.
Paper improves COCO problem, reducing constraint violation at the cost of slightly more regret.
problem Online Convex Optimization with adversarial constraints.
method Proposes new policies that trade off regret for reduced constraint violation.
result Achieves regret and CCV.
A new RL model ensures safe learning in uncertain environments.
problem Safe reinforcement learning in uncertain, partially observable environments.
method Lyapunov-based uncertainty quantification and Transformers for memory.
result Significant improvement in safety and optimality in grid-world tasks.
Proposes real-time risk monitoring for machine learning systems under unknown shifts.
problem Dynamic distribution shifts challenge real-world machine learning systems' risk assurances.
method Sequential hypothesis testing with 'testing by betting' to detect risk violations.
result Effective real-time risk monitoring under various unknown shifts.
In many real-world reinforcement learning (RL) problems, besides optimizing the main objective function, an agent must concurrently avoid violating a number of constraints. In particular, besides optimizing performance it is crucial to guarantee the safety of an agent during training as well as deployment (e.g. a robot…
FISAR uses neural networks to optimize safe reinforcement learning with forward-invariant constraints.
problem Safe reinforcement learning with constraints in safety-critical environments.
method Imposing linear constraints on policy parameters' updating dynamics, using a DNN-based optimizer to satisfy these constraints.
result The policy decreases constraint violation and maximizes cumulative reward monotonically.
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.
Classifier-based AI safety gates fail in self-improvement, even with advanced verification methods.
problem Maintaining reliable oversight of AI systems as they improve over iterations.
method Comprehensive empirical testing on neural controllers and MuJoCo benchmarks, using various classifiers and verification methods.
result Classifier-based safety gates fail in maintaining reliable oversight, even with advanced verification methods.
We propose Trusted Neural Network (TNN) models, which are deep neural network models that satisfy safety constraints critical to the application domain. We investigate different mechanisms for incorporating rule-based knowledge in the form of first-order logic constraints into a TNN model, where rules that encode safet…
New algorithm achieves sublinear regret in CMDPs without error cancellations.
problem Safety constraints in reinforcement learning with error cancellations.
method Model-based primal-dual algorithm for CMDPs with multiple constraints.
result Achieves sublinear regret without error cancellations.
Cancellation-Free Regret Bounds for Lagrangian Approaches in Constrained Markov Decision Processescs.LG
New algorithm reduces regret in CMDPs without cancellation of errors.
problem Lagrangian approaches in CMDPs struggle with cancellation of errors.
method OptAug-CMDP, based on augmented Lagrangian method.
result Regret of for both objective and constraint violation.
AI monitors social distancing and masks at manufacturing plants.
problem Ensuring safety of workers during post-COVID production.
method Computer vision and AI techniques for social distancing and mask detection.
result Real-time alerts prevent violations of social distancing and mask-wearing.
Neural Lyapunov Redesigneess.SY
Combines Lyapunov functions with controller synthesis for safe control policies.
problem Ensuring safety in controller design for nonlinear systems.
method Iterative algorithm combining Lyapunov function estimation and controller synthesis.
result Effective control policies with large safe regions are derived.
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…
The use of Reinforcement Learning (RL) is still restricted to simulation or to enhance human-operated systems through recommendations. Real-world environments (e.g. industrial robots or power grids) are generally designed with safety constraints in mind implemented in the shape of valid actions masks or contingency con…
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.
ProEval efficiently estimates AI performance and discovers failures using pre-trained Gaussian Processes.
problem Resource-intensive evaluation of generative AI models.
method ProEval uses pre-trained Gaussian Processes and Bayesian quadrature to estimate performance and discover failures.
result ProEval requires significantly fewer samples to achieve accurate performance estimates and reveals more diverse failure cases.
Algorithm ensures safe optimization under unknown constraints.
problem Optimization under unknown safety constraints.
method Reliable Frank-Wolfe (Reliable-FW) algorithm for non-convex functions.
result Algorithm finds approximate first-order stationary points safely.
VerifAI toolkit improves neural network-based aircraft taxiing system safety.
problem Improving safety of autonomous aircraft taxiing systems using neural networks.
method Unified approach to formal analysis and retraining of AI systems, including falsification, debugging, and retraining.
result Improved neural network performance and reduced failure cases in aircraft taxiing system.
SAMBA improves safe reinforcement learning with active exploration metrics.
problem Safe reinforcement learning in dynamic systems.
method Combines probabilistic modelling, information theory, and statistics. Uses novel metrics for out-of-sample Gaussian process evaluation.
result Orders of magnitude reduction in samples and violations compared to state-of-the-art methods.
New algorithm reduces regret and constraint violation in adversarial CMDP learning.
problem Online learning for episodic stochastically constrained Markov decision processes (CMDPs) with adversarial loss.
method Upper Confidence Primal-Dual Reinforcement Learning (UC-PDL) algorithm.
result Achieves upper bounds of both regret and constraint violation.
CSP improves time-series forecasting without training, outperforming DeepNPTS in speed and accuracy.
problem Improving probabilistic time-series forecasting without training.
method Mixing empirical and residual draws around a seasonal naive forecast.
result CSP significantly outperforms DeepNPTS on CRPS, normalized mean quantile loss, and coverage metrics.
Paper tackles robust MDPs with sample complexity guarantees.
problem Learning safe policies in uncertain environments.
method Introduces augmented state space and RCVI algorithm.
result First sample complexity guarantee for RCMDPs.
Deep neural networks have been widely adopted in recent years, exhibiting impressive performances in several application domains. It has however been shown that they can be fooled by adversarial examples, i.e., images altered by a barely-perceivable adversarial noise, carefully crafted to mislead classification. In thi…
New algorithm optimizes reward while ensuring safety in complex decision-making problems.
problem Maximizing reward while adhering to safety constraints in complex decision-making problems.
method Optimistic Primal-Dual Proximal Policy Optimization (OPDOP) algorithm combining least-squares policy evaluation and a bonus term for safe exploration.
result Achieves regret and constraint violation.
HardNet adds hard constraints to neural networks without sacrificing performance.
problem Ensuring adherence to input-dependent constraints in neural networks.
method Appends a differentiable enforcement layer to neural networks for end-to-end training with hard constraint guarantees.
result HardNet retains neural networks' universal approximation capabilities and enables efficient optimization.
RLVR maintains safety while improving reasoning capabilities in LLMs.
problem Safety-capability tradeoff in fine-tuning LLMs.
method Reinforcement Learning with Verifiable Rewards (RLVR) and theoretical analysis.
result RLVR can enhance reasoning while maintaining safety guardrails.
Navigating complex urban environments safely is a key to realize fully autonomous systems. Predicting future locations of vulnerable road users, such as pedestrians and cyclists, thus, has received a lot of attention in the recent years. While previous works have addressed modeling interactions with the static (obstacl…
Research tackles safety of deep learning in safety-critical tasks.
problem Safety concerns of deep learning in perception tasks for autonomous agents.
method Technical enumeration and discussions on safety concerns and mitigation methods.
result Need for more mitigation methods to ensure safety of deep learning.
The paper discusses safety assessment for AI systems, focusing on machine learning models.
problem Safety assessment of AI systems, especially machine learning models, in safety-related applications.
method Analyzed AI models as statistical models and proposed a new budget allocation for AI safety.
result Safety assessment of AI systems requires a new approach focusing on the model used, not just the system.