Nonlinear meta-learning can guarantee faster rates
From MaRDI portal
Cites work
- A chain rule for the expected suprema of Gaussian processes
- An elementary analysis of ridge regression with random design
- Convergence analysis of deterministic kernel-based quadrature rules in misspecified settings
- Dimension reduction for nonelliptically distributed predictors
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Domain generalization by marginal transfer learning
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- Kernel dimension reduction in regression
- Learning sparse polynomial functions
- Linearized two-layers neural networks in high dimension
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- Optimal rates for regularization of statistical inverse learning problems
- Optimal rates for the regularized least-squares algorithm
- Optimally tackling covariate shift in RKHS-based nonparametric regression
- Perturbation bounds in connection with singular value decomposition
- Principal support vector machines for linear and nonlinear sufficient dimension reduction
- Smoothing spline ANOVA models
- Sobolev norm learning rates for regularized least-squares algorithms
- Successive direction extraction for estimating the central subspace in a multiple-index regres\-sion
- Support Vector Machines
- The benefit of multitask representation learning
- Universality, Characteristic Kernels and RKHS Embedding of Measures
This page was built for publication: Nonlinear meta-learning can guarantee faster rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913607)
