Submodular functions arise in economics of multi-agent games and in various discrete optimization problems that look like problems facing me, but not so much that I actually have anything useful to say. I am mostly making this note so I remember the connection with implicit layers via convex relaxations.
Balkanski, Eric, and Yaron Singer. 2018a. “Approximation Guarantees for Adaptive Sampling,” 17.
———. 2018b. “The Adaptive Complexity of Maximizing a Submodular Function,” 37.
Djolonga, Josip, and Andreas Krause. 2017. “Differentiable Learning of Submodular Models.” In Proceedings of the 31st International Conference on Neural Information Processing Systems, 1014–24. NIPS’17. Red Hook, NY, USA: Curran Associates Inc.
Krause, Andreas, and Daniel Golovin. 2013. “Submodular Function Maximization.” In Tractability, edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli, and Robert Mateescu, 71–104. Cambridge: Cambridge University Press.
Lovász, L. 1983. “Submodular Functions and Convexity.” In Mathematical Programming The State of the Art: Bonn 1982, edited by Achim Bachem, Bernhard Korte, and Martin Grötschel, 235–57. Berlin, Heidelberg: Springer.
Toriello, Alejandro. n.d. “A Brief Lecture on Submodular Functions,” 8.
Tschiatschek, Sebastian, Aytunc Sahin, and Andreas Krause. 2018. “Differentiable Submodular Maximization.” In Proceedings of the 27th International Joint Conference on Artificial Intelligence, 2731–38. IJCAI’18. Stockholm, Sweden: AAAI Press.
No comments yet. Why not leave one?