نتایج جستجو برای: nystrom method

تعداد نتایج: 1630162  

2010
Ameet Talwalkar Afshin Rostamizadeh

The Nyström method is an efficient technique to speed up large-scale learning applications by generating low-rank approximations. Crucial to the performance of this technique is the assumption that a matrix can be well approximated by working exclusively with a subset of its columns. In this work we relate this assumption to the concept of matrix coherence and connect matrix coherence to the pe...

Journal: :Progress In Electromagnetics Research Letters 2018

Journal: :Computers & Mathematics with Applications 1987

Journal: :SIAM journal on mathematics of data science 2021

Kernel methods have achieved very good performance on large scale regression and classification problems by using the Nystrom method preconditioning techniques. The approximation---base...

Journal: :CoRR 2014
Shusen Wang Luo Luo Zhihua Zhang

Symmetric positive semidefinite (SPSD) matrix approximation is an important problem with applications in kernel methods. However, existing SPSD matrix approximation methods such as the Nyström method only have weak error bounds. In this paper we conduct in-depth studies of an SPSD matrix approximation model and establish strong relative-error bounds. We call it the prototype model for it has mo...

Journal: :Journal of Machine Learning Research 2013
Alex Gittens Michael W. Mahoney

We reconsider randomized algorithms for the low-rank approximation of symmetric positive semi-definite (SPSD) matrices such as Laplacian and kernel matrices that arise in data analysis and machine learning applications. Our main results consist of an empirical evaluation of the performance quality and running time of sampling and projection methods on a diverse suite of SPSD matrices. Our resul...

Journal: :iranian journal of fuzzy systems 2012
majid alavi babak asady

in this paper a linear fuzzy fredholm integral equation(ffie) with arbitrary fuzzy function input and symmetric triangular (fuzzy interval) output is considered. for each variable, output is the nearest triangular fuzzy number (fuzzy interval) to the exact fuzzy solution of (ffie).

2013
Alexander G. Gray Hassan A. Kingravi Patricio A. Vela

This paper presents a practical, and theoretically wellfounded, approach to improve the speed of kernel manifold learning algorithms relying on spectral decomposition. Utilizing recent insights in kernel smoothing and learning with integral operators, we propose Reduced Set KPCA (RSKPCA), which also suggests an easy-toimplement method to remove or replace samples with minimal effect on the empi...

Journal: :American Journal of Sociology 1917

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید