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

Trend · papers per month

182364546728 · Jun 202019922001200920172026
48 results for falsification study

Algorithm detects unmeasured confounding in observational data.

problem Estimating treatment effects in observational studies with untestable conditions.
method Two-stage procedure that detects dependencies between causal mechanisms.
result Algorithm efficiently detects confounding on simulated and semi-synthetic data.

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.

Study finds no statistically significant trading edge in MNQ futures signals from OHLCV data.

problem Testing intraday momentum signals from OHLCV data in MNQ futures under realistic execution constraints.
method 947 trading days of five-minute data, 14 signal families evaluated, strict institutional criteria applied.
result No signal satisfies all criteria simultaneously, gross edge insufficient to overcome costs.

Proposes a test to ensure predictive algorithms predict intended outcomes better than unintended ones.

problem Unintended model behavior leading to prediction of unintended outcomes.
method Falsification framework using nonparametric hypothesis testing to compare prediction losses across outcomes.
result Establishes discriminant validity with respect to gender but not race in an admissions setting.

This work examines fundamental limits in model falsification without assuming specific distributions.

problem Establishing lower bounds on model class risk in distribution-free settings.
method Model-agnostic fundamental hardness result for constructing lower bounds on test error.
result No positive lower bound on model class risk is possible in certain settings.

This paper considers the problem of detection in distributed networks in the presence of data falsification (Byzantine) attacks. Detection approaches considered in the paper are based on fully distributed consensus algorithms, where all of the nodes exchange information only with their neighbors in the absence of a fus…

2015-04-14abs ↗pdf ↗

We information-theoretically reformulate two measures of capacity from statistical learning theory: empirical VC-entropy and empirical Rademacher complexity. We show these capacity measures count the number of hypotheses about a dataset that a learning algorithm falsifies when it finds the classifier in its repertoire …

2011-11-23abs ↗pdf ↗

Efficiently generates models resistant to falsification.

problem Creating models that cannot be disproven by tests.
method Exploits connections between high-dimensional multicalibration and expected variational inequality problems to develop an efficient algorithm.
result First to efficiently produce online outcome indistinguishable generative models resistant to infinite classes of tests.

