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

Trend · papers per month

1.5%2.9%4.4%5.9% · Jun 199619922001200920172026
48 results for Autonomous Explanations

LLMs can help explain credit risk models but not autonomously.

problem Leveraging LLMs for post-hoc explainability in credit risk models.
method Comparison of LLM outputs with SHAP and coefficient-based attributions on three LMs.
result LLMs reliably preserve feature-importance rankings but poorly align with autonomous explanations.

The ubiquity of systems using artificial intelligence or "AI" has brought increasing attention to how those systems should be regulated. The choice of how to regulate AI systems will require care. AI systems have the potential to synthesize large amounts of data, allowing for greater levels of personalization and preci…

2017-11-03abs ↗pdf ↗

The paper introduces a method to assess the reliability of model explanations.

problem Assessing the quality and reliability of model explanations.
method An Ordinal Consensus Approach using diverse bootstrapped surrogate explainers.
result Uncertainty estimates offer actionable insights beyond standard surrogate explainers.

As machine learning algorithms are increasingly applied to high impact yet high risk tasks, such as medical diagnosis or autonomous driving, it is critical that researchers can explain how such algorithms arrived at their predictions. In recent years, a number of image saliency methods have been developed to summarize …

2017-04-11abs ↗pdf ↗

Self-explaining AI provides understandable explanations for AI decisions.

problem Difficulty in interpreting decisions made by deep neural networks, especially in critical applications.
method Introducing self-explaining AI that provides human-understandable explanations and confidence levels.
result Deep neural networks operate by interpolating between data points, making them hard to interpret.

A new framework for robot block-stacking tasks using causal probabilistic models.

problem Robots fail outside controlled environments due to uncertainty and lack of explicit design for all scenarios.
method Causal probabilistic framework combining causal models and probabilistic representations of noise.
result Robots can perceive, reason about, and explain their environment for block-stacking tasks.

SEP framework teaches LLMs to generate explainable stock predictions.

problem Challenging task of generating human-readable explanations for stock predictions.
method Self-reflective agent and Proximal Policy Optimization (PPO) for autonomous learning.
result Fine-tuned LLM outperforms traditional methods in prediction accuracy and Matthews correlation coefficient.

This work improves safety validation of autonomous vehicles by finding interpretable failures.

problem Finding interpretable failures of autonomous systems in simulation.
method Signal temporal logic expressions optimized for high likelihood and human interpretability.
result Our methodology finds more interpretable failures with higher likelihood compared to baseline approaches.

Generalizes energy-momentum method for non-autonomous Hamiltonian systems.

problem Stability analysis of non-autonomous Hamiltonian systems with symmetries.
method Develops a new approach to relative equilibrium points and stability conditions for non-autonomous systems.
result Conditions ensuring stability of relative equilibrium points in non-autonomous Hamiltonian systems.

This paper explores formal verification for autonomous systems, identifying limitations and proposing improvements.

problem Ensuring safety of autonomous systems like self-driving cars and drones.
method Formal verification techniques based on formal methods, analyzing three assumptions and their limitations.
result Preliminary work to improve the strength of evidence provided by formal verification.

The study explores autonomous systems and their connections to contact geometry and Frobenius manifolds.

problem Understanding the connections between autonomous systems and geometric structures.
method Investigation of the Darboux-Halphen-Ramanujan system, contact geometry, and Frobenius manifolds.
result Highlighting the role of contact geometry in autonomous systems.

Many methods to explain black-box models, whether local or global, are additive. In this paper, we study global additive explanations for non-additive models, focusing on four explanation methods: partial dependence, Shapley explanations adapted to a global setting, distilled additive explanations, and gradient-based e…

2018-01-26abs ↗pdf ↗

Adaptive framework generates challenging adversarial scenarios for autonomous vehicles.

problem Lack of efficient and adaptable evaluation methods for autonomous vehicles.
method Adaptive evaluation framework using ensemble models and nonparametric Bayesian clustering.
result Adversarial scenarios significantly degrade tested autonomous vehicles' performance.

Unified treatment of RC in stochastic and deterministic settings.

problem Understanding and generalizing reservoir computing in both deterministic and stochastic contexts.
method Investigation of state-space systems, analysis of fading memory and solution stability, introduction of stochastic echo states.
result Generality of fading memory and solution stability in state-space systems, even without the echo state property.

