Co-occurring keywords · papers mentioning both
Papers
Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries
ALT 2024
Augmented Sparsifiers for Generalized Hypergraph Cuts
JMLR 2023
Difference of submodular minimization via DC programming
ICML 2023
Discrete Continuous Optimization Framework for Simultaneous Clustering and Training in Mixture Models
ICML 2023
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity
NeurIPS 2022
Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness
ICML 2022
Stochastic $L^\natural$-convex Function Minimization
NeurIPS 2021
Tracking Regret Bounds for Online Submodular Optimization
AISTATS 2021
Active-set Methods for Submodular Minimization Problems
JMLR 2017
Differentiable Learning of Submodular Models
NeurIPS 2017
Diverse Weighted Bipartite b-Matching
IJCAI 2017
Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization
NeurIPS 2016
Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions
ICML 2015
Provable Submodular Minimization using Wolfe's Algorithm
NeurIPS 2014
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
NeurIPS 2013
Reflection methods for user-friendly submodular optimization
NeurIPS 2013
On fast approximate submodular minimization
NeurIPS 2011
Efficient Minimization of Decomposable Submodular Functions
NeurIPS 2010
SFO: A Toolbox for Submodular Function Optimization
JMLR 2010
Beyond Convexity: Online Submodular Minimization
NeurIPS 2009