activity
20222026
most citedMonte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization

10 citations · 40 across the 27 of their papers we have counts for

collaborators

27 papers

cs.LG2026

SHSP: Structure-Aware Hierarchical Solution Prediction for Mixed-Integer Linear Programming

Zherong Zhang, Guanlin Li, Chengrui Gao +5

Mixed-Integer Linear Programming (MILP) is a fundamental optimization paradigm in combinatorial optimization and has been widely applied across real-world domains. Due to its NP-ha…

cs.AI2026

Learning Early-to-Final Solution Consistency for MILP Acceleration

Guanlin Li, Chengrui Gao, Chenguang Wang +6

Mixed-Integer Linear Programming (MILP) is a fundamental problem class in operations research and combinatorial optimization, with broad applications to industrial decision-making.…

cs.LG2026

On the Learnability of Offline Model-Based Optimization: A Ranking Perspective

Shen-Huan Lyu, Rong-Xi Tan, Ke Xue +4

Offline model-based optimization (MBO) seeks to discover high-performing designs using only a fixed dataset of past evaluations. Most existing methods rely on learning a surrogate…

cs.AI2025

Best Practices For Empirical Meta-Algorithmic Research: Guidelines from the COSEAL Research Network

Theresa Eimer, Lennart Schäpermeier, André Biedenkapp +15

Empirical research on meta-algorithmics, such as algorithm selection, configuration, and scheduling, often relies on extensive and thus computationally expensive experiments. With…

cs.LG2025

Beyond Token-level Supervision: Unlocking the Potential of Decoding-based Regression via Reinforcement Learning

Ming Chen, Sheng Tang, Rong-Xi Tan +4

Decoding-based regression, which reformulates regression as a sequence generation task, has emerged as a promising paradigm of applying large language models for numerical predicti…

cs.LG2025

Sequential Multi-Agent Dynamic Algorithm Configuration

Chen Lu, Ke Xue, Lei Yuan +4

Dynamic algorithm configuration (DAC) is a recent trend in automated machine learning, which can dynamically adjust the algorithm's configuration during the execution process and r…

cs.LG2025

Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings

Rong-Xi Tan, Ming Chen, Ke Xue +4

The pursuit of universal black-box optimization (BBO) algorithms is a longstanding goal. However, unlike domains such as language or vision, where scaling structured data has drive…

cs.LG2025

Quality-Diversity Red-Teaming: Automated Generation of High-Quality and Diverse Attackers for Large Language Models

Ren-Jian Wang, Ke Xue, Zeyu Qin +7

Ensuring the safety and robustness of large language models (LLMs) is a fundamental challenge and a critical prerequisite for the responsible deployment of artificial intelligence.…

cs.LG2025

Pareto Set Learning for Multi-Objective Reinforcement Learning

Erlong Liu, Yu-Chang Wu, Xiaobin Huang +4

Multi-objective decision-making problems have emerged in numerous real-world scenarios, such as video games, navigation and robotics. Considering the clear advantages of Reinforcem…

cs.LG2024

Monte Carlo Tree Search based Space Transfer for Black-box Optimization

Shukuan Wang, Ke Xue, Lei Song +2

Bayesian optimization (BO) is a popular method for computationally expensive black-box optimization. However, traditional BO methods need to solve new problems from scratch, leadin…

cs.LG2024★ 1 cited

Reinforcement Learning Policy as Macro Regulator Rather than Macro Placer

Ke Xue, Ruo-Tong Chen, Xi Lin +4

In modern chip design, placement aims at placing millions of circuit modules, which is an essential step that significantly influences power, performance, and area (PPA) metrics. R…

cs.LG2024

Offline Model-Based Optimization by Learning to Rank

Rong-Xi Tan, Ke Xue, Shen-Huan Lyu +5

Offline model-based optimization (MBO) aims to identify a design that maximizes a black-box function using only a fixed, pre-collected dataset of designs and their corresponding sc…

math.OC2024★ 1 cited

Neural Solver Selection for Combinatorial Optimization

Chengrui Gao, Haopu Shang, Ke Xue +1

Machine learning has increasingly been employed to solve NP-hard combinatorial optimization problems, resulting in the emergence of neural solvers that demonstrate remarkable perfo…

cs.LG2024

Quality-Diversity with Limited Resources

Ren-Jian Wang, Ke Xue, Cong Guan +1

Quality-Diversity (QD) algorithms have emerged as a powerful optimization paradigm with the aim of generating a set of high-quality and diverse solutions. To achieve such a challen…

cs.LG2024

Offline Multi-Objective Optimization

Ke Xue, Rong-Xi Tan, Xiaobin Huang +1

Offline optimization aims to maximize a black-box objective function with a static dataset and has wide applications. In addition to the objective function being black-box and expe…

cs.LG2024★ 1 cited

Escaping Local Optima in Global Placement

Ke Xue, Xi Lin, Yunqi Shi +3

Placement is crucial in the physical design, as it greatly affects power, performance, and area metrics. Recent advancements in analytical methods, such as DREAMPlace, have demonst…

cs.LG2024★ 1 cited

Reinforced In-Context Black-Box Optimization

Lei Song, Chenxiao Gao, Ke Xue +5

Black-Box Optimization (BBO) has found successful applications in many fields of science and engineering. Recently, there has been a growing interest in meta-learning particular co…

cs.NE2024

Quality-Diversity Algorithms Can Provably Be Helpful for Optimization

Chao Qian, Ke Xue, Ren-Jian Wang

Quality-Diversity (QD) algorithms are a new type of Evolutionary Algorithms (EAs), aiming to find a set of high-performing, yet diverse solutions. They have found many successful a…

cs.LG2023★ 2 cited

Stochastic Bayesian Optimization with Unknown Continuous Context Distribution via Kernel Density Estimation

Xiaobin Huang, Lei Song, Ke Xue +1

Bayesian optimization (BO) is a sample-efficient method and has been widely used for optimizing expensive black-box functions. Recently, there has been a considerable interest in B…

cs.LG2023

Diversity from Human Feedback

Ren-Jian Wang, Ke Xue, Yutong Wang +4

Diversity plays a significant role in many problems, such as ensemble learning, reinforcement learning, and combinatorial optimization. How to define the diversity measure is a lon…

cs.LG2023★ 2 cited

Towards Generalizable Neural Solvers for Vehicle Routing Problems via Ensemble with Transferrable Local Policy

Chengrui Gao, Haopu Shang, Ke Xue +2

Machine learning has been adapted to help solve NP-hard combinatorial optimization problems. One prevalent way is learning to construct solutions by deep neural networks, which has…

cs.LG2023★ 6 cited

Macro Placement by Wire-Mask-Guided Black-Box Optimization

Yunqi Shi, Ke Xue, Lei Song +1

The development of very large-scale integration (VLSI) technology has posed new challenges for electronic design automation (EDA) techniques in chip floorplanning. During this proc…

cs.MA2023★ 3 cited

Fast Teammate Adaptation in the Presence of Sudden Policy Change

Ziqian Zhang, Lei Yuan, Lihe Li +5

In cooperative multi-agent reinforcement learning (MARL), where an agent coordinates with teammate(s) for a shared goal, it may sustain non-stationary caused by the policy change o…

cs.MA2023

Robust multi-agent coordination via evolutionary generation of auxiliary adversarial attackers

Lei Yuan, Zi-Qian Zhang, Ke Xue +6

Cooperative multi-agent reinforcement learning (CMARL) has shown to be promising for many real-world applications. Previous works mainly focus on improving coordination ability via…