Built independently by an author, for readers. Read the story and support ChapterPal

keyword

convex risk minimization

Convex risk minimization is a framework in statistical machine learning where a predictive model is trained by minimizing an expected or empirical objective function defined by a convex surrogate loss. In many practical tasks, directly minimizing the true performance metric involves discrete or non-convex loss functions, such as the zero-one misclassification loss, which makes exact optimization computationally intractable. Convex risk minimization resolves this difficulty by replacing the non-convex target loss with a convex surrogate, such as hinge loss, cross-entropy loss, or logistic loss. This convexity ensures that the optimization landscape lacks problematic local minima and can be solved efficiently with standard convex optimization algorithms, while theoretical properties like calibration, excess risk bounds, and Bayes consistency guarantee that minimizing the surrogate loss effectively optimizes performance on the underlying target task.

1 item