Yue Fang, Junyi Liu, Jong-Shi Pang
arXiv 3 Jan 2024 · Mathematics — Optimization
arXiv:2401.01565 · PDF · DOI · OpenAlex · Extracted main text
This paper proposes a Heaviside composite optimization approach and presents a progressive (mixed) integer programming (PIP) method for solving multi-class classification and multi-action treatment problems with constraints. A Heaviside composite function is a composite of a Heaviside function (i.e., the indicator function of either the open $( \, 0,\infty )$ or closed $[ \, 0,\infty \, )$ interval) with a possibly nondifferentiable function. Modeling-wise, we show how Heaviside composite optimization provides a unified formulation for learning the optimal multi-class classification and multi-action treatment rules, subject to rule-dependent constraints stipulating a variety of domain restrictions. A Heaviside composite function has an equivalent discrete formulation, and the resulting optimization problem can in principle be solved by integer programming (IP) methods. Nevertheless, for constrained learning problems with large data sets, a straightforward application of off-the-shelf IP solvers is usually ineffective in achieving global optimality. To alleviate such a computational burden, our major contribution is the proposal of the PIP method by leveraging the effectiveness of state-of-the-art IP solvers for problems of modest sizes. We provide the theoretical advantage of the PIP method with the connection to continuous optimization and show that the computed solution is locally optimal for a broad class of Heaviside composite optimization problems. The numerical performance of the PIP method is demonstrated by extensive computational experimentation.
appendix boundary found by none_found · 100% of the source is main text. Read the extracted text to check this.
The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.
| Reference | Intensity | Mentions | Sections | Main text | |
|---|---|---|---|---|---|
| 1 | Cui Y, Liu J, Pang JS (2023) The minimization of piecewise functions: Pseudo stationarity | 0.928 | 4 | 3 | 100% |
| 2 | Han S, Cui Y, Pang JS (September (2023) Analysis of a class of minimization problems lacking lower semicontinuity | 0.928 | 4 | 3 | 100% |
| 3 | Bertsimas D, Dunn J (2017) Optimal classification trees | 0.737 | 3 | 2 | 100% |
| 4 | Aghaei S, Gómez A, Vayanos P (2021) Strong optimal classification trees | 0.511 | 2 | 1 | 100% |
| 5 | Cui Y, Pang JS (2021) Modern Nonconvex Nondifferentiable Optimization | 0.511 | 2 | 1 | 100% |
| 6 | Adam L, Mácha V, Sm'dl V (2020) Deeptoppush: Simple and scalable method for accuracy at the top | 0.405 | 1 | 1 | 100% |
| 7 | Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and regression trees | 0.405 | 1 | 1 | 100% |
| 8 | Boyd S, Cortes C, Mohri M, Radovanovic A (2012) Accuracy at the top | 0.405 | 1 | 1 | 100% |
| 9 | Cotter A, Jiang H, Gupta M, Wang S, Narayan T, You S, Sridharan K (2019) a) Optimization with non-differentiable constraints with applications to fairness, recall, churn, and other goals | 0.405 | 1 | 1 | 100% |
| 10 | Cotter A, Jiang H, Sridharan K (2019) b) Two-player games for efficient non-convex constrained optimization | 0.405 | 1 | 1 | 100% |
Showing the top 10 of 25 scored citations.