Pith. sign in

REVIEW 3 major objections 5 minor 114 references

Feature Bagging Provides Stability

T0 review · 3 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Feature bagging provably stabilizes predictions against feature removal.

desk verdict FI and the peeling/pith recursion are real contributions, but the random-forest guarantee is proven only for dyadic midpoint splits—the abstract overstates, and it deserves review with that fix. read the letter →

arxiv 2607.26964 v2 pith:HRNEEYOP submitted 2026-07-29 stat.ML cs.LGmath.STstat.TH

Yuheng Ma , Qiang Sun This is my paper · ORCID
classification stat.MLcs.LGmath.STstat.TH
keywords featureinstabilitybaggingalgorithmicstabilityrandomforestsforwardselectionleave-one-feature-outrecursivesubsampling
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper argues that feature bagging—training an ensemble on random subsets of features and averaging—reliably reduces an algorithm's sensitivity to losing any single feature, a quantity it names feature instability (FI). In a linear-regression model it derives exact asymptotic formulas showing how bagging shrinks both instance and feature instability and how the gains depend on the instance and feature subsampling ratios. Outside parametric models, it proves bounds for recursive feature subsampling in random forward selection and a simplified dyadic random forest, with the average leave-one-feature-out change controlled by the feature-subsampling ratio q. More aggressive subsampling yields stronger guarantees, and a modest number of bagging rounds approaches the infinite-bagging stability level. Experiments indicate FI carries generalization-relevant signal that instance instability misses.

What carries the argument

Feature instability (FI), the leave-one-feature-out average of squared prediction changes, together with the feature-subsampling ratio q and averaging over resampled feature sets. The recursive results are carried by a one-step condition—the propagated feature-removal discrepancy may grow by at most a factor 1+δ_t per step—plus a peeling recurrence (Proposition 4.4) and a Hilbert-space radius bound. In the linear-model part, an affected-axis resampling coupling and sketching matrices allow exact asymptotic moment calculations.

What would settle it

Measure the leave-one-feature-out prediction change for a standard random forest with data-dependent thresholds on correlated features while decreasing q; if FI increases as q decreases, or exceeds q A_T^2/((d-1)(1-q)) at shallow depth T, the recursive stability claim fails for real forests. More directly, estimate the ratio ||E[S^{-j}_ξ(w)-S^{-j}_ξ(w^{-j})]|| / ||E[Δ]|| across splits; values above 1+√2 would refute the dyadic contraction condition.

Watch

Extended reading notes

Core claim

The paper's central claim is that feature bagging—averaging learners trained on randomly subsampled feature sets—is provably less sensitive to single-feature removal than the same algorithm without feature bagging. In the linear model, Theorem 3.1 gives an exact large-B decomposition of FI and II, with the bagged instability falling to order 1/n away from the interpolation threshold. In the model-free setting, Theorem 4.5 bounds the feature instability of random forward selection by T^2/(d-1) · q/(1-q) when T ≲ 1/q, compared with a non-bagged value of 2T/d, so bagging wins whenever T ≲ (1-q)/q. Theorem 4.7 extends the bound to a dyadic max-edge random forest with factor q A_T^2/((d-1)(1-q)).

Load-bearing premise

The recursive guarantees rest on a one-step condition—after removing one feature the expected discrepancy between full and reduced runs may grow by at most a factor 1+δ_t each step—which is verified for orthogonal-design random forward selection and dyadic max-edge forests, but not for standard random forests with data-dependent thresholds or correlated features.

Editorial extensions

