vix.ing · top · new · best · stats · spec

Non-Convex Optimization by Hamiltonian Alternation

2022/06/28 by Anuj Apte, Apte, Anuj, Kunal Marwaha +3 · 1 citation
Computer Science · Physics and Astronomy · #Disordered Systems and Neural Networks (cond-mat.dis-nn) #FOS: Physical sciences #Neural Networks and Reservoir Computing #Quantum Physics (quant-ph) #Quantum many-body systems #Statistical Mechanics (cond-mat.stat-mech) #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.2206.14072

openalex publication_date 2022/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A major obstacle to non-convex optimization is the problem of getting stuck in local minima. We introduce a novel metaheuristic to handle this issue, creating an alternate Hamiltonian that shares minima with the original Hamiltonian only within a chosen energy range. We find that repeatedly minimizing each Hamiltonian in sequence allows an algorithm to escape local minima. This technique is particularly straightforward when the ground state energy is known, and one obtains an improvement even without this knowledge. We demonstrate this technique by using it to find the ground state for instances of a Sherrington-Kirkpatrick spin glass.

Cited by

Related