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

8.2%16.4%24.6%32.8% · May 202619922001200920172026
48 results for test prediction variance

Develops abstention procedure for nonparametric regression via variance testing.

problem Prediction with selective abstention in error-critical machine learning.
method Nonparametric heteroskedastic regression via testing hypothesis on conditional variance.
result Non-asymptotic risk bounds and convergence regimes for the estimator.

Introduces TPV to analyze model robustness without labels.

problem Analyzing post-training robustness of machine learning models.
method Parameter perturbations and test prediction variance (TPV) as a unifying framework.
result TPV connects various perturbations under a single lens, providing insights into model stability.

A simple method treats heteroscedastic variance variatively, improving model calibration and sample quality.

problem Brittle optimization impacts model likelihoods for mean and variance estimation.
method Proposes a variational approach to heteroscedastic variance, improving predictive mean and variance calibration.
result The proposed method significantly improves parameter calibration and sample quality for regression and VAEs.

Adversarial training leads to large generalization gap, decomposed into bias and variance.

problem Understanding the large generalization gap in adversarially trained models.
method Bias-Variance decomposition of test risk as a function of adversarial perturbation radius.
result Bias increases monotonically with adversarial perturbation radius and is dominant in test risk.

Unified approach combines prediction-powered inference and variance reduction for semi-supervised optimization.

problem Scarcity of labeled data in semi-supervised optimization.
method PPI-SVRG, combining PPI and SVRG methods.
result Unified convergence bound with improved performance under label scarcity.

New method uses interval-based metric to validate prediction uncertainty in machine learning.

problem Validation of prediction uncertainty in machine learning regression tasks is unreliable due to heavy-tailed distributions.
method Shift from variance-based metrics to interval-based Prediction Interval Coverage Probability (PICP).
result PICP method more quickly and reliably tests prediction intervals than variance-based metrics.

Researchers have constantly asked whether stock returns can be predicted by some macroeconomic data. However, it is known that macroeconomic data may exhibit nonstationarity and/or heavy tails, which complicates existing testing procedures for predictability. In this paper we propose novel empirical likelihood methods …

2014-04-30abs ↗pdf ↗

China's stock market is the largest emerging market all over the world. It is widely accepted that the Chinese stock market is far from efficiency and it possesses possible linear and nonlinear dependence. We study the predictability of returns in the Chinese stock market by employing the wild bootstrap automatic varia…

2016-11-13abs ↗pdf ↗

Proposes a modified Morgan-Pitman test for evaluating variances in machine learning models.

problem Limited ability to account for sampling variability in model selection.
method Enhances the classic Morgan-Pitman test for robustness in non-linear models with heavy-tailed distributions or outliers.
result Demonstrates the test's effectiveness and practical utility in model evaluation and selection.

New bin-wise scaling methods improve prediction uncertainty calibration for machine learning.

problem Improving prediction uncertainty calibration for machine learning regression.
method Adaptations of Binwise Variance Scaling (BVS) with alternative loss functions and feature-based binning.
result Improved adaptivity and consistency in prediction uncertainty calibration.

Scaling laws in linear regression explain model performance improvements with size and data.

problem Disagreement between empirical neural scaling laws and conventional wisdom on variance error.
method Infinite dimensional linear regression setup, one-pass SGD, Gaussian prior, power-law spectrum.
result Variance error is dominated by other errors, disappearing from the bound due to SGD's implicit regularization.

USNRT uses tree-structured learning to improve uncertainty quantification of variance networks.

problem Improving uncertainty quantification of variance networks.
method Tree-structured local neural network model that partitions feature space into regions for training region-specific neural networks to predict mean and variance.
result USNRT shows superior performance in estimating uncertainty with variances on UCI datasets compared to recent methods.

Ordinary stochastic neural networks mostly rely on the expected values of their weights to make predictions, whereas the induced noise is mostly used to capture the uncertainty, prevent overfitting and slightly boost the performance through test-time averaging. In this paper, we introduce variance layers, a different k…

2018-03-10abs ↗pdf ↗

Gradient-flow optimization is reinterpreted as a statistical inference problem.

problem Optimizing training duration and assessing model performance in deep learning.
method Develops a statistical framework for gradient-flow training, treating it as a random-effects model.
result Establishes asymptotic optimality for prediction and reduces reliance on validation splits.

