:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hanneke, Steve, Xu, Mingyue
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2601.20774
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When Structure Doesn't Help: LLMs Do Not Read Text-Attributed Graphs as Effectively as We Expected
by: Xu, Haotian, et al.
Published: (2025)

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)

Semantics at an Angle: When Cosine Similarity Works Until It Doesn't
by: You, Kisung
Published: (2025)

Explorations of the Softmax Space: Knowing When the Neural Network Doesn't Know
by: Sikar, Daniel, et al.
Published: (2025)

Recurrent Off-Policy Deep Reinforcement Learning Doesn't Have to be Slow
by: Clark, Tyler, et al.
Published: (2025)

Library Learning Doesn't: The Curious Case of the Single-Use "Library"
by: Berlot-Attwell, Ian, et al.
Published: (2024)

Reinforcement Learning for Reasoning in Small LLMs: What Works and What Doesn't
by: Dang, Quy-Anh, et al.
Published: (2025)

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

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

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

One LR Doesn't Fit All: Heavy-Tail Guided Layerwise Learning Rates for LLMs
by: He, Di, et al.
Published: (2026)

Infinite Width Models That Work: Why Feature Learning Doesn't Matter as Much as You Think
by: Sernau, Luke
Published: (2024)

A Critical Look at Targeted Instruction Selection: Disentangling What Matters (and What Doesn't)
by: Nayak, Nihal V., et al.
Published: (2026)

Curated Synthetic Data Doesn't Have to Collapse: A Theoretical Study of Generative Retraining with Pluralistic Preferences
by: Falahati, Ali, et al.
Published: (2026)

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)

On Characterizing Learnability for Adversarial Noisy Bandits
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 Optimistically Universal Online Learnability for General Concept Classes
by: Hanneke, Steve, et al.
Published: (2025)

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

Machine Unlearning Doesn't Do What You Think: Lessons for Generative AI Policy and Research
by: Cooper, A. Feder, et al.
Published: (2024)

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

Chapter When It Doesn't Go to Plan
by: Kim, Seoyeon | https://orcid.org/0000-0002-2018-9520, et al.
Published: (2026)

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

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

Why Prompt Optimization Works, and Why It Sometimes Doesn't: A Causal-Inspired Edit-Level Analysis
by: Gong, Shuzhi, et al.
Published: (2026)

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

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

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

MedCalc-Bench Doesn't Measure What You Think: A Benchmark Audit and the Case for Open-Book Evaluation
by: Krohn-Grimberghe, Artus
Published: (2026)

When Do "More Contexts" Help with Sarcasm Recognition?
by: Nimase, Ojas, et al.
Published: (2024)

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

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

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

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

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

When the Conversation Doesn't Go Your Way
Published: (2024)

Revisiting Intermediate-Layer Matching in Knowledge Distillation: Layer-Selection Strategy Doesn't Matter (Much)
by: Yu, Zony, et al.
Published: (2025)

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