Guaranteed non-convex optimization: Submodular maximization over continuous domains

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017

Volumn , Issue , 2017, Pages

  Bian, Andrew An ^a   Mirzasoleiman, Baharan ^a   Buhmann, Joachim M ^a   Krause, Andreas ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONVEX OPTIMIZATION; ENERGY EFFICIENCY; FUNCTIONS;

CONTINUOUS DOMAIN; CONTINUOUS FUNCTIONS; CONVEX CONSTRAINTS; FACILITY LOCATIONS; LINEAR CONVERGENCE RATE; NONCONVEX OPTIMIZATION; REAL WORLD SETTING; REVENUE MAXIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 85083938903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (56)

1. Alexander A Ageev and Maxim I Sviridenko. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization, 8(3):307–328, 2004.
2. Zeyuan Allen-Zhu and Elad Hazan. Variance reduction for faster non-convex optimization. arXiv preprint arXiv:1603.05643, 2016.
3. Zeyuan Allen-Zhu and Lorenzo Orecchia. Nearly-linear time positive lp solver with faster convergence rate. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pages 229–236. ACM, 2015.
4. Animashree Anandkumar, Rong Ge, Daniel Hsu, Sham M Kakade, and Matus Telgarsky. Tensor decompositions for learning latent variable models. JMLR, 15(1):2773–2832, 2014.
5. Francis Bach. Submodular functions: from discrete to continous domains. arXiv:1511.00394, 2015.
6. Francis R Bach. Structured sparsity-inducing norms through submodular functions. In NIPS, pages 118–126, 2010.
7. Andrew An Bian, Baharan Mirzasoleiman, Joachim M. Buhmann, and Andreas Krause. Guaranteed non-convex optimization: Submodular maximization over continuous domains. arXiv preprint arXiv:1606.05615, 2016.
8. Jerey Bilmes and Wenruo Bai. Deep submodular functions. arXiv preprint arXiv:1701.08939, 2017.
9. Niv Buchbinder, Moran Feldman, Joseph Seffi Naor, and Roy Schwartz. A tight linear time (1/2)-approximation for unconstrained submodular maximization. In FOCS, pages 649–658. IEEE, 2012.
10. Gruia Cälinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a submodular set function subject to a matroid constraint. In Integer programming and combinatorial optimization, pages 182–196. Springer, 2007.
11. Gruia Cälinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., 40(6):1740–1766, 2011.
12. Abhimanyu Das and David Kempe. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv preprint arXiv:1102.3975, 2011.
13. Josip Djolonga and Andreas Krause. From map to marginals: Variational inference in bayesian submodular models. In NIPS, pages 244–252, 2014.
14. Shahar Dobzinski and Jan Vondrák. From query complexity to computational complexity. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 1107–1116. ACM, 2012.
15. Reza Eghbali and Maryam Fazel. Designing smoothing functions for improved worst-case competitive ratio in online optimization. In NIPS, pages 3279–3287. 2016.
16. Alina Ene and Huy L Nguyen. A reduction for optimizing lattice submodular functions with diminishing returns. arXiv preprint arXiv:1606.08362, 2016.
17. Uriel Feige. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634–652, 1998.
18. Uriel Feige, Vahab S Mirrokni, and Jan Vondrak. Maximizing non-monotone submodular functions. SIAM Journal on Computing, 40(4):1133–1153, 2011.
19. Marguerite Frank and Philip Wolfe. An algorithm for quadratic programming. Naval research logistics quarterly, 3(1-2):95–110, 1956.
20. Satoru Fujishige. Submodular functions and optimization, volume 58. Elsevier, 2005.
21. Jennifer Gillenwater, Alex Kulesza, and Ben Taskar. Near-optimal map inference for determinantal point processes. In Advances in Neural Information Processing Systems, pages 2735–2743, 2012.
22. Daniel Golovin and Andreas Krause. Adaptive submodularity: Theory and applications in active learning and stochastic optimization. Journal of Artificial Intelligence Research, pages 427–486, 2011.
23. Corinna Gottschalk and Britta Peis. Submodular function maximization on the bounded integer lattice. In Approximation and Online Algorithms, pages 133–144. Springer, 2015.
24. Jason Hartline, Vahab Mirrokni, and Mukund Sundararajan. Optimal marketing strategies over social networks. In Proceedings of the 17th international conference on World Wide Web, pages 189–198. ACM, 2008.
25. Daisuke Hatano, Takuro Fukunaga, Takanori Maehara, and Ken-ichi Kawarabayashi. Lagrangian decomposition algorithm for allocating marketing channels. In AAAI, pages 1144–1150, 2015.
26. Elad Hazan, Kfir Y Levy, and Shai Shalev-Swartz. On graduated optimization for stochastic non-convex problems. arXiv preprint arXiv:1503.03712, 2015.
27. Satoru Iwata, Lisa Fleischer, and Satoru Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761–777, 2001.
28. Martin Jaggi. Revisiting frank-wolfe: Projection-free sparse convex optimization. In ICML 2013, pages 427–435, 2013.
29. Majid Janzamin, Hanie Sedghi, and Anima Anandkumar. Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods. CoRR abs/1506.08473, 2015.
30. Sunyoung Kim and Masakazu Kojima. Exact solutions of some nonconvex quadratic optimization problems via sdp and socp relaxations. Computational Optimization and Applications, 26(2):143–154, 2003.
31. Vladimir Kolmogorov. Submodularity on a tree: Unifying l-convex and bisubmodular functions. In Mathematical Foundations of Computer Science, pages 400–411. Springer, 2011.
32. Andreas Krause and Volkan Cevher. Submodular dictionary selection for sparse representation. In ICML, pages 567–574, 2010.
33. Andreas Krause and Daniel Golovin. Submodular function maximization. Tractability: Practical Approaches to Hard Problems, 3:19, 2012.
34. Andreas Krause and Carlos Guestrin. Near-optimal nonmyopic value of information in graphical models. In UAI, pages 324–331, 2005.
35. Dirk P Kroese, Thomas Taimre, and Zdravko I Botev. Handbook of Monte Carlo Methods, volume 706. John Wiley & Sons, 2013.
36. Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. Cost-eective outbreak detection in networks. In ACM SIGKDD international conference on Knowledge discovery and data mining, pages 420–429, 2007.
37. Huan Li and Zhouchen Lin. Accelerated proximal gradient methods for nonconvex programming. In NIPS, pages 379–387, 2015.
38. Hui Lin and Je Bilmes. Multi-document summarization via budgeted maximization of submodular functions. In Annual Conference of the North American Chapter of the Association for Computational Linguistics, pages 912–920, 2010.
39. Hui Lin and Je Bilmes. A class of submodular functions for document summarization. In HLT, 2011.
40. László Lovász. Submodular functions and convexity. In Mathematical Programming The State of the Art, pages 235–257. Springer, 1983.
41. Baharan Mirzasoleiman, Amin Karbasi, Rik Sarkar, and Andreas Krause. Distributed submodular maximization: Identifying representative elements in massive data. In NIPS, pages 2049–2057, 2013.
42. George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. An analysis of approximations for maximizing submodular set functions – i. Mathematical Programming, 14(1):265–294, 1978.
43. Yurii Nesterov and Boris T Polyak. Cubic regularization of newton method and its global performance. Mathematical Programming, 108(1):177–205, 2006.
44. BT Polyak. Gradient methods for the minimisation of functionals. USSR Computational Mathematics and Mathematical Physics, 3(4):864–878, 1963.
45. Sashank J Reddi, Suvrit Sra, Barnabas Poczos, and Alex Smola. Fast stochastic methods for non-smooth nonconvex optimization. arXiv preprint arXiv:1605.06900, 2016.
46. Ajit P Singh, Andrew Guillory, and Je Bilmes. On bisubmodular maximization. In International Conference on Artificial Intelligence and Statistics, pages 1055–1063, 2012.
47. Martin Skutella. Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM, 2001.
48. Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, and Ken-ichi Kawarabayashi. Optimal budget allocation: Theoretical guarantee and efficient algorithm. In ICML, pages 351–359, 2014.
49. Tasuku Soma and Yuichi Yoshida. A generalization of submodular cover via the diminishing return property on the integer lattice. In NIPS, pages 847–855, 2015.
50. Tasuku Soma and Yuichi Yoshida. Maximizing submodular functions with the diminishing return property over the integer lattice. arXiv preprint arXiv:1503.01218, 2015.
51. Suvrit Sra. Scalable nonconvex inexact proximal splitting. In NIPS, pages 530–538, 2012.
52. Maxim Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32(1):41–43, 2004.
53. Donald M Topkis. Minimizing a submodular function on a lattice. Operations research, 26(2):305–321, 1978.
54. Jan Vondrák. Optimal approximation for the submodular welfare problem in the value oracle model. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pages 67–74, 2008.
55. Justin Ward and Stanislav Zivny. Maximizing bisubmodular and k-submodular functions. In SODA 2014, pages 1468–1481, 2014.
56. Laurence A. Wolsey. Maximising real-valued submodular functions: Primal and dual heuristics for location problems. Math. Oper. Res., 7(3):410–425, 1982.