← Search

Peijie Dong

29 accepted papers

2026

Identifying and Mitigating Errors in Gradient Aggregation of Distributed Data Parallel Training

ICML 2026poster

Hardware-related silent data corruptions during gradient aggregation pose significant challenges to fault-tolerant distributed training, often leading to slow or failed convergence. To address this, we first mathematically formulate these errors as gradient inconsistency and theoretically analyze ho…

Cited by 0SourceScholar
2026

Semantic Integrity Matters: Benchmarking and Preserving High-Density Reasoning in KV Cache Compression

ICML 2026poster

While Key-Value (KV) cache compression is essential for efficient LLM inference, current evaluations disproportionately focus on \textbf{sparse retrieval} tasks, potentially masking the degradation of High-Density Reasoning where Chain-of-Thought (CoT) coherence is critical. We introduce KVFundaBenc…

Cited by 0SourceScholar
2026

Smooth Reading: Bridging the Gap of Recurrent LLM to Self-Attention LLM on Long-Context Understanding

ICLR 2026poster

Recurrent large language models (Recurrent LLMs) offer linear computational complexity as efficient alternatives to quadratic self-attention-based LLMs (Self-Attention LLMs). However, Recurrent LLMs underperform on long-context tasks due to limited fixed-size memory. Previous research focused on arc…

Cited by 0SourceScholar
2026

VCG-Bench: Towards A Unified Visual-Centric Benchmark for Structured Generation and Editing

ICML 2026poster

Despite the rapid advancements in Vision-Language Models (VLMs), a critical gap remains in their ability to handle structured, controllable diagrammatic tasks essential for professional workflows, as existing methods predominantly rely on pixel-based synthesis which operates in probabilistic pixel s…

Cited by 0SourceScholar
2025

Can Compressed LLMs Truly Act? An Empirical Evaluation of Agentic Capabilities in LLM Compression

ICML 2025poster

Post-training compression reduces the computational and memory costs of large language models (LLMs), enabling resource-efficient deployment. However, existing compression benchmarks focus narrowly on language modeling (e.g., perplexity) and natural language understanding tasks (e.g., GLUE accuracy)…

2025

ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inference

NeurIPS 2025poster

Large Language Models (LLMs) require significant GPU memory when processing long texts, with the key value (KV) cache consuming up to 70\% of total memory during inference. Although existing compression methods reduce memory by evaluating the importance of individual tokens, they overlook critical s…

Cited by 0SourcecodeScholar
2025

ParZC: Parametric Zero-Cost Proxies for Efficient NAS

AAAI 2025technical

Recent advancements in Zero-shot Neural Architecture Search (NAS) highlight the ability of zero-cost proxies in identifying superior architecture. However, we identify a critical issue with current zero-cost proxies: they aggregate node-wise zero-cost statistics without considering that not all node…

Cited by 7SourcePDFScholar
2025

Perovskite-LLM: Knowledge-Enhanced Large Language Models for Perovskite Solar Cell Research

EMNLP 2025

The rapid advancement of perovskite solar cells (PSCs) has led to an exponential growth in research publications, creating an urgent need for efficient knowledge management and reasoning systems in this domain. We present a comprehensive knowledge-enhanced system for PSCs that integrates three key c

Cited by 0SourcePDFScholar
2025

STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMs

ICLR 2025poster

In this paper, we present the first structural binarization method for LLM compression to less than 1-bit precision. Although LLMs have achieved remarkable performance, their memory-bound nature during the inference stage hinders the adoption of resource-constrained devices. Reducing weights to 1-bi…

2024

AttnZero: Efficient Attention Discovery for Vision Transformers

ECCV 2024poster

"In this paper, we present AttnZero, the first framework for automatically discovering efficient attention modules tailored for Vision Transformers (ViTs). While traditional self-attention in ViTs suffers from quadratic computation complexity, linear attention offers a more efficient alternative wit…

2024

Auto-DAS: Automated Proxy Discovery for Training-free Distillation-aware Architecture Search

ECCV 2024poster

"Distillation-aware Architecture Search (DAS) seeks to discover the ideal student architecture that delivers superior performance by distilling knowledge from a given teacher model. Previous DAS methods involve time-consuming training-based search processes. Recently, the training-free DAS method (,…

2024

Auto-GAS: Automated Proxy Discovery for Training-free Generative Architecture Search

ECCV 2024poster

"In this paper, we introduce Auto-GAS, the first training-free Generative Architecture Search (GAS) framework enabled by an auto-discovered proxy. Generative models like Generative Adversarial Networks (GANs) are now widely used in many real-time applications. Previous GAS methods use differentiable…

2024

Auto-Prox: Training-Free Vision Transformer Architecture Search via Automatic Proxy Discovery

AAAI 2024technical

The substantial success of Vision Transformer (ViT) in computer vision tasks is largely attributed to the architecture design. This underscores the necessity of efficient architecture search for designing better ViTs automatically. As training-based architecture search methods are computationally in…

