Co-occurring keywords · papers mentioning both
Papers
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams
ICML 2018
Fair Division Under Cardinality Constraints
IJCAI 2018
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
ICML 2018
Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint
NeurIPS 2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations
NeurIPS 2018
Optimization for Approximate Submodularity
NeurIPS 2018
Predict and Constrain: Modeling Cardinality in Deep Structured Prediction
ICML 2018
Pseudo-Boolean Constraints from a Knowledge Representation Perspective
IJCAI 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint
NeurIPS 2018
Robust Maximization of Non-Submodular Objectives
AISTATS 2018
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
ICML 2017
On The Projection Operator to A Three-view Cardinality Constrained Set
ICML 2017
Robust Guarantees of Stochastic Greedy Algorithms
ICML 2017
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
ICML 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
NeurIPS 2017
Submodular Optimization under Noise
COLT 2017
Maximization of Approximately Submodular Functions
NeurIPS 2016
Stochastic Variance Reduced Optimization for Nonconvex Sparse Learning
ICML 2016
The Power of Optimization from Samples
NeurIPS 2016
Filtered Search for Submodular Maximization with Controllable Approximation Bounds
AISTATS 2015
Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint
ICML 2014
Distributed Submodular Maximization: Identifying Representative Elements in Massive Data
NeurIPS 2013
Fast Determinantal Point Process Sampling with Application to Clustering
NeurIPS 2013
Submodularity Cuts and Applications
NeurIPS 2009
Deflation Methods for Sparse PCA
NeurIPS 2008