Optimization
Finding Second-Order Stationary Points in Nonconvex-Strongly-Concave Minimax Optimization
P ( x) could be nonconvex.
A Simple Decentralized Cross-Entropy Method
In this paper, we show that such a centralized approach makes CEM vulnerable to local optima, thus impairing its sample efficiency.
BILCO: An Efficient Algorithm for Joint Alignment of Time Series Xuelong Mi
We develop the strategy of linear component operations that integrates dynamic programming technique and the push-relabel approach.
Triangulation candidates for Bayesian optimization
Bayesian optimization involves "inner optimization" over a new-data acquisition
Distributionally Robust Optimization via Ball Oracle Acceleration
Our approach relies on an accelerated method that queries a ball optimization oracle, i.e., a subroutine that minimizes the objective within a small ball around the query point. Our main contribution is efficient implementations of this oracle for DRO objectives.
Distributionally Robust Optimization via Ball Oracle Acceleration
Our approach relies on an accelerated method that queries a ball optimization oracle, i.e., a subroutine that minimizes the objective within a small ball around the query point. Our main contribution is efficient implementations of this oracle for DRO objectives.
Faster width-dependent algorithm for mixed packing and covering LPs
Digvijay Boob, Saurabh Sawlani, Di Wang
Neural Information Processing Systems http://nips.cc/
