Papers
LAMDA: Two-Phase HPO via Learning Prior from Low-Fidelity Data
Fan Li, Shengbo Wang, Ke Li
Finding One Local Optimum Is Easy—but What About Two?
Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
MOTIF: Multi-strategy Optimization via Turn-based Interactive Framework
Nguyen Viet Tuan Kiet, Tung Dao, Cong Dao Tran et al.
EvoGrad: Evolutionary-Weighted Gradient and Hessian Learning for Black-Box Optimization
Yedidya Kfir, Elad Sarafian, Yoram Louzoun et al.
Approximation Algorithm for Constrained k-Center Clustering: A Local Search Approach
Chaoqi Jia, Longkun Guo, Kewen Liao et al.
USPR: Learning a Unified Solver for Profiled Routing
Chuanbo Hua, Federico Berto, Zhikai Zhao et al.
Pareto-Grid-Guided Large Language Models for Fast and High-Quality Heuristics Design in Multi-Objective Combinatorial Optimization
Ha Minh Hieu, Hung Phan, Tung Duy Doan et al.
Beyond Single-Step Updates: Reinforcement Learning of Heuristics with Limited-Horizon Search
Gal Hadar, Forest Agostinelli, Shahaf S. Shperberg
Improved Streaming Algorithm for Fair k-Center Clustering
Longkun Guo, Zeyu Lin, Chaoqi Jia et al.
Practical, Utilitarian Algorithm Configuration
Devon R. Graham, Eros Rojas Velez, Kevin Leyton-Brown
Improved Fully Dynamic Submodular Maximization Under Matroid Constraints
Yiwei Gao, Jialin Zhang, Zhijie Zhang
A Parallel CPU-GPU Framework for Batching Heuristic Operations in Depth-First Heuristic Search
Ehsan Futuhi, Nathan R. Sturtevant
ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions
Fares Fourati, Mohamed-Slim Alouini, Vaneet Aggarwal
UCPO: A Universal Constrained Combinatorial Optimization Method via Preference Optimization
Zhanhong Fang, Debing Wang, Jinbiao Chen et al.
Meta-Black-Box Optimization with Bi-Space Landscape Analysis and Dual-Control Mechanism for SAEA
Yukun Du, Haiyue Yu, Xiaotong Xie et al.
EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding
Jinchun Du, Bojie Shen, Muhammad Aamir Cheema
Discounted Cuts: A Stackelberg Approach to Network Disruption
Pål Grønås Drange, Fedor Fomin, Petr A. Golovach et al.
Finding Diverse Solutions Parameterized by Cliquewidth
Karolina Drabik, Tomáš Masařík
Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
Benjamin Doerr, Martin S. Krejca, Milan Stanković
Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
Maxim Divilkovskiy, Alexander Gasnikov
Massively Parallel Proof-Number Search for Impartial Games and Beyond
Tomáš Čížek, Martin Balko, Martin Schmid
Parametric Pareto Set Learning for Expensive Multi-Objective Optimization
Ji Cheng, Bo Xue, Qingfu Zhang
Minimum-Cost Network Flow with Dual Predictions
Zhiyang Chen, Hailong Yao, Xia Yin
Parallelizable Riemannian Alternating Direction Method of Multipliers for Non-convex Pose Graph Optimization
Xin Chen, Chunfeng Cui, Deren Han et al.
An Adaptive Configuration-Aware Simulated Annealing for the Maximally Diverse Grouping Problem
Baiyu Chen, Canhui Luo, Junwen Ding et al.