Quanlin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Quanlin Chen has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Jing Huo
Nanjing University
2 shared publications - Tianyu Ding
Applied Sciences Group, Microsoft Corporation, Redmond, WA, USA
2 shared publications - Yang Gao
Nanjing University
2 shared publications - Yiyu Chen
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China
2 shared publications - Dong Li
Huawei Noah's Ark Lab
1 shared publication - Xu He
Noah’s Ark Laboratory
1 shared publication
Latest Publications
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 3058-3065
Enhancing Trust-Region Bayesian Optimization via Newton Methods
Bayesian Optimization (BO) has been widely applied to optimize expensive black-box functions while retaining sample efficiency. However, scaling BO to high-dimensional spaces remains challenging. Existing literature proposes performing standard BO in multiple local trust regions (TuRBO) for heterogeneous modeling of the objective function and avoiding over-exploration. Despite its advantages, using local Gaussian Processes (GPs) reduces sampling efficiency compared to a global GP. To enhance sampling efficiency while preserving heterogeneous modeling, we propose to construct multiple local quadratic models using gradients and Hessians from a global GP, and select new sample points by solving the bound-constrained quadratic program. Additionally, we address the issue of vanishing gradients of GPs in high-dimensional spaces. We provide a convergence analysis and demonstrate through experimental results that our method enhances the efficacy of TuRBO and outperforms a wide range of high-dimensional BO techniques on synthetic functions and real-world applications.
- 21 October 2025
- Published by IOS Press
- p. 3058-3065
Open AccessEnhancing Trust-Region Bayesian Optimization via Newton Methods
Bayesian Optimization (BO) has been widely applied to optimize expensive black-box functions while retaining sample efficiency. However, scaling BO to high-dimensional spaces remains challenging. Existing literature proposes performing standard BO in multiple local trust regions (TuRBO) for heterogeneous modeling of the objective function and avoiding over-exploration. Despite its advantages, using local Gaussian Processes (GPs) reduces sampling efficiency compared to a global GP. To enhance sampling efficiency while preserving heterogeneous modeling, we propose to construct multiple local quadratic models using gradients and Hessians from a global GP, and select new sample points by solving the bound-constrained quadratic program. Additionally, we address the issue of vanishing gradients of GPs in high-dimensional spaces. We provide a convergence analysis and demonstrate through experimental results that our method enhances the efficacy of TuRBO and outperforms a wide range of high-dimensional BO techniques on synthetic functions and real-world applications.
- Open Access
An Overview and Comparison of Traditional Motion Planning Based on Rapidly Exploring Random Trees
Motion planning is a fundamental problem in robotics that involves determining feasible or optimal paths within finite time. While complete motion planning algorithms are guaranteed to converge to a path solution in finite time, they are proven to be computationally inefficient, making them unsuitable for most practical problems. Resolution-complete algorithms, on the other hand, ensure completeness only if the resolution parameter is sufficiently fine, but they suffer severely from the curse of dimensionality. In contrast, sampling-based algorithms, such as Rapidly Exploring Random Trees (RRT) and its variants, have gained the increasing attention of researchers due to their computational efficiency and effectiveness, particularly in high-dimensional problems. This review paper introduces RRT-based algorithms and provides an overview of their key methodological aspects.
Open AccessAn Overview and Comparison of Traditional Motion Planning Based on Rapidly Exploring Random Trees
Motion planning is a fundamental problem in robotics that involves determining feasible or optimal paths within finite time. While complete motion planning algorithms are guaranteed to converge to a path solution in finite time, they are proven to be computationally inefficient, making them unsuitable for most practical problems. Resolution-complete algorithms, on the other hand, ensure completeness only if the resolution parameter is sufficiently fine, but they suffer severely from the curse of dimensionality. In contrast, sampling-based algorithms, such as Rapidly Exploring Random Trees (RRT) and its variants, have gained the increasing attention of researchers due to their computational efficiency and effectiveness, particularly in high-dimensional problems. This review paper introduces RRT-based algorithms and provides an overview of their key methodological aspects.
- 7 September 2024
- Published by Springer Nature
- p. 356-373
Re-examining Supervised Dimension Reduction for High-Dimensional Bayesian Optimization
- 7 September 2024
- Published by Springer Nature
- p. 356-373
Re-examining Supervised Dimension Reduction for High-Dimensional Bayesian Optimization