← Search

Jingwen Leng

18 accepted papers

2026

ASTRAEA: A Token-wise Acceleration Framework for Video Diffusion Transformers

ICLR 2026poster

Video diffusion transformers (vDiTs) have made tremendous progress in text-to-video generation, but their high computational demands pose a major challenge for practical deployment. While existing studies propose acceleration methods to reduce workload at various granularities, they often rely on he…

Cited by 0SourceScholar
2026

DASH: Deterministic Attention Scheduling for High-throughput Reproducible LLM Training

ICLR 2026poster

Determinism is indispensable for reproducibility in large language model (LLM) training, yet it often exacts a steep performance cost. In widely used attention implementations such as FlashAttention-3, the deterministic backward pass can incur up to a 37.9% throughput reduction relative to its non‑d…

Cited by 0SourcecodeScholar
2026

Seele: A Unified Acceleration Framework for Real-Time Gaussian Splatting on Mobile Devices

CVPR 2026

3D Gaussian Splatting (3DGS) has become a crucial rendering technique for many real-time applications. How- ever, the limited hardware resources on today's mobile platforms hinder these applications, as they struggle to achieve real-time performance. In this paper, we propose SEELE, a general framew

Cited by 0SourcecodeScholar
2026

TimeRipples: Accelerating vDiTs by Understanding the Spatio-Temporal Correlations in Latent Space

CVPR 2026

The recent surge in video generation has shown the growing demand for high-quality video synthesis using large vision models. Existing video generation models are predominantly based on the video diffusion transformer (vDiT), however, they suffer from substantial inference delay due to self-attentio

Cited by 0SourceScholar
2025

An Efficient Private GPT Never Autoregressively Decodes

ICML 2025poster

The wide deployment of the generative pre-trained transformer (GPT) has raised privacy concerns for both clients and servers. While cryptographic primitives can be employed for secure GPT inference to protect the privacy of both parties, they introduce considerable performance overhead. To accelerat…

Cited by 0SourcePDFScholar
2025

ClusterFusion: Expanding Operator Fusion Scope for LLM Inference via Cluster-Level Collective Primitive

NeurIPS 2025poster

Large language model (LLM) decoding suffers from high latency due to fragmented execution across operators and heavy reliance on off-chip memory for data exchange and reduction. This execution model limits opportunities for fusion and incurs significant memory traffic and kernel launch overhead. Wh…

Cited by 0SourceScholar
2025

Gumbel Reranking: Differentiable End-to-End Reranker Optimization

ACL 2025long

RAG systems rely on rerankers to identify relevant documents. However, fine-tuning these models remains challenging due to the scarcity of annotated query-document pairs. Existing distillation-based approaches suffer from training-inference misalignment and fail to capture interdependencies among ca…

Cited by 0SourcePDFScholar
2025

WeightedKV: Attention Scores Weighted Key-Value Cache Merging for Large Language Models

ICASSP 2025accepted

Large Language Models (LLMs) use key-value (KV) cache to reduce redundant computation in autoregressive generation. However, the KV cache size increases linearly during generation, leading to excessive memory usage, especially for long texts. Most KV cache compression methods evict the unimportant K…

Cited by 0SourceScholar
2025

Yggdrasil: Bridging Dynamic Speculation and Static Runtime for Latency-Optimal Tree-Based LLM Decoding

NeurIPS 2025poster

Speculative decoding improves LLM inference by generating and verifying multiple tokens in parallel, but existing systems suffer from suboptimal performance due to a mismatch between dynamic speculation and static runtime assumptions. We present Yggdrasil, a co-designed system that enables latency-o…

Cited by 0SourceScholar
2024

Fovea Transformer: Efficient Long-Context Modeling with Structured Fine-To-Coarse Attention

ICASSP 2024accepted

The quadratic complexity of self-attention in Transformers has hindered the processing of long text. To alleviate this problem, previous works have proposed to sparsify the attention matrix, taking advantage of the observation that crucial information about a token can be derived from its neighbors.…

Cited by 0SourceScholar
2024

Nimbus: Secure and Efficient Two-Party Inference for Transformers

NeurIPS 2024poster

Transformer models have gained significant attention due to their power in machine learning tasks. Their extensive deployment has raised concerns about the potential leakage of sensitive information during inference. However, when being applied to Transformers, existing approaches based on secure tw…

2023

Fourier Transformer: Fast Long Range Modeling by Removing Sequence Redundancy with FFT Operator

ACL 2023findings

The transformer model is known to be computationally demanding, and prohibitively costly for long sequences, as the self-attention module uses a quadratic time and space complexity with respect to sequence length. Many researchers have focused on designing new forms of self-attention or introducing…

2022

Block-Skim: Efficient Question Answering for Transformer

AAAI 2022technical

Transformer models have achieved promising results on natural language processing (NLP) tasks including extractive question answering (QA). Common Transformer encoders used in NLP tasks process the hidden states of all input tokens in the context paragraph throughout all layers. However, different f…

2022

SQuant: On-the-Fly Data-Free Quantization via Diagonal Hessian Approximation

ICLR 2022poster

Quantization of deep neural networks (DNN) has been proven effective for compressing and accelerating DNN models. Data-free quantization (DFQ) is a promising approach without the original datasets under privacy-sensitive and confidential scenarios. However, current DFQ solutions degrade accuracy, ne…

2022

Transkimmer: Transformer Learns to Layer-wise Skim

ACL 2022long

Transformer architecture has become the de-facto model for many machine learning tasks from natural language processing and computer vision. As such, improving its computational efficiency becomes paramount. One of the major computational inefficiency of Transformer based models is that they spend t…

2020

How Far Does BERT Look At: Distance-based Clustering and Analysis of BERT’s Attention

COLING 2020main

Recent research on the multi-head attention mechanism, especially that in pre-trained models such as BERT, has shown us heuristics and clues in analyzing various aspects of the mechanism. As most of the research focus on probing tasks or hidden states, previous works have found some primitive patter…

Cited by 25SourcePDFScholar
2019

Adversarial Defense Through Network Profiling Based Path Extraction

CVPR 2019poster

Recently, researchers have started decomposing deep neural network models according to their semantics or functions. Recent work has shown the effectiveness of decomposed functional blocks for defending adversarial attacks, which add small input perturbation to the input image to fool the DNN models…

Cited by 65PDFScholar