Minimax Optimization
Minimax Optimization is a mathematical optimization framework that, within the context of machine learning, seeks to find optimal decision rules by minimizing the maximum possible loss, thereby distinguishing itself from conventional optimization paradigms through its adversarial structure that models worst-case scenario minimization.
1.8K
Publications
118.7K
Citations
3.4K
Authors
1.1K
Institutions
Publications per year
2017–2026
539
Variants
Minimax Programming
1.8K
1–5 of 1.8K
3.4K
17
h-index
14
h-index
11
h-index
11
h-index
10
h-index
1–5 of 3.4K
1.1K
University of California, Berkeley
Berkeley, United States
32 h-index
88 publications
9.2K citations
Stanford University
Stanford, United States
26 h-index
63 publications
5.7K citations
University of Illinois Urbana-Champaign
Urbana, United States
23 h-index
68 publications
4.2K citations
University of Pennsylvania
Philadelphia, United States
22 h-index
39 publications
3K citations
Technion – Israel Institute of Technology
Haifa, Israel
21 h-index
36 publications
2.4K citations
Princeton University
Princeton, United States
21 h-index
46 publications
3.5K citations
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
49 publications
5.2K citations
Georgia Institute of Technology
Atlanta, United States
18 h-index
35 publications
4.7K citations
1–8 of 1.1K
Repository · 248 publications · 12.3K citations
56
h-index
60 publications · 9.6K citations
36
h-index
35 publications · 5.1K citations
25
h-index
38 publications · 4.5K citations
23
h-index
44 publications · 1.7K citations
23
h-index
1–5