Learning with risks based on M-location
From MaRDI portal
Publication:6097134
DOI10.1007/s10994-022-06217-5arXiv2012.02424OpenAlexW3159057493WikidataQ114224927 ScholiaQ114224927MaRDI QIDQ6097134
Publication date: 12 June 2023
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.02424
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Empirical risk minimization for heavy-tailed losses
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Quantitative stability in stochastic programming
- Introductory lectures on convex optimization. A basic course.
- Stochastic linear programming. Models, theory, and computation
- Regularization in Banach spaces with respect to the Bregman distance
- Efficiency of minimizing compositions of convex functions and smooth maps
- Differential properties of the Moreau envelope
- Generalized deviations in risk analysis
- Integrals which are convex functionals
- Coherent Measures of Risk
- Convexity and Optimization in Banach Spaces
- On the interchange of subdifferentiation and conditional expectation for convex functionals
- Variational Analysis
- Bregman Monotone Optimization Algorithms
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic Model-Based Minimization of Weakly Convex Functions
- Prox-regular functions in variational analysis
- Variance-based regularization with convex objectives
- Optimization of Convex Risk Functions
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Understanding Machine Learning
- The Existence of Probability Measures with Given Marginals
- Robust Estimation of a Location Parameter
- Prediction Games and Arcing Algorithms
- Convex analysis and monotone operator theory in Hilbert spaces
