Yao Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yao Lu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Zhiyao Xie
The Hong Kong University of Science and Technology
14 shared publications - Qijun Zhang
Hong Kong University of Science and Technology, Hong Kong, Hong Kong, Hong Kong
11 shared publications - Wenji Fang
Hong Kong University of Science and Technology, Hong Kong, Hong Kong, Hong Kong
9 shared publications - Shang Liu
Hong Kong University of Science and Technology, Hong Kong, Hong Kong, Hong Kong
8 shared publications - Mengming Li
HKUST, Hong Kong, Hong Kong, Hong Kong
5 shared publications - Jing Wang
HKUST, Hong Kong, Hong Kong, Hong Kong
3 shared publications
Latest Publications
- Top Cited PapersOpen Access
- 31 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 32 (1) , 1-71
A Survey of Circuit Foundation Model: Foundation AI Models for VLSI Circuit Design and EDA
Artificial intelligence (AI)-driven electronic design automation (EDA) techniques have been extensively explored for VLSI circuit design applications. Most recently, foundation AI models for circuits have emerged as a new technology trend. Unlike traditional task-specific AI solutions, these new AI models are developed through two stages: (1) self-supervised pre-training on a large amount of unlabeled data to learn intrinsic circuit properties; and (2) efficient fine-tuning for specific downstream applications, such as early-stage design quality evaluation, circuit-related context generation, and functional verification. This new paradigm brings many advantages: model generalization, less reliance on labeled circuit data, efficient adaptation to new tasks, and unprecedented generative capability. In this article, we propose referring to AI models developed with this new paradigm as circuit foundation models (CFMs) . This article provides a comprehensive survey of the latest progress in circuit foundation models, unprecedentedly covering over 160 relevant works. Over 90% of our introduced works were published in or after 2022, indicating that this emerging research trend has attracted wide attention in a short period. In this survey, we propose to categorize all existing circuit foundation models into two primary types: (1) encoder-based methods performing general circuit representation learning for predictive tasks ; and (2) decoder-based methods leveraging large language models (LLMs) for generative tasks . For our introduced works, we cover their input modalities, model architecture, pre-training strategies, domain adaptation techniques, and downstream design applications. In addition, this article discussed the unique properties of circuits from the data perspective. These circuit properties have motivated many works in this domain and differentiated them from general AI techniques. Finally, we shared our observed challenges and potential future research directions about developing foundation AI models for EDA methodologies.
- 31 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 32 (1) , 1-71
Top Cited PapersOpen AccessA Survey of Circuit Foundation Model: Foundation AI Models for VLSI Circuit Design and EDA
Artificial intelligence (AI)-driven electronic design automation (EDA) techniques have been extensively explored for VLSI circuit design applications. Most recently, foundation AI models for circuits have emerged as a new technology trend. Unlike traditional task-specific AI solutions, these new AI models are developed through two stages: (1) self-supervised pre-training on a large amount of unlabeled data to learn intrinsic circuit properties; and (2) efficient fine-tuning for specific downstream applications, such as early-stage design quality evaluation, circuit-related context generation, and functional verification. This new paradigm brings many advantages: model generalization, less reliance on labeled circuit data, efficient adaptation to new tasks, and unprecedented generative capability. In this article, we propose referring to AI models developed with this new paradigm as circuit foundation models (CFMs) . This article provides a comprehensive survey of the latest progress in circuit foundation models, unprecedentedly covering over 160 relevant works. Over 90% of our introduced works were published in or after 2022, indicating that this emerging research trend has attracted wide attention in a short period. In this survey, we propose to categorize all existing circuit foundation models into two primary types: (1) encoder-based methods performing general circuit representation learning for predictive tasks ; and (2) decoder-based methods leveraging large language models (LLMs) for generative tasks . For our introduced works, we cover their input modalities, model architecture, pre-training strategies, domain adaptation techniques, and downstream design applications. In addition, this article discussed the unique properties of circuits from the data perspective. These circuit properties have motivated many works in this domain and differentiated them from general AI techniques. Finally, we shared our observed challenges and potential future research directions about developing foundation AI models for EDA methodologies.
- Open Access
- 27 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
OSCAR: An Open-Source Flexible and Hierarchical AI Accelerator Generator with Accurate Power Model
With the growing demand for artificial intelligence (AI) applications, high-performance and energy-efficient AI chips are needed to support the computation. However, architectural-level AI chip design, PPA evaluation, and power estimation remain challenging due to the exponential set of possible designs and the difficulty of accurately modeling the impact of diverse dataflows and workflows on the underlying hardware at the architectural-design stage. We propose a novel open-source framework named OSCAR, which, given a set of hardware and workload specifications, provides architecture-level power estimation and can also automatically generate Chisel and synthesizable RTL of the custom AI chip. Our contributions include (1) a flexible and hierarchical AI chip design space, software and hardware stack, and an RTL generator supporting dense, Transformer, Winograd, systolic, and reconfigurable architectures in one unified framework, (2) hierarchy-based data-sensitive power model using architectural-level toggling features, achieving 3.8% error and correlation coefficient R > 0.99 to post-synthesis power, outperforming state-of-the-art power estimation methods, (3) validation of our power model by performing design space exploration, finding designs with better Pareto-optimality, 2.5 × lower power or 2 × better runtime metrics, compared with using prior art power models, (4) a tape-out of an AI chip based on DSE results, with OSCAR modeling its power with over 90% accuracy.
- 27 August 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
Open AccessOSCAR: An Open-Source Flexible and Hierarchical AI Accelerator Generator with Accurate Power Model
With the growing demand for artificial intelligence (AI) applications, high-performance and energy-efficient AI chips are needed to support the computation. However, architectural-level AI chip design, PPA evaluation, and power estimation remain challenging due to the exponential set of possible designs and the difficulty of accurately modeling the impact of diverse dataflows and workflows on the underlying hardware at the architectural-design stage. We propose a novel open-source framework named OSCAR, which, given a set of hardware and workload specifications, provides architecture-level power estimation and can also automatically generate Chisel and synthesizable RTL of the custom AI chip. Our contributions include (1) a flexible and hierarchical AI chip design space, software and hardware stack, and an RTL generator supporting dense, Transformer, Winograd, systolic, and reconfigurable architectures in one unified framework, (2) hierarchy-based data-sensitive power model using architectural-level toggling features, achieving 3.8% error and correlation coefficient R > 0.99 to post-synthesis power, outperforming state-of-the-art power estimation methods, (3) validation of our power model by performing design space exploration, finding designs with better Pareto-optimality, 2.5 × lower power or 2 × better runtime metrics, compared with using prior art power models, (4) a tape-out of an AI chip based on DSE results, with OSCAR modeling its power with over 90% accuracy.
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
LEAP: A Self-Supervised Per-Cycle Toggle Propagation Model Supports Fast, Transferable, and Early Analysis of Layout Power
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessLEAP: A Self-Supervised Per-Cycle Toggle Propagation Model Supports Fast, Transferable, and Early Analysis of Layout Power
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
G-Power: Architecture-level GPU Power Modeling with Aggregated Knowledge Foundations from Known GPUs
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessG-Power: Architecture-level GPU Power Modeling with Aggregated Knowledge Foundations from Known GPUs
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
COOL: A Cooling-Aware Point Transformer Framework for Thermal Prediction in Advanced 3D/3.5D IC Packaging
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessCOOL: A Cooling-Aware Point Transformer Framework for Thermal Prediction in Advanced 3D/3.5D IC Packaging
- 19 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
MFSPart: A Generalized Partitioning Framework for Multi-FPGA Systems and Its Ensemble-Based Extension
Multi-FPGA systems (MFSs) are essential for prototyping very large-scale integration (VLSI) designs, necessitating efficient partitioning techniques. Optimizing inter-FPGA communication—particularly minimizing hop count—is critical for improving performance and reducing latency. However, existing topology-aware partitioning methods primarily minimize driver–sink pair cut size under a strict one-hop constraint, which may not always yield feasible solutions. They also typically overlook practical constraints such as FPGA capacity limits and I/O resource optimization, leading to solutions with excessive pin usage and routing complexity. To address these limitations, we propose a unified formulation that jointly optimizes driver–sink pair cut size, connectivity, and mean hop count under maximum-hop and capacity constraints. Unlike prior frameworks that enforce hop-based constraints via propagation before coarsening—imposing significant limitations— we postpone propagation until after coarsening. Based on this, we develop MFSPart, a framework applicable to both fixed-node and non-fixed-node scenarios, featuring improved coarsening, initial partitioning, and refinement strategies. We further propose an enhanced version, MFSPart-Ensemble, which systematically combines high-quality structures from diverse solutions across uncoarsening stages to generate superior partitions. Experiments demonstrate that MFSPart achieves excellent performance across all three objectives with reduced runtime, while MFSPart-Ensemble further improves solution quality, especially for complex FPGA systems.
- 19 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
MFSPart: A Generalized Partitioning Framework for Multi-FPGA Systems and Its Ensemble-Based Extension
Multi-FPGA systems (MFSs) are essential for prototyping very large-scale integration (VLSI) designs, necessitating efficient partitioning techniques. Optimizing inter-FPGA communication—particularly minimizing hop count—is critical for improving performance and reducing latency. However, existing topology-aware partitioning methods primarily minimize driver–sink pair cut size under a strict one-hop constraint, which may not always yield feasible solutions. They also typically overlook practical constraints such as FPGA capacity limits and I/O resource optimization, leading to solutions with excessive pin usage and routing complexity. To address these limitations, we propose a unified formulation that jointly optimizes driver–sink pair cut size, connectivity, and mean hop count under maximum-hop and capacity constraints. Unlike prior frameworks that enforce hop-based constraints via propagation before coarsening—imposing significant limitations— we postpone propagation until after coarsening. Based on this, we develop MFSPart, a framework applicable to both fixed-node and non-fixed-node scenarios, featuring improved coarsening, initial partitioning, and refinement strategies. We further propose an enhanced version, MFSPart-Ensemble, which systematically combines high-quality structures from diverse solutions across uncoarsening stages to generate superior partitions. Experiments demonstrate that MFSPart achieves excellent performance across all three objectives with reduced runtime, while MFSPart-Ensemble further improves solution quality, especially for complex FPGA systems.
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 572-585
Profile-Guided Temporal Prefetching
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 572-585
Open AccessProfile-Guided Temporal Prefetching
- Open Access
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 1145-1152
FirePower: Towards a Foundation with Generalizable Knowledge for Architecture-Level Power Modeling
Power efficiency is a critical design objective in modern processor design. A high-fidelity architecture-level power modeling method is greatly needed by CPU architects for guiding early optimizations. However, traditional architecture-level power models can not meet the accuracy requirement, largely due to the discrepancy between the power model and actual design implementation. While some machine learning (ML)-based architecture-level power modeling methods have been proposed in recent years, the data-hungry ML model training process requires sufficient similar known designs, which are unrealistic in many development scenarios. This work proposes a new power modeling solution FirePower that targets few-shot learning scenario for new target architectures. FirePower proposes multiple new policies to utilize cross-architecture knowledge. First, it develops power models at component level, and components are defined in a power-friendly manner. Second, it supports different generalization strategies for models of different components. Third, it formulates generalizable and architecture-specific design knowledge into two separate models. FirePower also supports the evaluation of the generalization quality. In our experiments, FirePower can achieve a low error percentage of 5.8% and a high correlation R of 0.98 on average only using two configurations of target architecture. This is 8.8% lower in error percentage and 0.03 higher in R compared with directly training McPAT-Calib baseline on configurations of target architecture.
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 1145-1152
Open AccessFirePower: Towards a Foundation with Generalizable Knowledge for Architecture-Level Power Modeling
Power efficiency is a critical design objective in modern processor design. A high-fidelity architecture-level power modeling method is greatly needed by CPU architects for guiding early optimizations. However, traditional architecture-level power models can not meet the accuracy requirement, largely due to the discrepancy between the power model and actual design implementation. While some machine learning (ML)-based architecture-level power modeling methods have been proposed in recent years, the data-hungry ML model training process requires sufficient similar known designs, which are unrealistic in many development scenarios. This work proposes a new power modeling solution FirePower that targets few-shot learning scenario for new target architectures. FirePower proposes multiple new policies to utilize cross-architecture knowledge. First, it develops power models at component level, and components are defined in a power-friendly manner. Second, it supports different generalization strategies for models of different components. Third, it formulates generalizable and architecture-specific design knowledge into two separate models. FirePower also supports the evaluation of the generalization quality. In our experiments, FirePower can achieve a low error percentage of 5.8% and a high correlation R of 0.98 on average only using two configurations of target architecture. This is 8.8% lower in error percentage and 0.03 higher in R compared with directly training McPAT-Calib baseline on configurations of target architecture.
- Open Access
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 527-533
Towards Big Data in AI for EDA Research: Generation of New Pseudo Circuits at RTL Stage
Machine learning (ML) techniques have demonstrated remarkable effectiveness in electronic design automation (EDA). ML models need to be trained on diverse circuit datasets for better accuracy and generalization capabilities. However, the availability of circuit data remains a long-standing severe issue. The strong data privacy concern in the semiconductor industry makes direct sharing of circuit IPs almost impossible. To address the data availability problem, open-source datasets like CircuitNet have been proposed, but they mostly focus on collecting labels of several existing open-source designs, instead of generating any new designs. In this work, we make an innovative exploration to directly generate new pseudo-circuits without human effort. We believe that generating pseudo-circuits is the most promising, if not the only, approach to achieving "big data" in the semiconductor industry in the foreseeable future. We demonstrate that pseudo-circuits can significantly boost the performance of ML models in early design quality predictions, as early as the pre-synthesis RTL stage.
- 20 January 2025
- Published by Association for Computing Machinery (ACM)
- p. 527-533
Open AccessTowards Big Data in AI for EDA Research: Generation of New Pseudo Circuits at RTL Stage
Machine learning (ML) techniques have demonstrated remarkable effectiveness in electronic design automation (EDA). ML models need to be trained on diverse circuit datasets for better accuracy and generalization capabilities. However, the availability of circuit data remains a long-standing severe issue. The strong data privacy concern in the semiconductor industry makes direct sharing of circuit IPs almost impossible. To address the data availability problem, open-source datasets like CircuitNet have been proposed, but they mostly focus on collecting labels of several existing open-source designs, instead of generating any new designs. In this work, we make an innovative exploration to directly generate new pseudo-circuits without human effort. We believe that generating pseudo-circuits is the most promising, if not the only, approach to achieving "big data" in the semiconductor industry in the foreseeable future. We demonstrate that pseudo-circuits can significantly boost the performance of ML models in early design quality predictions, as early as the pre-synthesis RTL stage.