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

140280420560 · Jun 202019922001200920172026
48 results for double sampling

More data can actually hurt linear regression performance in certain conditions.

problem The test risk of linear regression estimators increases with additional samples in overparameterized settings.
method An analysis of linear regression with isotropic Gaussian covariates using gradient descent.
result The bias decreases with more samples, but variance increases, leading to a surprising increase in test risk.

Study shows double and triple descent in unsupervised autoencoders, improving performance in various tasks.

problem Exploring the phenomenon of double descent in unsupervised learning.
method Analytical demonstration and extensive experiments on synthetic and real datasets.
result Over-parameterized unsupervised autoencoders exhibit double and triple descent, enhancing performance in downstream tasks.

Optimal regularization can prevent the double descent phenomenon in learning models.

problem The double descent phenomenon in learning models, where test performance is non-monotonic in sample size and model size.
method Theoretical and empirical study of optimal 2\ell_2 regularization for linear regression models and neural networks.
result Optimally-tuned 2\ell_2 regularization achieves monotonic test performance for certain models and mitigates the double descent phenomenon for more general models.

Exact expressions for double descent and implicit regularization in over-parameterized models.

problem Understanding the generalization error of over-parameterized models like deep neural networks.
method Surrogate random design to replace standard i.i.d. design, leading to exact expressions for mean squared error and implicit regularization.
result Exact non-asymptotic expressions for double descent and implicit regularization in over-parameterized models.

New algorithm borrows future randomness to stabilize model-free control.

problem Double sampling problem in model-free control with nonlinear approximations.
method Borrowing from the future (BFF) algorithm to approximate re-sampling of next states.
result BFF is close to unbiased SGD under smooth dynamics, validated by simulations.

Deep learning models can initially degrade in performance as they grow larger, then improve.

problem Performance degradation of larger models and more data.
method Defined effective model complexity and identified double descent phenomenon.
result Increasing model size and data can initially hurt performance, contrary to intuition.

Least squares regression shows unexpected double descent in under-parameterized models.

problem Understanding the generalization of under-parameterized models in regression.
method Analyzing the spectrum and eigenvectors of the sample covariance matrix.
result Least squares regression can exhibit a peak in generalization in the under-parameterized regime, contrary to previous explanations.

The paper investigates how calibrating propensity scores improves DML estimates of average treatment effects.

problem Improving the accuracy of DML estimates in finite samples.
method Propensity score calibration within the Double/debiased machine learning framework.
result Calibrating propensity scores reduces the root mean squared error of DML estimates of average treatment effects in finite samples.

The paper develops methods to estimate treatment effects in sample selection models.

problem Evaluation of treatments when outcomes are only observed for a subpopulation due to sample selection or attrition.
method Combines selection-on-observables and instrumental variable assumptions with double machine learning for treatment evaluation.
result Proposed estimators are asymptotically normal and root-n consistent.

Study on double descent behavior in two-layer neural networks for binary classification.

problem Understanding the double descent phenomenon in model test error.
method Two-layer neural network with ReLU activation for binary classification. Quantified model size by sample-to-dimension ratio. Empirical risk minimization using Convex Gaussian Min Max Theorem.
result Observed and investigated the double descent behavior of model test error.

The "double descent" risk curve was proposed to qualitatively describe the out-of-sample prediction accuracy of variably-parameterized machine learning models. This article provides a precise mathematical analysis for the shape of this curve in two simple data models with the least squares/least norm predictor. Specifi…

2019-03-18abs ↗pdf ↗

Double descent in portfolio optimization shows improved performance with complexity, then declines, due to overfitting.

problem Improving portfolio optimization performance with model complexity.
method Investigates the relationship between model complexity and out-of-sample performance in mean-variance portfolio optimization.
result Performance of low-dimensional models initially improves with complexity but declines due to overfitting. High-dimensional models show double ascent Sharpe ratio curve.

In this paper, we propose a Double Thompson Sampling (D-TS) algorithm for dueling bandit problems. As indicated by its name, D-TS selects both the first and the second candidates according to Thompson Sampling. Specifically, D-TS maintains a posterior distribution for the preference matrix, and chooses the pair of arms…

2016-04-25abs ↗pdf ↗

Study on RF regression with SGD shows double descent phenomenon.

problem Understanding generalization in RF models trained with SGD.
method Precise non-asymptotic error bounds derived for RF regression under constant and polynomial-decay step-size SGD.
result RF regression generalizes well for interpolation learning and exhibits double descent behavior.

A theorem for debiasing machine learning with finite sample guarantees.

problem Calculating confidence intervals for machine learning functionals.
method Debiased machine learning based on bias correction and sample splitting.
result Nonasymptotic debiased machine learning theorem with finite sample guarantees.

Histogram binning method proven with guarantees without splitting data.

problem Proving theoretical guarantees for histogram binning without sample splitting.
method Using Markov property of order statistics to prove calibration guarantees for original method.
result Proves histogram binning has strong calibration guarantees without sample splitting.

Hybrid regularization avoids double descent in random feature models.

problem Avoiding the double descent phenomenon in random feature models.
method Combines early stopping and weight decay, using GCV for hyperparameter selection.
result Hybrid method successfully avoids double descent and achieves comparable generalization.

A new method for causal inference in high-dimensional data using machine learning.

problem Causal inference in high-dimensional observational data.
method Support Points Sample Splitting (SPSS) for efficient double machine learning (DML) in causal inference.
result Deep learning with SPSS and hybrid methods outperform SVM with SPSS in computational efficiency and estimation quality.

The paper uses double machine learning to estimate dynamic treatment effects robustly.

problem Estimating causal effects of dynamic treatments with time-varying covariates.
method Double machine learning with Neyman-orthogonal score functions for robustness.
result Asymptotic normality and n\sqrt{n}-consistency of the estimators under specific conditions.

Sparse coding is a crucial subroutine in algorithms for various signal processing, deep learning, and other machine learning applications. The central goal is to learn an overcomplete dictionary that can sparsely represent a given input dataset. However, a key challenge is that storage, transmission, and processing of …

2017-11-09abs ↗pdf ↗

Modern ML methods show unexpected behaviors that contradict classical statistics.

problem Modern machine learning methods exhibit behaviors at odds with classical statistical intuitions.
method Comparison between fixed and random design settings in ML and statistics.
result Moving from fixed to random designs reveals new insights into bias-variance tradeoffs and overfitting.

Two new algorithms improve Q* approximation in batch RL with linear error propagation.

problem Improving Q* approximation in batch reinforcement learning.
method Two novel algorithms that estimate Bellman error directly, without quadratic dependence.
result Linear-in-horizon error propagation for batch RL algorithms.

New findings challenge the traditional U-shaped curve of model complexity and error, revealing a second descent in error as model size increases.

problem The traditional U-shaped curve of model complexity and prediction error is incomplete, with recent work suggesting a second descent in error as model size increases.
method Careful consideration of multiple complexity axes and a nonparametric statistics perspective were used to interpret the observed double descent curves.
result The observed double descent curves in classical statistical machine learning methods fold back into traditional convex shapes, resolving tensions with statistical intuition.

This work reveals how label noise can cause a final ascent in neural network performance curves.

problem The impact of label noise on the performance of neural networks.
method Theoretical analysis and extensive experiments on various neural network architectures.
result Label noise can lead to a final ascent in the test loss curve, improving generalization at intermediate model widths.

Unified framework for causal inference under sample selection.

problem Causal inference under sample selection with treatment and outcome non-randomness.
method ForestRiesz estimator, Riesz representation framework.
result ForestRiesz estimator yields more stable treatment effect estimates than conventional double machine learning approaches.

A Klein surface is a surface with a dianalytic structure. A double of a Klein surface XX is a Klein surface YY such that there is a degree two morphism (of Klein surfaces) YXY\rightarrow X. There are many doubles of a given Klein surface and among them the so-called natural doubles which are: the complex double, the …

2014-04-03abs ↗pdf ↗

Changing kernel bandwidth during training improves kernel regression performance.

problem Improving kernel regression performance with varying model complexity.
method Investigated changing the bandwidth of a translational-invariant kernel during training for kernel regression using gradient descent.
result Kernel regression exhibits double descent behavior with decreasing model complexity (bandwidth).

Characterizes RFF regression in large n,p,Nn,p,N setting, providing precise learning phases and double descent curve.

problem Characterizes RFF regression in large n,p,Nn,p,N setting.
method Characterizes the exact asymptotics of random Fourier feature (RFF) regression in the realistic setting of large n,p,Nn,p,N.
result Characterizes two qualitatively different phases of learning and the corresponding double descent test error curve.

Improves robustness of propensity score estimators in challenging settings.

problem Limited overlap, small sample sizes, or unbalanced data.
method Extends calibration techniques for propensity score models, focusing on sample-splitting schemes.
result Calibration reduces variance and bias in inverse probability weighting and double/debiased machine learning frameworks.

Develops a test for conditional local independence of counting processes.

problem Testing the hypothesis of conditional local independence among continuous time stochastic processes.
method Introduces a new functional parameter, the Local Covariance Measure (LCM), and proposes a test called (X)-LCT using nonparametric estimators and sample splitting or cross-fitting.
result The (X)-LCT test can be controlled uniformly with modest rates, and it works well without restrictive parametric assumptions.

We define a general notion of abstract double Lie algebroid. We show (1) that the double Lie algebroid of a double Lie groupoid is a double Lie algebroid in this sense; (2) that the double cotangent constructed from Lie algebroid structures on a vector bundle A and its dual A* is a double Lie algebroid if and only if (…

1998-08-17abs ↗pdf ↗

We propose a generalized double Pareto prior for Bayesian shrinkage estimation and inferences in linear models. The prior can be obtained via a scale mixture of Laplace or normal distributions, forming a bridge between the Laplace and Normal-Jeffreys' priors. While it has a spike at zero like the Laplace density, it al…

2011-04-05abs ↗pdf ↗

We define double principal bundles (DPBs), for which the frame bundle of a double vector bundle, double Lie groups and double homogeneous spaces are basic examples. It is shown that a double vector bundle can be realized as the associated bundle of its frame bundle. Also dual structures, gauge transformations and conne…

2016-11-02abs ↗pdf ↗