Saved in:
Bibliographic Details
Main Author: Dughmi, Shaddin
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.00607
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918008000086016
author Dughmi, Shaddin
author_facet Dughmi, Shaddin
contents The main goal of this article is to convince you, the reader, that supervised learning in the Probably Approximately Correct (PAC) model is closely related to -- of all things -- bipartite matching! En-route from PAC learning to bipartite matching, I will overview a particular transductive model of learning, and associated one-inclusion graphs, which can be viewed as a generalization of some of the hat puzzles that are popular in recreational mathematics. Whereas this transductive model is far from new, it has recently seen a resurgence of interest as a tool for tackling deep questions in learning theory. A secondary purpose of this article could be as a (biased) tutorial on the connections between the PAC and transductive models of learning.
format Preprint
id arxiv_https___arxiv_org_abs_2502_00607
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle PAC Learning is just Bipartite Matching (Sort of)
Dughmi, Shaddin
Machine Learning
Data Structures and Algorithms
F.0
The main goal of this article is to convince you, the reader, that supervised learning in the Probably Approximately Correct (PAC) model is closely related to -- of all things -- bipartite matching! En-route from PAC learning to bipartite matching, I will overview a particular transductive model of learning, and associated one-inclusion graphs, which can be viewed as a generalization of some of the hat puzzles that are popular in recreational mathematics. Whereas this transductive model is far from new, it has recently seen a resurgence of interest as a tool for tackling deep questions in learning theory. A secondary purpose of this article could be as a (biased) tutorial on the connections between the PAC and transductive models of learning.
title PAC Learning is just Bipartite Matching (Sort of)
topic Machine Learning
Data Structures and Algorithms
F.0
url https://arxiv.org/abs/2502.00607