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

89179268357 · Jun 202019922001200920172026
48 results for AI robustness

The paper investigates AI robustness through experiments and statistical analysis.

problem Inaccurate AI predictions can lead to safety and adoption issues.
method Design of experiments framework to study AI classification robustness.
result AI algorithms' robustness is influenced by various factors.

Paper examines Go AI robustness against adversarial attacks.

problem Superhuman Go AIs are vulnerable to simple adversarial strategies.
method Three defenses tested: adversarial training, iterated adversarial training, and changing network architecture.
result No defense is robust against newly trained adversaries, and attacks are similar to cyclic attacks.

VB-Score evaluates AI systems without ground truth, revealing robustness.

problem Evaluating AI systems without ground truth labels, especially for entity-centric tasks.
method VB-Score uses variance-bounded evaluation, constraint relaxation, and Monte Carlo sampling.
result VB-Score reveals robustness differences not seen by conventional frameworks.

Research tackles distribution shift issues in ML to improve AI reliability.

problem Distribution shift limits ML reliability and trustworthiness.
method Study three distribution shifts (perturbation, domain, modality) and investigate robustness, explainability, adaptability.
result Proposes effective solutions and fundamental insights for enhancing ML robustness, adaptability, and safety.

We study the problem of designing AI agents that can robustly cooperate with people in human-machine partnerships. Our work is inspired by real-life scenarios in which an AI agent, e.g., a virtual assistant, has to cooperate with new users after its deployment. We model this problem via a parametric MDP framework where…

2019-10-05abs ↗pdf ↗

Proposes a sample selection algorithm for fair and robust AI training.

problem Balancing fairness and robustness in AI models, especially with corrupted data.
method Formulates and solves a combinatorial optimization problem for unbiased sample selection, proposing a greedy algorithm.
result Improves fairness and robustness compared to state-of-the-art techniques, both synthetically and on real datasets.

Mathematical conditions and practical computations for adversarial robustness measures are established.

problem Existence, uniqueness, and scalability of adversarial robustness measures for AI classifiers.
method Formulated and proven mathematical conditions for existence, uniqueness, and explicit analytical computation of minimal adversarial paths and distances. Practical computation demonstrated on various AI tools and synthetic benchmarks.
result Explicit mathematical conditions and practical computations for adversarial robustness measures are established.

Adaptive AI delegation framework for dynamic decision authority allocation.

problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.

FinAI-BERT classifies AI disclosures in financial reports with high accuracy.

problem Systematic detection of AI-related disclosures in financial reports.
method Fine-tuned transformer-based model on a curated dataset.
result Achieved near-perfect classification performance (99.37% accuracy).

New method improves active statistical inference by reducing noise.

problem Inaccurate uncertainty estimates in active sampling lead to noisy results.
method Robust sampling strategies that interpolate between uniform and active sampling based on uncertainty scores.
result The robust sampling ensures that the estimator is never worse than uniform sampling and usually outperforms active inference.

Optimizes AI learning with limited human feedback budgets.

problem Optimizing allocation of a fixed annotation budget for AI learning.
method Preference-Calibrated Active Learning (PCAL) using semi-parametric inference.
result Proves asymptotic optimality and robustness of the PCAL estimator.

FCNv2 robustness tested under noise and random initial conditions.

problem Assessing AI weather forecasting model robustness to input noise.
method Two experiments with varying noise levels and random initial conditions.
result FCNv2 preserves hurricane features under low to moderate noise, but underestimates intensity and persistence.

Improved AI patent classifier measures U.S. and China's AI patenting.

problem Measuring AI patents with high precision and generalization.
method Fine-tuning PatentSBERTa on manually labeled data from USPTO's AI Patent Dataset.
result Rapid growth in AI patenting in both countries, but different organizational patterns.

Reprogram deep models to resist adversarial attacks without changing parameters.

problem Improving deep learning models' robustness against adversarial and noisy inputs.
method Proposes a non-linear robust pattern matching technique and three reprogramming paradigms.
result Demonstrates effective reprogramming of deep models for robustness without altering parameters.

This paper introduces Probability Engineering to improve deep learning models.

problem Challenges in traditional probabilistic modeling for AI applications.
method Treats learned probability distributions as engineering artifacts and actively modifies them.
result Improves robustness, efficiency, adaptability, and trustworthiness of deep learning models.

Do-AIQ framework evaluates AI algorithms' quality using DOE.

