arXiv Machine Learning
Enabling Population-Based Architectures for Neural Combinatorial Optimization
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Jul 28
NeurGO: Learning to Generate Elite Candidates for Meta-Black-Box Expensive Optimization
arXiv:2607. 23408v1 Announce Type: new Abstract: Expensive black-box optimization is ubiquitous in science and engineering, where function evaluations are costly and the evaluation budget is limited.
arXiv Machine Learning
1d ago
MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization
MiLoop is a reinforcement‑learning‑based constructive framework for neural combinatorial optimization that propagates selective memory across rollout steps. By fusing current embeddings with historical memory before attention layers and applying adaptive gated updates afterward, it enables a shallow policy to learn dynamic embeddings without external solution labels or search‑space pruning. Experiments on four combinatorial optimization problems show MiLoop consistently generates high‑quality solutions for instances ranging from 100 to 10 million nodes, demonstrating strong generalization.
Hugging Face Trending Papers
Jul 30
SCOPE: Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization
Black-box combinatorial optimization requires systematically identifying high-quality solutions under a limited evaluation budget, yet the unknown objective function provides little guidance for deciding where the search should explore next. We introduce SCOPE, a general framework for Synthetic Conditional Objectives for Policy Evolution in Black-Box Combinatorial Optimization.
arXiv AI
Jun 3
ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
arXiv Machine Learning
Sep 22
Towards Training-free Automatic Proxy Discovery via Large Language Models for Mixed Precision Quantization
arXiv:2512.07419v3 Announce Type: replace Abstract: Mixed-Precision Quantization (MPQ) liberates Deep Neural Networks (DNNs) from the Out-Of-Memory (OOM) bottleneck and has garnered increasing resear...
arXiv Machine Learning
Jul 30
Surrogate assisted diversity estimation in neural ensemble search
arXiv:2607. 26940v1 Announce Type: new Abstract: Ensembles are a standard way to improve the performance and robustness of deep neural networks, but their effectiveness crucially depends on both the quality and the diversity of individual models.