Kernel-based regularized learning with random projections: beyond least squares
From MaRDI portal
Cites work
- Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- Eigenvalues of integral operators with smooth positive definite kernels
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
- How deep are deep Gaussian processes?
- scientific article; zbMATH DE number 2089352 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- Information-theoretic determination of minimax rates of convergence
- Introductory lectures on convex optimization. A basic course.
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming
- Nonlinear functional models for functional responses in reproducing kernel hilbert spaces
- Optimal rates for the regularized least-squares algorithm
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Randomized Algorithms for Matrices and Data
- Randomized algorithms in numerical linear algebra
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized sketches for kernels: fast and optimal nonparametric regression
- Robust high dimensional learning for Lipschitz and convex losses
- Robust statistical learning with Lipschitz and convex loss functions
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Theory of Reproducing Kernels
This page was built for publication: Kernel-based regularized learning with random projections: beyond least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996961)
