Cover Image

A Theory of Optimistically Universal Online Learnability for General Concept Classes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hanneke, Steve, Wang, Hongao
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

What is Learnable in Valiant's Theory of the Learnable?
by: Hanneke, Steve, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

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

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
by: Yan, Yu-Hu, et al.
Published: (2025)

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)

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

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

Optimistic Critic Reconstruction and Constrained Fine-Tuning for General Offline-to-Online RL
by: Luo, Qin-Wen, et al.
Published: (2024)

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

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

Uniform Convergence Beyond Glivenko-Cantelli
by: Devale, Tanmay, et al.
Published: (2025)

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

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

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

Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem
by: Fioravanti, Simone, et al.
Published: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)

On the Learnability of Distribution Classes with Adaptive Adversaries
by: Lechner, Tosca, et al.
Published: (2025)

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

Optimistic Online Non-stochastic Control via FTRL
by: Mhaisen, Naram, et al.
Published: (2024)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

Not All Learnable Distribution Classes are Privately Learnable
by: Bun, Mark, et al.
Published: (2024)

VFOG: Variance-Reduced Fast Optimistic Gradient Methods for a Class of Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Optimistic Online LQR via Intrinsic Rewards
by: Bartos, Marcell, et al.
Published: (2026)

A Combinatorial Characterization of Supervised Online Learnability
by: Raman, Vinod, et al.
Published: (2023)

Data Selection for ERMs
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)