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.

169,051 papers · 148 categories

Trend · papers per month

63127190253 · Jun 202019922001200920182026
48 results for statistical conclusions

Deep learning models are evaluated for sensory information processing.

problem Unclear interpretation of model comparison techniques for DNNs.
method Explicitly define conclusions from existing model comparison techniques.
result Stronger conclusions about sensory processing mechanisms possible with DNNs.

Neuroimaging research has predominantly drawn conclusions based on classical statistics, including null-hypothesis testing, t-tests, and ANOVA. Throughout recent years, statistical learning methods enjoy increasing popularity, including cross-validation, pattern classification, and sparsity-inducing regression. These t…

2016-03-06abs ↗pdf ↗

The authors argue against the classification of forecasting methods as machine learning or statistical.

problem The classification of forecasting methods as machine learning or statistical limits insights into their appropriateness and effectiveness.
method Alternative characteristics of forecasting methods are proposed to draw meaningful conclusions.
result The distinction between machine learning and statistical forecasting methods is not fundamental.

SMILE improves explainability of machine learning models.

problem Difficulty in understanding and trusting the conclusions of black-box machine learning models.
method Statistical Model-agnostic Interpretability with Local Explanations (SMILE).
result SMILE makes machine learning models more interpretable.

The thesis tackles overconfident approximations in simulation-based inference.

problem Overconfident conclusions from machine learning approximations in statistical analyses.
method Introduces balancing and Bayesian neural networks to reduce overconfidence.
result Balancing and Bayesian neural networks lead to less overconfident approximations.

We extend nonparametric models to handle extrapolation, providing bounds for inference.

problem Challenges in nonparametric statistical inference when evaluating outside the conditioning variable's support.
method Introduced a class of extrapolation assumptions and a consistent estimation procedure to handle extrapolation.
result Validated extrapolation-aware conclusions through various applications and real-world data.

The paper evaluates index-based allocation policies using data from randomized control trials.

problem Evaluating index-based allocation policies in resource-scarce scenarios.
method Using data from randomized control trials, the paper introduces an efficient estimator and methods for computing asymptotically correct confidence intervals.
result Valid statistical conclusions can be drawn for index-based allocation policies.

New estimator improves statistical validity of synthetic data integration.

problem Combining synthetic data generated by large language models with real data for valid inference.
method Generalized method of moments estimator with theoretical guarantees.
result Improves estimates of target parameter through interactions between synthetic and real data.

Paper introduces a new gradient statistic to improve deep learning convergence.

problem Fluctuation effect of gradient updates between iterations.
method Introduces an unbiased stratified statistic \(\bar{G}_{mst}\) and a new algorithm MSSG.
result MSSG algorithm outperforms other sgd-like algorithms in training deep models.

Proposes incorporating noise sources in machine learning evaluation for more reliable conclusions.

problem Inadequate handling of nondeterminism in machine learning research leads to unreliable results.
method Uses linear mixed effects models (LMEMs) and generalized likelihood ratio tests (GLRT) to analyze performance evaluation scores and assess performance differences.
result Demonstrates how to incorporate various sources of noise and data properties into statistical significance testing and reliability analysis.

Deep RL evaluation underestimates uncertainty, leading to misleading conclusions.

problem Statistical uncertainty in deep RL performance evaluations is underestimated, leading to misleading conclusions.
method Advocates for reporting interval estimates of aggregate performance and proposes performance profiles to account for variability.
result Substantial discrepancies in prior performance comparisons are revealed, highlighting the need for more rigorous evaluation methods.

