conftrace_

approximation guarantee

65 papers

Explore in graph

Co-occurring keywords

greedy algorithm (242) submodular maximization (143) approximation algorithm (630) submodular optimization (261) cardinality constraint (71) combinatorial optimization (1039) streaming algorithm (131) evolutionary algorithm (264) data summarization (37) k-means clustering (235)

Papers

Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap AISTATS 2018
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection IJCAI 2018
Approximation Guarantees for Adaptive Sampling ICML 2018
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017
Elementary Symmetric Polynomials for Optimal Experimental Design NIPS 2017
On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
An Efficient Streaming Algorithm for the Submodular Cover Problem NIPS 2016
Fast Constrained Submodular Maximization: Personalized Data Summarization ICML 2016
A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NIPS 2016
Secure Approximation Guarantee for Cryptographically Private Empirical Risk Minimization ACML 2016
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets ICML 2015
Distributed Submodular Cover: Succinctly Summarizing Massive Data NIPS 2015
Nonnegative Sparse PCA with Provable Guarantees ICML 2014
Online Clustering with Experts AISTATS 2012