Skip to content
Portrait of Thang Duong

Thang Duong

PhD Candidate, Computer Science, University of Arizona

Expected Dec 2026 · Advisor: Prof. Chicheng Zhang · Seeking research engineering and research scientist roles

I study sample-efficient decision making and build research tools across bandits, reinforcement learning, and LLM-assisted workflows.

NeurIPS 2024 first author 2× regret reduction on real mmWave benchmarks ICML 2025 EXAIT workshop author

About

I'm a final-year CS PhD candidate at the University of Arizona, advised by Prof. Chicheng Zhang. My research asks how learning systems can use shared structure to make better decisions with less data. That question connects my work in bandits, reinforcement learning, and LLM-guided exploration.

My work spans proofs and experiments: a NeurIPS 2024 first-author guarantee for representation transfer without task diversity and physics-informed bandits on mmWave benchmarks. In late 2024, I joined three LLM reading groups and brought my RL background to a new question: can LLM-collected data help an agent learn with fewer interactions? That led to an ICML 2025 workshop paper.

I also work with domain scientists to translate research workflows into agent-assisted tools. My role includes gathering requirements, steering implementation, and checking whether the interface and scientific interpretations make sense.

I'm seeking research engineering and research scientist roles where I can investigate new methods, implement and evaluate them, and build tools that researchers can trust.

Selected Research

Published NeurIPS 2024

Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits

Thang Duong, Zhi Wang, Chicheng Zhang

Established a regret guarantee for sequential representation transfer without the standard task-diversity assumption, showing that this assumption is not necessary for the guarantee.

I proposed the exponential-algorithm approach after earlier proof attempts based on Davis-Kahan could not remove task diversity. BOSS learns and transfers a low-rank representation across tasks under an ellipsoid action-set assumption. Its computational cost motivates our follow-up work on efficient methods.

Meta-regret accumulated across the sequence of tasks.
Average regret over the horizon T, across tasks.
PDF arXiv Code
BibTeX
@article{duong2024beyond,
  title   = {Beyond task diversity: provable representation transfer for sequential multitask linear bandits},
  author  = {Duong, Thang and Wang, Zhi and Zhang, Chicheng},
  journal = {Advances in Neural Information Processing Systems},
  volume  = {37},
  pages   = {37791--37822},
  year    = {2024}
}
Published WiOpt 2026

Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications

Hao Qin*, Thang Duong*, Ming F. Li, Chicheng Zhang

2× reduction in beam-alignment regret on the real-world DeepMIMO and DeepSense6G benchmarks, including settings where unimodality or multimodality assumptions break.

We cast mmWave beam alignment as a parametric bandit tied to the Phase-Retrieval structure of the channel and design two algorithms (PR-ETC, PR-GREEDY) that exploit sparse multipath structure without restrictive assumptions on the reward function.

Published ICML 2025 EXAIT Workshop

Improving the Data-efficiency of Reinforcement Learning by Warm-starting with LLM

Thang Duong, Minglai Yang, Chicheng Zhang

Studied whether LLM-collected trajectories can improve the early learning of RL agents in small Gymnasium environments.

LORO uses LLM-generated data to warm-start an RL agent before online training. The workshop paper evaluates the approach on classical MDP benchmarks; the linked repository also contains subsequent experiments.

Working paper

Efficient Algorithms for Lifelong Representation Learning in Linear Bandits Beyond Task Diversity

Thang Duong, et al.

A computationally efficient algorithm (BRESS) that drops the task-diversity assumption and remains polynomial-time via a black-box reduction to online PCA, with adversarial robustness.

By reducing sequential multi-task linear bandits to online principal component analysis, any low-competitive-ratio online-PCA subroutine yields low meta-regret. (Details available upon publication.)

Published RLC 2024

Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms

MJ Azizi, Thang Duong, Yasin Abbasi-Yadkori, András György, Claire Vernade, M. Ghavamzadeh

Meta-learns across a sequence of bandit tasks whose optimal arms lie in a small unknown subset, beating the naive Õ(√(KNT)) baseline.

Via a reduction to bandit submodular maximization, the algorithm exploits shared optimal-arm structure across tasks in both the meta-learning and non-stationary settings.

Regret on the task (meta-learning) experiment.
Regret on the optimal-arm subset experiment.

Interactive: bandit regret

A core theme of my work is sample efficiency: how fast a learner stops paying for exploration. Below, two classic strategies play the same multi-armed bandit live in your browser: UCB (adaptive, logarithmic regret) vs. Explore-Then-Commit (explores, then commits). Drag the sliders to see how the gap between arms and the horizon change the cost of learning. (Illustration simulated here, not paper data.)

