We propose the data augmented bootstrap (DAB), a framework for constructing confidence intervals from approximately invariant transformations of the data. As special cases, DAB recovers popular methods that rely on exact group symmetries, such as conformal prediction, wild bootstrap for Maximum Mean Discrepancy U-statistics and the recently proposed SymmPI.
arXiv:2606. 09049v1 Announce Type: cross Abstract: We propose the data augmented bootstrap (DAB), a framework for constructing confidence intervals from approximately invariant transformations of the data.
arXiv:2606. 24418v1 Announce Type: new Abstract: Data augmentation is a simple and model-agnostic approach for exploiting known invariances in learning problems.
arXiv:2505. 08784v2 Announce Type: replace-cross Abstract: As machine learning (ML) enters high-stakes domains, trustworthy uncertainty quantification (UQ) is essential for safety.
arXiv:2606. 31915v1 Announce Type: cross Abstract: While conformal prediction provides a general framework for uncertainty quantification in predictive inference, its application is often limited by computational cost.
arXiv:2604.22391v2 Announce Type: replace-cross Abstract: The Super Learner (SL) is a widely used ensemble method that combines point predictions from a library of learners based on their predictive...
The paper investigates sparse data augmentation for nonconvex optimization in geometric machine learning. It shows that using a small, fixed sample of transformations—obtained before optimization—allows gradient descent to achieve an ε‑stationary point of the fully augmented objective with ≤ O((log|G|+log(1/δ))/ε²) transformation queries. This is more efficient than both full augmentation and standard group‑SGD, which require O(1/ε⁴) queries.
arXiv:2602. 01733v3 Announce Type: replace-cross Abstract: Conformal Prediction (CP) provides a statistical framework for uncertainty quantification that constructs prediction sets with coverage guarantees.
arXiv:2609.08133v1 Announce Type: cross Abstract: In nonconvex optimization problems arising in geometric machine learning, data augmentation is commonly used to promote invariance by averaging empir...
The paper introduces a unified framework for dataset condensation (DC) that generalizes existing methods by using discrepancy measures to quantify the distance between probability distributions. It extends the traditional goal of DC—creating a small synthetic dataset that preserves generalization—to include additional objectives such as robustness and privacy. The framework positions DC as a formal approximation problem, broadening its applicability across different machine learning regimes.
arXiv:2606. 27269v1 Announce Type: cross Abstract: Reliably quantifying predictive uncertainty is difficult for complex, high-dimensional, or misspecified models.
arXiv:2603.23923v2 Announce Type: replace-cross Abstract: Predictive inference is a fundamental task in statistics, traditionally addressed using parametric assumptions about the data distribution an...
arXiv:2601. 21455v2 Announce Type: replace-cross Abstract: Conformal prediction(CP) has become a cornerstone of distribution-free uncertainty quantification, conventionally evaluated by its coverage and interval length.