Data thinning for convolution-closed distributions
Not on the map. Why?
Abstract (arXiv)
We propose data thinning, an approach for splitting an observation into two or more independent parts that sum to the original observation, and that follow the same distribution as the original observation, up to a (known) scaling of a parameter. This very general proposal is applicable to any convolution-closed distribution, a class that includes the Gaussian, Poisson, negative binomial, gamma, and binomial distributions, among others. Data thinning has a number of applications to model selection, evaluation, and inference. For instance, cross-validation via data thinning provides an attractive alternative to the usual approach of cross-validation via sample splitting, especially in settings in which the latter is not applicable. In simulations and in an application to single-cell RNA-sequencing data, we show that data thinning can be used to validate the results of unsupervised learning approaches, such as k-means clustering and principal components analysis, for which traditional sample splitting is unattractive or unavailable.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 8 of its 47 references that are in the map. First posted on arXiv 18 Jan 2023.
Builds on
8 of 47 references.
References · 8
- 2014Optimal Inference After Model Selectioncited by 63
- 2020Selective Inference for Hierarchical Clusteringcited by 37
- 2021Splitting strategies for post-selection inferencecited by 14
- 2021Data fission: splitting a single data pointcited by 13
- 2017Estimating the number of clusters using cross-validationcited by 6
- 2021Estimating Graph Dimension with Cross-validated Eigenvaluescited by 6
- 2021Unbiased Risk Estimation in the Normal Means Problem via Coupled Bootstrap Techniquescited by 6
- 2022Inference after latent variable estimation for single-cell RNA sequencing datacited by 3
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 6; 2026: 2.
12 papers.
- 2023Generalized Data Thinning Using Sufficient Statisticscited by 7
- 2023Interpretable Machine Learning for Discovery: Statistical Challenges & Opportunitiescited by 7
- 2024A Flexible Defense Against the Winner's Cursecited by 6
- 2024Decomposing Gaussians with Unknown Covariancecited by 2
- 2025Thinning a Wishart Random Matrixcited by 0
- 2025LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networkscited by 0
- 2025Flexible Selective Inference with Flow-based Transport Mapscited by 0
- 2025Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detectioncited by 0
- 2025Rate doubly robust estimation for weighted average treatment effectscited by 0
- 2025Integrating RCTs, RWD, AI/ML and Statistics: Next-Generation Evidence Synthesiscited by 0
- 2026Testing hypotheses via orthogonalizationcited by 0
- 2026Physics-Driven Independent Pair Generation for Iterative Self-Supervised Low-Dose CT Denoisingcited by 0
- 2026Physics-Driven Independent Pair Generation for Iterative Self-Supervised Low-Dose CT Denoising1 Sep 2026
- 2026Testing hypotheses via orthogonalization29 Jun 2026
- 2025Integrating RCTs, RWD, AI/ML and Statistics: Next-Generation Evidence Synthesis24 Nov 2025
- 2025Rate doubly robust estimation for weighted average treatment effects18 Sep 2025
- 2025Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detection12 Jul 2025
- 2025Flexible Selective Inference with Flow-based Transport Maps1 Jun 2025
- 2025LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networks20 May 2025
- 2025Thinning a Wishart Random Matrix14 Feb 2025
- 2024A Flexible Defense Against the Winner's Curse27 Nov 2024
- 2024Decomposing Gaussians with Unknown Covariance17 Sep 2024
- 2023Interpretable Machine Learning for Discovery: Statistical Challenges & Opportunities2 Aug 2023
- 2023Generalized Data Thinning Using Sufficient Statistics22 Mar 2023