problem Quality evaluation of AI mislabel detection algorithms.
method Design-of-experiment approach with high-dimensional constraint space design and surrogate modeling.
result Established framework for evaluating AI algorithm quality robustly.

The paper highlights AI brittleness and the need for robust testing out-of-distribution performance.

problem The brittleness of AI systems, especially Deep Neural Networks, limits their reliability and certification.
method Analysis of AI brittleness and OOD performance, emphasizing the need for resilience and improved evaluation methods.
result AI systems are more failure-prone than certified in critical systems, and OOD performance falls off gradually.

AI agents improve forecast combination in empirical economics.

problem Hidden researcher degrees of freedom in AI-generated code.
method Adapted agent-loop architecture to empirical economics, added holdout evaluation.
result Independent agent searches find better forecast methods than benchmarks.

The workshop focuses on AI principles for structured data.

problem Using AI on structured data for decision-making.
method Addressing principles of privacy, accountability, interpretability, robustness, and reasoning.
result Designing approaches to use structured data for reliable decisions.

AI agents improve forecast combination but require transparency.

problem AI coding agents increase flexibility in empirical economics, leading to hidden degrees of freedom.
method Adapted open-source agent-loop architecture to empirical economics workflow, adding post-search holdout evaluation.
result Multiple agent runs outperform standard benchmarks in rolling evaluation but not all on post-search holdout.

This work advances collaborative decision making by combining human and AI strengths in uncertainty quantification.

problem Current AI lacks robust decision-making capabilities under uncertainty, especially in high-stakes contexts.
method Introduces Human AI Collaborative Uncertainty Quantification (HACUQ) framework, formalizing AI-human collaboration and developing calibration algorithms.
result Optimal collaborative prediction sets follow a two-threshold structure, and online adaptation algorithms can adapt to evolving human behavior.

New approach to algorithmic fairness for human-AI collaboration considers compliance with human decisions.

problem Current fairness approaches assume perfect human compliance, but real-world compliance is often poor.
method Defines compliance-robustly fair algorithms and proposes an optimization strategy to improve fairness.
result Algorithmic recommendations can improve fairness even if humans do not fully comply with fair algorithms.

Develops methods for AI self-assessment to improve trustworthiness.

problem Uncertainty in AI predictions and lack of trust in AI systems.
method Uncertainty estimation techniques considering practical impacts and costs.
result Guidelines for selecting and designing effective AI self-assessment methods.

Examines AI regulation in finance, highlighting risks and gaps in current laws.

problem Rapid AI adoption in finance introduces risks and compliance challenges.
method Reviews current legislation, industry guidelines, and real-world use cases.
result Need for adaptive, technology-neutral policies to balance innovation and consumer protection.

CAT framework improves AI medical screening fairness and reliability.

problem Imbalanced data, varying performance across cohorts, and patient-level inconsistencies in traditional metrics.
method CAT framework introduces patient-level assessment, entropy-based distribution weighting, and cohort-weighted sensitivity and specificity.
result Enhanced predictive reliability, fairness, and interpretability of AI-driven medical screening models.

New AI method improves anomaly detection across different IIoT sensors.

problem Poor performance of anomaly detection models when applied to different machines.
method Robust AI method using pre-processing and multiple models on different pumps.
result Models perform well across different environments and types of pumps.

The paper solves optimal bounds for separating data points in high dimensions.

problem Correcting AI errors and analyzing vulnerabilities in high-dimensional data.
method General stochastic separation theorems with optimal probability estimates.
result Explicit and optimal estimates of separation probabilities for important classes of distributions.

New framework uses OR to ensure AI systems make safe decisions.

problem Ensuring generative AI systems make safe decisions as they gain autonomy.
method Developed a conceptual framework combining flow-based models and adversarial robustness.
result Increased autonomy requires new OR approaches for feasibility, robustness, and stress testing.

FR-Train improves fair and robust AI training by detecting and reducing poisoned data.

problem Training AI models that are fair and robust in the presence of data bias and poisoning.
method Mutual information-based adversarial training with an additional discriminator.
result FR-Train maintains fairness and accuracy even in the presence of poisoned data.

Peer-induced fairness framework audits algorithmic fairness in AI applications.

problem Current auditing methods lack robustness and fail to distinguish between algorithmic discrimination and subject limitations.
method Combines counterfactual fairness and peer comparison strategy for a reliable auditing tool.
result Demonstrates significant unfairness in micro-firms compared to non-micro firms, highlighting the framework's potential.