Autonomous Vehicles(AV) are one of the brightest promises of the future which would help cut down fatalities and improve travel time while working in harmony. Autonomous vehicles will face with challenging situations and experiences not seen before. These experiences should be converted to knowledge and help the vehicl…

2018-08-16abs ↗pdf ↗

Safe RL for autonomous vehicles using PCPO with trust regions and parallel learners.

problem Unexplainable behaviours and lack of safety guarantees in RL for real vehicles.
method PCPO framework with trust regions and parallel learners.
result Safe learning confirmed for autonomous vehicles with fast convergence.

A machine learning environment for detecting autonomous vehicle corner cases.

problem Testing autonomous driving software in the real world is difficult.
method Connecting CARLA simulation software to TensorFlow and custom AI client software.
result The system can identify situations where AI software fails to understand the scenario.

New approach uses dynamic programming to efficiently discover failures in autonomous vehicle simulations.

problem Efficiently discovering rare failure events in autonomous vehicle simulations.
method Approximate dynamic programming and scene decomposition to estimate failure distribution.
result Increased number of failures discovered compared to baseline approaches.

The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.

problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.

Real-time semantic segmentation for autonomous vehicles on FPGA reduces latency and power consumption.

problem Efficient real-time semantic segmentation for autonomous vehicles.
method Compressed ENet architecture, FPGA deployment, batch processing, filter reduction, quantization-aware training.
result Reduced latency to 3 ms per image with batch size of ten and 40% resource utilization.

New definition reveals encoding explanations that retain predictive power.

problem Challenges in evaluating and identifying encoding explanations.
method Developed a definition of encoding based on conditional dependence.
result Existing evaluation scores do not rank non-encoding explanations correctly, but STRIPE-X does.

Develops a method to simulate rare dangerous events in autonomous systems.

problem Rare dangerous events in safety-critical systems are hard to test in real-world settings.
method Combines exploration, exploitation, and optimization techniques for rare-event simulation.
result Provides rigorous guarantees for the performance of the method.

Gemini uses inexpensive measurements to correct biases in expensive property evaluations.

problem Accurate estimation of materials properties using expensive measurements is hindered in scientific discovery campaigns.
method Gemini is a data-driven model that corrects systematic biases between property evaluation methods using inexpensive measurements.
result Gemini reduces the number of expensive evaluations needed for Bayesian optimization in materials discovery.

GRANITE unifies feature-based explanation methods to reduce disagreement.

problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.

Safe autonomous decisions made with machine learning predictions using Conformal Decision Theory.

problem Safe decisions from imperfect machine learning predictions.
method Conformal Decision Theory framework for producing safe decisions.
result Safe decisions with provable statistical guarantees of low risk.

This work improves autonomous racing by creating diverse opponents and adapting risk.

problem Balancing performance and safety in autonomous racing environments.
method Developed a self-play method using replica-exchange Markov chain Monte Carlo for diverse opponents and a distributionally robust bandit optimization for adaptive risk adjustment.
result Demonstrated real-time motion-planning methods achieving speeds comparable to Formula One racecars.

Differentially private algorithms protect model explanations from leaking training data.

problem Model explanations can leak training data, compromising privacy.
method Adaptive differentially private gradient descent algorithm to produce accurate, private explanations.
result Privacy amplification and reduction of overall privacy loss on explanation data.

We consider objective evaluation measures of saliency explanations for complex black-box machine learning models. We propose simple robust variants of two notions that have been considered in recent literature: (in)fidelity, and sensitivity. We analyze optimal explanations with respect to both these measures, and while…

2019-01-27abs ↗pdf ↗

Paper explores a consumer-friendly approach to explain machine learning decisions.

problem Challenges in providing understandable explanations for machine learning predictions.
method Consumer-driven approach called TED that asks for explanations in training data.
result TED is robust to increasing numbers of explanations, noisy explanations, and missing explanations.

Improves global counterfactual explanations for model recourse.

problem Inability to provide explanations beyond local instances.
method Investigates and improves Actionable Recourse Summaries (AReS) for global counterfactual explanations.
result Develops more efficient and interactive explainability tools.

We define and compute plausible counterfactual explanations using density constraints.

problem Efficiently compute plausible counterfactual explanations for machine learning models.
method Propose and study a formal definition of plausible counterfactual explanations, use density estimators, and introduce convex density constraints.
result Convex density constraints ensure plausible and feasible counterfactual explanations.