Robust Guarantees of Stochastic Greedy Algorithms

No abstract is available for this paper.

• Publication year

  2017

• Venue

  International Conference on Machine Learning

• Publication date

  2017-07-17

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Leveraging Sparsity for Efficient Submodular Data Summarization

  2017influential reference
• Submodular Optimization under Noise

  2016cited by this paper
• Data Summarization with Social Contexts

  2016cited by this paper
• Horizontally Scalable Submodular Maximization

  2016cited by this paper
• Large-scale Submodular Greedy Exemplar Selection with Structured Similarity Matrices

  2016influential reference
• On Greedy Maximization of Entropy

  2015influential reference
• Gaussian quadrature for matrix inverse forms with applications

  2015influential reference
• Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization

  2015cited by this paper
• Lazier Than Lazy Greedy

  2014influential reference
• {SNAP Datasets}: {Stanford} Large Network Dataset Collection

  2014cited by this paper
• Movie recommender system for profit maximization

  2013cited by this paper
• A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint

  2012cited by this paper
• Optimal approximation for the submodular welfare problem in the value oracle model

  2008cited by this paper
• Best Algorithms for Approximating the Maximum of a Submodular Set Function

  1978influential reference
• An analysis of approximations for maximizing submodular set functions—I

  1978influential reference

• Randomized Greedy Methods for Weak Submodular Sensor Selection with Robustness Considerations

  2024cites this paper
• Linear Submodular Maximization with Bandit Feedback

  2024cites this paper
• Greedy optimization of resistance-based graph robustness with global and local edge insertions

  2023cites this paper
• Randomized Greedy Algorithms for Sensor Selection in Large-Scale Satellite Constellations

  2023cites this paper
• Faster Greedy Optimization of Resistance-based Graph Robustness

  2022cites this paper
• Robust Subset Selection by Greedy and Evolutionary Pareto Optimization

  2022cites this paper
• Sublinear time algorithms for greedy selection in high dimensions

  2022cites this paper
• Stochastic-Lazier-Greedy Algorithm for monotone non-submodular maximization

  2021cites this paper
• The Adaptive Complexity of Maximizing a Gross Substitutes Valuation

  2020cites this paper
• Good Feature Matching: Toward Accurate, Robust VO/VSLAM With Low Latency

  2020cites this paper
• Improving the Applicability of Visual SLAM with Submodular Submatrix Selection

  2020cites this paper
• Attackability Characterization of Adversarial Evasion Attack on Discrete Data

  2020cites this paper
• Good Graph to Optimize: Cost-Effective, Budget-Aware Bundle Adjustment in Visual SLAM

  2020cites this paper
• Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time

  2020cites this paper
• Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint

  2019cites this paper
• The FAST Algorithm for Submodular Maximization

  2019cites this paper
• Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection

  2018cites this paper