Ling Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ling Yang has a total of 95 co-authors. Here are the top co-authors by number of shared publications:
- Bin Cui
Peking University
6 shared publications - Wentao Zhang
Peking University, Beijing, China
6 shared publications - Shenda Hong
National Institute of Health Data Science, Peking University, Beijing, China
5 shared publications - Zhilin Huang
Shenzhen International Graduate School, Tsinghua University , Shenzhen, 518000
3 shared publications - Bohan Zeng
Peking University, Beijing, China
2 shared publications - Chenye Meng
Zhejiang University, Hangzhou, China
2 shared publications
Latest Publications
- Open Access
- 12 November 2026
- Published by MDPI AG in Preprints.org
AI for Productivity in the Age of Agentic AI
Throughout history, transformative technologies have repeatedly reshaped production systems and economic activity. In the current wave of AI development, Agentic AI systems are emerging as a new class of productive instruments capable of goal perception, multi-step planning, environmental interaction, and autonomous workflow coordination. Beyond automating routine tasks, these systems have the potential to augment knowledge work, reorganize decision-making, and reshape the relationship between human labor, organizational routines, and machine intelligence. This development gives rise to the emerging research direction of AI for Productivity (AI4Productivity), which examines how advanced AI systems affect productivity across economic and social contexts. In this paper, we conducts an in-depth investigation for explaining how Agentic AI creates productivity. We define AI4Productivity as the use of Agentic AI in real-world workflows to deliver economically valuable work with less human effort, and identify two core mechanisms of productivity gains: Efficiency, which reduces the time and labor required for existing tasks, and Expansion, which makes previously infeasible work economically viable. We further characterize the evolution of AI systems through four stages: conversational assistant, reactive operator, adaptive coordinator, and self-governing production system. Building on this framework, we review representative AI productivity tools and examine the sectoral diffusion of Agentic AI across three levels of adoption: early-stage exploration in manufacturing, agriculture, real estate, and government services; broader integration in trade, media, education, and legal services; deeper workflow orchestration in information technology, finance, and healthcare. Finally, we discuss key challenges including safety, long-horizon reliability, academia-industry gaps, adoption barriers, governance, and labor-market uncertainty. This paper provides a structured account of how Agentic AI is reshaping productivity and outlines future directions for reliable and socially beneficial AI-driven production systems. We hope this paper will serve as a foundation for advancing AI4Productivity research and guiding the design of AI systems that deliver reliable, scalable, and broadly beneficial productivity gains.
- 12 November 2026
- Published by MDPI AG in Preprints.org
Open AccessAI for Productivity in the Age of Agentic AI
Throughout history, transformative technologies have repeatedly reshaped production systems and economic activity. In the current wave of AI development, Agentic AI systems are emerging as a new class of productive instruments capable of goal perception, multi-step planning, environmental interaction, and autonomous workflow coordination. Beyond automating routine tasks, these systems have the potential to augment knowledge work, reorganize decision-making, and reshape the relationship between human labor, organizational routines, and machine intelligence. This development gives rise to the emerging research direction of AI for Productivity (AI4Productivity), which examines how advanced AI systems affect productivity across economic and social contexts. In this paper, we conducts an in-depth investigation for explaining how Agentic AI creates productivity. We define AI4Productivity as the use of Agentic AI in real-world workflows to deliver economically valuable work with less human effort, and identify two core mechanisms of productivity gains: Efficiency, which reduces the time and labor required for existing tasks, and Expansion, which makes previously infeasible work economically viable. We further characterize the evolution of AI systems through four stages: conversational assistant, reactive operator, adaptive coordinator, and self-governing production system. Building on this framework, we review representative AI productivity tools and examine the sectoral diffusion of Agentic AI across three levels of adoption: early-stage exploration in manufacturing, agriculture, real estate, and government services; broader integration in trade, media, education, and legal services; deeper workflow orchestration in information technology, finance, and healthcare. Finally, we discuss key challenges including safety, long-horizon reliability, academia-industry gaps, adoption barriers, governance, and labor-market uncertainty. This paper provides a structured account of how Agentic AI is reshaping productivity and outlines future directions for reliable and socially beneficial AI-driven production systems. We hope this paper will serve as a foundation for advancing AI4Productivity research and guiding the design of AI systems that deliver reliable, scalable, and broadly beneficial productivity gains.
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5610-5619
SEPO: Self-Evolving Preference Optimization for Diffusion Alignment via Dynamic Rule Refinement
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5610-5619
Open AccessSEPO: Self-Evolving Preference Optimization for Diffusion Alignment via Dynamic Rule Refinement
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 9901-9910
Inversion-DPO: Precise and Efficient Post-Training for Diffusion Models
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 9901-9910
Open AccessInversion-DPO: Precise and Efficient Post-Training for Diffusion Models
- Top Cited PapersOpen Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 12674-12681
EditWorld: Simulating World Dynamics for Instruction-Following Image Editing
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 12674-12681
Top Cited PapersOpen AccessEditWorld: Simulating World Dynamics for Instruction-Following Image Editing
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37  (6) , 3173-3192
Acceleration Algorithms in GNNs: A Survey
Graph Neural Networks have demonstrated remarkable effectiveness in various graph-based tasks, but their inefficiency in training and inference poses significant challenges for scaling to real-world, large-scale applications. To address these challenges, a plethora of algorithms have been developed to accelerate GNN training and inference, garnering substantial interest from the research community. This paper presents a systematic review of these acceleration algorithms, categorizing them into three main topics: training acceleration, inference acceleration, and execution acceleration. For training acceleration, we discuss techniques like graph sampling and GNN simplification. In inference acceleration, we focus on knowledge distillation, GNN quantization, and GNN pruning. For execution acceleration, we explore GNN binarization and graph condensation. Additionally, we review several libraries related to GNN acceleration, including our Scalable Graph Learning library, and propose future research directions.
- 11 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 37  (6) , 3173-3192
Acceleration Algorithms in GNNs: A Survey
Graph Neural Networks have demonstrated remarkable effectiveness in various graph-based tasks, but their inefficiency in training and inference poses significant challenges for scaling to real-world, large-scale applications. To address these challenges, a plethora of algorithms have been developed to accelerate GNN training and inference, garnering substantial interest from the research community. This paper presents a systematic review of these acceleration algorithms, categorizing them into three main topics: training acceleration, inference acceleration, and execution acceleration. For training acceleration, we discuss techniques like graph sampling and GNN simplification. In inference acceleration, we focus on knowledge distillation, GNN quantization, and GNN pruning. For execution acceleration, we explore GNN binarization and graph condensation. Additionally, we review several libraries related to GNN acceleration, including our Scalable Graph Learning library, and propose future research directions.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35  (6) , 6034-6046
Spatio-Temporal Energy-Guided Diffusion Model for Zero-Shot Video Synthesis and Editing
Diffusion-based generative models have exhibited considerable success in conditional video synthesis and editing. Nevertheless, prevailing video diffusion models primarily rely on conditioning with specific input modalities, predominantly text, restricting their adaptability to alternative modalities without necessitating retraining of modality-specific components. In this work, we present ENERGYVID, a universal spatio-temporal Energy-guided Video Diffusion model designed for zero-shot video synthesis and editing across diverse conditions. Specifically, we leverage off-the-shelf pre-trained networks to construct generic energy functions, guiding the generation process under specific conditions without the need for retraining. To precisely capture temporal dynamics related to motion conditions (e.g., pose sequences), we introduce a novel kernel Maximum Mean Discrepancy (MMD)-based energy function, which minimizes the global distribution discrepancy between the conditioning input and the generated video. Our extensive qualitative and quantitative experiments demonstrate that our algorithm consistently produces high-quality results across a wide range of motion and non-motion conditions, including text, face ID, style, poses, depths, sketches, canny edges, and segmentation maps, in the context of zero-shot video synthesis and editing. We will release source code upon acceptance of the paper.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35  (6) , 6034-6046
Spatio-Temporal Energy-Guided Diffusion Model for Zero-Shot Video Synthesis and Editing
Diffusion-based generative models have exhibited considerable success in conditional video synthesis and editing. Nevertheless, prevailing video diffusion models primarily rely on conditioning with specific input modalities, predominantly text, restricting their adaptability to alternative modalities without necessitating retraining of modality-specific components. In this work, we present ENERGYVID, a universal spatio-temporal Energy-guided Video Diffusion model designed for zero-shot video synthesis and editing across diverse conditions. Specifically, we leverage off-the-shelf pre-trained networks to construct generic energy functions, guiding the generation process under specific conditions without the need for retraining. To precisely capture temporal dynamics related to motion conditions (e.g., pose sequences), we introduce a novel kernel Maximum Mean Discrepancy (MMD)-based energy function, which minimizes the global distribution discrepancy between the conditioning input and the generated video. Our extensive qualitative and quantitative experiments demonstrate that our algorithm consistently produces high-quality results across a wide range of motion and non-motion conditions, including text, face ID, style, poses, depths, sketches, canny edges, and segmentation maps, in the context of zero-shot video synthesis and editing. We will release source code upon acceptance of the paper.
- Open Access
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1043-1052
Motion-aware Latent Diffusion Models for Video Frame Interpolation
With the advancement of AIGC, video frame interpolation (VFI) has become a crucial component in existing video generation frameworks, attracting widespread research interest. For the VFI task, the motion estimation between neighboring frames plays a crucial role in avoiding motion ambiguity. However, existing VFI methods always struggle to accurately predict the motion information between consecutive frames, and this imprecise estimation leads to blurred and visually incoherent interpolated frames. In this paper, we propose a novel diffusion framework, Motion-Aware latent Diffusion models (MADiff), which is specifically designed for the VFI task. By incorporating motion priors between the conditional neighboring frames with the target interpolated frame predicted throughout the diffusion sampling procedure, MADiff progressively refines the intermediate outcomes, culminating in generating both visually smooth and realistic results. Extensive experiments conducted on benchmark datasets demonstrate that our method achieves state-of-the-art performance significantly outperforming existing approaches, especially under challenging scenarios involving dynamic textures with complex motion.
- 28 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1043-1052
Open AccessMotion-aware Latent Diffusion Models for Video Frame Interpolation
With the advancement of AIGC, video frame interpolation (VFI) has become a crucial component in existing video generation frameworks, attracting widespread research interest. For the VFI task, the motion estimation between neighboring frames plays a crucial role in avoiding motion ambiguity. However, existing VFI methods always struggle to accurately predict the motion information between consecutive frames, and this imprecise estimation leads to blurred and visually incoherent interpolated frames. In this paper, we propose a novel diffusion framework, Motion-Aware latent Diffusion models (MADiff), which is specifically designed for the VFI task. By incorporating motion priors between the conditional neighboring frames with the target interpolated frame predicted throughout the diffusion sampling procedure, MADiff progressively refines the intermediate outcomes, culminating in generating both visually smooth and realistic results. Extensive experiments conducted on benchmark datasets demonstrate that our method achieves state-of-the-art performance significantly outperforming existing approaches, especially under challenging scenarios involving dynamic textures with complex motion.
- Open Access
- 9 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 414-427
NPA: Improving Large-scale Graph Neural Networks with Non-parametric Attention
Recent works show great interest in designing Graph Neural Networks (GNNs) that scale to large graphs. While previous work focuses on designing advanced sampling techniques for existing GNNs, the design of non-parametric GNNs, an orthogonal direction for scalable performance, has aroused lots of concerns recently. For example, nearly all top solutions in the Open Graph Benchmark leaderboard are non-parametric GNNs. Despite their high predictive performance and scalability, non-parametric GNNs still face two limitations. First, due to the propagation of over-smoothed features, they suffer from severe performance degradation along with the propagation depth. More importantly, they only consider the graph structure and ignore the feature influence during the non-parametric propagation, leading to sub-optimal propagated features. To address these limitations, we present non-parametric attention (NPA), a plug-and-play module that is compatible with non-parametric GNNs, to get scalable and deep GNNs simultaneously. We have deployed NPA in Tencent with the Angel platform, and we further evaluate NPA on both real-world datasets and large-scale industrial datasets. Experimental results on seven homophilic graphs (including the industrial Tencent Video graph) and five heterophilic graphs demonstrate NPA enjoys high performance -- achieves large performance gain over existing non-parametric GNNs, deeper architecture -- improves non-parametric GNNs with large model depth, and high scalability -- can support large-scale graphs with low time costs. Notably, it achieves state-of-the-art performance on the large ogbn-papers100M dataset.
- 9 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 414-427
Open AccessNPA: Improving Large-scale Graph Neural Networks with Non-parametric Attention
Recent works show great interest in designing Graph Neural Networks (GNNs) that scale to large graphs. While previous work focuses on designing advanced sampling techniques for existing GNNs, the design of non-parametric GNNs, an orthogonal direction for scalable performance, has aroused lots of concerns recently. For example, nearly all top solutions in the Open Graph Benchmark leaderboard are non-parametric GNNs. Despite their high predictive performance and scalability, non-parametric GNNs still face two limitations. First, due to the propagation of over-smoothed features, they suffer from severe performance degradation along with the propagation depth. More importantly, they only consider the graph structure and ignore the feature influence during the non-parametric propagation, leading to sub-optimal propagated features. To address these limitations, we present non-parametric attention (NPA), a plug-and-play module that is compatible with non-parametric GNNs, to get scalable and deep GNNs simultaneously. We have deployed NPA in Tencent with the Angel platform, and we further evaluate NPA on both real-world datasets and large-scale industrial datasets. Experimental results on seven homophilic graphs (including the industrial Tencent Video graph) and five heterophilic graphs demonstrate NPA enjoys high performance -- achieves large performance gain over existing non-parametric GNNs, deeper architecture -- improves non-parametric GNNs with large model depth, and high scalability -- can support large-scale graphs with low time costs. Notably, it achieves state-of-the-art performance on the large ogbn-papers100M dataset.
- 25 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36  (11) , 6358-6369
Graphusion: Latent Diffusion for Graph Generation
Graph generation is a fundamental task in machine learning with broad impacts on numerous real-world applications such as biomedical discovery and social science. Most recently, generative models, especially diffusion models (DMs), have shown great promise in synthesizing realistic graphs. However, existing DMs methods typically conduct diffusion processes directly in complex graph space (i.e., node feature, adjacency matrix, or both), resulting in high modeling complexity and poor multimodal distribution coverage. In this paper, we propose Graphusion, a novel and unified latent-based graph generative framework to address the problems. Specifically, Graphusion is composed of a variational graph autoencoder mapping raw graphs with high-dimensional discrete space to low-dimensional topology-injected latent space, and latent DMs running there, producing a smoother, faster, and more expressive graph generation procedure. Thanks to the latest space modeling, we further develop principled latent self-guidance to sufficiently cover the whole semantical distribution of the unlabeled graph set. Experiments show that our Graphusion framework can consistently outperform previous graph generation baselines on both generic and molecular graph datasets, demonstrating the generality and extensibility along with further analytical justifications.
- 25 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 36  (11) , 6358-6369
Graphusion: Latent Diffusion for Graph Generation
Graph generation is a fundamental task in machine learning with broad impacts on numerous real-world applications such as biomedical discovery and social science. Most recently, generative models, especially diffusion models (DMs), have shown great promise in synthesizing realistic graphs. However, existing DMs methods typically conduct diffusion processes directly in complex graph space (i.e., node feature, adjacency matrix, or both), resulting in high modeling complexity and poor multimodal distribution coverage. In this paper, we propose Graphusion, a novel and unified latent-based graph generative framework to address the problems. Specifically, Graphusion is composed of a variational graph autoencoder mapping raw graphs with high-dimensional discrete space to low-dimensional topology-injected latent space, and latent DMs running there, producing a smoother, faster, and more expressive graph generation procedure. Thanks to the latest space modeling, we further develop principled latent self-guidance to sufficiently cover the whole semantical distribution of the unlabeled graph set. Experiments show that our Graphusion framework can consistently outperform previous graph generation baselines on both generic and molecular graph datasets, demonstrating the generality and extensibility along with further analytical justifications.
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3177-3182
Null-Space-Based Elegant Anti-Disturbance Control Allocation for Autonomous Berthing
To mitigate the impact of multi-source disturbances, such as environmental loads, bank effects, model uncertainties, and control allocation (CA) errors, during autonomous ship berthing, we propose an anti-disturbance control allocation method based on the null-space. This method considers the real-time and precision requirements of motion control allocation algorithms, as well as the characteristics of disturbances and their corresponding responses. The first step involves establishing models for ship berthing motion, multi-source disturbances, and control allocation. A passive elegant extended state observer (PEESO) is designed to estimate ship states and multi-source disturbances in real-time. Moreover, null-space technology is employed to develop a CA algorithm that ensures real-time and accurate results. This algorithm achieves the scheme of stabilization control outside the berth and then parallel berthing. Simulation and comparison experiments demonstrate that this method ensures the accuracy of berthing motion control and significantly reduces computation time, thereby decreasing the maximum allocation error.
- 17 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3177-3182
Null-Space-Based Elegant Anti-Disturbance Control Allocation for Autonomous Berthing
To mitigate the impact of multi-source disturbances, such as environmental loads, bank effects, model uncertainties, and control allocation (CA) errors, during autonomous ship berthing, we propose an anti-disturbance control allocation method based on the null-space. This method considers the real-time and precision requirements of motion control allocation algorithms, as well as the characteristics of disturbances and their corresponding responses. The first step involves establishing models for ship berthing motion, multi-source disturbances, and control allocation. A passive elegant extended state observer (PEESO) is designed to estimate ship states and multi-source disturbances in real-time. Moreover, null-space technology is employed to develop a CA algorithm that ensures real-time and accurate results. This algorithm achieves the scheme of stabilization control outside the berth and then parallel berthing. Simulation and comparison experiments demonstrate that this method ensures the accuracy of berthing motion control and significantly reduces computation time, thereby decreasing the maximum allocation error.