Sandeep Routray
Sandeep Routray
Home
Publications
Projects
Contact
CV
Light
Dark
Automatic
Optimization
Smooth Minimax Optimisation in Non-Euclidean Space Using Bregman Divergence Framework
Minimax type of problems arise in several domains such as machine learning, optimization, statistics, communication, and game theory. However, a majority of results are established for the Euclidean norm due to its special self-dual nature.
PDF
Slides
Cite
×