Huayu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Huayu Li has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Jiyan Yang
Meta Platforms, Inc., Menlo Park, CA, USA
4 shared publications - Laming Chen
Meta Platforms, Inc., Menlo Park, CA, USA
4 shared publications - Xi Liu
Meta Platforms, Sunnyvale, CA, USA
4 shared publications - Chunzhi Yang
Meta Platforms, Inc, Menlo Park, USA
3 shared publications - Kai Wang
Meta, Sunnyvale, USA
3 shared publications - Mengyue Hang
Meta Platforms, Inc., Menlo Park, CA, USA
3 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7379-7390
Kunlun: Establishing Scaling Laws for Massive-Scale Recommendation Systems through Unified Architecture Design
Deriving predictable scaling laws that govern the relationship between model performance and computational investment is crucial for designing and allocating resources in massive-scale recommendation systems. While such laws are established for large language models, they remain challenging for recommendation systems, especially those processing both user history and context features. We identify poor scaling efficiency as the main barrier to predictable power-law scaling, stemming from inefficient modules with low Model FLOPs Utilization (MFU) and suboptimal resource allocation. We introduce Kunlun, a scalable architecture that systematically improves model efficiency and resource allocation. Our low-level optimizations include Generalized Dot-Product Attention (GDPA), Hierarchical Seed Pooling (HSP), and Sliding Window Attention. Our high-level innovations feature Computation Skip (CompSkip) and Event-level Personalization. These advances increase MFU from 17% to 37% on NVIDIA B200 GPUs and double scaling efficiency over state-of-the-art methods. Kunlun is now deployed in major Meta Ads models, delivering significant production impact.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 7379-7390
Open AccessKunlun: Establishing Scaling Laws for Massive-Scale Recommendation Systems through Unified Architecture Design
Deriving predictable scaling laws that govern the relationship between model performance and computational investment is crucial for designing and allocating resources in massive-scale recommendation systems. While such laws are established for large language models, they remain challenging for recommendation systems, especially those processing both user history and context features. We identify poor scaling efficiency as the main barrier to predictable power-law scaling, stemming from inefficient modules with low Model FLOPs Utilization (MFU) and suboptimal resource allocation. We introduce Kunlun, a scalable architecture that systematically improves model efficiency and resource allocation. Our low-level optimizations include Generalized Dot-Product Attention (GDPA), Hierarchical Seed Pooling (HSP), and Sliding Window Attention. Our high-level innovations feature Computation Skip (CompSkip) and Event-level Personalization. These advances increase MFU from 17% to 37% on NVIDIA B200 GPUs and double scaling efficiency over state-of-the-art methods. Kunlun is now deployed in major Meta Ads models, delivering significant production impact.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4000-4011
Generalizable Multi-Pass Training of Ads Recommendation Models with Foundation Model Guidance
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4000-4011
Open AccessGeneralizable Multi-Pass Training of Ads Recommendation Models with Foundation Model Guidance
- Top Cited PapersOpen Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6225-6233
InterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6225-6233
Top Cited PapersOpen AccessInterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 344-353
External Large Foundation Model: How to Efficiently Serve Trillions of Parameters for Online Ads Recommendation
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 344-353
Open AccessExternal Large Foundation Model: How to Efficiently Serve Trillions of Parameters for Online Ads Recommendation
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 374-382
AutoML for Large Capacity Modeling of Meta's Ranking Systems
Web-scale ranking systems at Meta serving billions of users is complex. Improving ranking models is essential but engineering heavy. Automated Machine Learning (AutoML) can potentially release engineers from labor intensive work of tuning ranking models; however, it is unknown if AutoML is efficient enough to meet tight production timeline in real-world applications and, at the same time, bring additional improvements to the already strong baselines. Moreover, to achieve higher ranking performance, there is an ever-increasing demand to scale up ranking models to even larger capacity, which imposes more challenges on the AutoML efficiency. The large scale of models and tight production schedule requires AutoML to outperform human baselines by only using a small number of model evaluation trials (~100). This paper presents a sampling-based AutoML search method, focusing on neural architecture search and hyperparameter optimization, with a particular emphasis on addressing aforementioned challenges in Meta-scale production when building large capacity models. Our approach efficiently handles large-scale data demands. It leverages a lightweight predictor-based searcher and reinforcement learning to explore vast search spaces, significantly reducing the number of model evaluations. Through experiments in large capacity modeling for CTR and CVR applications, we have demonstrated that our method achieves outstanding Return-on-Investment (ROI) versus human tuned baselines, with up to 0.09% Normalized Entropy (NE) loss reduction or 25% Query-per-Second (QPS) increase by only sampling one hundred models on average from a curated search space. The proposed AutoML method has already made real-world impact where a discovered Instagram CTR model with up to -0.36% NE gain (over existing production baseline) was selected for large-scale online A/B test and show statistically significant gain. These production results proved AutoML efficacy and accelerated its adoption in ranking systems at Meta.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 374-382
Open AccessAutoML for Large Capacity Modeling of Meta's Ranking Systems
Web-scale ranking systems at Meta serving billions of users is complex. Improving ranking models is essential but engineering heavy. Automated Machine Learning (AutoML) can potentially release engineers from labor intensive work of tuning ranking models; however, it is unknown if AutoML is efficient enough to meet tight production timeline in real-world applications and, at the same time, bring additional improvements to the already strong baselines. Moreover, to achieve higher ranking performance, there is an ever-increasing demand to scale up ranking models to even larger capacity, which imposes more challenges on the AutoML efficiency. The large scale of models and tight production schedule requires AutoML to outperform human baselines by only using a small number of model evaluation trials (~100). This paper presents a sampling-based AutoML search method, focusing on neural architecture search and hyperparameter optimization, with a particular emphasis on addressing aforementioned challenges in Meta-scale production when building large capacity models. Our approach efficiently handles large-scale data demands. It leverages a lightweight predictor-based searcher and reinforcement learning to explore vast search spaces, significantly reducing the number of model evaluations. Through experiments in large capacity modeling for CTR and CVR applications, we have demonstrated that our method achieves outstanding Return-on-Investment (ROI) versus human tuned baselines, with up to 0.09% Normalized Entropy (NE) loss reduction or 25% Query-per-Second (QPS) increase by only sampling one hundred models on average from a curated search space. The proposed AutoML method has already made real-world impact where a discovered Instagram CTR model with up to -0.36% NE gain (over existing production baseline) was selected for large-scale online A/B test and show statistically significant gain. These production results proved AutoML efficacy and accelerated its adoption in ranking systems at Meta.
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 47-55
Scaling User Modeling: Large-scale Online User Representations for Ads Personalization in Meta
Effective user representations are pivotal in personalized advertising. However, stringent constraints on training throughput, serving latency, and memory, often limit the complexity and input feature set of online ads ranking models. This challenge is magnified in extensive systems like Meta's, which encompass hundreds of models with diverse specifications, rendering the tailoring of user representation learning for each model impractical. To address these challenges, we present Scaling User Modeling (SUM), a framework widely deployed in Meta's ads ranking system, designed to facilitate efficient and scalable sharing of online user representation across hundreds of ads models. SUM leverages a few designated upstream user models to synthesize user embeddings from massive amounts of user features with advanced modeling techniques. These embeddings then serve as inputs to downstream online ads ranking models, promoting efficient representation sharing. To adapt to the dynamic nature of user features and ensure embedding freshness, we designed SUM Online Asynchronous Platform (SOAP), a latency-free online serving system complemented with model freshness and embedding stabilization, which enables frequent user model updates and online inference of user embeddings upon each user request. We share our hands-on deployment experiences for the SUM framework and validate its superiority through comprehensive experiments. To date, SUM has been launched to hundreds of ads ranking models in Meta, processing hundreds of billions of user requests daily, yielding significant online metric gains and infrastructure cost savings.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 47-55
Open AccessScaling User Modeling: Large-scale Online User Representations for Ads Personalization in Meta
Effective user representations are pivotal in personalized advertising. However, stringent constraints on training throughput, serving latency, and memory, often limit the complexity and input feature set of online ads ranking models. This challenge is magnified in extensive systems like Meta's, which encompass hundreds of models with diverse specifications, rendering the tailoring of user representation learning for each model impractical. To address these challenges, we present Scaling User Modeling (SUM), a framework widely deployed in Meta's ads ranking system, designed to facilitate efficient and scalable sharing of online user representation across hundreds of ads models. SUM leverages a few designated upstream user models to synthesize user embeddings from massive amounts of user features with advanced modeling techniques. These embeddings then serve as inputs to downstream online ads ranking models, promoting efficient representation sharing. To adapt to the dynamic nature of user features and ensure embedding freshness, we designed SUM Online Asynchronous Platform (SOAP), a latency-free online serving system complemented with model freshness and embedding stabilization, which enables frequent user model updates and online inference of user embeddings upon each user request. We share our hands-on deployment experiences for the SUM framework and validate its superiority through comprehensive experiments. To date, SUM has been launched to hundreds of ads ranking models in Meta, processing hundreds of billions of user requests daily, yielding significant online metric gains and infrastructure cost savings.
- 1 January 2006
- Published by JSTOR in Foreign Affairs
- Vol. 85 (6) , 177
Mao and the Economic Stalinization of China, 1948-1953
- 1 January 2006
- Published by JSTOR in Foreign Affairs
- Vol. 85 (6) , 177
Mao and the Economic Stalinization of China, 1948-1953