If this is right

  • Smaller feature-subsampling ratios q produce strictly stronger FI guarantees in the analyzed regimes.
  • Finite bagging with B proportional to d(1-q)/q already matches the infinite-bagging stability bound up to an O(1/B) term.
  • Feature instability and instance instability carry complementary generalization information, so stability reports should track both axes.
  • In the shallow-recursion regime (T ≲ (1-q)/q), feature-bagged random forward selection and dyadic random forests beat their non-bagged counterparts on FI.
  • In linear regression, bagging flattens the double-descent instability peak of single subsampled estimators.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • One could treat feature bagging as an explicit stability-regularization knob for tree ensembles, choosing q by the desired tolerance for feature-removal sensitivity—an implication the paper motivates but does not develop into a tuning rule.
  • The dyadic-forest bound likely extends to standard CART only if the one-step condition (4.3) holds for data-dependent split thresholds; a direct check of that condition on real random forests would settle how far the guarantee reaches.
  • Because FI scales with 1/(d-1) and q/(1-q), the stability effect should be largest in wide-but-shallow settings (large d, small q, small T); experiments on tabular data with d ≫ n could expose where the bound is tight.
  • The complementarity of FI and II suggests a two-axis stability diagnostic that could be computed alongside model selection, though the paper stops short of recommending a specific procedure.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces feature instability (FI), a leave-one-feature-out analogue of instance instability, and studies whether feature bagging improves stability along the feature axis. In the parametric setting (Section 3), the authors analyze bagged minimum-norm least squares under proportional asymptotics and give an exact decomposition of FI and II into variance and signal terms with closed-form limits (Theorem 3.1 and Table 1). In the model-free setting (Section 4), they propose a recursive stochastic-process framework with a one-step pith condition (4.3), apply it to randomized forward selection and a dyadic midpoint-split random forest, and give finite-bagging concentration bounds (Proposition 4.8). The paper also reports experiments suggesting that FI carries generalization-relevant information complementary to II.

Significance. If the results hold as stated, the linear-model exact asymptotics are a genuine contribution: they provide parameter-free closed forms for the effect of instance/feature subsampling and bagging on both stability axes, and the finite-B decomposition cleanly separates same-submodel and cross-submodel contributions. The model-free framework is also conceptually useful and yields the first feature-side analogue of the assumption-free instance-bagging stability results. The empirical finding that FI is complementary to II is plausible and well supported by the bootstrap/R2 noise-control checks described in the appendix. However, the model-free results are proven only for substantially simplified algorithms, and the paper's abstract and introduction overstate the scope by saying the theory applies to random forests without qualification. The central claims are defensible for the analyzed simplifications, but the manuscript needs to either extend the proofs or carefully re-scope the claims.

major comments (3)
  1. [§4.2.2, Theorem 4.7 and Proposition 4.6] The random-forest guarantee is stated for the 'max-edge dyadic randomized forest' with fixed midpoint splits, but the abstract and introduction claim the theory applies to random forests. The proof of δ_t=√2 and the affine encoding K(w) both rely essentially on the simplification that thresholds are deterministic midpoints, so the local cell containing x is a function only of the split-count matrix w. In a standard CART split, thresholds are data-dependent; removing a feature can change thresholds on other features, the partition is no longer encoded by w alone, and the affine map K(w) of Proposition 4.6 does not hold. Unless condition (4.3) is verified for CART-type splits, all random-forest claims should be explicitly restricted to the dyadic midpoint-split setting.
  2. [§4.2.1, Theorem 4.5] Theorem 4.5 is stated for Algorithm 1 without any design assumption, but the proof uses the orthogonal design X⊤X=nI_d. In particular, the residual-sum-of-squares decrease formula (S.8), the score-ordering argument, and the structural 'auxiliary fact' about D_t^j all depend on this assumption. For correlated designs, the one-step condition (4.3) is not established. The orthogonal-design condition needs to appear in the theorem statement, or the proof must be extended to general designs.
  3. [§4.2.2, Theorem 4.7] The bound (4.7) depends on A_T^2 with A_T = ∑_{t=1}^T (1+√2)^{T−t}, which grows exponentially in T. The text compares this with the non-bagged baseline 2T/d only through the informal phrase 'for shallow trees and sufficiently small q'. As written, no explicit regime is given in which the right-hand side of (4.7) is smaller than 2T/d. The paper should state a concrete depth/regime condition (for example T=O(log d) and q below some threshold) under which the claimed strict improvement is guaranteed.
