Algorithmic stability implies training-conditional coverage for distribution-free prediction methods
From MaRDI portal
Cites work
- 10.1162/153244302760200704
- A comparison of some conformal quantile regression methods
- A finite sample distribution-free performance bound for local discrimination rules
- Algorithmic stability implies training-conditional coverage for distribution-free prediction methods
- Analyzing bagging
- Bagging equalizes influence
- Bagging predictors
- Black-box tests for algorithmic stability
- Conditional predictive inference for stable algorithms
- Conditional validity of inductive conformal predictors
- Cross-conformal predictors
- Distribution-free inequalities for the deleted and holdout error estimates
- Distribution-free performance bounds for potential function rules
- Distribution-free predictive inference for regression
- scientific article; zbMATH DE number 2168212 (Why is no real title available?)
- scientific article; zbMATH DE number 1931847 (Why is no real title available?)
- Max-information, differential privacy, and post-selection hypothesis testing
- Post-selection inference via algorithmic stability
- Predictive inference with the jackknife+
- Preserving statistical validity in adaptive data analysis (extended abstract)
- Random forests
- Stability of randomized learning algorithms
- Stability selection. With discussion and authors' reply
- Training-conditional coverage for distribution-free predictive inference
- Variable Selection with Error Control: Another Look at Stability Selection
Cited in
(1)
This page was built for publication: Algorithmic stability implies training-conditional coverage for distribution-free prediction methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926375)