2024

DetKDS: Knowledge Distillation Search for Object Detectors

ICML 2024poster

In this paper, we present DetKDS, the first framework that searches for optimal detection distillation policies. Manual design of detection distillers becomes challenging and time-consuming due to significant disparities in distillation behaviors between detectors with different backbones, paradigms…

2024

Discovering Sparsity Allocation for Layer-wise Pruning of Large Language Models

NeurIPS 2024poster

In this paper, we present DSA, the first automated framework for discovering sparsity allocation schemes for layer-wise pruning in Large Language Models (LLMs). LLMs have become increasingly powerful, but their large parameter counts make them computationally expensive. Existing pruning methods fo…

Cited by 10SourcePDFScholar
2024

FuseFL: One-Shot Federated Learning through the Lens of Causality with Progressive Model Fusion

NeurIPS 2024spotlight

One-shot Federated Learning (OFL) significantly reduces communication costs in FL by aggregating trained models only once. However, the performance of advanced OFL methods is far behind the normal FL. In this work, we provide a causal view to find that this performance drop of OFL methods comes from…

2024

LPZero: Language Model Zero-cost Proxy Search from Zero

EMNLP 2024finding

Despite the outstanding performance, Neural Architecture Search (NAS) is criticized for massive computation. Recently, Zero-shot NAS has emerged as a promising approach by exploiting Zero-cost (ZC) proxies, which markedly reduce computational demands. Despite this, existing ZC proxies heavily rely o…

Cited by 2SourcePDFScholar
2024

Multi-Task Domain Adaptation for Language Grounding with 3D Objects

ECCV 2024poster

"The existing works on object-level language grounding with 3D objects mostly focus on improving performance by utilizing the off-the-shelf pre-trained models to capture features, such as viewpoint selection or geometric priors. However, they have failed to consider exploring the cross-modal represe…

Cited by 1SourcePDFScholar
2024

Pruner-Zero: Evolving Symbolic Pruning Metric From Scratch for Large Language Models

ICML 2024poster

Despite the remarkable capabilities, Large Language Models (LLMs) face deployment challenges due to their extensive size. Pruning methods drop a subset of weights to accelerate, but many of them require retraining, which is prohibitively expensive and computationally demanding. Recently, post-traini…

2024

Should We Really Edit Language Models? On the Evaluation of Edited Language Models

NeurIPS 2024poster

Model editing has become an increasingly popular alternative for efficiently updating knowledge within language models. Current methods mainly focus on reliability, generalization, and locality, with many methods excelling across these criteria. Some recent works disclose the pitfalls of these ed…

2023

DMFormer: Closing the gap Between CNN and Vision Transformers

ICASSP 2023accepted

Vision transformers have shown excellent performance in computer vision tasks. As the computation cost of their self-attention mechanism is expensive, recent works tried to replace the self-attention mechanism in vision transformers with convolutional operations, which is more efficient with built-i…

Cited by 0SourceScholar
2023

EMQ: Evolving Training-free Proxies for Automated Mixed Precision Quantization

ICCV 2023poster

Mixed-Precision Quantization (MQ) can achieve a competitive accuracy-complexity trade-off for models. Conventional training-based search methods require time-consuming candidate training to search optimized per-layer bit-width configurations in MQ. Recently, some training-free approaches have presen…

Cited by 39PDFcodeScholar
2023

KD-Zero: Evolving Knowledge Distiller for Any Teacher-Student Pairs

NeurIPS 2023poster

Knowledge distillation (KD) has emerged as an effective technique for compressing models that can enhance the lightweight model. Conventional KD methods propose various designs to allow student model to imitate the teacher better. However, these handcrafted KD designs heavily rely on expert knowle…

Cited by 38SourcePDFScholar
2023

Progressive Meta-Pooling Learning for Lightweight Image Classification Model

ICASSP 2023accepted

Practical networks for edge devices adopt shallow depth and small convolutional kernels to save memory and computational cost, which leads to a restricted receptive field. Conventional efficient learning methods focus on lightweight convolution designs, ignoring the role of the receptive field in ne…

Cited by 0SourceScholar
2023

RD-NAS: Enhancing One-Shot Supernet Ranking Ability Via Ranking Distillation From Zero-Cost Proxies

ICASSP 2023accepted

Neural architecture search (NAS) has made tremendous progress in the automatic design of effective neural network structures but suffers from a heavy computational burden. One-shot NAS significantly alleviates the burden through weight sharing and improves computational efficiency. Zero-shot NAS fur…

Cited by 0SourceScholar
2022

Cross-Modal Knowledge Distillation in Multi-Modal Fake News Detection

ICASSP 2022accepted

Since the rapid dissemination of fake news brings a lot of negative effects on real society, automatic fake news detection has attracted increasing attention in recent years. In most circumstances, the fake news detection task is a multimodal problem that consists of textual and visual contents. Man…

Cited by 0SourceScholar