arXiv Machine Learning
Jul 8
Boosting with List-Decodable Codes
arXiv:2607. 05791v1 Announce Type: cross Abstract: Boosting is a fundamental technique for generically improving the accuracy of learning algorithms (Schapire 1989).
Defensive Boosting for Online Probabilistic Forecasting
arXiv:2608. 13554v1 Announce Type: new Abstract: We study online probabilistic forecasting of binary outcomes chosen by an adaptive adversary.
Related stories
arXiv Machine Learning
Jun 2
Towards Optimal Robustness in Learning-Augmented Paging
arXiv:2606. 01342v1 Announce Type: cross Abstract: Learning-augmented paging has been extensively studied in recent years.
arXiv Machine Learning
Jul 9
PB-OEL: A Performance-Bounded Online Ensemble Learning Framework With Mixed Feedback for Real-Time Safety Assessment
arXiv:2503. 15581v2 Announce Type: replace Abstract: Real-time safety assessment is critical for ensuring the reliable operation of complex dynamic systems.
arXiv Machine Learning
Sep 1
Adversarial Online Classification with a Preview
arXiv:2608. 29503v1 Announce Type: new Abstract: Worst-case online classification is governed by sequential complexity, such as Littlestone dimension, and can be impossible even for statistically simple classes, such as thresholds of VC dimension one.
arXiv Machine Learning
Jun 17
On Randomized Algorithms in Online Strategic Classification
arXiv:2602. 06257v2 Announce Type: replace Abstract: Online strategic classification studies settings in which agents strategically modify their features to obtain favorable predictions.
arXiv AI
Sep 1
Learning Dynamics of Logits Debiasing for Long-Tailed Semi-Supervised Learning
arXiv:2608.30699v1 Announce Type: cross Abstract: Long-tailed distributions are prevalent in real-world semi-supervised learning (SSL), where pseudo-labels tend to favor majority classes, leading to...
arXiv Machine Learning
Jul 2
Verifiable Rewards for Calibrated Probabilistic Forecasting
arXiv:2607. 00164v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards can in principle train calibrated probabilistic forecasters, since a proper scoring rule such as the Brier score is computed from outcomes alone and is minimized in expectation by the true probability.
arXiv Machine Learning
Aug 11
ReliableNet: A Chance-Constrained Approach to Trustworthy Classification in Deep Learning
arXiv:2608. 09768v1 Announce Type: new Abstract: A prediction that is both confident and wrong is a critical reliability failure because it can bypass abstention and human review precisely when the model is mistaken.
arXiv Machine Learning
Jul 16
Parallel gradient boosting for flexible estimation of conditional distributions
arXiv:2607. 13550v1 Announce Type: cross Abstract: Boosting is one of the most successful learning techniques for standard classification and regression tasks.
arXiv Machine Learning
Jul 20
ADS-C: Antidistillation Sampling for Classification
arXiv:2607. 15467v1 Announce Type: new Abstract: Knowledge distillation enables an adversary to replicate a proprietary classifier by querying its prediction interface and training a surrogate on the returned probability vectors.
arXiv Machine Learning
Aug 14
Bagging Robustly Learns VC Classes with Linear Sample Complexity
arXiv:2608. 13514v1 Announce Type: cross Abstract: We revisit the problem of learning predictors robust to adversarial examples at test-time.
arXiv Machine Learning
Aug 12
Optimized Sequential Testing for Binary Ensemble Classifiers
arXiv:2606. 15237v1 Announce Type: cross Abstract: Ensemble classifiers are predictive models that combine the results of simpler base models, often by majority vote.