:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Devale, Tanmay, Devulapalli, Pramith, Hanneke, Steve
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2510.21506
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Dimension of Self-Directed Learning
by: Devulapalli, Pramith, et al.
Published: (2024)

Learning from Snapshots of Discrete and Continuous Data Streams
by: Devulapalli, Pramith, et al.
Published: (2024)

Glivenko-Cantelli for $f$-divergence
by: Wang, Haoming, et al.
Published: (2025)

The Empirical Mean is Minimax Optimal for Local Glivenko-Cantelli
by: Cohen, Doron, et al.
Published: (2024)

List Sample Compression and Uniform Convergence
by: Hanneke, Steve, et al.
Published: (2024)

Glivenko-Cantelli classes and NIP formulas
by: Khanaki, Karim
Published: (2021)

Tight Bounds for Local Glivenko-Cantelli
by: Blanchard, Moïse, et al.
Published: (2023)

Universal rates of ERM for agnostic learning
by: Hanneke, Steve, et al.
Published: (2025)

A Theory of Optimistically Universal Online Learnability for General Concept Classes
by: Hanneke, Steve, et al.
Published: (2025)

On Characterizing Learnability for Adversarial Noisy Bandits
by: Hanneke, Steve, et al.
Published: (2026)

Universal Multiclass Transductive Online Learning
by: Hanneke, Steve, et al.
Published: (2026)

Universal Rates of Empirical Risk Minimization
by: Hanneke, Steve, et al.
Published: (2024)

Adversarially Robust PAC Learnability of Real-Valued Functions
by: Attias, Idan, et al.
Published: (2022)

When More Data Doesn't Help: Limits of Adaptation in Multitask Learning
by: Hanneke, Steve, et al.
Published: (2026)

A Complete Characterization of Learnability for Stochastic Noisy Bandits
by: Hanneke, Steve, et al.
Published: (2024)

A Theory of Universal Agnostic Learning
by: Hanneke, Steve, et al.
Published: (2026)

Adaptive Sample Aggregation In Transfer Learning
by: Hanneke, Steve, et al.
Published: (2024)

Sample Compression Scheme Reductions
by: Attias, Idan, et al.
Published: (2024)

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
by: Attias, Idan, et al.
Published: (2026)

Sample Complexity of Autoregressive Reasoning: Chain-of-Thought vs. End-to-End
by: Hanneke, Steve, et al.
Published: (2026)

A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
by: Attias, Idan, et al.
Published: (2022)

Efficient Agnostic Learning with Average Smoothness
by: Hanneke, Steve, et al.
Published: (2023)

Constrained Policy Optimization with Cantelli-Bounded Value-at-Risk
by: Tangri, Rohan, et al.
Published: (2026)

Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
by: Attias, Idan, et al.
Published: (2025)

Data Selection for ERMs
by: Hanneke, Steve, et al.
Published: (2025)

On Union-Closedness of Language Generation
by: Hanneke, Steve, et al.
Published: (2025)

Proofs as Explanations: Short Certificates for Reliable Predictions
by: Blum, Avrim, et al.
Published: (2025)

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
by: Filmus, Yuval, et al.
Published: (2023)

On the ERM Principle in Meta-Learning
by: Alon, Yannay, et al.
Published: (2024)

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs
by: Filmus, Yuval, et al.
Published: (2024)

Multiclass Transductive Online Learning
by: Hanneke, Steve, et al.
Published: (2024)

Optimal Mistake Bounds for Transductive Online Learning
by: Chase, Zachary, et al.
Published: (2025)

An Optimal Sauer Lemma Over $k$-ary Alphabets
by: Hanneke, Steve, et al.
Published: (2026)

A Donsker and Glivenko‐Cantelli theorem for random measures linked to extreme value theory
by: B. Bobbia, et al.
Published: (2025)

Revisiting Agnostic PAC Learning
by: Hanneke, Steve, et al.
Published: (2024)

Private List Learnability vs. Online List Learnability
by: Hanneke, Steve, et al.
Published: (2025)

Adversarial Resilience in Sequential Prediction via Abstention
by: Goel, Surbhi, et al.
Published: (2023)

Agnostic Sample Compression Schemes for Regression
by: Attias, Idan, et al.
Published: (2018)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
by: Hanneke, Steve, et al.
Published: (2026)

Optimal Learners for Realizable Regression: PAC Learning and Online Learning
by: Attias, Idan, et al.
Published: (2023)