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

Trend · papers per month

3876114152 · May 202619922001200920172026
48 results for safety gap

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.

CRC improves multivariate forecasting accuracy without risking performance degradation.

problem Systematic errors and lack of guarantees in multivariate forecasters.
method CRC uses a causality-inspired encoder and hybrid corrector with a safety mechanism.
result CRC consistently improves accuracy and ensures high non-degradation rates.

Develops algorithms for CCBs with non-linear costs, improving safety and performance.

problem Safety constraints in sequential decision making with non-linear arm costs.
method Innovative algorithms using Inverse Gap Weighting (IGW) and online regression oracle.
result Sub-linear regret bounds for C-SquareCB and first-order regret for C-FastCB.

Safe-EF improves federated learning for non-smooth, constrained optimization.

problem Federated learning's communication bottlenecks with high-dimensional model updates.
method Error feedback (EF) for non-smooth convex optimization with safety constraints.
result Safe-EF matches lower complexity bounds and ensures safety constraints.

New bounds on trajectory safety in training models with Langevin Dynamics.

problem Bounding the probability of a model's trajectory staying away from a designated failure region.
method Analyzes Langevin dynamics on smooth, strongly convex loss landscapes, introducing shape-free and local relaxation bounds.
result The in-set probability relaxes to the static value after a burn-in time of order d, using only the global spectral gap of the loss.

A decentralized algorithm minimizes cumulative regret in stochastic linear bandits with safety constraints.

problem Efficiently solving a linear bandit-optimization problem over a network of agents with safety constraints.
method DLUCB: a fully decentralized algorithm that minimizes cumulative regret through UCB strategy and consensus procedure.
result Near-optimal regret performance of O(dlogNTNT)\mathcal{O}(d\log{NT}\sqrt{NT}) with O(dN2)\mathcal{O}(dN^2) communication rate.

This review explores ML and DL techniques for detecting distracted driving across various modalities.

problem Improving detection of complex distraction patterns, especially cognitive distractions.
method Categorizes and evaluates studies based on modality, data accessibility, and methodology.
result Multimodal systems outperform single-modal systems in detecting complex distraction patterns.

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.

Autonomous vehicles rely on machine learning to solve challenging tasks in perception and motion planning. However, automotive software safety standards have not fully evolved to address the challenges of machine learning safety such as interpretability, verification, and performance limitations. In this paper, we revi…

2019-12-20abs ↗pdf ↗

Study examines uncertainty in adversarially trained models and proposes improved AT methods.

problem Uncertainty quantification in adversarially trained models for safety-critical applications.
method Investigates conformal prediction (CP) for adversarial attacks, proposes Beta-weighting loss with entropy minimization for improved prediction set size (PSS).
result Proposed AT-UR method improves CP efficiency and prediction set size.

RAGuard improves safety in LLMs for offshore wind maintenance.

problem Conventional LLMs fail with specialised or unexpected scenarios in offshore wind maintenance.
method Integrates safety-critical documents alongside technical manuals in RAG framework.
result RAGuard increases safety recall from almost 0% to over 50% while maintaining technical recall above 60%.

Safe imitation learning with a safety layer for flexible training.

problem Flexible yet safe imitation learning for complex tasks.
method Theory and modular method with a safety layer for continuous policy, adversarial training, and worst-case safety guarantees.
result Robustness advantage of safety layer during training compared to test time.

This paper formalizes AI safety using hypothesis testing in GenAI.

problem Ensuring safety of generative AI tools that create realistic content.
method Formalization of computational safety through hypothesis testing and signal processing.
result Demonstrates how AI safety can be assessed quantitatively using mathematical frameworks.

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

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.

ALMANACS benchmarks explainability methods on simulatability.

problem Evaluating the effectiveness of explainability methods for language models.
method ALMANACS is a simulatability benchmark that evaluates explainability methods on twelve safety-relevant topics.
result No explainability method outperforms the explanation-free control across all topics.

Failures are challenging for learning to control physical systems since they risk damage, time-consuming resets, and often provide little gradient information. Adding safety constraints to exploration typically requires a lot of prior knowledge and domain expertise. We present a safety measure which implicitly captures…

2019-10-07abs ↗pdf ↗

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.

A novel approach for safe offline RL using latent safety constraints.

problem Balancing safety constraints and reward maximization in offline RL.
method Conditional Variational Autoencoders for latent safety modeling, Constrained Reward-Return Maximization.
result Our approach maintains safety compliance while optimizing rewards, outperforming existing methods.

Safe Bayesian Optimization algorithms are improved to ensure safety in real-world applications.

problem Ensuring safety in Bayesian Optimization algorithms for real-world applications.
method Investigated and improved three safety-related issues of SafeOpt-type algorithms: frequentist uncertainty bounds, RKHS norm assumptions, and discrete search spaces.
result Introduced Real-{eta}-SafeOpt, Lipschitz-only Safe Bayesian Optimization (LoSBO), and Lipschitz-only GP-UCB (LoS-GP-UCB) algorithms that retain safety guarantees and superior performance.

Researchers introduce a method to assess the safety of interpretable machine learning models.

problem Ensuring safety in machine learning models that are easy to understand.
method Introduce maximum deviation as an optimization problem to find the largest deviation from a safe reference model.
result Interpretability helps in assessing the safety of machine learning models.

By building on a recently introduced genetic-inspired attribute-based conceptual framework for safety risk analysis, we propose a novel methodology to compute construction univariate and bivariate construction safety risk at a situational level. Our fully data-driven approach provides construction practitioners and aca…

2016-09-26abs ↗pdf ↗

The paper shows why AI safety doesn't generalize across tasks.

problem AI safety fails to generalize across unseen tasks.
method Theoretical analysis of linear-quadratic control with HH_{\infty}-robustness, empirical demonstrations in simulated quadcopter navigation and CRM.
result The mapping from task specification to an optimal controller has a higher Lipschitz constant with safety requirements than without, indicating inherent complexity of safety.

Machine learning algorithms are increasingly influencing our decisions and interacting with us in all parts of our daily lives. Therefore, just like for power plants, highways, and myriad other engineered sociotechnical systems, we must consider the safety of systems involving machine learning. In this paper, we first …

2016-01-16abs ↗pdf ↗

Unified control theory and machine learning for safety in uncertain systems.

problem Safety guarantees for systems with measurement model uncertainty.
method Measurement-Robust Control Barrier Functions (MR-CBFs) for control synthesis.
result MR-CBFs ensure safety in perception systems with measurement model uncertainty.