Penalized empirical risk minimization over Besov spaces
From MaRDI portal
Publication:1952004
Recommendations
- Sparsity in penalized empirical risk minimization
- The principle of penalized empirical risk in severely ill-posed problems
- Rademacher penalties and structural risk minimization
- Asymptotics in empirical risk minimization
- On concentration for (regularized) empirical risk minimization
- Empirical risk minimization for heavy-tailed losses
- Suboptimality of Penalized Empirical Risk Minimization in Classification
- The landscape of empirical risk for nonconvex losses
- Penalized Bregman divergence estimation via coordinate descent
- Empirical risk minimization as parameter choice rule for general linear regularization methods
Cites work
- scientific article; zbMATH DE number 5784463 (Why is no real title available?)
- scientific article; zbMATH DE number 44878 (Why is no real title available?)
- scientific article; zbMATH DE number 53328 (Why is no real title available?)
- scientific article; zbMATH DE number 3554907 (Why is no real title available?)
- scientific article; zbMATH DE number 3602126 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- 10.1162/153244303321897690
- 10.1162/1532443041424319
- 10.1162/1532443041424337
- Aggregation of SVM classifiers using Sobolev spaces
- Classification with minimax fast rates for classes of Bayes rules with sparse representation
- Convexity, Classification, and Risk Bounds
- Density estimation by wavelet thresholding
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Fast learning rates for plug-in classifiers
- Fast rates for support vector machines using Gaussian kernels
- Local Rademacher complexities
- Minimax-optimal classification with dyadic decision trees
- Model selection and error estimation
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables
- Optimal aggregation of classifiers in statistical learning.
- Orthonormal bases of compactly supported wavelets
- Rademacher penalties and structural risk minimization
- Risk bounds for statistical learning
- Sous-dualités et noyaux (reproduisants) associés. (Subdualities and associated (reproducing) kernels)
- Statistical performance of support vector machines
Cited in
(7)- Soft and hard classification by reproducing kernel Hilbert space methods
- Adaptive inference for the bivariate mean function in functional data
- Inverse statistical learning
- Minimax fast rates for discriminant analysis with errors in variables
- An asymptotically minimax kernel machine
- Streaming kernel regression with provably adaptive mean, variance, and regularization
- Regularized kernel-based reconstruction in generalized Besov spaces
This page was built for publication: Penalized empirical risk minimization over Besov spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952004)