Minimax Lower Bounds for Realizable Transductive Classification
Ilya Tolstikhin, David Lopez-Paz

TL;DR
This paper establishes the first minimax lower bounds for realizable transductive binary classification, showing that transduction is as hard as induction and unlabeled data does not necessarily aid learning.
Contribution
It provides the first known minimax lower bounds for transductive learning, demonstrating its fundamental difficulty and the limited benefit of unlabeled data in this setting.
Findings
Transduction is as hard as induction in the minimax sense.
Unlabeled data does not improve transductive learning bounds.
Lower bounds for semi-supervised learning are derived from transductive bounds.
Abstract
Transductive learning considers a training set of labeled samples and a test set of unlabeled samples, with the goal of best labeling that particular test set. Conversely, inductive learning considers a training set of labeled samples drawn iid from , with the goal of best labeling any future samples drawn iid from . This comparison suggests that transduction is a much easier type of inference than induction, but is this really the case? This paper provides a negative answer to this question, by proving the first known minimax lower bounds for transductive, realizable, binary classification. Our lower bounds show that should be at least when -learning a concept class of finite VC-dimension with confidence , for all . This result draws three important…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Domain Adaptation and Few-Shot Learning
