← Search

Xiang Shu

7 accepted papers

2026

Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension

IJCAI 2026

Bayesian optimization is widely employed for optimizing complex black-box functions but struggles with the curse of dimensionality. Random embedding, as a dimension reduction strategy, simplifies tasks that possess the effective dimension by optimizing within a low-dimensional subspace. However, det

Cited by 0Scholar
2026

Diversity-Driven Offline Multi-Objective Optimization via Bi-Level Pareto Set Learning

ICML 2026poster

Multi-objective optimization (MOO) has emerged as a powerful approach to solving complex optimization problems involving multiple objectives. In many practical scenarios, function evaluations are unavailable or prohibitively expensive, necessitating optimization solely based on a fixed offline datas…

Cited by 0SourceScholar
2025

LLMOPT: Learning to Define and Solve General Optimization Problems from Scratch

ICLR 2025poster

Optimization problems are prevalent across various scenarios. Formulating and then solving optimization problems described by natural language often requires highly specialized human expertise, which could block the widespread application of optimization-based decision making. To automate problem fo…

2025

LaMP-Val: Large Language Models Empower Personalized Valuation in Auction

EMNLP 2025

Auctions are a vital economic mechanism used to determine the market value of goods or services through competitive bidding within a specific framework. However, much of the current research primarily focuses on the bidding algorithms used within auction mechanisms. This often neglects the potential

2025

Relation-Augmented Dueling Bayesian Optimization via Preference Propagation

IJCAI 2025

In black-box optimization, when directly evaluating the function values of solutions is very costly or infeasible, access to the objective function is often limited to comparing pairs of solutions, which yields dueling black-box optimization. Dueling optimization is solely based on pairwise preferen

2025

SOO-Bench: Benchmarks for Evaluating the Stability of Offline Black-Box Optimization

ICLR 2025poster

Black-box optimization aims to find the optima through building a model close to the black-box objective function based on function value evaluation. However, in many real-world tasks, such as the design of molecular formulas and mechanical structures, it is perilous, costly, or even infeasible to e…

2023

High-Dimensional Dueling Optimization with Preference Embedding

AAAI 2023technical

In many scenarios of black-box optimization, evaluating the objective function values of solutions is expensive, while comparing a pair of solutions is relatively cheap, which yields the dueling black-box optimization. The side effect of dueling optimization is that it doubles the dimension of solut…