activity
20242026
most citedInstance-Conditioned Adaptation for Large-scale Generalization of Neural Routing Solver

2 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing cs.LGShow all

14 papers · 1 filter

cs.LG2026

URS: A Unified Neural Routing Solver for Cross-Problem Zero-Shot Generalization

Changliang Zhou, Canhong Yu, Shunyu Yao +4

Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model. However, existing n…

cs.LG2026

Fine-tuning Large Language Model for Automated Algorithm Design

Fei Liu, Rui Zhang, Xi Lin +2

The integration of large language models (LLMs) into automated algorithm design has shown promising potential. A prevalent approach embeds LLMs within search routines to iterativel…

cs.LG2026

FoMEMO: Towards Foundation Models for Expensive Multi-objective Optimization

Yiming Yao, Fei Liu, Liang Zhao +3

Expensive multi-objective optimization is a prevalent and crucial concern in many real-world scenarios, where sample-efficiency is vital due to the limited evaluations to recover t…

cs.LG2026

Quality-Diversity Optimization as Multi-Objective Optimization

Xi Lin, Ping Guo, Yilu Liu +2

The Quality-Diversity (QD) optimization aims to discover a collection of high-performing solutions that simultaneously exhibit diverse behaviors within a user-defined behavior spac…

cs.LG2026

Few for Many: Tchebycheff Set Scalarization for Many-Objective Optimization

Xi Lin, Yilu Liu, Xiaoyuan Zhang +3

Multi-objective optimization can be found in many real-world applications where some conflicting objectives can not be optimized by a single solution. Existing optimization methods…

cs.LG20262 cited

A Systematic Survey on Large Language Models for Algorithm Design

Fei Liu, Yiming Yao, Ping Guo +9

Algorithm design is crucial for effective problem-solving across various domains. The advent of Large Language Models (LLMs) has notably enhanced the automation and innovation with…