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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for cycling safety

This study maps cycling risks and discomfort in Zurich, offering personalized route recommendations.

problem High cycling accidents and discomfort in Smart Cities.
method Geolocated bike accidents data, kernel density contours, weather, time, accident type and severity analysis.
result Empirical continuous spatial risk estimations and personalized route recommendations.

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.

Survey of technologies for trustworthy machine learning systems.

problem Building machine learning systems that are fair, explainable, auditable, and secure.
method Survey of technologies across data and model stages of machine learning.
result Four categories of system properties (fairness, explainability, auditability, safety & security) are essential for trustworthy systems.

Topological parallax assesses AI models' geometric similarity to datasets for safety.

problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.

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.

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.

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.

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.

ANNs predict SAFARI-1 neutron fluxes with uncertainties.

problem Uncertainty quantification in ANN predictions for SAFARI-1.
method Deep Neural Networks (DNNs) with Monte Carlo Dropout (MCD) and Bayesian Neural Networks (BNN VI) for uncertainty quantification.
result Uncertainty bands envelop noisy measurement data points, indicating good prediction and generalization.

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.

Odd crossing numbers and even rotation numbers for cycles in plane immersions.

problem Analyzing crossing and rotation numbers of cycles in plane immersions of graphs.
method Generic immersions and Legendrian embeddings of graphs, focusing on cycles of specific lengths.
result Sum of rotation numbers of all 5-cycles is even, and sum of crossing numbers is odd.

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.

This work introduces novel methods to identify and compare cycles across topological objects.

problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.

This paper identifies the unique efficient cycle for most hyperbolic manifolds but not for the figure-8 knot complement.

problem Identifying the unique efficient cycle for hyperbolic manifolds.
method Analyzing the limit of fundamental cycles and their 1\ell^1-norm convergence.
result The uniqueness of the efficient cycle is proven for most hyperbolic manifolds but not for the figure-8 knot complement.

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.

Gauss diagrams' properties can change with Hamiltonian cycle choice.

problem The impact of Hamiltonian cycle choice on Gauss diagrams.
method Examined realizable and unrealizable Gauss diagrams, and proved preservation of realizability under certain Hamiltonian cycle changes.
result Properties of Gauss diagrams can vary with Hamiltonian cycle choice.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.

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.

Credit expansion led to stronger household leverage cycles during the U.S. business cycle.

problem Understanding the role of credit supply in the U.S. business cycle.
method Causal evidence from 1999-2010 U.S. business cycle data.
result Credit expansion, particularly in private-label mortgages, caused stronger household leverage cycles.

In the current article we study complex cycles of higher multiplicity in a specific polynomial family of holomorphic foliations in the complex plane. The family in question is a perturbation of an exact polynomial one-form giving rise to a foliation by Riemann surfaces. In this setting, a complex cycle is defined as a …

2011-06-14abs ↗pdf ↗

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 ↗