Distribution-free learnability by bounded-precision mini-batch SGD implies approximability by a polynomial number of random features, up to a new complexity measure called average probabilistic dimension complexity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
The Power of Random Features and the Limits of Distribution-Free Gradient Descent
Distribution-free learnability by bounded-precision mini-batch SGD implies approximability by a polynomial number of random features, up to a new complexity measure called average probabilistic dimension complexity.