Optimization

On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NeurIPS 2019 On The Power of Curriculum Learning in Training Deep Networks ICML 2019 On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA COLT 2019 Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019 Open Problem: Risk of Ruin in Multiarmed Bandits COLT 2019 Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory COLT 2019 Optimal Auctions through Deep Learning ICML 2019 Optimal Control Via Neural Networks: A Convex Approach ICLR 2019 Optimal Dynamic Auctions Are Virtual Welfare Maximizers AAAI 2019 Optimal Minimization of the Sum of Three Convex Functions with a Linear Operator AISTATS 2019 Optimal Policies for Observing Time Series and Related Restless Bandit Problems JMLR 2019 Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer NeurIPS 2019 Optimal Sparse Decision Trees NeurIPS 2019 Optimal Statistical Rates for Decentralised Non-Parametric Regression with Linear Speed-Up NeurIPS 2019 Optimal Stochastic and Online Learning with Individual Iterates NeurIPS 2019 Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization COLT 2019 Optimal Testing in the Experiment-rich Regime AISTATS 2019 Optimal Transport for Multi-source Domain Adaptation under Target Shift AISTATS 2019 Optimal Transport Maps For Distribution Preserving Operations on Latent Spaces of Generative Models ICLR 2019 Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile ICLR 2019 Optimization of Inf-Convolution Regularized Nonconvex Composite Problems AISTATS 2019 Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals JMLR 2019 Optimizing Constraint Solving via Dynamic Programming IJCAI 2019 Optimizing Generalized Rate Metrics with Three Players NeurIPS 2019 Optimizing Interactive Systems with Data-Driven Objectives IJCAI 2019