conftrace_

greedy algorithm

242 papers

Explore in graph

Co-occurring keywords

submodular optimization (261) submodular maximization (143) approximation algorithm (630) combinatorial optimization (1039) submodular function (121) approximation guarantee (65) cardinality constraint (71) regret bound (1926) feature selection (649) matroid constraint (50)

Papers

Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection JMLR 2018
Accelerating Greedy Coordinate Descent Methods ICML 2018
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function NAACL 2018
Fast greedy algorithms for dictionary selection with generalized sparsity constraints NIPS 2018
The limits of automatic summarisation according to ROUGE EACL 2017
A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents IJCAI 2017
Fair and Efficient Social Choice in Dynamic Settings IJCAI 2017
On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models JMLR 2017
Guarantees for Greedy Maximization of Non-submodular Functions with Applications ICML 2017
Faster Greedy MAP Inference for Determinantal Point Processes ICML 2017
On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017
Towards Abstractive Multi-Document Summarization Using Submodular Function-Based Framework, Sentence Compression and Merging IJCNLP 2017
Online Summarization via Submodular and Convex Optimization CVPR 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization COLT 2017
Scaling Submodular Maximization via Pruned Submodularity Graphs AISTATS 2017
Scalable Greedy Feature Selection via Weak Submodularity AISTATS 2017
Probabilistic Submodular Maximization in Sub-Linear Time ICML 2017
Robust Guarantees of Stochastic Greedy Algorithms ICML 2017
No Time to Observe: Adaptive Influence Maximization with Partial Feedback IJCAI 2017
Acoustic Data-Driven Lexicon Learning Based on a Greedy Pronunciation Selection Framework INTERSPEECH 2017
Approximate Supermodularity Bounds for Experimental Design NIPS 2017
Elementary Symmetric Polynomials for Optimal Experimental Design NIPS 2017
Subset Selection under Noise NIPS 2017
A Greedy Approach for Budgeted Maximum Inner Product Search NIPS 2017