Optimization
Robust and Faster Zeroth-Order Minimax Optimization: Complexity and Applications Weixin An
Many zeroth-order (ZO) optimization algorithms have been developed to solve nonconvex minimax problems in machine learning and computer vision areas.
A Unified Discretization Framework for Differential Equation Approach with Lyapunov Arguments for Convex Optimization
The differential equation (DE) approach for convex optimization, which relates optimization methods to specific continuous DEs with rate-revealing Lyapunov functionals, has gained increasing interest since the seminal paper by Su-Boyd-Candès (2014).
c5cf13bfd3762821ef7607e63ee90075-Supplemental-Conference.pdf
Suppose that there arennodes overaconnected graph G = {E,V}, where E and V represent the edges and vertices.
c5cf13bfd3762821ef7607e63ee90075-Paper-Conference.pdf
Suppose that there arennodes overaconnected graph G = {E,V}, where E and V represent the edges and vertices.
Learning to Screen
Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Shay Moran
Neural Information Processing Systems http://nips.cc/
