Learning Bounds for Kernel Regression Using Effective Data Dimensionality
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244302760200713
- 10.1162/1532443041424337
- Covering numbers for support vector machines
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- Improving the sample complexity using global data
- Leave-One-Out Bounds for Kernel Methods
- Optimal global rates of convergence for nonparametric regression
- The importance of convexity in learning with squared loss
Cited in
(49)- Estimator selection in the Gaussian setting
- An efficient kernel learning algorithm for semisupervised regression problems
- Importance sampling: intrinsic dimension and computational cost
- Analysis of regularized least squares for functional linear regression model
- Kernel conjugate gradient methods with random projections
- Dimension independent excess risk by stochastic gradient descent
- Non-asymptotic error bound for optimal prediction of function-on-function regression by RKHS approach
- Nyström landmark sampling and regularized Christoffel functions
- Nonparametric distributed learning under general designs
- General regularization schemes for signal detection in inverse problems
- Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
- Discrepancy based model selection in statistical inverse problems
- A partially linear framework for massive heterogeneous data
- Kernel regression, minimax rates and effective dimensionality: beyond the regular case
- Concentration inequalities for statistical inference
- Random design analysis of ridge regression
- scientific article; zbMATH DE number 2033148 (Why is no real title available?)
- Faster kernel ridge regression using sketching and preconditioning
- Distributed learning with regularized least squares
- Optimal rates for multi-pass stochastic gradient methods
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- Adaptive discretization for signal detection in statistical inverse problems
- Distributed least squares prediction for functional linear regression*
- Intrinsic dimension adaptive partitioning for kernel methods
- scientific article; zbMATH DE number 7306853 (Why is no real title available?)
- Analysis of regularized Nyström subsampling for regression functions of low smoothness
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Learning with generalization capability by kernel methods of bounded complexity
- Asymptotic learning curves of kernel methods: empirical data versus teacher–student paradigm
- A review of distributed statistical inference
- High-dimensional regression with unknown variance
- Spectral algorithms for learning with dependent observations
- HARFE: hard-ridge random feature expansion
- Capacity dependent analysis for functional online learning algorithms
- Statistical inference using regularized M-estimation in the reproducing kernel Hilbert space for handling missing data
- Distributed Bayesian inference in massive spatial data
- High-Dimensional Analysis of Double Descent for Linear Regression with Random Projections
- Least square regression with indefinite kernels and coefficient regularization
- An Asymptotic Analysis of Random Partition Based Minibatch Momentum Methods for Linear Regression Models
- Distributed robust regression with correntropy losses and regularization kernel networks
- New equivalences between interpolation and SVMs: kernels and structured features
- Optimal policy evaluation using kernel-based temporal difference methods
- Least squares regression under weak moment conditions
- Pseudo-labeling for kernel ridge regression under covariate shift
- Minimax optimality of kernel ridge regression when kernel eigenvalues decay polynomially or exponentially
- Grid Point Approximation for Distributed Nonparametric Smoothing and Prediction
- Effect of dimensionality on convergence rates of kernel ridge regression estimator
- Optimal Plug-in Gaussian Processes for Modeling Derivatives
- Learning Lévy density via adaptive RKHS regression with bi-level optimization
This page was built for publication: Learning Bounds for Kernel Regression Using Effective Data Dimensionality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706660)
