{"list":"other","total":60,"rows":[{"id":"1909.05207","title":"Introduction to Online Convex Optimization","created":"2019-09-07","cited_by_count":803},{"id":"1309.5549","title":"Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programming","created":"2013-09-22","cited_by_count":724},{"id":"1708.03999","title":"ZOO: Zeroth Order Optimization based Black-box Attacks to Deep Neural Networks without Training Substitute Models","created":"2017-08-14","cited_by_count":666},{"id":"1802.04434","title":"signSGD: Compressed Optimisation for Non-Convex Problems","created":"2018-02-13","cited_by_count":571},{"id":"1804.08598","title":"Black-box Adversarial Attacks with Limited Queries and Information","created":"2018-04-23","cited_by_count":501},{"id":"1809.07599","title":"Sparsified SGD with Memory","created":"2018-09-20","cited_by_count":376},{"id":"1905.10018","title":"Momentum-Based Variance Reduction in Non-Convex SGD","created":"2019-05-24","cited_by_count":306},{"id":"1807.01695","title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator","created":"2018-07-04","cited_by_count":287},{"id":"1705.07878","title":"TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learning","created":"2017-05-22","cited_by_count":256},{"id":"1703.00102","title":"SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient","created":"2017-03-01","cited_by_count":220},{"id":"1610.02132","title":"QSGD: Communication-Efficient SGD via Gradient Quantization and Encoding","created":"2016-10-07","cited_by_count":147},{"id":"1707.03587","title":"Cooperative Game Theory Approaches for Network Partitioning","created":"2017-07-12","cited_by_count":135},{"id":"1507.08752","title":"An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback","created":"2015-07-31","cited_by_count":111},{"id":"1806.05618","title":"Stochastic Variance-Reduced Policy Gradient","created":"2018-06-14","cited_by_count":106},{"id":"1603.05643","title":"Variance Reduction for Faster Non-Convex Optimization","created":"2016-03-17","cited_by_count":72},{"id":"1607.00345","title":"Convergence Rate of Frank-Wolfe for Non-Convex Objectives","created":"2016-07-01","cited_by_count":63},{"id":"1710.10551","title":"Stochastic Zeroth-order Optimization in High Dimensions","created":"2017-10-29","cited_by_count":63},{"id":"1702.07944","title":"Stochastic Variance Reduction Methods for Policy Evaluation","created":"2017-02-25","cited_by_count":58},{"id":"1812.04529","title":"On the Ineffectiveness of Variance Reduced Optimization for Deep Learning","created":"2018-12-11","cited_by_count":48},{"id":"1804.09554","title":"Stochastic Conditional Gradient Methods: From Convex Minimization to Submodular Maximization","created":"2018-04-24","cited_by_count":47},{"id":"1602.02101","title":"Variance-Reduced and Projection-Free Stochastic Optimization","created":"2016-02-05","cited_by_count":40},{"id":"1809.06474","title":"Zeroth-order Nonconvex Stochastic Optimization: Handling Constraints, High-Dimensionality and Saddle-Points","created":"2018-09-17","cited_by_count":37},{"id":"1802.06052","title":"Online Continuous Submodular Maximization","created":"2018-02-16","cited_by_count":35},{"id":"1812.00151","title":"Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification","created":"2018-12-01","cited_by_count":35},{"id":"1708.03949","title":"Gradient Methods for Submodular Maximization","created":"2017-08-13","cited_by_count":33},{"id":"1910.12424","title":"Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback","created":"2019-10-28","cited_by_count":33},{"id":"1402.2092","title":"Near-Optimally Teaching the Crowd to Classify","created":"2014-02-10","cited_by_count":32},{"id":"1910.04322","title":"One Sample Stochastic Frank-Wolfe","created":"2019-10-10","cited_by_count":32},{"id":"1506.06438","title":"Taming the Wild: A Unified Analysis of Hogwild!-Style Algorithms","created":"2015-06-22","cited_by_count":31},{"id":"1606.05615","title":"Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains","created":"2016-06-17","cited_by_count":31},{"id":"1802.08183","title":"Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity","created":"2018-02-22","cited_by_count":31},{"id":"1511.00394","title":"Submodular Functions: from Discrete to Continous Domains","created":"2015-11-02","cited_by_count":25},{"id":"1711.01660","title":"Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap","created":"2017-11-05","cited_by_count":21},{"id":"1411.0541","title":"Distributed Submodular Maximization","created":"2014-11-03","cited_by_count":20},{"id":"1705.07261","title":"Stochastic Recursive Gradient Algorithm for Nonconvex Optimization","created":"2017-05-20","cited_by_count":20},{"id":"1610.07183","title":"How to be Fair and Diverse?","created":"2016-10-23","cited_by_count":18},{"id":"1407.1082","title":"Online Submodular Maximization under a Matroid Constraint with Application to Learning Assignments","created":"2014-07-03","cited_by_count":17},{"id":"1805.07474","title":"Projection-Free Bandit Convex Optimization","created":"2018-05-18","cited_by_count":17},{"id":"1810.03233","title":"Towards Gradient Free and Projection Free Stochastic Optimization","created":"2018-10-08","cited_by_count":15},{"id":"1809.02162","title":"Escaping Saddle Points in Constrained Optimization","created":"2018-09-06","cited_by_count":14},{"id":"1707.04347","title":"Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?","created":"2017-07-13","cited_by_count":13},{"id":"1606.00739","title":"Stochastic Structured Prediction under Bandit Feedback","created":"2016-06-02","cited_by_count":12},{"id":"1708.04783","title":"Non-convex Conditional Gradient Sliding","created":"2017-08-16","cited_by_count":12},{"id":"1805.09480","title":"Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization","created":"2018-05-24","cited_by_count":12},{"id":"1711.01566","title":"Stochastic Submodular Maximization: The Case of Coverage Functions","created":"2017-11-05","cited_by_count":11},{"id":"1811.07591","title":"Deep Frank-Wolfe For Neural Network Optimization","created":"2018-11-19","cited_by_count":11},{"id":"1901.09515","title":"Black Box Submodular Maximization: Discrete and Continuous Settings","created":"2019-01-28","cited_by_count":9},{"id":"1610.05120","title":"Lazifying Conditional Gradient Algorithms","created":"2016-10-17","cited_by_count":8},{"id":"1702.08791","title":"Robust Budget Allocation via Continuous Submodular Functions","created":"2017-02-28","cited_by_count":8},{"id":"1811.06603","title":"Unconstrained Submodular Maximization with Constant Adaptive Complexity","created":"2018-11-15","cited_by_count":8},{"id":"1404.2644","title":"A Distributed Frank-Wolfe Algorithm for Communication-Efficient Sparse Learning","created":"2014-04-09","cited_by_count":7},{"id":"1803.06453","title":"Constrained Deep Learning using Conditional Gradient and Applications in Computer Vision","created":"2018-03-17","cited_by_count":7},{"id":"1904.13389","title":"Categorical Feature Compression via Submodular Optimization","created":"2019-04-30","cited_by_count":7},{"id":"1710.05270","title":"Learning Infinite RBMs with Frank-Wolfe","created":"2017-10-15","cited_by_count":4},{"id":"1712.07495","title":"A Distributed Frank-Wolfe Framework for Learning Low-Rank Matrices with the Trace Norm","created":"2017-12-20","cited_by_count":4},{"id":"1409.6086","title":"Parallel and Distributed Block-Coordinate Frank-Wolfe Algorithms","created":"2014-09-22","cited_by_count":3},{"id":"1603.08616","title":"Submodular Variational Inference for Network Reconstruction","created":"2016-03-29","cited_by_count":2},{"id":"1805.07482","title":"Optimal DR-Submodular Maximization and Applications to Provable Mean Field Inference","created":"2018-05-19","cited_by_count":2},{"id":"1803.04300","title":"Neural Conditional Gradients","created":"2018-03-12","cited_by_count":1},{"id":"1901.07648","title":"Finite-Sum Smooth Optimization with SARAH","created":"2019-01-22","cited_by_count":1}],"next_cursor":null}