I’m a Ph.D. candidate in Department of Civil and Environmental Engineering and Center for Scientific Computation at The Hong Kong University of Science and Technology, under the supervision of Prof. Sen Li. I’m also a research intern in Keeta at Meituan (Beidou Talent Program), mentored by Haolin Yang and Huanyu Zheng. My current research focuses on operations research for intelligent transportation, leveraging MARL and LLMs.
I received my B.Eng. degree from School of Computer Science and Engineering at Sun Yat-sen University in 2024, supervised by Prof. Kai Huang, Prof. Chengying Gao and Prof. Ning Liu. I was also a visiting student in Shenzhen Research Institute of Big Data at The Chinese University of Hong Kong (Shenzhen) from 2023 to 2024, under the guidance of Prof. Guangxu Zhu. Moreover, I was a research intern in Noah’s Ark Lab (2012 Laboratories) at Huawei in 2026, mentored by Xialiang Tong.
Aside from academics, I’m also the vocalist, guitarist, and bassist for several metal and rock bands, including Tokamak Disruption, NEWS (personal band) and Rights of Lethe (dissolved). You can explore my musical work on Longino • Independent Musician. If you are interested in collaborating with me (whether in academia or music), please feel free to reach out via zzhaock@connect.ust.hk!
Ph.D. in Civil Engineering (Scientific Computation), 2024~
The Hong Kong University of Science and Technology (Clearwater Bay Campus, Hong Kong)
B.Eng. in Computer Science and Technology (National Basic Subject Talent Training Plan), 2020~2024
Sun Yat-sen University (Guangzhou Campus, Guangdong)
Code: Python, C/C++ (CCF-CSP:320, Top 0.8%), Java, Matlab, SQL Music: Guitar, Keyboard, Bass, Drum, Ukulele
Teaching Assistant: HKUST CIVL 4640 Introduction to Smart City Economics (Undergraduate, Spring 2026)Interview: HKUST JUPAS 2025
Society Membership: IEEE Student Member, ACM Student Member, AAAI Student Membership,CCF Student MemberWorkshop Chair: ICISCC Workshop 2026TPC Membership: IEEE WCNC Workshop 2024-2026, IEEE PIMRC Workshop 2024-2025, IEEE GLOBECOM Workshop 2025, IEEE/CIC ICCC Workshop 2025Technical Reviewer: IEEE TPAMI, IEEE TMC, IEEE/ACM TON, IEEE TCOM, IEEE IOT-J, IEEE OJ-COMS, IEEE WCL, IEEE CL, Transportation Research Part E, ACM TOMM, Frontiers in AI, MTAP, Bentham Science Book, IEEE ICASSP 2024-2027, ICLR 2025-2027, IEEE IJCNN 2025-2027, AAAI 2026-2027, ACM KDD 2027, ACM WWW 2027, IEEE ICME 2024-2026, IEEE WCNC 2024-2026, ACL ARR 2025-2026, IEEE MLSP 2025-2026, NeurIPS 2026, ICML 2026, CVPR 2026, ACM ICMR 2026, IEEE PIMRC 2024-2025, HKSTS 2024-2025, IEEE GLOBECOM 2025, IEEE/CIC ICCC 2025, IEEE AVSS 2025, IET IRC 2025, BTR 2025, IEEE SMC 2023

Stage lighting plays an essential role in live music performances, influencing the engaging experience of both musicians and audiences. Given the high costs associated with hiring or training professional lighting engineers, Automatic Stage Lighting Control (ASLC) has gained increasing attention. However, most existing approaches only classify music into limited categories and map them to predefined light patterns, resulting in formulaic and monotonous outcomes that lack rationality. To address this issue, this paper presents an end-to-end solution that directly learns from experienced lighting engineers – Skip-BART. To the best of our knowledge, this is the first work to conceptualize ASLC as a generative task rather than merely a classification problem. Our method modifies the BART model to take audio music as input and produce light hue and value (intensity) as output, incorporating a novel skip connection mechanism to enhance the relationship between music and light within the frame grid. We validate our method through both quantitative analysis and an human evaluation, demonstrating that Skip-BART outperforms conventional rule-based methods across all evaluation metrics and shows only a limited gap compared to real lighting engineers. Specifically, our method yields a p-value of 0.72 in a statistical comparison based on human evaluations with human lighting engineers, suggesting that the proposed approach closely matches human lighting engineering performance. To support further research, we have made our self-collected dataset, code, and trained model parameters available at https://github.com/RS2002/Skip-BART.

On-demand ride-sharing platforms, such as Uber and Lyft, face the intricate real-time challenge of bundling and matching passengers—each with distinct origins and destinations—to available vehicles, all while navigating significant system uncertainties. Due to the extensive observation space arising from the large number of drivers and orders, order dispatching, though fundamentally a centralized task, is often addressed using Multi-Agent Reinforcement Learning (MARL). However, independent MARL methods fail to capture global information and exhibit poor cooperation among workers, while Centralized Training Decentralized Execution (CTDE) MARL methods suffer from the curse of dimensionality. To overcome these challenges, we propose Triple-BERT, a centralized Single Agent Reinforcement Learning (MARL) method designed specifically for large-scale order dispatching on ride-sharing platforms. Built on a variant TD3, our approach addresses the vast action space through an action decomposition strategy that breaks down the joint action probability into individual driver action probabilities. To handle the extensive observation space, we introduce a novel BERT-based network, where parameter reuse mitigates parameter growth as the number of drivers and orders increases, and the attention mechanism effectively captures the complex relationships among the large pool of driver and orders. We validate our method using a real-world ride-hailing dataset from Manhattan. Triple-BERT achieves approximately an 11.95% improvement over current state-of-the-art methods, with a 4.26% increase in served orders and a 22.25% reduction in pickup times. Our code, trained model parameters, and processed data are publicly available at the repository https://github.com/RS2002/Triple-BERT .

Wireless sensing has recently found widespread applications in diverse environments, including homes, offices, and public spaces. By analyzing patterns in channel state information (CSI), it is possible to infer human actions for tasks such as person identification, gesture recognition, and fall detection. However, CSI is highly sensitive to environmental changes, where even minor alterations can significantly distort the CSI patterns. This sensitivity often leads to performance degradation or outright failure when applying wireless sensing models trained in one environment to another. To address this challenge, Domain Alignment (DAL) has been widely adopted for cross-domain classification tasks, as it focuses on aligning the global distributions of the source and target domains in feature space. Despite its popularity, DAL often neglects inter-category relationships, which can lead to misalignment between categories across domains, even when global alignment is achieved. To overcome these limitations, we propose K-Nearest Neighbors Maximum Mean Discrepancy (KNN-MMD), a novel few-shot method for cross-domain wireless sensing. Our approach begins by constructing a ``help set" using K-Nearest Neighbors (KNN) from the target domain, enabling local alignment between the source and target domains within each category using Maximum Mean Discrepancy (MMD). Additionally, we address a key instability issue commonly observed in cross-domain methods, where model performance fluctuates sharply between epochs. Further, most existing methods struggle to determine an optimal stopping point during training due to the absence of labeled data from the target domain. Our method resolves this by excluding the support set from the target domain during training and employing it as a validation set to determine the stopping criterion. We evaluate the effectiveness of the proposed method across several cross-domain Wi-Fi sensing tasks, including gesture recognition, person identification, fall detection, and action recognition, using both a public dataset and a self-collected dataset. In a one-shot scenario, our method achieves accuracy rates of 93.26%, 81.84%, 77.62%, and 75.30% for the respective tasks. The dataset and code are publicly available at https://github.com/RS2002/KNN-MMD.