minor comments (5)
  1. [Eqs. (1.1) and (1.2)] The displayed informal instability quantities are missing the square on the difference; as written the expressions are not squared deviations.
  2. [Appendix S.2.2, after Lemma S.2.4] The sentence 'The assumption ET[U1^T U1] = ... appears less natural, but is important...' appears to be a dangling editorial note. It should be moved into the lemma statement or removed.
  3. [Notation, Section 3] Using the superscript B for the signal/bias terms while B also denotes the number of bagging rounds is confusing even with the inline caveat. Consider renaming the bias terms (e.g., Δ^sig or Δ^μ).
  4. [§4.2.1 and §4.3] Theorem 4.5 uses the regime T≲q^{-1}, while the prose comparison with the non-bagged baseline uses T≲(1−q)/q. These are different conditions; the relation should be stated precisely.
  5. [Appendix S.3.3] The proof of Proposition 4.4 is only one sentence ('recursively applying equation (S.7) and Proposition 4.3'). Since this proposition is the backbone of Section 4, the recursive derivation and the handling of the sup terms in M_T should be expanded.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the stability bounds are derived from explicit conditions and random-matrix/recursion arguments; self-citations are not load-bearing and no fitted quantity is relabeled as a prediction.

full rationale

The paper’s derivation chain is self-contained. Section 3 obtains exact asymptotic II/FI formulas for bagged least squares from Gaussian random-matrix lemmas (S.2.3–S.2.6); the closed-form limits in Table 1 are compared with simulations, not fitted from them. Section 4 is conditional: Proposition 4.4 converts the one-step pith condition (4.3) into the recursive FI bound (4.4) by a peeling recurrence, and Theorems 4.5 and 4.7 verify (4.3) directly for random forward selection and for the max-edge dyadic forest using new structural facts (pathwise difference support, column leakage, increment bounds). Proposition 4.1/4.3 is proved by an explicit covariance calculation and is only described as the feature-side analogue of Soloff et al.; it does not depend on that citation for validity. The reformulation of bagged least squares as sketched least squares, credited to Wu and Sun (2025), is a modeling equivalence, and the appendix supplies an independent asymptotic derivation, so that self-citation is not load-bearing. The explicit restriction to dyadic midpoint splits in Section 4.2.2 is a scope limitation for standard CART random forests, not a circularity: the theorem is honestly conditioned on that simplified algorithm. No equation reduces by construction to the claimed stability improvement, and no fitted parameter is renamed as a prediction.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The paper introduces no new free parameters fitted to data: q, p, γ, B, M, and rad(W) are design/input parameters, not inferred. No new physical entities are postulated; FI, pith/peel, and the tree encoding w_t are analytic constructs. The axioms listed are the load-bearing assumptions; the most fragile is the one-step propagation condition (4.3) and the dyadic/orthogonal simplifications.

assumptions (6)
  • domain assumption Gaussian linear model: x ~ N(0,I), β* ~ N(0,I/d), ε ~ N(0,σ^2), proportional asymptotics d/n -> γ
    Used throughout Section 3 to obtain exact closed-form asymptotics (Theorem 3.1).
  • domain assumption Universality: Gaussian assumptions can be relaxed to bounded moment conditions
    Stated in Section 3.1 without proof; leans on prior work (Hastie et al., Chen et al., Wu and Sun).
  • domain assumption Bounded output range or finite Hilbert-space radius (Assumption 1)
    Needed for Propositions 4.1, 4.3, 4.4 and 4.8; all algorithms with bounded outputs qualify.
  • ad hoc to paper One-step propagation condition (4.3)
    The entire recursive peeling bound depends on this Lipschitz-type condition; it is verified case-by-case for the two studied algorithms, not shown in general.
  • domain assumption Orthogonal design X^T X = n I_d in random forward selection
    Reduces selection to ranking by marginal score (Eq. S.8); without it the selection-path argument does not go through.
  • domain assumption Dyadic midpoint splits and max-edge rule for random forests
    Simplifies the tree partition to a feature-count encoding; real CART thresholds are data-dependent and not covered by the theorems.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Feature Bagging Provides Stability." pith.science (2026). https://pith.science/paper/HRNEEYOP

@misc{pith2026260726964,
  author       = {Pith},
  title        = {Pith review of: Feature Bagging Provides Stability},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HRNEEYOP}},
  note         = {Machine review of arXiv:2607.26964}
}
read the original abstract

We study feature bagging through the lens of algorithmic stability. Feature bagging is an ensemble strategy that aggregates base learners trained on randomly subsampled feature subsets, possibly in a data-dependent manner. We introduce feature instability (FI), the feature-axis analogue of instance instability (II), which measures sensitivity to removing a single feature. Smaller values of II or FI correspond to stronger stability, and our experiments show that FI captures generalization-relevant information complementary to II. Within this framework, we analyze feature bagging in both a parametric linear model and a model-free setting inspired by recursive feature subsampling in random forests. In both settings, we establish formal guarantees showing that feature bagging improves the relevant stability relative to its non-bagged counterpart, with larger improvements under more aggressive subsampling. We further show that a modest number of bagging rounds is sufficient to approach the infinite-bagging stability level.

