Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yunheng Shen

dblp:335/8087 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
7since 2021 · last 2025
0000-0003-1961-0274ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 since 2021Systems, architecture and hardware · 3 · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › design for manufacturability
layout pattern generation
2.332025
DiffPattern-Flex: Efficient Layout Pattern Generation via Discrete Diffusion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025
ChatPattern: Layout Pattern Customization via Natural Language · DAC 2024
DiffPattern: Layout Pattern Generation via Discrete Diffusion · DAC 2023
Electronic design automation
physical design
2.332025
DiffPattern-Flex: Efficient Layout Pattern Generation via Discrete Diffusion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025
ChatPattern: Layout Pattern Customization via Natural Language · DAC 2024
DiffPattern: Layout Pattern Generation via Discrete Diffusion · DAC 2023
Machine learning › Efficient and distributed learning
federated learning
0.812024
FedLPA: One-shot Federated Learning with Layer-Wise Posterior Aggregation · NeurIPS 2024
Machine learning › Efficient and distributed learning › federated learning › communication-efficient federated learning
one-shot federated learning
0.812024
FedLPA: One-shot Federated Learning with Layer-Wise Posterior Aggregation · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

discrete diffusion model · 1.5posterior aggregation · 0.8layer-wise laplace approximation · 0.8large language model · 0.8diffusion model · 0.8white-box pattern assessment · 0.7
YearPublicationVenuePosition
2025 FedAGHN: Personalized federated learning with attentive graph hypernetworks
Yunheng Shen, Chengbin Hou, Pengyu Wang 0007, Jinbao Wang 0001, Ke Tang 0001, Hairong Lv
Knowl. Based Syst.2
2025 DiffPattern-Flex: Efficient Layout Pattern Generation via Discrete Diffusion
Zixiao Wang 0001, Wenqian Zhao 0002, Yunheng Shen, Guojin Chen, Farzan Farnia, Bei Yu 0001
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2024 ChatPattern: Layout Pattern Customization via Natural Language
abstract
Existing works focus on fixed-size layout pattern generation, while the more practical free-size pattern generation receives limited attention. In this paper, we propose ChatPattern, a novel Large-Language-Model (LLM) powered framework for flexible pattern customization. ChatPattern utilizes a two-part system featuring an expert LLM agent and a highly controllable layout pattern generator. The LLM agent can interpret natural language requirements and operate design tools to meet specified needs, while the generator excels in conditional layout generation, pattern modification, and memory-friendly patterns extension. Experiments on challenging pattern generation setting shows the ability of ChatPattern to synthesize high-quality large-scale patterns.
Zixiao Wang 0001, Yunheng Shen, Xufeng Yao, Wenqian Zhao 0002, Farzan Farnia, Bei Yu 0001
DAC2
2024 FedLPA: One-shot Federated Learning with Layer-Wise Posterior Aggregation
abstract
Efficiently aggregating trained neural networks from local clients into a global model on a server is a widely researched topic in federated learning. Recently, motivated by diminishing privacy concerns, mitigating potential attacks, and reducing communication overhead, one-shot federated learning (i.e., limiting client-server communication into a single round) has gained popularity among researchers. However, the one-shot aggregation performances are sensitively affected by the non-identical training data distribution, which exhibits high statistical heterogeneity in some real-world scenarios. To address this issue, we propose a novel one-shot aggregation method with layer-wise posterior aggregation, named FedLPA. FedLPA aggregates local models to obtain a more accurate global model without requiring extra auxiliary datasets or exposing any private label information, e.g., label distributions. To effectively capture the statistics maintained in the biased local datasets in the practical non-IID scenario, we efficiently infer the posteriors of each layer in each local model using layer-wise Laplace approximation and aggregate them to train the global parameters. Extensive experimental results demonstrate that FedLPA significantly improves learning performance over state-of-the-art methods across several metrics.
Xiang Liu 0017, Liangxi Liu, Feiyang Ye 0004, Yunheng Shen, Xia Li 0005, Linshan Jiang, Jialin Li 0001
NeurIPS4
2023 DiffPattern: Layout Pattern Generation via Discrete Diffusion
abstract
Deep generative models dominate the existing literature in layout pattern generation. However, leaving the guarantee of legality to an inexplicable neural network could be problematic in several applications. In this paper, we propose DiffPattern to generate reliable layout patterns. DiffPattern introduces a novel diverse topology generation method via a discrete diffusion model with compute-efficiently lossless layout pattern representation. Then a white-box pattern assessment is utilized to generate legal patterns given desired design rules. Our experiments on several benchmark settings show that DiffPattern significantly outperforms existing baselines and is capable of synthesizing reliable layout patterns.
Zixiao Wang 0001, Yunheng Shen, Wenqian Zhao 0002, Guojin Chen, Farzan Farnia, Bei Yu 0001
DAC2
2023 A distributed joint extraction framework for sedimentological entities and relations with federated learning
Tianheng Wang, Hairong Lv, Chenghu Zhou, Yunheng Shen, Qinjun Qiu, Pufan Li, Guorui Wang
Expert Syst. Appl.5
2022 AggEnhance: Aggregation Enhancement by Class Interior Points in Federated Learning with Non-IID Data
abstract
Federated learning (FL) is a privacy-preserving paradigm for multi-institutional collaborations, where the aggregation is an essential procedure after training on the local datasets. Conventional aggregation algorithms often apply a weighted averaging of the updates generated from distributed machines to update the global model. However, while the data distributions are non-IID, the large discrepancy between the local updates might lead to a poor averaged result and a lower convergence speed, i.e., more iterations required to achieve a certain performance. To solve this problem, this article proposes a novel method named AggEnhance for enhancing the aggregation, where we synthesize a group of reliable samples from the local models and tune the aggregated result on them. These samples, named class interior points (CIPs) in this work, bound the relevant decision boundaries that ensure the performance of aggregated result. To the best of our knowledge, this is the first work to explicitly design an enhancing method for the aggregation in prevailing FL pipelines. A series of experiments on real data demonstrate that our method has noticeable improvements of the convergence in non-IID scenarios. In particular, our approach reduces the iterations by 31.87% on average for the CIFAR10 dataset and 43.90% for the PASCAL VOC dataset. Since our method does not modify other procedures of FL pipelines, it is easy to apply to most existing FL frameworks. Furthermore, it does not require additional data transmitted from the local clients to the global server, thus holding the same security level as the original FL algorithms.
Jinxiang Ou, Yunheng Shen, Feng Wang 0047, Qiao Liu 0008, Xuegong Zhang, Hairong Lv
ACM Trans. Intell. Syst. Technol.2