Optimal rates for the regularized least-squares algorithm
From MaRDI portal
Publication:2385535
Recommendations
- Optimal rate of the regularized regression learning algorithm
- Learning rates of least-square regularized regression
- The learning rate for regularized least-squares algorithm on the unit sphere
- Optimal learning rates for least squares regularized regression with unbounded sampling
- Regularized least square algorithm with two kernels
Cited in
(only showing first 100 items - show all)- Convex multi-task feature learning
- Elastic-net regularization in learning theory
- Nonparametric regression using needlet kernels for spherical data
- Generalization properties of doubly stochastic learning algorithms
- Optimal learning rates for kernel partial least squares
- Kernel methods for the approximation of some key quantities of nonlinear systems
- Distributed kernel-based gradient descent algorithms
- Importance sampling: intrinsic dimension and computational cost
- Analysis of regularized least squares for functional linear regression model
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Learning rates for least square regressions with coefficient regularization
- A meta-learning approach to the regularized learning -- case study: blood glucose prediction
- ERM learning with unbounded sampling
- Concentration estimates for learning with unbounded sampling
- Optimal regression rates for SVMs using Gaussian kernels
- Least-squares two-sample test
- Adaptive kernel methods using the balancing principle
- Optimal prediction for high-dimensional functional quantile regression in reproducing kernel Hilbert spaces
- Kernel conjugate gradient methods with random projections
- Generalization ability of online pairwise support vector machine
- Coefficient-based regression with non-identical unbounded sampling
- Additive functional regression in reproducing kernel Hilbert spaces under smoothness condition
- Distributed regularized least squares with flexible Gaussian kernels
- Linearized two-layers neural networks in high dimension
- Sparse high-dimensional semi-nonparametric quantile regression in a reproducing kernel Hilbert space
- Error bounds of the invariant statistics in machine learning of ergodic Itô diffusions
- An elementary analysis of ridge regression with random design
- Exact minimax risk for linear least squares, and the lower tail of sample covariance matrices
- Functional linear regression with Huber loss
- Approximate kernel PCA: computational versus statistical trade-off
- A sieve stochastic gradient descent estimator for online nonparametric regression in Sobolev ellipsoids
- Distribution-free robust linear regression
- Machine learning with kernels for portfolio valuation and risk management
- Online gradient descent algorithms for functional data learning
- State-based confidence bounds for data-driven stochastic reachability using Hilbert space embeddings
- Non-asymptotic error bound for optimal prediction of function-on-function regression by RKHS approach
- Deep learning for inverse problems. Abstracts from the workshop held March 7--13, 2021 (hybrid meeting)
- Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration
- Learning rate of distribution regression with dependent samples
- Manifold regularization based on Nyström type subsampling
- Distributed kernel gradient descent algorithm for minimum error entropy principle
- Learning rates for the kernel regularized regression with a differentiable strongly convex loss
- Tikhonov regularization with oversmoothing penalty for nonlinear statistical inverse problems
- Convergence analysis of Tikhonov regularization for non-linear statistical inverse problems
- Just interpolate: kernel ``ridgeless regression can generalize
- ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels
- Finite-sample analysis of \(M\)-estimators using self-concordance
- Kernel gradient descent algorithm for information theoretic learning
- Finite sample performance of linear least squares estimation
- Almost optimal estimates for approximation and learning by radial basis function networks
- Optimal convergence rates of high order Parzen windows with unbounded sampling
- Learning sets with separating kernels
- Least-square regularized regression with non-iid sampling
- Balancing principle in supervised learning for a general regularization scheme
- Optimal learning rates for distribution regression
- Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
- Moving quantile regression
- Fast and strong convergence of online learning algorithms
- High-probability bounds for the reconstruction error of PCA
- Least square regularized regression for multitask learning
- On nonparametric randomized sketches for kernels with further smoothness
- Concentration of weakly dependent Banach-valued sums and applications to statistical learning methods
- Optimal rates for coefficient-based regularized regression
- Multi-task learning via linear functional strategy
- Distributed learning with multi-penalty regularization
- Oracle-type posterior contraction rates in Bayesian inverse problems
- On randomized trace estimates for indefinite matrices with an application to determinants
- Nonasymptotic analysis of robust regression with modified Huber's loss
- Low-rank kernel approximation of Lyapunov functions using neural networks
- Convergence analysis of online learning algorithm with two-stage step size
- A Vector-Contraction Inequality for Rademacher Complexities
- Convergence rates of kernel conjugate gradient for random design regression
- On extension theorems and their connection to universal consistency in machine learning
- Indefinite kernel network with dependent sampling
- Half supervised coefficient regularization for regression learning with unbounded sampling
- Online regression with unbounded sampling
- Optimal rate of the regularized regression learning algorithm
- Rademacher Chaos Complexities for Learning the Kernel Problem
- Multi-penalty regularization in learning theory
- Least square regression with \(l^{p}\)-coefficient regularization
- A note on stability of error bounds in statistical learning theory
- Nonparametric stochastic approximation with large step-sizes
- Estimates of learning rates of regularized regression via polyline functions
- Local learning estimates by integral operators
- scientific article; zbMATH DE number 6671876 (Why is no real title available?)
- Kernel regression, minimax rates and effective dimensionality: beyond the regular case
- The Random Feature Model for Input-Output Maps between Banach Spaces
- Analysis of regression algorithms with unbounded sampling
- Convergence Rates of Spectral Regularization Methods: A Comparison between Ill-Posed Inverse Problems and Statistical Kernel Learning
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES AND UNIVERSALITY
- Spectral Algorithms for Supervised Learning
- Cross-validation based adaptation for regularization operators in learning theory
- A new concentration result for regularized risk minimizers
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
- Regularized least square regression with unbounded and dependent sampling
- Integral operator approach to learning theory with unbounded sampling
- Random design analysis of ridge regression
- An empirical feature-based learning algorithm producing sparse approximations
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- Consistency of support vector machines using additive kernels for additive models
This page was built for publication: Optimal rates for the regularized least-squares algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385535)
