Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kai-Jie Lin

dblp:408/7825 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Optimization for machine learning · 87% Reinforcement learning · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.912025
BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL · ICLR 2025
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
multi-objective bayesian optimization
0.912025
BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL · ICLR 2025
Machine learning › Reinforcement learning › deep reinforcement learning
deep q-learning
0.312025
BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL · ICLR 2025

Methods — techniques the papers use, named apart from their topics

transformer · 0.9sequence modeling · 0.9
YearPublicationVenuePosition
2025 BOFormer: Learning to Solve Multi-Objective Bayesian Optimization via Non-Markovian RL
abstract
Bayesian optimization (BO) offers an efficient pipeline for optimizing black-box functions with the help of a Gaussian process prior and an acquisition function (AF). Recently, in the context of single-objective BO, learning-based AFs witnessed promising empirical results given its favorable non-myopic nature. Despite this, the direct extension of these approaches to multi-objective Bayesian optimization (MOBO) suffer from the hypervolume identifiability issue, which results from the non-Markovian nature of MOBO problems. To tackle this, inspired by the non-Markovian RL literature and the success of Transformers in language modeling, we present a generalized deep Q-learning framework and propose BOFormer, which substantiates this framework for MOBO via sequence modeling. Through extensive evaluation, we demonstrate that BOFormer constantly achieves better performance than the benchmark rule-based and learning-based algorithms in various synthetic MOBO and real-world multi-objective hyperparameter optimization problems.
Yu-Heng Hung, Kai-Jie Lin, Yu-Heng Lin, Chien-Yi Wang, Ping-Chun Hsieh
ICLR2