Inverse statistical learning
From MaRDI portal
Recommendations
- Statistical inference for inverse problems
- scientific article; zbMATH DE number 1552304
- Statistical methodology for inverse problems
- Convex regularization in statistical inverse learning problems
- Nonparametric statistical inverse problems
- scientific article; zbMATH DE number 4072107
- Fast inference for statistical inverse problems
- A unified approach to inversion problems in statistics
- Rethinking statistical learning theory: learning using statistical invariants
Cites work
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 1420699 (Why is no real title available?)
- A Bennett concentration inequality and its application to suprema of empirical processes
- Deconvolution problems in nonparametric statistics
- Empirical minimization
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Fast learning rates for plug-in classifiers
- General nonexact oracle inequalities for classes with a subexponential envelope
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- Goodness-of-fit testing and quadratic functional estimation from indirect observations
- Local Rademacher complexities
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Measuring mass concentrations and estimating density contour clusters -- An excess mass approach
- Minimax fast rates for discriminant analysis with errors in variables
- New concentration inequalities for suprema of empirical processes
- New concentration inequalities in product spaces
- Nonparametric statistical inverse problems
- On deconvolution with repeated measurements
- On the optimal rates of convergence for nonparametric deconvolution problems
- Optimal aggregation of classifiers in statistical learning.
- Penalized empirical risk minimization over Besov spaces
- Risk bounds for statistical learning
- Smooth discrimination analysis
- Some applications of concentration inequalities to statistics
- Square root penalty: Adaption to the margin in classification and in edge estimation
- Statistical performance of support vector machines
- Weak convergence and empirical processes. With applications to statistics
Cited in
(6)- Orthogonal statistical learning
- Noisy discriminant analysis with boundary assumptions
- Optimal rates for regularization of statistical inverse learning problems
- Data quality for the inverse lsing problem
- Bandwidth selection in kernel empirical risk minimization via the gradient
- Convergence Rates for Learning Linear Operators from Noisy Data
This page was built for publication: Inverse statistical learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364201)
