No article text was recorded for this version.
empirical-theoretical performance gap
Version 1 of 132 papers36 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Maximizing submodular functions under submodular constraints
- Blog: Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint
- Blog: Instance Specific Approximations for Submodular Maximization
- Blog: Instance Specific Approximations for Submodular Maximization
- Blog: Budget-Smoothed Analysis for Submodular Maximization
- Blog: Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity
- Blog: Submodularity Cuts and Applications
- Blog: Non-monotone Continuous DR-submodular Maximization: Structure and Algorithms
- Blog: Equilibrium Computation and Robust Optimization in Zero Sum Games With Submodular Structure
- Blog: Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio
- Blog: Composable Coresets for Determinant Maximization: Greedy is Almost Optimal
- Blog: Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection
- Blog: Submodular Optimization Over Sliding Windows
- Blog: On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
- Blog: A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
- Blog: Streaming Weak Submodularity: Interpreting Neural Networks on the Fly
- Blog: A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity
- Blog: Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
- Blog: Coordinating monetary contributions in participatory budgeting
- Blog: Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
- Blog: Guarantees for Greedy Maximization of Non-submodular Functions with Applications
- Blog: Online Non-Monotone DR-Submodular Maximization
- Blog: Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression
- Blog: Performance guarantees for greedy maximization of non-submodular controllability metrics
- Blog: "Bring Your Own Greedy"+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack
- Blog: Performance-Guaranteed Solutions for Multi-Agent Optimal Coverage Problems using Submodularity, Curvature, and Greedy Algorithms
- Blog: Near optimality of greedy strategies for string submodular functions with forward and backward curvature constraints
- Blog: Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions
- Blog: On Greedy Maximization of Entropy
- Blog: Improving Information Centrality of a Node in Complex Networks by Adding Edges
- Blog: Smooth Interactive Submodular Set Cover
- Blog: Optimal composition of heterogeneous multi-agent teams for coverage problems with performance bound guarantees
History & citation
Current · Permanent link
- This direction split from Beyond Worst Case Bounds for Submodular Maximization (84% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_empirical_theoretical_performance_gap_6c6a97bc,
title = {empirical-theoretical performance gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/empirical-theoretical-performance-gap/rdr_6c6a97bcc6ff480f9e8e300e0d9b3b16},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_empirical_theoretical_performance_gap_6c6a97bc_v1,
title = {empirical-theoretical performance gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/empirical-theoretical-performance-gap/rdr_6c6a97bcc6ff480f9e8e300e0d9b3b16/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}