68 citations · 163 across the 20 of their papers we have counts for
3 papers · 1 filter
Transductive Learning Is Compact
Julian Asilis, Siddartha Devic, Shaddin Dughmi +2
We demonstrate a compactness result holding broadly across supervised learning with a general class of loss functions: Any hypothesis class is learnable with transductive sampl…
Regularization and Optimal Multiclass Learning
Julian Asilis, Siddartha Devic, Shaddin Dughmi +2
The quintessential learning algorithm of empirical risk minimization (ERM) is known to fail in various settings for which uniform convergence does not characterize learning. It is…
Decision trees are PAC-learnable from most product distributions: a smoothed analysis
Adam Tauman Kalai, Shang-Hua Teng
We consider the problem of PAC-learning decision trees, i.e., learning a decision tree over the n-dimensional hypercube from independent random labeled examples. Despite significan…