No article text was recorded for this version.
teaching-to-learning complexity ratio
Version 2 of 239 papers68 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Open Problem: Recursive Teaching Dimension Versus VC Dimension
- Blog: On the Recursive Teaching Dimension of VC Classes
- Blog: Quadratic Upper Bound for Recursive Teaching Dimension of Finite VC Classes
- Blog: On Batch Teaching Without Collusion
- Blog: Teaching and compressing for low VC-dimension
- Blog: On Batch Teaching with Sample Complexity Bounded by VCD
- Blog: Tournaments, Johnson Graphs and NC-Teaching
- Blog: Preference-Based Batch and Sequential Teaching: Towards a Unified View of Models
- Blog: RTD-Conjecture and Concept Classes Induced by Graphs
- Blog: Preference-based Teaching of Unions of Geometric Objects
- Blog: Optimal Collusion-Free Teaching
- Blog: Non-Clashing Teaching Maps for Balls in Graphs
- Blog: Open Problem: Information Complexity of VC Learning
- Blog: The Star Number and Eluder Dimension: Elementary Observations About the Dimensions of Disagreement
- Blog: Collaborative PAC Learning
- Blog: Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Blog: Optimal Collusion-Free Teaching
- Blog: The VC dimension of k-fold union
- Blog: Lower Bounds for Greedy Teaching Set Constructions
- Blog: Inner Product Spaces for Bayesian Networks
- Blog: Preference-Based Batch and Sequential Teaching
- Blog: Learning a hyperplane classifier by minimizing an exact bound on the VC dimension
- Blog: Adversarially Robust Learning with Unknown Perturbation Sets
- Blog: Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds
- Blog: Almost Linear VC Dimension Bounds for Piecewise Polynomial Networks
- Blog: Sign rank versus VC dimension
- Blog: Non-Clashing Teaching Maps for Balls in Graphs
- Blog: VC Classes are Adversarially Robustly Learnable, but Only Improperly
- Blog: Preference-based Teaching
- Blog: Complexity Bounds for Batch Active Learning in Classification
- Blog: A Compression Technique for Analyzing Disagreement-Based Active Learning
- Blog: Boosting Simple Learners
- Blog: Inapproximability of VC Dimension and Littlestone's Dimension
- Blog: Teaching Dimensions based on Cooperative Learning
- Blog: Neural Networks with Quadratic VC Dimension
- Blog: Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexity
- Blog: Threshold Network Learning in the Presence of Equivalences
- Blog: Classifying the Arithmetical Complexity of Teaching Models
- Blog: The teaching complexity of erasing pattern languages with bounded variable frequency.
History & citation
Current · Permanent link
- Non Clashing Constraints for Collusion Free Machine Teaching merged into this direction (56% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_teaching_to_learning_complexity_ratio_8d6e2c7a,
title = {teaching-to-learning complexity ratio},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/teaching-to-learning-complexity-ratio/rdr_8d6e2c7a63e2467da20f5d64aeff36ae},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_teaching_to_learning_complexity_ratio_8d6e2c7a_v2,
title = {teaching-to-learning complexity ratio},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/teaching-to-learning-complexity-ratio/rdr_8d6e2c7a63e2467da20f5d64aeff36ae/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}