We propose a method to efficiently construct data-dependent kernels which can make use of large quantities of (unlabeled) data. Our construction makes an approximation in the standard construction of semi-supervised kernels in Sindhwani et al. 2005. In typical cases these kernels can be computed in nearly-linear time (in the amount of data), improving on the cubic time of the standard construction, enabling large scale semi-supervised learning in a variety of contexts. The methods are validated on semi-supervised and unsupervised problems on data sets containing upto 64,000 sample points.
Data Dependent Kernel Approximation using Pseudo Random Fourier Features
IRISA, Univ. Bretagne-Sud(布列塔尼南方大学 IRISA);ETIS UMR 8051, Univ. Paris Seine, Univ. Cergy-Pontoise, ENSEA, CNRS(ETIS UMR 8051,巴黎塞纳大学,塞尔吉-蓬图瓦兹大学,ENSEA,法国国家科学研究中心)
Generalization Bound of Gradient Flow through Training Trajectory and Data-dependent Kernel
University of California San Diego(加州大学圣地亚哥分校);University of California Berkeley(加州大学伯克利分校);ICSI(国际计算机科学研究所);RIKEN AIP(理化学研究所Advanced Institute for Scientific Research);University of Sydney(悉尼大学);University of Tokyo(东京大学)
Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networks
John A. Paulson School of Engineering and Applied Sciences, Harvard University(哈佛大学约翰·A·保尔森工程与应用科学学院);Center for Brain Science, Harvard University(哈佛大学脑科学中心)
Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所);School of Cyber Security, University of Chinese Academy of Sciences(中国科学院大学网络空间安全学院)
Learning to Embed Distributions via Maximum Kernel Entropy
Dipartimento di Matematica, Università degli Studi di Genova(热那亚大学数学系);Technion Israel Institute of Technology(以色列理工学院);Allen Institute for Neural Dynamics(艾伦神经动力学研究所)