This chapter studies emerging cyber-attacks on reinforcement learning (RL) and introduces a quantitative approach to analyze the vulnerabilities of RL. Focusing on adversarial manipulation on the cost signals, we analyze the performance degradation of TD(λλ) and QQ-learning algorithms under the manipulation. For TD($…

2020-02-07abs ↗pdf ↗

The paper argues that machine learning is a falsificationist process.

problem The role of falsification in machine learning is underexplored.
method The paper presents a falsificationist account of artificial neural networks, emphasizing empirical risk minimization and implicit regularization.
result Artificial neural networks can be seen as a falsificationist process, rejecting inadequate prediction rules.

A new metric assesses causal graphs using node permutations to detect inconsistencies.

problem Quantifying the goodness of causal graphs and distinguishing them from random graphs.
method Constructing a baseline through node permutations and comparing inconsistencies.
result The proposed metric can distinguish between true and wrong causal graphs.

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as the length of the shortest program producing it. The second, Shannon information…

2011-10-17abs ↗pdf ↗

New method tightens bounds on causation probabilities using independent datasets.

problem Challenging point identification of causation probabilities without strong assumptions.
method Imposes counterfactual consistency between SCMs constructed from independent datasets and uses conditional mutual information.
result Significantly tighter bounds on causation probabilities are established.

New methods improve robust decision-making under uncertainty in off-policy evaluation.

problem Statistical uncertainty and causal considerations in off-policy evaluation.
method Marginal Ratio (MR) estimator, Conformal Off-Policy Prediction (COPP), causal bounds.
result Improved robustness and uncertainty quantification in off-policy decision-making.

Faster Tsetlin Machines use clause indexing to speed inference and learning.

problem Overfitting and slow inference in Tsetlin Machines.
method Introduced a look-up table that indexes clauses based on feature falsification, enabling faster evaluation of clauses.
result Up to 15 times faster classification and three times faster learning on MNIST and Fashion-MNIST.

Causal Bayesian networks interpret actions as interventions to connect models to real-world outcomes.

problem Connecting causal model predictions to real-world outcomes.
method Formal framework to interpret actions as interventions and prove impossibility results.
result No non-circular interpretation exists that satisfies natural desiderata without violating some.

A new method estimates treatment effects across multiple studies considering differences.

problem Estimating treatment effects across multiple studies with varying conditions.
method The multi-study R-learner framework that accounts for between-study heterogeneity.
result The multi-study R-learner is more efficient and normal than existing methods in the presence of heterogeneity.

Study shows convergence of Fubini-Study currents to equilibrium metrics on Kähler manifolds.

problem Convergence of Fubini-Study currents to equilibrium metrics in Kähler geometry.
method Analysis of continuous Hermitian metrics and their Fubini-Study currents on line bundles.
result The scaled difference between Fubini-Study currents and equilibrium metrics converges to zero in the sense of currents.

Treatment recommendations within Clinical Practice Guidelines (CPGs) are largely based on findings from clinical trials and case studies, referred to here as research studies, that are often based on highly selective clinical populations, referred to here as study cohorts. When medical practitioners apply CPG recommend…

2019-07-09abs ↗pdf ↗

This article examines five common misunderstandings about case-study research: (1) Theoretical knowledge is more valuable than practical knowledge; (2) One cannot generalize from a single case, therefore the single case study cannot contribute to scientific development; (3) The case study is most useful for generating …

2013-04-02abs ↗pdf ↗

This paper reviewed the machine learning-based studies for quantitative positron emission tomography (PET). Specifically, we summarized the recent developments of machine learning-based methods in PET attenuation correction and low-count PET reconstruction by listing and comparing the proposed methods, study designs an…

2020-01-18abs ↗pdf ↗

Ricci flow simulations show unstable Fubini-Study metrics develop singularities.

problem Understanding the behavior of unstable perturbations in Ricci flow.
method Numerical simulations of Ricci flow starting from unstable Fubini-Study metrics.
result Ricci flow solutions from unstable Fubini-Study metrics develop local singularities.

GenAI improves actuarial practices through case studies.

problem Improving actuarial practices using AI.
method Four case studies using LLMs, Retrieval-Augmented Generation, and vision-enabled LLMs.
result GenAI enhances claim cost prediction, market comparisons, and car damage classification.

Optimal ensemble construction improves prediction accuracy for multi-study tasks, especially in pandemic scenarios.

problem Poor out-of-study prediction performance due to heterogeneous datasets.
method Optimal ensemble construction using a two-stage stacking strategy that jointly estimates ensemble weights and study-specific model parameters.
result Our method outperforms multi-study stacking and other standard methods in predicting excess mortality during the pandemic.

Study evaluates machine learning for predicting treatment effects in observational studies.

problem Challenges in measuring treatment effects due to confounding bias in observational studies.
method Simulated two scenarios with and without confounding, using linear and non-linear relationships. Used machine learning models (linear regression, lasso regression, random forest) to predict counterfactuals and treatment effects.
result Machine learning models perform well under linearity but poorly under non-linearity, even in the presence of confounding.

In this paper, as a fundamental study on the theory of Morse functions and their higher dimensional versions or fold maps and applications to geometric theory of manifolds, which were started in 1950s by differential topologists such as Thom and Whitney and have been studied actively, we study algebraic and differentia…

2015-08-23abs ↗pdf ↗

Study evaluates and compares numerical differentiation methods on three case studies.

problem Evaluating and comparing numerical differentiation methods for efficiency.
method Forward, Backward, and Centered Finite-Difference methods applied at two levels of precision.
result Different methods perform differently across case studies, with varying levels of computational cost and accuracy.

Ablation studies show BCF model's propensity score is not essential for treatment effect estimation.

problem Understanding the necessity of propensity score in nonparametric treatment effect estimation.
method Partial ablation studies of Bayesian Causal Forest (BCF) model.
result Excluding estimated propensity score does not affect treatment effect estimation or uncertainty quantification.

The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mech…

2012-11-13abs ↗pdf ↗

Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via graphical diagrams with virtual crossings. Virtual knot theory studies non-planar Gauss…

1998-11-05abs ↗pdf ↗