A research frontier has emerged in scientific computation, wherein numerical error is regarded as a source of epistemic uncertainty that can be modelled. This raises several statistical challenges, including the design of statistical methods that enable the coherent propagation of probabilities through a (possibly dete…

2015-12-03abs ↗pdf ↗

Big Data bring new opportunities to modern society and challenges to data scientists. On one hand, Big Data hold great promises for discovering subtle population patterns and heterogeneities that are not possible with small-scale data. On the other hand, the massive sample size and high dimensionality of Big Data intro…

2013-08-07abs ↗pdf ↗

A new method uses randomized trials to estimate the strength of unobserved confounding.

problem Unobserved confounding compromises causal conclusions from non-randomized studies.
method Designs a statistical test to detect unobserved confounding strength and estimates a lower bound.
result Estimates an asymptotically valid lower bound on unobserved confounding strength.

Over the past two decades, several consistent procedures have been designed to infer causal conclusions from observational data. We prove that if the true causal network might be an arbitrary, linear Gaussian network or a discrete Bayes network, then every unambiguous causal conclusion produced by a consistent method f…

2012-03-15abs ↗pdf ↗

We apply basic statistical reasoning to signal reconstruction by machine learning -- learning to map corrupted observations to clean signals -- with a simple and powerful conclusion: it is possible to learn to restore images by only looking at corrupted examples, at performance at and sometimes exceeding training using…

2018-03-12abs ↗pdf ↗

The paper extends hypothesis testing to non-diagonalizable matrices, improving network statistics inference.

problem Testing on non-diagonalizable matrices for network statistics.
method Generalizes Wald and t-tests to non-symmetric matrices, controlling convergence rates.
result Improved inference on network statistics from directed networks.

The paper analyzes optimal statistical arbitrage strategies for co-integrated stocks.

problem Finding optimal portfolio weights for co-integrated stocks.
method Solving a Hamilton-Jacobi-Bellman (HJB) partial differential equation for optimal portfolio weights.
result The proposed co-integrated model with eigenportfolios can generate stable growth rates over a long time horizon.

Choosing a reference group in Oaxaca-Blinder decomposition can reverse conclusions.

problem The choice of reference group in Oaxaca-Blinder decomposition can lead to different conclusions.
method The study uses the Oaxaca-Blinder decomposition to investigate how the choice of reference group affects the results.
result The Oaxaca-Blinder decomposition can yield different conclusions based on the choice of reference group.

The study improves the assessment of fairness in face recognition using ROC curves and statistical guarantees.

problem Improving the assessment of fairness in face recognition systems.
method Proves asymptotic guarantees for empirical ROC curves and fairness metrics, and introduces a recentering technique to avoid bootstrap pitfalls.
result Demonstrates the practical relevance of the methods for assessing fairness in face recognition systems.

Because of the prominent position of urban rail in reducing urban transport-related problems, such as congestion and air pollution, insights into the costs of possible new urban rail projects is very relevant for those involved with cost estimations, policy makers, cost-benefit analysts, and other target groups. Knowle…

2013-03-20abs ↗pdf ↗

Understanding the causes of crime is a longstanding issue in researcher's agenda. While it is a hard task to extract causality from data, several linear models have been proposed to predict crime through the existing correlations between crime and urban metrics. However, because of non-Gaussian distributions and multic…

2017-12-08abs ↗pdf ↗

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

We present an overview of some representative Agent-Based Models in Economics. We discuss why and how agent-based models represent an important step in order to explain the dynamics and the statistical properties of financial markets beyond the Classical Theory of Economics. We perform a schematic analysis of several m…

2011-01-10abs ↗pdf ↗

Study shows heavy-tailed distributions affect reliability of machine learning calibration statistics.

problem Reliability of calibration statistics for machine learning regression tasks is affected by heavy-tailed uncertainty and error distributions.
method Examined two calibration error estimation methods (CE and ZMS) and found ZMS to be less sensitive to heavy-tailed distributions.
result Heavy-tailed distributions make MSE and MV unreliable, but ZMS remains a reliable approach.

Traditional statistical theory assumes that the analysis to be performed on a given data set is selected independently of the data themselves. This assumption breaks downs when data are re-used across analyses and the analysis to be performed at a given stage depends on the results of earlier stages. Such dependency ca…

2017-06-02abs ↗pdf ↗

seMCD computes depth functions with statistical guarantees using sequential Monte Carlo.

problem Computing depth functions is computationally challenging, especially in high dimensions.
method Sequential Monte Carlo methodology with theoretical and empirical guarantees.
result The seMCD method provides accurate depth approximations with fewer samples than traditional methods.

Quantile TD learning outperforms classical TD learning for value estimation.

problem Temporal-difference learning in reinforcement learning.
method Quantile Temporal-Difference Learning (QTD) for policy evaluation.
result QTD offers superior performance to classical TD learning, even in tabular settings.

Machine learning experiments often contain errors, especially in confusion matrices and statistical tests.

problem Errors in machine learning experiments, particularly in confusion matrices and statistical tests.
method Analyzed 49 papers describing 2456 experiments, checking for errors in confusion matrices and statistical significance.
result 22 out of 49 papers contain demonstrable errors, with 7 statistical and 16 related to confusion matrix inconsistency.

The stability of statistical analysis is an important indicator for reproducibility, which is one main principle of scientific method. It entails that similar statistical conclusions can be reached based on independent samples from the same underlying population. In this paper, we introduce a general measure of classif…

2014-05-26abs ↗pdf ↗

Study improves statistical power for detecting algorithmic bias in educational data.

problem Challenges in measuring algorithmic bias using ABROCA due to skewed distribution.
method Investigates ABROCA's distributional properties and proposes nonparametric randomization tests.
result ABROCA-based bias assessments are underpowered in typical EDM sample sizes.

This paper develops embeddings that preserve likelihood-based statistical inference.

problem Modern machine learning embeddings destroy the geometric structure required for likelihood-based inference.
method Developed a rigorous theory of likelihood-preserving embeddings and introduced the Likelihood-Ratio Distortion metric.
result Controlling the distortion ΔnΔ_n is necessary and sufficient for preserving inference.