Paper improves volatility estimation using a Queue-Reactive model.

problem Volatility estimation from high-frequency data is biased by microstructure noise.
method Uses Queue-Reactive model of limit order book to improve volatility estimation.
result Unified and alternation estimators lead to optimal mean squared error for integrated volatility.

A new method improves treatment effect inferences in RCTs by adjusting for covariates and heteroskedasticity.

problem Improving treatment effect inferences in RCTs with efficient and powerful methods.
method Weighted Prognostic Covariate Adjustment Method (Weighted PROCOVA) for heteroskedasticity.
result The method reduces variance, maintains Type I error rate, and increases test power for treatment effect.

The bias-variance tradeoff tells us that as model complexity increases, bias falls and variances increases, leading to a U-shaped test error curve. However, recent empirical results with over-parameterized neural networks are marked by a striking absence of the classic U-shaped test error curve: test error keeps decrea…

2018-10-19abs ↗pdf ↗

This work uses ANOVA to understand how different factors contribute to test error in machine learning models.

problem Understanding why overparametrized models generalize well despite potentially fitting noise.
method Analysis of variance (ANOVA) to decompose test error into components of variance.
result The interaction between training samples and initialization can dominate variance, and there are phase transitions in variance behavior.

We quantify predictive uncertainty using the posterior predictive variance.

problem Quantifying uncertainty in predictive models.
method Using the law of total variance, we generate expansions for the posterior predictive variance.
result Identify the main contributors to prediction intervals and quantify term-wise uncertainty.

Language models allocate information storage, not collapsing into uniform representations.

problem Incomplete neural collapse in language model representations.
method Analyzing variance and information sharing across 14 models, proving an information floor.
result Within-class variance is allocated information storage, not collapsed into uniform representations.

The infinitesimal jackknife (IJ) has recently been applied to the random forest to estimate its prediction variance. These theorems were verified under a traditional random forest framework which uses classification and regression trees (CART) and bootstrap resampling. However, random forests using conditional inferenc…

2017-06-19abs ↗pdf ↗

The paper proposes a new method for comparing logistic regression models across different populations.

problem Comparing logistic regression models across sub-populations can lead to misleading results.
method Develops a cascading set of equivalence tests for logistic regression models, addressing coding, predictions, and overall accuracy.
result Equivalence testing incentivizes accurate inference and avoids perverse incentives from significance tests.

Improves predictive algorithm performance with domain adaptation.

problem Improves performance of predictive algorithms in distributional shift scenarios.
method Domain adaptive bootstrap aggregating with iterative nearest neighbor sampling.
result Proposes a method to improve predictive algorithm performance in distributional shift scenarios.

We present local ensembles, a method for detecting underspecification -- when many possible predictors are consistent with the training data and model class -- at test time in a pre-trained model. Our method uses local second-order information to approximate the variance of predictions across an ensemble of models from…

2019-10-21abs ↗pdf ↗

Project predicts stock prices for robust portfolio design in Indian sectors.

problem Precise stock price prediction for robust portfolio design.
method Minimum variance and optimal risk portfolio optimization using past stock prices.
result Backtesting shows improved performance of optimized portfolios over equal weight portfolio.

In this paper we formulate a regression problem to predict realized volatility by using option price data and enhance VIX-styled volatility indices' predictability and liquidity. We test algorithms including regularized regression and machine learning methods such as Feedforward Neural Networks (FNN) on S&P 500 Index a…

2019-09-22abs ↗pdf ↗

Paper explains how tree ensembles improve predictions by smoothing and regulating smoothness.

problem Understanding why tree ensembles perform well despite their complexity.
method Interpreting tree ensembles as adaptive and self-regularizing smoothers.
result Ensemble trees make more smooth predictions than individual trees and adjust smoothness based on input dissimilarity.

The relationship between the size and the variance of firm growth rates is known to follow an approximate power-law behavior σ(S)Sβ(S)σ(S) \sim S^{-β(S)} where SS is the firm size and β(S)0.2β(S)\approx 0.2 is an exponent weakly dependent on SS. Here we show how a model of proportional growth which treats firms as classes compos…

2009-04-08abs ↗pdf ↗

This paper improves uncertainty quantification in ELM models.

problem Uncertainty in ELM predictions due to data assumptions and randomness.
method Analytical derivations and variance estimates under various conditions.
result Improved understanding and estimation of ELM variability.