8 citations · 20 across the 14 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LG2022★ 2 cited
Projection-free Adaptive Regret with Membership Oracles
Zhou Lu, Nataly Brukhim, Paula Gradu +1
In the framework of online convex optimization, most iterative algorithms require the computation of projections onto convex sets, which can be computationally expensive. To tackle…
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…