Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy?

Keyphrases

• Submodular Maximization 100%
• Cardinality Constraint 100%
• Submodularity 100%
• Greedy 100%
• Submodular Function 66%
• Combinatorial Structure 33%
• Approximation Ratio 33%
• Learning Communities 33%
• Greedy Algorithm 33%
• Set Function 33%
• Machine Learning 33%
• Approximation Guarantee 33%
• Real-world Problems 33%
• Approximation Results 33%
• Constrained Optimization Problem 33%
• Matroid Constraint 33%
• Site Detection 33%
• Restricted Strong Convexity 33%
• Video Summarization 33%
• Sparse Reconstruction 33%
• Detection Boxes 33%
• Splice Site 33%
• Machine Learning Applications 33%
• Strong Connection 33%
• Black-box Interpretation 33%
• Parameters Measuring 33%

Mathematics

• Cardinality 100%
• Black Box 100%
• Combinatorial Structure 100%
• Greedy Algorithm 100%
• Set Function 100%
• Constrained Optimization Problem 100%
• World Problems 100%
• Matroid 100%
• Randomization 100%

Computer Science

• Approximation (Algorithm) 100%
• Cardinality 100%
• Machine Learning 100%
• Learning System 100%
• Approximation Ratio 50%
• Experimental Result 50%
• Optimization Problem 50%
• Video Summarization 50%
• Real-World Problem 50%
• Constrained Optimization 50%
• Greedy Algorithm 50%
• Learning Community 50%