Research map / Learning theory and algorithms / Combinatorial and search optimization
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
Kaito Fujii
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use non-oblivious local search instead of oblivious local search | Sparse regression, n=200 · Synthetic sparse regression, n=200 | running time: approximately 10 times faster | Improved |
| Use non-oblivious local search instead of oblivious local search | Sparse regression, n=200 · Synthetic sparse regression, n=200 | R^2 | No clear effect |
| Use non-oblivious local search instead of random residual greedy | Sparse regression · Synthetic sparse regression, n=200 | R^2 | Improved |
| Use non-oblivious local search instead of the benchmarks | Sparse regression · Synthetic sparse regression, n=1000 | R^2 | Improved |
| Use non-oblivious local search instead of modular approximation | Graphical model structure learning · Ising models, |V|=10 | running time | No clear effect |
| Use non-oblivious local search instead of modular approximation | Graphical model structure learning · Ising models, |V|=10 | objective ratio | Improved |
| Use non-oblivious local search instead of the benchmarks | Graphical model structure learning · Ising models, |V|=20 | objective ratio | Improved |
Closest papers by meaning
- Finding One Local Optimum Is Easy—but What About Two? (AAAI 2026 · similarity 0.88)
- Optimizing Discrete Spaces via Expensive Evaluations: A Learning to Search Framework (AAAI 2020 · similarity 0.87)
- Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems (NeurIPS 2024 · similarity 0.86)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · similarity 0.86)
- The Query Complexity of Local Search in Rounds on General Graphs (NeurIPS 2026 · similarity 0.85)
- Finding Simple Proofs for First-Order Optimization (NeurIPS 2026 · similarity 0.85)
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.
