Cover Image

Optimal Learners for Realizable Regression: PAC Learning and Online Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Attias, Idan, Hanneke, Steve, Kalavasis, Alkis, Karbasi, Amin, Velegkas, Grigoris
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Computational Landscape of Replicable Learning
by: Kalavasis, Alkis, et al.
Published: (2024)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)

On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability
by: Kalavasis, Alkis, et al.
Published: (2024)

On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse
by: Kalavasis, Alkis, et al.
Published: (2024)

Replicable Learning of Large-Margin Halfspaces
by: Kalavasis, Alkis, et al.
Published: (2024)

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

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

(Im)possibility of Automated Hallucination Detection in Large Language Models
by: Karbasi, Amin, et al.
Published: (2025)

Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models
by: Kalavasis, Alkis, et al.
Published: (2024)

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

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)

On Agnostic PAC Learning in the Small Error Regime
by: Asilis, Julian, et al.
Published: (2025)

On Language Generation in the Limit with Bounded Memory
by: Kleinberg, Jon, et al.
Published: (2026)

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

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

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

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

Replicable Clustering
by: Esfandiari, Hossein, et al.
Published: (2023)

Differentially Private Language Generation and Identification in the Limit
by: Mehrotra, Anay, et al.
Published: (2026)

Language Generation with Infinite Contamination
by: Mehrotra, Anay, et al.
Published: (2025)

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

Gödel Test: Can Large Language Models Solve Easy Conjectures?
by: Feldman, Moran, et al.
Published: (2025)

Procurement Auctions via Approximately Optimal Submodular Optimization
by: Deng, Yuan, et al.
Published: (2024)

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

Understanding Aggregations of Proper Learners in Multiclass Classification
by: Asilis, Julian, et al.
Published: (2024)

PAC Learning with Improvements
by: Attias, Idan, et al.
Published: (2025)

Realizable Abstractions: Near-Optimal Hierarchical Reinforcement Learning
by: Cipollone, Roberto, et al.
Published: (2025)

Evolutionary Discovery of Reinforcement Learning Algorithms via Large Language Models
by: Sygkounas, Alkis, et al.
Published: (2026)

Hybrid Learners Do Not Forget: A Brain-Inspired Neuro-Symbolic Approach to Continual Learning
by: Banayeeanzade, Amin, et al.
Published: (2025)

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

Barriers to Welfare Maximization with No-Regret Learning
by: Anagnostides, Ioannis, et al.
Published: (2024)

PolarQuant: Quantizing KV Caches with Polar Transformation
by: Han, Insu, et al.
Published: (2025)

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

Transfer Learning Beyond Bounded Density Ratios
by: Kalavasis, Alkis, et al.
Published: (2024)

PAC-Bayesian Reinforcement Learning Trains Generalizable Policies
by: Zitouni, Abdelkrim, et al.
Published: (2025)

Is Efficient PAC Learning Possible with an Oracle That Responds 'Yes' or 'No'?
by: Daskalakis, Constantinos, et al.
Published: (2024)

Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs
by: Ryabchenko, Alexander, et al.
Published: (2025)

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

PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning
by: Lee, Jaejun, et al.
Published: (2024)