A Characterization of List Learnability

11/07/2022
by   Moses Charikar, et al.
0

A classical result in learning theory shows the equivalence of PAC learnability of binary hypothesis classes and the finiteness of VC dimension. Extending this to the multiclass setting was an open problem, which was settled in a recent breakthrough result characterizing multiclass PAC learnability via the DS dimension introduced earlier by Daniely and Shalev-Shwartz. In this work we consider list PAC learning where the goal is to output a list of k predictions. List learning algorithms have been developed in several settings before and indeed, list learning played an important role in the recent characterization of multiclass learnability. In this work we ask: when is it possible to k-list learn a hypothesis class? We completely characterize k-list learnability in terms of a generalization of DS dimension that we call the k-DS dimension. Generalizing the recent characterization of multiclass learnability, we show that a hypothesis class is k-list learnable if and only if the k-DS dimension is finite.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2022

A Characterization of Multiclass Learnability

A seminal result in learning theory characterizes the PAC learnability o...
research
03/27/2023

List Online Classification

We study multiclass online prediction where the learner can predict usin...
research
11/08/2021

Realizable Learning is All You Need

The equivalence of realizable and agnostic learnability is a fundamental...
research
11/16/2022

Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes

In many learning theory problems, a central role is played by a hypothes...
research
04/07/2020

On the Complexity of Learning from Label Proportions

In the problem of learning with label proportions, which we call LLP lea...
research
07/02/2023

Multiclass Boosting: Simple and Intuitive Weak Learning Criteria

We study a generalization of boosting to the multiclass setting. We intr...
research
04/05/2023

List and Certificate Complexities in Replicable Learning

We investigate replicable learning algorithms. Ideally, we would like to...

Please sign up or login with your details

Forgot password? Click here to reset