UCB Explore-Then-Commit

Publications

  1. Beyond Task Diversity: Provable Representation Transfer for Sequential Multi-Task Linear Bandits

    Thang Duong, Zhi Wang, Chicheng Zhang

    NeurIPS , 2024 [PDF] [arXiv] [Code]

  2. Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications

    Hao Qin*, Thang Duong*, Ming F. Li, Chicheng Zhang

    WiOpt , 2026 [arXiv]

  3. Improving the Data-efficiency of Reinforcement Learning by Warm-starting with LLM

    Thang Duong, Minglai Yang, Chicheng Zhang

    ICML EXAIT Workshop , 2025 [Workshop] [arXiv] [Code]

  4. Efficient Algorithms for Lifelong Representation Learning in Linear Bandits Beyond Task Diversity

    Thang Duong, et al.

    Working paper

  5. Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms

    MJ Azizi, Thang Duong, Yasin Abbasi-Yadkori, András György, Claire Vernade, M. Ghavamzadeh

    RLC , 2024 [PDF] [arXiv] [Code]

  6. Association of MRI-defined Structure Features at Baseline with Knee Pain Trajectories

    S. Liu, X. Sun, Y. Ge, Thang Duong, C.K. Kwoh

    ACR Convergence , 2024 [Link]

  7. Deep Regression for Precise Geometric Dimension Measurement

    Thang Duong, Binh Nguyen Duc, Phuong Le Khac, Ngoc Tu Nguyen, Mai Nguyen Thi Phuong

    J. Korean Soc. Precis. Eng. , 2019 [PDF] [DOI]

  8. Analyzing Seismic Signal using Support Vector Machine for Vehicle Motion Detection

    Thang Duong, Nguyen Thi Phuong Mai

    J. Industrial Networks and Intelligent Systems , 2019 [PDF]

Experience

Aug 2022 – Present

Tucson, AZ

Graduate Research Assistant · University of Arizona

  • Proved a regret guarantee that eliminates the task-diversity assumption for sequential multi-task representation transfer in bandits (NeurIPS 2024, first author).
  • Cut beam-alignment regret 2× on the DeepMIMO and DeepSense6G benchmarks with physics-informed bandit algorithms (cross-team with Prof. Ming Li's ECE lab).
  • Implemented and evaluated an RL warm-start pipeline using LLM-collected trajectories for classical MDPs (ICML 2025 EXAIT Workshop); mentored an undergraduate contributor.

May 2025 – Aug 2025

Chicago, IL

Visiting Student · Toyota Technological Institute at Chicago (TTIC)

  • Studied Process Reward Models (PRMs) for LLM reasoning by framing them within the Actor-Critic framework, toward provably improving PRM-guided search-based policies (with Prof. Chicheng Zhang et al.).

Dec 2019 – Jun 2022

Hanoi, Vietnam

Research Resident · Qualcomm (formerly VinAI Research)

  • Bandit meta-learning: built a modular multi-task bandit codebase leveraging shared structure, with improved sample efficiency across a full experiment suite (RLC 2024). Mentored by Yasin Abbasi-Yadkori, Dinh Phung, and Tung Pham.
  • Prototyped active-learning strategies for domain adaptation and model warm-starting.
  • Investigated Sim-to-Real transfer with a proof-of-concept domain-adaptation method in the CARLA simulator.

May 2018 – Jun 2019

Hanoi, Vietnam

AI Team Leader, Scrum Master · NAL Vietnam JSC

  • Integrated NLP models (intent classification, entity recognition) into Chatops, a commercial business chat interface.
  • Led a team of six to deploy facial-recognition models for a parent–child matching product across six kindergarten locations.

Education

2022 – exp. Dec 2026

Ph.D. in Computer Science

University of Arizona

Advisor: Prof. Chicheng Zhang. Focus: high-dimensional interactive learning with domain-specific inductive biases.

2012 – 2018

B.Eng. in Mechatronics Engineering (Advanced Program)

Hanoi University of Science and Technology

Skills

Research
Reinforcement Learning Multi-armed Bandits Online Learning Representation / Transfer Learning Meta-learning LLM reasoning (RLHF / PRM) Statistics & Optimization
Engineering
Python PyTorch TensorFlow HuggingFace / Transformers RLlib OpenAI Gym CUDA Docker / Linux / Git

Get in touch

I'm looking for research engineering and research scientist roles starting in 2027. The fastest way to reach me is email.

Tucson, AZ (open to relocation, US)