Research map / Learning theory and algorithms / Sample complexity
Matroid Algorithms Under Size-Sensitive Independence Oracles
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Accelerating Matroid Optimization through Fast Imprecise Oracles (NeurIPS 2024 · similarity 0.93)
- Matroid Semi-Bandits in Sublinear Time (ICML 2024 · similarity 0.86)
- Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization (NeurIPS 2024 · similarity 0.85)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 2025 · similarity 0.84)
- The Query Complexity of Local Search in Rounds on General Graphs (NeurIPS 2026 · similarity 0.84)
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.