On the principle of empirical risk minimization based on averaging aggregation functions
From MaRDI portal
Publication:679984
DOI10.1134/S106456241705026XzbMATH Open1392.62084OpenAlexW2766217071MaRDI QIDQ679984FDOQ679984
Authors: Z. M. Shibzukhov
Publication date: 22 January 2018
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s106456241705026x
Recommendations
- Principle of minimizing empirical risk and averaging aggregate functions
- Aggregation via empirical risk minimization
- Empirical risk minimization is optimal for the convex aggregation problem
- On the optimality of the empirical risk minimization procedure for the convex aggregation problem
- Empirical risk minimization for heavy-tailed losses
Linear regression; mixed models (62J05) Applications of mathematical programming (90C90) Robustness and adaptive procedures (parametric inference) (62F35)
Cites Work
Cited In (6)
- Principle of minimizing empirical risk and averaging aggregate functions
- Excess risk bounds in robust empirical risk minimization
- Clustering algorithm based on feature space partitioning
- Minimizing robust estimates of sums of parameterized functions
- On a robust gradient boosting scheme based on aggregation functions insensitive to outliers
- Title not available (Why is that?)
This page was built for publication: On the principle of empirical risk minimization based on averaging aggregation functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679984)