42 citations · 143 across the 33 of their papers we have counts for
33 papers
ActiveDPO: Active Direct Preference Optimization for Sample-Efficient Alignment
Xiaoqiang Lin, Arun Verma, Zhongxiang Dai +3
The recent success in using human preferences to align large language models (LLMs) has significantly improved their performance in various downstream tasks, such as question answe…
Active Human Feedback Collection via Neural Contextual Dueling Bandits
Arun Verma, Xiaoqiang Lin, Zhongxiang Dai +2
Collecting human preference feedback is often expensive, leading recent works to develop principled algorithms to select them more efficiently. However, these works assume that the…
Refining Adaptive Zeroth-Order Optimization at Ease
Yao Shu, Qixin Zhang, Kun He +1
Recently, zeroth-order (ZO) optimization plays an essential role in scenarios where gradient information is inaccessible or unaffordable, such as black-box systems and resource-con…
Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
Arun Verma, Zhongxiang Dai, Xiaoqiang Lin +2
Contextual dueling bandit is used to model the bandit problems, where a learner's goal is to find the best arm for a given context using observed noisy human preference feedback ov…
Data-Centric AI in the Age of Large Language Models
Xinyi Xu, Zhaoxuan Wu, Rui Qiao +16
This position paper proposes a data-centric viewpoint of AI research, focusing on large language models (LLMs). We start by making the key observation that data is instrumental in…
Prompt Optimization with Human Feedback
Xiaoqiang Lin, Zhongxiang Dai, Arun Verma +3
Large language models (LLMs) have demonstrated remarkable performances in various tasks. However, the performance of LLMs heavily depends on the input prompt, which has given rise…
Prompt Optimization with EASE? Efficient Ordering-aware Automated Selection of Exemplars
Zhaoxuan Wu, Xiaoqiang Lin, Zhongxiang Dai +5
Large language models (LLMs) have shown impressive capabilities in real-world applications. The capability of in-context learning (ICL) allows us to adapt an LLM to downstream task…
Robustifying and Boosting Training-Free Neural Architecture Search
Zhenfeng He, Yao Shu, Zhongxiang Dai +1
Neural architecture search (NAS) has become a key component of AutoML and a standard tool to automate the design of deep neural networks. Recently, training-free NAS as an emerging…
Localized Zeroth-Order Prompt Optimization
Wenyang Hu, Yao Shu, Zongmin Yu +5
The efficacy of large language models (LLMs) in understanding and generating natural language has aroused a wide interest in developing prompt-based methods to harness the power of…
Exploiting Correlated Auxiliary Feedback in Parameterized Bandits
Arun Verma, Zhongxiang Dai, Yao Shu +1
We study a novel variant of the parameterized bandits problem in which the learner can observe additional auxiliary feedback that is correlated with the observed reward. The auxili…
Batch Bayesian Optimization for Replicable Experimental Design
Zhongxiang Dai, Quoc Phong Nguyen, Sebastian Shenghong Tay +4
Many real-world experimental design problems (a) evaluate multiple experimental conditions in parallel and (b) replicate each condition multiple times due to large and heteroscedas…
Quantum Bayesian Optimization
Zhongxiang Dai, Gregory Kang Ruey Lau, Arun Verma +3
Kernelized bandits, also known as Bayesian optimization (BO), has been a prevalent method for optimizing complicated black-box reward functions. Various BO algorithms have been the…
Use Your INSTINCT: INSTruction optimization for LLMs usIng Neural bandits Coupled with Transformers
Xiaoqiang Lin, Zhaoxuan Wu, Zhongxiang Dai +5
Large language models (LLMs) have shown remarkable instruction-following capabilities and achieved impressive performances in various applications. However, the performances of LLM…
Source Attribution for Large Language Model-Generated Data
Jingtan Wang, Xinyang Lu, Zitong Zhao +4
The impressive performances of Large Language Models (LLMs) and their immense potential for commercialization have given rise to serious concerns over the Intellectual Property (IP…
Federated Zeroth-Order Optimization using Trajectory-Informed Surrogate Gradients
Yao Shu, Xiaoqiang Lin, Zhongxiang Dai +1
Federated optimization, an emerging paradigm which finds wide real-world applications such as federated learning, enables multiple clients (e.g., edge devices) to collaboratively o…
Training-Free Neural Active Learning with Initialization-Robustness Guarantees
Apivich Hemachandra, Zhongxiang Dai, Jasraj Singh +2
Existing neural active learning algorithms have aimed to optimize the predictive performance of neural networks (NNs) by selecting data for labelling. However, other than a good pr…
FedHQL: Federated Heterogeneous Q-Learning
Flint Xiaofeng Fan, Yining Ma, Zhongxiang Dai +3
Federated Reinforcement Learning (FedRL) encourages distributed agents to learn collectively from each other's experience to improve their performance without exchanging their raw…
Sample-Then-Optimize Batch Neural Thompson Sampling
Zhongxiang Dai, Yao Shu, Bryan Kian Hsiang Low +1
Bayesian optimization (BO), which uses a Gaussian process (GP) as a surrogate to model its objective function, is popular for black-box optimization. However, due to the limitation…
Bayesian Optimization under Stochastic Delayed Feedback
Arun Verma, Zhongxiang Dai, Bryan Kian Hsiang Low
Bayesian optimization (BO) is a widely-used sequential method for zeroth-order optimization of complex and expensive-to-compute black-box functions. The existing BO methods assume…
On Provably Robust Meta-Bayesian Optimization
Zhongxiang Dai, Yizhou Chen, Haibin Yu +2
Bayesian optimization (BO) has become popular for sequential optimization of black-box functions. When BO is used to optimize a target function, we often have access to previous ev…
Federated Neural Bandits
Zhongxiang Dai, Yao Shu, Arun Verma +3
Recent works on neural contextual bandits have achieved compelling performances due to their ability to leverage the strong representation power of neural networks (NNs) for reward…
Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization
Shouri Hu, Haowei Wang, Zhongxiang Dai +2
The expected improvement (EI) is one of the most popular acquisition functions for Bayesian optimization (BO) and has demonstrated good empirical performances in many applications…
Unifying and Boosting Gradient-Based Training-Free Neural Architecture Search
Yao Shu, Zhongxiang Dai, Zhaoxuan Wu +1
Neural architecture search (NAS) has gained immense popularity owing to its ability to automate neural architecture design. A number of training-free metrics are recently proposed…
Differentially Private Federated Bayesian Optimization with Distributed Exploration
Zhongxiang Dai, Bryan Kian Hsiang Low, Patrick Jaillet
Bayesian optimization (BO) has recently been extended to the federated learning (FL) setting by the federated Thompson sampling (FTS) algorithm, which has promising applications su…