arXiv Machine Learning
Deterministic Bounds on Accuracy and Stability of Metric-Space Regression and Classification
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 7
Distribution-free Deviation Bounds and The Role of Domain Knowledge in Learning via Model Selection with Cross-validation Risk Estimation
arXiv:2303. 08777v3 Announce Type: replace-cross Abstract: Cross-validation is one of the most widely used tools for risk estimation and model selection in statistics and machine learning, yet its theoretical properties when embedded in a learning procedure remain insufficiently understood.
arXiv Machine Learning
Aug 4
Nonparametric Distribution Regression Re-calibration
arXiv:2602. 13362v2 Announce Type: replace-cross Abstract: A key challenge in probabilistic regression is ensuring that predictive distributions accurately reflect true empirical uncertainty.
arXiv Machine Learning
Oct 16
Computational and Statistical Hardness of Calibration Distance
The paper investigates the computational and statistical challenges of the calibration distance, a key metric for measuring miscalibration in probabilistic predictors. It presents an efficient algorithm for exact computation when the distribution has a uniform marginal and noiseless labels, and shows that the problem becomes NP‑hard if either assumption is dropped. The authors also provide a polynomial‑time approximation scheme for the general case and establish tight sample complexity bounds for estimating the calibration distance from data.
arXiv Machine Learning
Jun 11
PCS-UQ: Uncertainty Quantification via the Predictability-Computability-Stability Framework
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 Machine Learning
6d ago
On the tradeoff between robustness and geometric accuracy in adversarial training
arXiv:2610. 22955v1 Announce Type: new Abstract: For non-parametric binary classification in the presence of an adversary, we prove an optimal quantitative estimate for adversarial classifiers controlling geometric accuracy, as measured by the Hausdorff distance to the Bayes classifier, in terms or their robustness, as encoded by the adversarial budget $\varepsilon$.
arXiv Machine Learning
Jun 8
MIST: Mutual Information Estimation Via Supervised Training
arXiv:2511. 18945v4 Announce Type: replace Abstract: We propose a fully data-driven approach to designing mutual information (MI) estimators.