Research map / Optimization / Nonconvex and smooth optimization
ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions
Fares Fourati, Mohamed-Slim Alouini, Vaneet Aggarwal
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 |
|---|---|---|---|
| add Worst-m memory (compare candidates against only the m worst points) (ablation) | ECP · 12 benchmark functions | acceptance-test cost: roughly 4--5x reduction | Improved |
| use small m in {8,16,32,64,128} instead of full memory (ablation) | ECPv2 · Himmelblau, Holder and ten other functions | final best value | No clear effect |
| increase m toward full memory (ablation) | ECPv2 · benchmark functions | performance and runtime | No clear effect |
| add adaptive lower bound to avoid empty acceptance regions (ablation) | ECP · low evaluation budgets | runtime: roughly 2x faster | Improved |
| combine random projection with Worst-m rule (ablation) | ECPv2 · Rosenbrock d=500 | runtime | Improved |
| replace ECP with ECPv2 on high-dimensional problems | ECP · Rosenbrock d=500, Powell d=1000 | convergence speed and score: roughly 2x faster | Improved |
| increase beta from 0.05 to 5 in projection dimension bound (ablation) | ECPv2 random projection · 100 points in R^1000, delta=0.5 | distance preservation | Improved |
Closest papers by meaning
- Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods (ICLR 2025 · similarity 0.85)
- Cumulative Regret Analysis of the Piyavskii–Shubert Algorithm and Its Variants for Global Optimization (AAAI 2024 · similarity 0.84)
- Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization (NeurIPS 2024 · similarity 0.84)
- Pointwise Lipschitz Continuous Graph Algorithms (NeurIPS 2026 · similarity 0.83)
- Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity (NeurIPS 2025 · similarity 0.83)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 2024 · similarity 0.83)
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.
