Research map / Learning theory and algorithms / Combinatorial and search optimization
Don't Waste Population: Post-Anneal Refinement for Combinatorial Optimization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes recovering value from the discarded replicas of Parallel Quasi-Quantum Annealing (PQQA) by treating them as an implicit elite archive and refining them after annealing, rather than returning a single rounded solution.
Problem
GPU-native combinatorial optimization solvers evolve large populations of relaxed candidates, but their post-processing collapses this population into a single rounded solution, wasting the computation spent on the population.
Approach
The discarded replicas of PQQA form an implicit elite archive containing basin-level information that can be recovered after annealing; an iterative post-anneal refinement procedure exploits this archive.
Experimental setup
Builds on: Parallel Quasi-Quantum Annealing
Closest papers by meaning
- Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling (ICLR 2025 · similarity 0.89)
- Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression (AAAI 2025 · similarity 0.85)
- Efficient Combinatorial Optimization via Heat Diffusion (NeurIPS 2024 · similarity 0.85)
- Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search (AAAI 2025 · similarity 0.84)
- Replay-buffer engineering for noise-robust quantum circuit optimization (NeurIPS 2026 · similarity 0.83)
- Evolution Fine-Tuning: Learning to Discover Across 371 Optimization Tasks (NeurIPS 2026 · 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.