Bachelor of Engineering in Electronic and Computer Engineering (Computer Engineering Stream)
AI Algorithm Engineer Intern at Huawei Technologies Co., Ltd.I am a final-year undergraduate student at The Chinese University of Hong Kong (Shenzhen), majoring in Electronic and Computer Engineering with a focus on Computer Engineering. My research interests lie in machine learning, artificial intelligence, and federated learning, with particular expertise in fairness-aware algorithms and optimization theory.
Currently, I work as an AI Algorithm Engineer Intern at Huawei Technologies, where I contribute to the development of AI4Coding tools. I also serve as a Research Assistant at CUHK-Shenzhen, collaborating with Tencent Ads on optimal boost design for auto-bidding mechanisms. My research has been submitted and published in top-tier conferences including AAAI and ICIC.
Warning
Problem: The current name of your GitHub Pages repository ("Solution: Please consider renaming the repository to "
http://".
However, if the current repository name is intended, you can ignore this message by removing "{% include widgets/debug_repo_name.html %}" in index.html.
Action required
Problem: The current root path of this site is "baseurl ("_config.yml.
Solution: Please set the
baseurl in _config.yml to "Education
-
The Chinese University of Hong Kong (Shenzhen)School of Science and Engineering
Bachelor of Engineering in Electronic and Computer Engineering (Computer Engineering Stream)Sep. 2022 - Present -
The Chinese University of Hong KongSummer SchoolJul. 2024 - Aug. 2024
Experience
-
Huawei Technologies Co., Ltd.AI Algorithm Engineer InternJul. 2025 - Present
-
The Chinese University of Hong Kong (Shenzhen) & Tencent AdsResearch AssistantSep. 2024 - Present
-
Shenzhen Institute of Artificial Intelligence and Robotics (AIRS)Research AssistantMar. 2024 - Mar. 2025
Honors & Awards
-
Undergraduate Research AwardMar. 2025
-
Dean's List (2023-2024 Academic Year)Aug. 2024
-
Dean's List (2022-2023 Academic Year)Jul. 2023
-
Ling Bowen II Scholarship (Provincial First Prize in High School Chemistry Competition)Sep. 2022
-
Mathematical Contest in Modeling (MCM) - Meritorious WinnerJan. 2025
Selected Publications (view all )
Optimal Boost Design for Auto-bidding Mechanism with Publisher Quality Constraints
Huanyu Yan, Yu Huo, Min Lu, Weitong Ou, Xingyan Shi, Ruihe Shi, Xiaoying Tang# (# corresponding author)
Submitted to Association for the Advancement of Artificial Intelligence (AAAI)
Online bidding is crucial in mobile ecosystems, enabling real-time ad allocation across billions of devices to optimize performance and user experience. Improving ad allocation efficiency is a long-standing research problem, as it directly enhances the economic outcomes for all participants in advertising platforms. This paper investigates the design of optimal boost factors in online bidding while incorporating quality value (the impact of displayed ads on publishers' long-term benefits). To address the divergent interests on quality, we establish a three-party auction framework with a unified welfare metric of advertiser and publisher. Within this framework, we derive the theoretical efficiency lower bound for C-competitive boost in second-price single-slot auctions, then design a novel quality-involved Boosting (q-Boost) algorithm for computing the optimal boost factor. Experimental validation on Alibaba's public dataset (AuctionNet) demonstrates 2%-6% welfare improvements over conventional approaches, proving our method's effectiveness in real-world settings.
Optimal Boost Design for Auto-bidding Mechanism with Publisher Quality Constraints
Huanyu Yan, Yu Huo, Min Lu, Weitong Ou, Xingyan Shi, Ruihe Shi, Xiaoying Tang# (# corresponding author)
Submitted to Association for the Advancement of Artificial Intelligence (AAAI)
Online bidding is crucial in mobile ecosystems, enabling real-time ad allocation across billions of devices to optimize performance and user experience. Improving ad allocation efficiency is a long-standing research problem, as it directly enhances the economic outcomes for all participants in advertising platforms. This paper investigates the design of optimal boost factors in online bidding while incorporating quality value (the impact of displayed ads on publishers' long-term benefits). To address the divergent interests on quality, we establish a three-party auction framework with a unified welfare metric of advertiser and publisher. Within this framework, we derive the theoretical efficiency lower bound for C-competitive boost in second-price single-slot auctions, then design a novel quality-involved Boosting (q-Boost) algorithm for computing the optimal boost factor. Experimental validation on Alibaba's public dataset (AuctionNet) demonstrates 2%-6% welfare improvements over conventional approaches, proving our method's effectiveness in real-world settings.
FedGF: Layer-Wise Federated Learning with Group Fairness Guarantees
Yu Huo*, Yating Li*, Xiaoying Tang# (* equal contribution, # corresponding author)
International Conference on Intelligent Computing (ICIC) 2025 Oral
Federated Learning (FL) enables collaborative training without sharing raw data but often suffers fairness issues under non-IID distributions. Prior work targets client-level fairness yet overlooks demographic-group biases. We propose FedGF, a layer-wise method that embeds demographic-parity constraints into each layer’s descent direction, jointly optimizing accuracy, client fairness, and group fairness. Extensive experiments on benchmark datasets demonstrate that FedGF reduces group accuracy gaps by 78% compared to state-of-the-art methods while maintaining comparable model performance. Our method establishes new benchmarks for both client fairness (0.0862 fairness indicator on FMNIST) and group fairness (0.0002 demographic parity difference on CIFAR-10), highlighting its effectiveness in creating more equitable federated learning systems.
FedGF: Layer-Wise Federated Learning with Group Fairness Guarantees
Yu Huo*, Yating Li*, Xiaoying Tang# (* equal contribution, # corresponding author)
International Conference on Intelligent Computing (ICIC) 2025 Oral
Federated Learning (FL) enables collaborative training without sharing raw data but often suffers fairness issues under non-IID distributions. Prior work targets client-level fairness yet overlooks demographic-group biases. We propose FedGF, a layer-wise method that embeds demographic-parity constraints into each layer’s descent direction, jointly optimizing accuracy, client fairness, and group fairness. Extensive experiments on benchmark datasets demonstrate that FedGF reduces group accuracy gaps by 78% compared to state-of-the-art methods while maintaining comparable model performance. Our method establishes new benchmarks for both client fairness (0.0862 fairness indicator on FMNIST) and group fairness (0.0002 demographic parity difference on CIFAR-10), highlighting its effectiveness in creating more equitable federated learning systems.