Learning sets with separating kernels
From MaRDI portal
Publication:2252512
DOI10.1016/j.acha.2013.11.003zbMath1345.94022arXiv1204.3573OpenAlexW2963848220MaRDI QIDQ2252512
Alessandro Toigo, Ernesto De Vito, Lorenzo Rosasco
Publication date: 18 July 2014
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.3573
Related Items (14)
Data analysis from empirical moments and the Christoffel function ⋮ Learning rates for the kernel regularized regression with a differentiable strongly convex loss ⋮ The convergence rate of semi-supervised regression with quadratic loss ⋮ Convergence analysis of Tikhonov regularization for non-linear statistical inverse problems ⋮ Error analysis of kernel regularized pairwise learning with a strongly convex loss ⋮ SOCKS: A Stochastic Optimal Control and Reachability Toolbox Using Kernel Methods ⋮ Separability of reproducing kernel spaces ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss ⋮ Convergence rate of SVM for kernel-based robust regression ⋮ Probabilistic error bounds on constraint violation for empirical-analytical Lagrangian models of motion ⋮ Regularized Nyström subsampling in regression and ranking problems under general smoothness assumptions ⋮ Performance analysis of the LapRSSLG algorithm in learning theory ⋮ Semi-algebraic approximation using Christoffel-Darboux kernel ⋮ Analysis of regularized Nyström subsampling for regression functions of low smoothness
Uses Software
Cites Work
- Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Minimax theory of image reconstruction
- Geometry on probability spaces
- Kernel PCA for novelty detection
- On regularization algorithms in learning theory
- Towards a theoretical foundation for Laplacian-based manifold methods
- Asymptotic normality in density support estimation
- Elastic-net regularization in learning theory
- On nonparametric estimation of density level sets
- A plug-in approach to support estimation
- Double operator integrals in a Hilbert space
- Random polytopes and the Efron-Stein jackknife inequality.
- A distribution-free theory of nonparametric regression
- Optimum bounds for the distributions of martingales in Banach spaces
- Weak convergence and empirical processes. With applications to statistics
- Optimal rates for the regularized least-squares algorithm
- Geometric harmonics: a novel tool for multiscale out-of-sample extension of empirical functions
- Estimating the Support of a High-Dimensional Distribution
- On the mathematical foundations of learning
- 10.1162/153244302760185252
- Some Recent Advances in Multiscale Geometric Analysis of Point Clouds
- A Topological View of Unsupervised Learning from Noisy Data
- Theory of Classification: a Survey of Some Recent Advances
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES AND UNIVERSALITY
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
- Support Vector Machines
- Spectral Algorithms for Supervised Learning
- CROSS-VALIDATION BASED ADAPTATION FOR REGULARIZATION OPERATORS IN LEARNING THEORY
- Detection of Abnormal Behavior Via Nonparametric Estimation of the Support
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: Multiscale methods
- Real Analysis and Probability
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Rates of convergence for random approximations of convex sets
- $K$-Dimensional Coding Schemes in Hilbert Spaces
- Theory of Reproducing Kernels
- The elements of statistical learning. Data mining, inference, and prediction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning sets with separating kernels
