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

Trend · papers per month

0111 · Nov 201019922001200920172026
8 results for subbagging

Subbagging estimation for big data reduces memory usage while maintaining statistical consistency.

problem Memory constraints in analyzing massive datasets.
method Randomly subsample the data, aggregate estimators from subsamples, and use incomplete U-statistics theory.
result Subbagging estimator achieves N\sqrt{N}-consistency and asymptotic normality under certain conditions.

The paper relaxes the stability condition to boost confidence in generalization for randomized learning algorithms.

problem The tension between uniform stability and L2L_2-stability in generalization bounds.
method Establishes in-expectation first moment generalization error bounds for L2L_2-stable randomized learning algorithms and uses subbagging to achieve near-tight exponential bounds.
result Improves generalization bounds for convex and non-convex optimization problems with SGD.

New method stabilizes machine learning predictions across random seeds.

problem Machine learning predictions vary across random seeds, causing instability.
method Introduces adaptive cross-bagging to eliminate seed dependence.
result Adaptive cross-bagging achieves targeted stability in debiased machine learning.

In this article, we derive concentration inequalities for the cross-validation estimate of the generalization error for subagged estimators, both for classification and regressor. General loss functions and class of predictors with both finite and infinite VC-dimension are considered. We slightly generalize the formali…

2010-11-23abs ↗pdf ↗

Stacking is a general approach for combining multiple models toward greater predictive accuracy. It has found various application across different domains, ensuing from its meta-learning nature. Our understanding, nevertheless, on how and why stacking works remains intuitive and lacking in theoretical insight. In this …

2019-01-26abs ↗pdf ↗

New unbiased variance estimator for random forests using Hoeffding decomposition.

problem Uncertainty quantification in random forests with large kernel sizes and small sample sizes.
method Proposes a new Hoeffding decomposition view for variance estimation, establishing unbiased estimators and ratio consistency.
result Establishes the ratio consistency of the proposed variance estimator, justifying confidence interval coverage rates.

Bagging reduces variance in LID estimation by preserving local distribution of NN distances.

problem High estimation variance from limited data in small neighborhoods.
method Subbagging to preserve local distribution of NN distances, combined with ensemble size.
result Bagging significantly reduces variance and MSE in LID estimation.