Figures

Figures reproduced from arXiv: 2607.26964 by the authors.

Figure 1
Figure 1. Illustration of subsampling and bagging schemes. In the random forest example (d), all [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Instability of the single subsampled minimum-norm OLS estimator as a function of the aspect [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Instability E[∥β − β ℓ ∥ 2 2 ] of the bagged least-squares estimator. Panels (a)–(d) use B = 200 bagging rounds and vary the aspect ratio γ; solid lines denote theoretical predictions, crosses mark empirical averages, and dashed curves show the infinite-bagging limit. Panels (e)–(f) compare different numbers of bagging rounds on an n −1 scale; colors indicate B, solid lines denote theoretical predictions, and crosse… view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Left: Feature instability of feature-bagged random forward selection and non-bagged baseline [PITH_FULL_IMAGE:figures/full_fig_p014_4.png]
Figure 5
Figure 5. Figure 5: Two possibilities of dyadic tree partition. The black dot represents the target test sample [PITH_FULL_IMAGE:figures/full_fig_p017_5.png]
Figure 6
Figure 6. Figure 6: Comparison of feature instability across di [PITH_FULL_IMAGE:figures/full_fig_p020_6.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

114 extracted references · 67 canonical work pages

  1. [1]

    arXiv preprint arXiv:2410.18268 , year=

    Stabilizing black-box model selection with the inflated argmax , author=. arXiv preprint arXiv:2410.18268 , year=

    arXiv

  2. [2]

    2013 , Owner =

    Lq Averaging for Symmetric Positive-Definite Matrices , Author =. 2013 , Owner =

    2013

  3. [3]

    The 11th International Conference on Learning Representations , year=

    Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learning , author=. The 11th International Conference on Learning Representations , year=

  4. [4]

    Transactions on Machine Learning Research , issn=

    Sparse MoEs meet Efficient Ensembles , author=. Transactions on Machine Learning Research , issn=. 2022 , note=

    2022

  5. [5]

    Proceedings of the 26th International Conference on Artificial Intelligence and Statistics , year=

    Is interpolation benign for random forest regression? , author=. Proceedings of the 26th International Conference on Artificial Intelligence and Statistics , year=

  6. [6]

    SIAM Journal of Matrix Analysis and Applications , Year =

    Geometric Means in a Novel Vector Space Structure on Symmetric Positive-Definite Matrices , Author =. SIAM Journal of Matrix Analysis and Applications , Year =

  7. [7]

    The Annals of Statistics , volume=

    Predictive inference with the jackknife+ , author=. The Annals of Statistics , volume=. 2021 , publisher=

    2021

  8. [8]

    Large sample theory of intrinsic and extrinsic sample means on manifolds

    Bhattacharya, Rabi and Patrangenaru, Vic , Journal =. Large sample theory of intrinsic and extrinsic sample means on manifolds. 2003 , Number =. arXiv , Arxivid =:0507423 , File =

    2003

Show all 114 references
  1. [9]

    Large sample theory of intrinsic and extrinsic sample means on manifolds

    Bhattacharya, Rabi and Patrangenaru, Vic , Journal =. Large sample theory of intrinsic and extrinsic sample means on manifolds. 2005 , Number =. arXiv , Arxivid =:0507423 , File =

    2005

  2. [10]

    Rabi Bhattacharya and Lizhen Lin , Journal =. Omnibus. 2017 , Pages =

    2017

  3. [11]

    , author=

    On the Rate of Convergence of the Bagged Nearest Neighbor Estimate. , author=. Journal of Machine Learning Research , volume=

  4. [12]

    Machine Learning , volume=

    Optimal dyadic decision trees , author=. Machine Learning , volume=. 2007 , publisher=

    2007

  5. [13]

    2013 , publisher=

    Boucheron, St. 2013 , publisher=. doi:10.1093/acprof:oso/9780199535255.001.0001 , isbn=

    2013

  6. [14]

    Journal of Machine Learning Research , volume=

    Stability and generalization , author=. Journal of Machine Learning Research , volume=

  7. [15]

    Proceedings of the 33rd Conference on Learning Theory , year=

    Sharper bounds for uniformly stable algorithms , author=. Proceedings of the 33rd Conference on Learning Theory , year=

  8. [16]

    Machine Learning , volume=

    Bagging predictors , author=. Machine Learning , volume=. 1996 , publisher=

    1996

  9. [17]

    Machine Learning , volume=

    Random forests , author=. Machine Learning , volume=. 2001 , publisher=

    2001

  10. [18]

    and Olshen, Richard A

    Breiman, Leo and Friedman, Jerome H. and Olshen, Richard A. and Stone, Charles J. , series=. 1984 , publisher=

    1984

  11. [19]

    Proceedings of the 40th International Conference on Machine Learning , year=

    Extrapolated Random Tree for Regression , author=. Proceedings of the 40th International Conference on Machine Learning , year=

  12. [20]

    The Annals of Statistics , volume=

    Transfer learning for contextual multi-armed bandits , author=. The Annals of Statistics , volume=. 2024 , publisher=

    2024

  13. [21]

    Bagged Regularized

    Cai, Yuchao and Yang, Hanfang and Ma, Yuheng and Hang, Hanyuan , journal=. Bagged Regularized

  14. [22]

    Journal of Applied Statistics , volume=

    Handling high-dimensional data with missing values by modern machine learning techniques , author=. Journal of Applied Statistics , volume=. 2023 , publisher=

    2023

  15. [23]

    Proceedings of the 40th International Conference on Machine Learning , year=

    Sketched ridgeless linear regression: The role of downsampling , author=. Proceedings of the 40th International Conference on Machine Learning , year=

  16. [24]

    2025 , eprint=

    Revisiting Randomization in Greedy Model Search , author=. 2025 , eprint=

    2025

  17. [25]

    , booktitle=

    Cheng, Guang and Ho, Jeffrey and Salehian, Hesamoddin and Vemuri, Baba C. , booktitle=. Recursive computation of the. 2016 , publisher=. doi:10.1007/978-3-319-22957-7_2 , isbn=

    2016 doi

  18. [26]

    2003 , publisher=

    Chikuse, Yasuko , series=. 2003 , publisher=

    2003

  19. [27]

    Journal of Machine Learning Research , volume=

    Dropout Regularization Versus l2-Penalization in the Linear Model , author=. Journal of Machine Learning Research , volume=

  20. [28]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , Year =

    Regression models on Riemannian symmetric spaces , Author =. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , Year =

  21. [29]

    Advances in Neural Information Processing Systems , year=

    A u-turn on double descent: Rethinking parameter counting in statistical learning , author=. Advances in Neural Information Processing Systems , year=

  22. [30]

    Why do random forests work?

    Curth, Alicia and Jeffares, Alan and van der Schaar, Mihaela , journal=. Why do random forests work?

  23. [31]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Moving beyond population variable importance: concept, theory and applications of individual variable importance , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

  24. [32]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    A Fourier approach to nonparametric deconvolution of a density estimate , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 1993 , publisher=

    1993

  25. [33]

    ESAIM: Probability and Statistics , volume=

    Impact of subsampling and tree depth on random forests , author=. ESAIM: Probability and Statistics , volume=. 2018 , publisher=

    2018

  26. [34]

    Journal of Machine Learning Research , volume=

    Stability of randomized learning algorithms , author=. Journal of Machine Learning Research , volume=

  27. [35]

    Journal of the American Statistical Association , volume=

    Variable selection via nonconcave penalized likelihood and its oracle properties , author=. Journal of the American Statistical Association , volume=. 2001 , publisher=

    2001

  28. [36]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Sure independence screening for ultrahigh dimensional feature space , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2008 , publisher=

    2008

  29. [37]

    Advances in Neural Information Processing Systems , year=

    Generalization bounds for uniformly stable algorithms , author=. Advances in Neural Information Processing Systems , year=

  30. [38]

    Proceedings of the 32nd Conference on Learning Theory , year=

    High probability generalization bounds for uniformly stable algorithms with nearly optimal rate , author=. Proceedings of the 32nd Conference on Learning Theory , year=

  31. [39]

    Thomas Fletcher , Journal =

    P. Thomas Fletcher , Journal =. Geodesic Regression and the Theory of Least Squares on. 2013 , Number =

    2013

  32. [40]

    The Annals of Statistics , volume=

    Multivariate adaptive regression splines , author=. The Annals of Statistics , volume=. 1991 , publisher=

    1991

  33. [41]

    2016 , Owner =

    Notes on Differential Geometry and Lie Groups , Author =. 2016 , Owner =

    2016

  34. [42]

    Artificial Intelligence , volume=

    Towards convergence rate analysis of random forests for classification , author=. Artificial Intelligence , volume=

  35. [43]

    Machine Learning , volume=

    Extremely randomized trees , author=. Machine Learning , volume=. 2006 , publisher=

    2006

  36. [44]

    2014 , publisher=

    Gradshteyn, Izrail Solomonovich and Ryzhik, Iosif Moiseevich , edition=. 2014 , publisher=

    2014

  37. [45]

    Journal of Multivariate Analysis , volume=

    An identity for the Wishart distribution with applications , author=. Journal of Multivariate Analysis , volume=. 1979 , publisher=

    1979

  38. [46]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=

    Neural network ensembles , author=. IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=. 1990 , publisher=

    1990

  39. [47]

    Proceedings of the 33rd International Conference on Machine Learning , year=

    Train faster, generalize better: Stability of stochastic gradient descent , author=. Proceedings of the 33rd International Conference on Machine Learning , year=

  40. [48]

    Proceedings of the 20th International Conference on Machine Learning , year=

    Online ranking/collaborative filtering using the perceptron algorithm , author=. Proceedings of the 20th International Conference on Machine Learning , year=

  41. [49]

    The Annals of Statistics , volume=

    Surprises in high-dimensional ridgeless least squares interpolation , author=. The Annals of Statistics , volume=

  42. [50]

    Journal of Business & Economic Statistics , volume =

    Haoze Hou and Wei Huang and Zheng Zhang , title =. Journal of Business & Economic Statistics , volume =

  43. [51]

    The Annals of Applied Statistics , volume=

    Weak signal inclusion under dependence and applications in genome-wide association study , author=. The Annals of Applied Statistics , volume=. 2024 , publisher=

    2024

  44. [52]

    Statistics and Computing , volume=

    Forward stability and model path selection , author=. Statistics and Computing , volume=. 2024 , publisher=

    2024

  45. [53]

    Proceedings of the 24th International Conference on Artificial Intelligence and Statistics , year=

    Sharp analysis of a simple model for random forests , author=. Proceedings of the 24th International Conference on Artificial Intelligence and Statistics , year=

  46. [54]

    Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence , year=

    Almost-everywhere algorithmic stability and generalization error , author=. Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence , year=

  47. [55]

    Advances in Neural Information Processing Systems , year=

    Simple and scalable predictive uncertainty estimation using deep ensembles , author=. Advances in Neural Information Processing Systems , year=

  48. [56]

    1995 , publisher=

    Lang, Serge , edition=. 1995 , publisher=

    1995

  49. [57]

    1999 , publisher=

    Lang, Serge , series=. 1999 , publisher=

    1999

  50. [58]

    , series=

    Lee, John M. , series=. 1997 , publisher=

    1997

  51. [59]

    , series=

    Lee, John M. , series=. 2003 , publisher=

    2003

  52. [60]

    Proceedings of the 37th International Conference on Machine Learning , year=

    Fine-grained analysis of stability and generalization for stochastic gradient descent , author=. Proceedings of the 37th International Conference on Machine Learning , year=

  53. [61]

    Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics , year=

    The implicit regularization of ordinary least squares ensembles , author=. Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics , year=

  54. [62]

    arXiv preprint arXiv:2506.02257 , year=

    Assumption-free stability for ranking problems , author=. arXiv preprint arXiv:2506.02257 , year=

    arXiv

  55. [63]

    Little, Roderick J. A. and Rubin, Donald B. , edition=. 2019 , publisher=

    2019

  56. [64]

    Proceedings of the 34th International Conference on Machine Learning , year=

    Algorithmic stability and hypothesis complexity , author=. Proceedings of the 34th International Conference on Machine Learning , year=

  57. [65]

    Less is More: Exploiting Feature Density for Enhanced Membership Inference Attacks , author=

  58. [66]

    Journal of Machine Learning Research , volume=

    Randomization can reduce both bias and variance: A case study in random forests , author=. Journal of Machine Learning Research , volume=

  59. [67]

    Advances in Neural Information Processing Systems , year=

    Decision Tree for Locally Private Estimation with Public Data , author=. Advances in Neural Information Processing Systems , year=

  60. [68]

    Journal of Machine Learning Research , volume=

    Optimal Locally Private Nonparametric Classification with Public Data , author=. Journal of Machine Learning Research , volume=

  61. [69]

    Proceedings of the 28th International Conference on Artificial Intelligence and Statistics , year=

    Locally Private Estimation with Public Features , author=. Proceedings of the 28th International Conference on Artificial Intelligence and Statistics , year=

  62. [70]

    Advances in Neural Information Processing Systems , year=

    Fast and robust least squares estimation in corrupted linear models , author=. Advances in Neural Information Processing Systems , year=

  63. [71]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Stability selection , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2010 , publisher=

    2010

  64. [72]

    Journal of Machine Learning Research , volume=

    Randomization as regularization: A degrees of freedom explanation for random forest success , author=. Journal of Machine Learning Research , volume=

  65. [73]

    Journal of Machine Learning Research , volume=

    Getting better from worse: Augmented bagging and a cautionary tale of variable importance , author=. Journal of Machine Learning Research , volume=

  66. [74]

    Linear Algebra and its Applications , Year =

    Infinite-dimensional Log-Determinant divergences between positive definite trace class operators , Author =. Linear Algebra and its Applications , Year =

  67. [75]

    Advances in Computational Mathematics , volume=

    Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization , author=. Advances in Computational Mathematics , volume=. 2006 , publisher=

    2006

  68. [76]

    James Murdoch and Chandan Singh and Karl Kumbier and Reza Abbasi-Asl and Bin Yu , title =

    W. James Murdoch and Chandan Singh and Karl Kumbier and Reza Abbasi-Asl and Bin Yu , title =. Proceedings of the National Academy of Sciences , volume =

  69. [77]

    Journal of Machine Learning Research , volume=

    On the stability of feature selection algorithms , author=. Journal of Machine Learning Research , volume=

  70. [78]

    Electronic Journal of Statistics , volume=

    The wishart and inverse wishart distributions , author=. Electronic Journal of Statistics , volume=

  71. [79]

    Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics , year=

    Online bagging and boosting , author=. Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics , year=

  72. [80]

    and Varoquaux, G

    Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V. and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P. and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E. , journal=. S...

  73. [81]

    The Annals of Statistics , number =

    Vianney Perchet and Philippe Rigollet , title =. The Annals of Statistics , number =

  74. [82]

    1995 , publisher=

    When networks disagree: Ensemble methods for hybrid neural networks , author=. 1995 , publisher=

    1995

  75. [83]

    Medical Image Understanding and Analysis , year=

    Multimodal Federated Learning with Missing Modalities Through Feature Imputation Network , author=. Medical Image Understanding and Analysis , year=

  76. [84]

    2020 , institution=

    For interpolating kernel machines, the minimum norm ERM solution is the most stable , author=. 2020 , institution=

    2020

  77. [85]

    Journal of the American Statistical Association , volume=

    Derandomizing knockoffs , author=. Journal of the American Statistical Association , volume=. 2023 , publisher=

    2023

  78. [86]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Derandomised knockoffs: leveraging e-values for false discovery rate control , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2024 , publisher=

    2024

  79. [87]

    Vemuri , Booktitle =

    Hesamoddin Salehian and Rudrasis Chakraborty and Edward Ofori and David Vaillancourt and Baba C. Vemuri , Booktitle =. An efficient recursive estimator of the Fr\'. 2015 , Owner =

    2015

  80. [88]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Variable selection with error control: another look at stability selection , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2013 , publisher=

    2013

  81. [89]

    Journal of Machine Learning Research , volume=

    Learnability, stability and uniform convergence , author=. Journal of Machine Learning Research , volume=. 2010 , publisher=

    2010

  82. [90]

    2025 , institution=

    Can Machines Learn Weak Signals? , author=. 2025 , institution=

    2025

  83. [91]

    The Annals of Mathematical Statistics , volume=

    Adjustment of an inverse matrix corresponding to changes in the elements of a given column or a given row of the original matrix , author=. The Annals of Mathematical Statistics , volume=

  84. [92]

    Landscape connectivity and dropout stability of

    Shevchenko, Alexander and Mondelli, Marco , booktitle=. Landscape connectivity and dropout stability of

  85. [93]

    Journal of Machine Learning Research , volume=

    Bagging provides assumption-free stability , author=. Journal of Machine Learning Research , volume=

  86. [94]

    Advances in Neural Information Processing Systems , year=

    Building a stable classifier with the inflated argmax , author=. Advances in Neural Information Processing Systems , year=

  87. [95]

    arXiv preprint arXiv:2405.09511 , year=

    Stability via resampling: statistical problems beyond the real line , author=. arXiv preprint arXiv:2405.09511 , year=

    arXiv

  88. [96]

    Journal of Machine Learning Research , volume=

    Dropout: a simple way to prevent neural networks from overfitting , author=. Journal of Machine Learning Research , volume=. 2014 , publisher=

    2014

  89. [97]

    Advances in Neural Information Processing Systems , year=

    Non-parametric regression between manifolds , author=. Advances in Neural Information Processing Systems , year=

  90. [98]

    SIAM Journal on Imaging Sciences , Year =

    Nonparametric Regression between General Riemannian Manifolds , Author =. SIAM Journal on Imaging Sciences , Year =

  91. [99]

    arXiv preprint arXiv:2401.11359 , year=

    The Exact Risks of Reference Panel-Based Regularized Estimators , author=. arXiv preprint arXiv:2401.11359 , year=

    arXiv

  92. [100]

    Proceedings of the Human Language Technology Conference of the

    Reducing weight undertraining in structured discriminative learning , author=. Proceedings of the Human Language Technology Conference of the

  93. [101]

    Advances in Neural Information Processing Systems , year=

    Stability of Random Forests and Coverage of Random-Forest Prediction Intervals , author=. Advances in Neural Information Processing Systems , year=

  94. [102]

    arXiv preprint arXiv:2408.12803 , year=

    Multi-Treatment Multi-Task Uplift Modeling for Enhancing User Growth , author=. arXiv preprint arXiv:2408.12803 , year=

    arXiv

  95. [103]

    Biometrics , volume=

    Nonparametric variable importance assessment using machine learning techniques , author=. Biometrics , volume=. 2021 , publisher=

    2021

  96. [104]

    Journal of the American Statistical Association , volume=

    A general framework for inference on algorithm-agnostic variable importance , author=. Journal of the American Statistical Association , volume=. 2023 , publisher=

    2023

  97. [105]

    Inverting modified matrices , author=

  98. [106]

    SIAM Journal on Mathematics of Data Science , volume=

    Ensemble linear interpolators: The role of ensembling , author=. SIAM Journal on Mathematics of Data Science , volume=

  99. [107]

    Advances in Neural Information Processing Systems , year=

    On the Algorithmic Stability of Adversarial Training , author=. Advances in Neural Information Processing Systems , year=

  100. [108]

    Available at SSRN , year=

    Adversarial Training in High-Dimensional Regression: Generated Data and Neural Networks , author=. Available at SSRN , year=

  101. [109]

    Cambridge UP, New York , year=

    Sample covariance matrices and high-dimensional data analysis , author=. Cambridge UP, New York , year=

  102. [110]

    Proceedings of the National Academy of Sciences , volume=

    Veridical data science , author=. Proceedings of the National Academy of Sciences , volume=

  103. [111]

    Advances in Neural Information Processing Systems , year=

    Neural ensemble search for uncertainty estimation and dataset shift , author=. Advances in Neural Information Processing Systems , year=

  104. [112]

    arXiv preprint arXiv:2402.11228 , year=

    Adaptive Split Balancing for Optimal Random Forest , author=. arXiv preprint arXiv:2402.11228 , year=

    arXiv

  105. [113]

    Toward Better

    Zhou, Sijia and Lei, Yunwen and Kab. Toward Better. Advances in Neural Information Processing Systems , year=

  106. [114]

    Statistical Analysis and Data Mining: The ASA Data Science Journal , volume=

    Trees, forests, chickens, and eggs: when and why to prune trees in a random forest , author=. Statistical Analysis and Data Mining: The ASA Data Science Journal , volume=. 2023 , publisher=

    2023

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.