22 citations · 35 across the 10 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2023
The Sample Complexity Of ERMs In Stochastic Convex Optimization
Daniel Carmon, Roi Livni, Amir Yehudayoff
Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained u…
cs.LG2022
A Characterization of Multiclass Learnability
Nataly Brukhim, Daniel Carmon, Irit Dinur +2
A seminal result in learning theory characterizes the PAC learnability of binary classes through the Vapnik-Chervonenkis dimension. Extending this characterization to the general m…