arXiv AI By Jiayu Chen, Chentong Chen, Yuhan Liu, Ye Fan, Jianyong Sun, Jialong Shi

Evo-B&B: Behavior-Aware LLM-Guided Joint Evolution of Branching and Node Selection Policies for MILP

Read the original on arXiv AI →

Evo-B&B is a new evolutionary framework that jointly evolves branching and node selection policies for Mixed-Integer Linear Programming (MILP) using large language model guidance and end-to-end SCIP solving feedback. It introduces a behavior-aware multi-island mechanism that measures policy similarity based on branching and node-selection behaviors to preserve population diversity and reduce redundant evaluations. Experiments on four standard MILP benchmarks show that Evo-B&B achieves competitive solving performance, generalizes to larger instances, and that joint evolution and behavior-aware diversity management are effective.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Hugging Face Trending Papers
5d ago

Holistic Diversity Management in LLM-Guided Evolutionary Search

The paper introduces HoliDivEvolve, a holistic strategy for maintaining diversity in LLM-guided evolutionary search. It employs diverse initialization, trajectory‑adaptive island selection, and growth‑adaptive migration to ensure distinct search directions and effective knowledge sharing across islands. Experiments on varied benchmarks demonstrate competitive performance and provide controlled analyses of the design choices.

arXiv AI
5d ago

Repulsive Population Policy Gradients for Behaviorally Diverse Reinforcement Learning

The paper introduces RePPO, a method that adapts Proximal Policy Optimization to jointly optimize a compact population of diverse, high‑quality policies using a population‑dependent, dynamically shaped reward. RePPO achieves a strong quality‑diversity tradeoff on standard continuous‑control tasks and scales to larger policy and behavior spaces, maintaining quality while significantly increasing diversity in pixel‑based tasks. The authors also demonstrate RePPO’s applicability to fine‑tuning large language models, showing for the first time that quality‑diversity reinforcement learning can scale to this domain.

By Saeed Hedayatian, Harsh Shah, Celine Mneimneh, Stefanos Nikolaidis
arXiv AI
Jul 22

MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers

arXiv:2607. 18252v1 Announce Type: new Abstract: Machine learning methods have shown that data-driven policies can accelerate mixed-integer linear programming (MILP) solvers, but many such approaches remain difficult to inspect, adapt, and deploy because the learned policy is represented as an external predictor or other opaque model.

By Jinbiao Nie, Kewei Feng, Xiaoyuan Zhang, Shan Yin, Zizhuo Wang, Bin Dong
arXiv AI
Oct 15

TurboEvolve: Towards Fast and Robust LLM-Driven Program Evolution

TurboEvolve is a multi‑island evolutionary framework that enhances LLM‑driven program evolution by improving sample efficiency and stability within fixed API‑cost budgets. It introduces Verbalized Sampling to generate multiple diverse candidates in a single LLM call, an adaptive scheduler that adjusts the number of offspring based on progress, and island‑aware initialization that clusters seed programs and mixes subpopulations with elitist preservation. The authors also provide a reusable cross‑task solution‑pool dataset and demonstrate that TurboEvolve achieves better cost‑quality trade‑offs and more stable performance on mathematical discovery and GPU‑kernel optimization tasks compared to controlled baselines.

By Yang Yang, Zining Zhong, Jindong Li, Jiemin Wu, Kaishen Yuan, Wenshuo Chen, Menglin Yang, Yutao Yue