REVIEW 3 cited by
Stability via resampling: statistical problems beyond the real line
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Model averaging techniques based on resampling methods (such as bootstrapping or subsampling) have been utilized across many areas of statistics, often with the explicit goal of promoting stability in the resulting output. We provide a general, finite-sample theoretical result guaranteeing the stability of bagging when applied to algorithms that return outputs in a general space, so that the output is not necessarily a real-valued -- for example, an algorithm that estimates a vector of weights or a density function. We empirically assess the stability of bagging on synthetic and real-world data for a range of problem settings, including causal inference, nonparametric regression, and Bayesian model selection.
Forward citations
Cited by 3 Pith papers
-
Model-free Methods for Event History Analysis and Efficient Adjustment (PhD Thesis)
The thesis introduces the Local Covariance Measure test for conditional local independence, the Debiased Outcome-adapted Propensity Estimator for efficient covariate adjustment, and the Aalen Covariance Measure for as...
-
Feature Bagging Provides Stability
Feature bagging provably reduces feature instability relative to non-bagged learners, with larger gains under aggressive feature subsampling and modest ensemble size.
-
Assumption-free stability for ranking problems
Inflated top-k and inflated full ranking provide assumption-free leave-one-out stability for ranking, with provably minimal ambiguity in the returned set.
Discussion (0). Continue with ORCID to comment.