No article text was recorded for this version.
realizability assumption
Version 2 of 2146 papers159 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On multi-view active learning and the combination with semi-supervised learning
- Blog: On the sample complexity of privately learning half-spaces
- Blog: Learning under $p$-Tampering Attacks
- Blog: On the Sample Complexity of Learning Sum-Product Networks
- Blog: Surrogate Losses in Passive and Active Learning
- Blog: Bounded Memory Active Learning through Enriched Queries
- Blog: Analysis of a greedy active learning strategy
- Blog: Universal Rates for Multiclass Learning
- Blog: Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
- Blog: Optimal PAC Bounds Without Uniform Convergence
- Blog: Minimax Lower Bounds for Realizable Transductive Classification
- Blog: The True Sample Complexity of Active Learning
- Blog: Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning
- Blog: Universal Rates of Empirical Risk Minimization
- Blog: Closure Properties for Private Classification and Online Prediction
- Blog: Learning ReLUs via Gradient Descent
- Blog: Near Optimal Distributed Learning of Halfspaces with Two Parties
- Blog: Efficient PAC Learning from the Crowd with Pairwise Comparisons
- Blog: Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
- Blog: A Theory of Universal Learning
- Blog: Interactive Submodular Set Cover
- Blog: Classification Protocols with Minimal Disclosure
- Blog: Supervised learning through the lens of compression
- Blog: Learning from Snapshots of Discrete and Continuous Data Streams
- Blog: Online Learnability of Chain-of-Thought Verifiers: Soundness and Completeness Trade-offs
- Blog: The Power of Comparisons for Actively Learning Linear Classifiers
- Blog: Provable guarantees for decision tree induction: the agnostic setting
- Blog: Of Dice and Games: A Theory of Generalized Boosting
- Blog: Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes
- Blog: Online Active Learning with Surrogate Loss Functions
- Blog: Littlestone Classes are Privately Online Learnable
- Blog: Distribution Learning with Valid Outputs Beyond the Worst-Case
- Blog: Learnability of the Superset Label Learning Problem
- Blog: Near-Polynomially Competitive Active Logistic Regression
- Blog: A Learning Framework for Distribution-Based Game-Theoretic Solution Concepts
- Blog: Generalized Thompson Sampling for Contextual Bandits
- Blog: Decision trees are PAC-learnable from most product distributions: a smoothed analysis
- Blog: Realizable Learning is All You Need
- Blog: Learning by Refuting
- Blog: Eluder dimension: localise it!
- Blog: Efficient Protocols for Distributed Classification and Optimization
- Blog: Learnability with Indirect Supervision Signals
- Blog: Efficient and Parsimonious Agnostic Active Learning
- Blog: Online Agnostic Multiclass Boosting
- Blog: Universal Rates for Multiclass Learning
- Blog: Multiclass Boosting: Simple and Intuitive Weak Learning Criteria
- Blog: Collaborative PAC Learning
- Blog: When is a Convolutional Filter Easy To Learn?
- Blog: Identifiability of Priors from Bounded Sample Sizes with Applications to Transfer Learning
- Blog: Diameter-Based Active Learning
- Blog: Online nearest neighbor classification
- Blog: A Theory of Optimistically Universal Online Learnability for General Concept Classes
- Blog: Active Learning with Simple Questions
- Blog: Privately Learning Decision Lists and a Differentially Private Winnow
- Blog: Bayes Complexity of Learners vs Overfitting
- Blog: Efficient PAC Learning from the Crowd
- Blog: Active Learning for Smooth Problems
- Blog: Learning under p-Tampering Attacks
- Blog: Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
- Blog: Sample efficient learning of predictors that complement humans
Showing 60 of 146 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_realizability_assumption_37d166c2,
title = {realizability assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/realizability-assumption/rdr_37d166c2fbb94712a4599d430aed3a04},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_realizability_assumption_37d166c2_v2,
title = {realizability assumption},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/realizability-assumption/rdr_37d166c2fbb94712a4599d430aed3a04/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}