2017
DOI: 10.48550/arxiv.1705.10958
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

FALKON: An Optimal Large Scale Kernel Method

Abstract: Kernel methods provide a principled way to perform non linear, nonparametric learning. They rely on solid functional analytic foundations and enjoy optimal statistical properties. However, at least in their basic form, they have limited applicability in large scale scenarios because of stringent computational requirements in terms of time and especially memory. In this paper, we take a substantial step in scaling up kernel methods, proposing FALKON, a novel algorithm that allows to efficiently process millions… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 14 publications
(51 reference statements)
0
9
0
Order By: Relevance
“…The resulting maps x → ρ( x, z l ) are random features, associated with a shallow neural network with 'frozen' weights. While further choices of kernel may be considered in the future, dot-product kernels have flexible approximation properties and are easily scalable [40].…”
Section: B3 Kernel Methodsmentioning
confidence: 99%
“…The resulting maps x → ρ( x, z l ) are random features, associated with a shallow neural network with 'frozen' weights. While further choices of kernel may be considered in the future, dot-product kernels have flexible approximation properties and are easily scalable [40].…”
Section: B3 Kernel Methodsmentioning
confidence: 99%
“…( 24) is typically cubic in time and quadratic in space with respect to the number of points, since it requires handling the kernel matrix K N N ∈ R N ×N with entries k γ (x i , x j ) (see Refs. [40,49] for further details). These costs prevent the application of basic solvers in large-scale setting, and some approximation is needed.…”
Section: Scalable Nonparametric Learning With Kernelsmentioning
confidence: 99%
“…The core ideas from a theoretical and algorithmic viewpoint are developed in Ref. [49,57,59]. The problem of minimizing the regularized empirical risk in Eq.…”
Section: B Falkonmentioning
confidence: 99%
“…State-of-the-art Kernel solvers in the literature (e.g. [52]) have scaled up to millions of points by leveraging techniques such as Nyström sampling. We plan to investigate how to leverage these approaches to handle larger inputs.…”
Section: Conclusion and Limitationsmentioning
confidence: 99%