Fetching the paper…
Reading the bibliography…
This paper considers stochastic optimization problems for a large class of objective functions, including convex and continuous submodular.
A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions–I
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
On Cezari’s convergence of the steepest descent method for approximating saddle point of convex-concave functions
Arkadi Nemirovski and D Yudin · 1978
Earlier work this paper cites.
Feasible direction methods for stochastic programming problems
Andrzej Ruszczyński · 1980
Earlier work this paper cites.
Maximizing submodular set functions: formulations and analysis of algorithms
G. L. Nemhauser and L. A. Wolsey · 1981
Earlier work this paper cites.
An analysis of the greedy algorithm for the submodular set covering problem
Laurence A Wolsey · 1982
Earlier work this paper cites.
Submodular functions and convexity
László Lovász · 1983
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadii Nemirovskii, David Borisovich Yudin, and Edgar Ronald Dawson · 1983
Earlier work this paper cites.
Adaptive signal processing algorithms: stability and performance
Victor Solo and Xuan Kong · 1994
Earlier work this paper cites.
Neuro-dynamic programming , volume 3 of Optimization and neural computation series
Dimitri P. Bertsekas and John N. Tsitsiklis · 1996
Earlier work this paper cites.
A threshold of ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
Submodular functions and optimization , volume 58
Satoru Fujishige · 2005
Earlier work this paper cites.
Adwords and generalized online matching
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, and Vijay V. Vazirani · 2007
Earlier work this paper cites.
Submodularity in combinatorial optimization
Jan Vondrák · 2007
Earlier work this paper cites.
Exponentiated gradient algorithms for conditional random fields and max-margin markov networks
Michael Collins, Amir Globerson, Terry Koo, Xavier Carreras, and Peter L Bartlett · 2008
Earlier work this paper cites.
Adaptive filter theory
Simon S Haykin · 2008
Earlier work this paper cites.
A merit function approach to the subgradient method with averaging
Andrzej Ruszczyński · 2008
Earlier work this paper cites.
Optimal approximation for the submodular welfare problem in the value oracle model
Jan Vondrák · 2008
Earlier work this paper cites.
Lectures on stochastic programming: modeling and theory
Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczyński · 2009
Cited alongside, same era.
Large-scale machine learning with stochastic gradient descent
Léon Bottou · 2010
Cited alongside, same era.
Ergodic stochastic optimization algorithms for wireless communication and networking
Alejandro Ribeiro · 2010
Cited alongside, same era.
Submodularity and curvature : The optimal algorithm (combinatorial optimization and discrete algorithms)
Jan Vondrák · 2010
Cited alongside, same era.
Maximizing a monotone submodular function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2011
Cited alongside, same era.
Maximizing non-monotone submodular functions
Uriel Feige, Vahab S Mirrokni, and Jan Vondrak · 2011
On multiplicative weight updates for concave and submodular function maximization
Chandra Chekuri, TS Jayram, and Jan Vondrák · 2015
Later among the works it cites.
Global convergence of online limited memory BFGS
Aryan Mokhtari and Alejandro Ribeiro · 2015
Later among the works it cites.
Optimal approximation for submodular and supermodular optimization with bounded curvature
Maxim Sviridenko, Jan Vondrák, and Justin Ward · 2015
Later among the works it cites.
Constrained submodular maximization via a non-symmetric technique
Niv Buchbinder and Moran Feldman · 2016
Later among the works it cites.
Designing smoothing functions for improved worst-case competitive ratio in online optimization
Reza Eghbali and Maryam Fazel · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A unified continuous greedy algorithm for submodular maximization
Moran Feldman, Joseph Naor, and Roy Schwartz · 2011
Cited alongside, same era.
A submodular function minimization algorithm based on the minimum-norm base
Satoru Fujishige and Shigueo Isotani · 2011
Cited alongside, same era.
Submodular maximization by simulated annealing
Shayan Oveis Gharan and Jan Vondrák · 2011
Cited alongside, same era.
Online matching with concave returns
Nikhil R. Devanur and Kamal Jain · 2012
Cited alongside, same era.
Projection-free online learning
Elad Hazan and Satyen Kale · 2012
Cited alongside, same era.
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Cited alongside, same era.
Alina Ene and Huy L. Nguyen · 2016
Later among the works it cites.
Variance-reduced and projection-free stochastic optimization
Elad Hazan and Haipeng Luo · 2016
Later among the works it cites.
Introduction to online convex optimization
Elad Hazan et al · 2016
Later among the works it cites.
Fast constrained submodular maximization: Personalized data summarization
Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, and Amin Karbasi · 2016
Later among the works it cites.
Stochastic Frank-Wolfe methods for nonconvex optimization
Sashank J Reddi, Suvrit Sra, Barnabás Póczos, and Alex Smola · 2016
Later among the works it cites.
A parallel decomposition method for nonconvex stochastic multi-agent optimization problems
Yang Yang, Gesualdo Scutari, Daniel P. Palomar, and Marius Pesavento · 2016
Later among the works it cites.
Non-monotone continuous dr-submodular maximization: Structure and algorithms
Andrew An Bian, Kfir Yehuda Levy, Andreas Krause, and Joachim M. Buhmann · 2017
Later among the works it cites.
Guaranteed non-convex optimization: Submodular maximization over continuous domains
Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann, and Andreas Krause · 2017
Later among the works it cites.
Greed is good: Near-optimal submodular maximization via greedy optimization
Moran Feldman, Christopher Harshaw, and Amin Karbasi · 2017
Later among the works it cites.
Gradient methods for submodular maximization
Hamed Hassani, Mahdi Soltanolkotabi, and Amin Karbasi · 2017
Later among the works it cites.
Stochastic submodular maximization: The case of coverage functions
Mohammad Karimi, Mario Lucic, Hamed Hassani, and Andreas Krause · 2017
Later among the works it cites.
Large-scale nonconvex stochastic optimization by doubly stochastic successive convex approximation
Aryan Mokhtari, Alec Koppel, Gesualdo Scutari, and Alejandro Ribeiro · 2017
Later among the works it cites.
Robust budget allocation via continuous submodular functions
Matthew Staib and Stefanie Jegelka · 2017
Later among the works it cites.
Probabilistic submodular maximization in sub-linear time
Serban Stan, Morteza Zadimoghaddam, Andreas Krause, and Amin Karbasi · 2017
Later among the works it cites.