ResearchTrend.AI
Simple and Almost Assumption-Free Out-of-Sample Bound for Random Feature Mapping

Simple and Almost Assumption-Free Out-of-Sample Bound for Random Feature Mapping

Shusen Wang
ArXivPDFHTML

Papers citing "Simple and Almost Assumption-Free Out-of-Sample Bound for Random Feature Mapping"

3 / 3 papers shown
Title
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
J. Tropp
A. Yurtsever
Madeleine Udell
Volkan Cevher
33
81
0
18 Jun 2017
Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds
Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds
Shusen Wang
Alex Gittens
Michael W. Mahoney
47
128
0
09 Jun 2017
Randomized Nonlinear Component Analysis
Randomized Nonlinear Component Analysis
David Lopez-Paz
S. Sra
Alex Smola
Zoubin Ghahramani
Bernhard Schölkopf
57
176
0
01 Feb 2014

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.