25 citations · 50 across the 14 of their papers we have counts for
9 papers · 1 filter
Hybrid Cross-domain Robust Reinforcement Learning
Linh Le Pham Van, Minh Hoang Nguyen, Hung Le +2
Robust reinforcement learning (RL) aims to learn policies that remain effective despite uncertainties in its environment, which frequently arise in real-world applications due to v…
High-Dimensional Bayesian Optimization via Random Projection of Manifold Subspaces
Quoc-Anh Hoang Nguyen, The Hung Tran
Bayesian Optimization (BO) is a popular approach to optimizing expensive-to-evaluate black-box functions. Despite the success of BO, its performance may decrease exponentially as t…
Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs
Vu Viet Hoang, Quoc Anh Hoang Nguyen, Hung Tran The
Bayesian Optimization (BO) is a widely-used method for optimizing expensive-to-evaluate black-box functions. Traditional BO assumes that the learner has full control over all query…
Policy Learning for Off-Dynamics RL with Deficient Support
Linh Le Pham Van, Hung The Tran, Sunil Gupta
Reinforcement Learning (RL) can effectively learn complex policies. However, learning these policies often demands extensive trial-and-error interactions with the environment. In m…
PINN-BO: A Black-box Optimization Algorithm using Physics-Informed Neural Networks
Dat Phan-Trong, Hung The Tran, Alistair Shilton +1
Black-box optimization is a powerful approach for discovering global optima in noisy and expensive black-box functions, a problem widely encountered in real-world scenarios. Recent…
Neural-BO: A Black-box Optimization Algorithm using Deep Neural Networks
Dat Phan-Trong, Hung Tran-The, Sunil Gupta
Bayesian Optimization (BO) is an effective approach for global optimization of black-box functions when function evaluations are expensive. Most prior works use Gaussian processes…
Neural Collapse in Deep Linear Networks: From Balanced to Imbalanced Data
Hien Dang, Tho Tran, Stanley Osher +3
Modern deep neural networks have achieved impressive performance on tasks from image classification to natural language processing. Surprisingly, these complex systems with massive…
Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
Hung Tran-The, Sunil Gupta, Santu Rana +1
The expected improvement (EI) algorithm is one of the most popular strategies for optimization under uncertainty due to its simplicity and efficiency. Despite its popularity, the t…
Bayesian Optimistic Optimisation with Exponentially Decaying Regret
Hung Tran-The, Sunil Gupta, Santu Rana +1
Bayesian optimisation (BO) is a well-known efficient algorithm for finding the global optimum of expensive, black-box functions. The current practical BO algorithms have regret bou…