返回
On Optimal Learning With Random Features
DOI:10.1109/TNNLS.2022.3152270.png)
摘要
En 中文
We consider supervised learning in a reproducing kernel Hilbert space (RKHS) using random features. We show that the optimal rate is obtained under suitable regularity conditions, and at the same time improving on the existing bounds on the number of random features required. As a straightforward extension, distributed learning in the simple setting of one-shot communication is also considered that achieves the same optimal rate.
Keyword:
Kernel
Standards
Urban areas
Time complexity
Supervised learning
Hilbert space
Convergence
Distributed learning
kernel method
optimal rate
random features
期刊
IF:
8.9
论文数:
7.5K
被引数:
7.2W
机构
引用论文
RANDOMIZED SKETCHES FOR KERNELS: FAST AND OPTIMAL NONPARAMETRIC REGRESSION内核的随机草图: 快速和最佳的非参数回归
ANNALS OF STATISTICS
IF3.7
没有更多内容

