← Search

Lu YIn

37 accepted papers

2026

Demystifying the Roles of LLM Layers in Retrieval, Knowledge, and Reasoning

ICASSP 2026poster

Recent studies suggest that the deeper layers of Large Language Models (LLMs) contribute little to representation learning and can often be removed without significant performance loss. However, such claims are typically drawn from narrow evaluations and may overlook important aspects of model behav…

Cited by 0SourcePDFScholar
2026

Diffusion Language Model Knows the Answer Before It Decodes

ICLR 2026oral

Diffusion language models (DLMs) have recently emerged as an alternative to autoregressive approaches, offering parallel sequence generation and flexible token orders. However, their inference remains slower than that of autoregressive models, primarily due to the cost of bidirectional attention and…

Cited by 0SourcecodeScholar
2026

Distinguishing Imitation Error from Intrinsic Motion Learning Difficulty

ICML 2026poster

Physics-based motion imitation is central to humanoid control, yet current evaluation metrics(e.g., MPJPE) only quantify imitation outcomes, not their underlying causes. This conflation obscures a critical diagnostic question: when imitation error occurs, does it stem from policy limitations or the …

Cited by 0SourceScholar
2026

Dual-Kernel Adapter: Expanding Spatial Horizons for Data-Constrained Medical Image Analysis

ICLR 2026poster

Adapters have become a widely adopted strategy for efficient fine-tuning of foundation models, particularly in resource-constrained settings. However, their performance under extreme data scarcity—common in medical imaging due to high annotation costs, privacy regulations, and fragmented datasets—re…

Cited by 0SourceScholar
2026

GPTailor: Large Language Model Pruning Through Layer Cutting and Stitching

ICLR 2026poster

Large language models (LLMs) have shown remarkable capabilities in language understanding and generation. However, such impressive capability typically comes with a substantial model size, which presents significant challenges in deployment and inference. While structured pruning of model parameters…

Cited by 0SourcecodeScholar
2026

Improving Sparse IMU-based Motion Capture with Motion Label Smoothing

AAAI 2026technical

Sparse Inertial Measurement Units (IMUs) based human motion capture has gained significant momentum, driven by the adaptation of fundamental AI tools such as recurrent neural networks (RNNs) and transformers that are tailored for temporal and spatial modeling. Despite these achievements, current res

Cited by 0SourcePDFScholar
2026

One LR Doesn’t Fit All: Heavy-Tail Guided Layerwise Learning Rates for LLMs

ICML 2026poster

Learning rate configuration is a fundamental aspect of modern deep learning. The prevailing practice of applying a uniform learning rate across all layers overlooks the structural heterogeneity of Transformers, potentially limiting their effectiveness as the backbone of Large Language Models (LLMs).…

Cited by 0SourceScholar
2026

Rewiring Experts on the Fly: Continuous Rerouting for Better Online Adaptation in Mixture-of-Expert models

ICML 2026poster

Mixture-of-Experts (MoE) models achieve efficient scaling through sparse expert activation, but often suffer from suboptimal routing decisions due to distribution shifts in deployment. While existing test-time adaptation methods could potentially address these issues, they primarily focus on dense m…

Cited by 0SourceScholar
2026

Search or Accelerate: Confidence-Switched Position Beam Search for Diffusion Language Models

ICML 2026poster

Diffusion Language Models (DLMs) generate text by iteratively denoising a masked sequence, repeatedly deciding which positions to commit at each step. Standard decoding follows a greedy rule, unmasking the most confident positions, yet this local choice can lock the model into a suboptimal unmasking…

Cited by 0SourceScholar
2025

AlphaDecay: Module-wise Weight Decay for Heavy-Tailed Balancing in LLMs

NeurIPS 2025poster

Weight decay is a standard regularization technique for training large language models (LLMs). While it is common to assign a uniform decay rate to every layer, this approach overlooks the structural diversity of LLMs and the varying spectral properties across modules. In this paper, we introduce A…

Cited by 0SourcecodeScholar
2025

From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applications

ICML 2025poster

Large Language Models (LLMs) matrices can often be expressed in low-rank format with potential to relax memory and compute resource requirements. Unlike previous works which pivot around developing novel matrix decomposition algorithms, in this work we focus to study the emerging non-uniform low-ran…

Cited by 0SourcePDFScholar
2025

Full-Rank No More: Low-Rank Weight Training for Modern Speech Recognition Models

ICASSP 2025accepted

This paper investigates the under-explored area of low-rank weight training for large-scale Conformer-based speech recognition models from scratch. Our study demonstrates the viability of this training paradigm for such models, yielding several notable findings. Firstly, we discover that applying a…

Cited by 0SourceScholar
2025

GPAS: Accelerating Convergence of LLM Pretraining via Gradient-Preserving Activation Scaling

NeurIPS 2025poster

Modern Large Language Models, such as the LLaMA, Qwen and DeepSeek series, predominantly adopt the Pre-LayerNorm (Pre-LN) Transformer architecture. While being stable during pretraining and scalable to large model sizes, Pre-LN suffers from an exponential growth in activation variance across layers,…

Cited by 0SourcecodeScholar
2025

LIFT the Veil for the Truth: Principal Weights Emerge after Rank Reduction for Reasoning-Focused Supervised Fine-Tuning

ICML 2025poster

Recent studies have shown that supervised fine-tuning of LLMs on a small number of high-quality datasets can yield strong reasoning capabilities. However, full fine-tuning (Full FT), while powerful, is computationally expensive and susceptible to overfitting and catastrophic forgetting, particularly…

2025

MagShield: Towards Better Robustness in Sparse Inertial Motion Capture Under Magnetic Disturbances

ICCV 2025poster

This paper proposes a novel method, named MagShield, designed to address the issue of magnetic disturbances in sparse inertial motion capture (MoCap) systems. Existing Inertial Measurement Units (IMUs) are prone to orientation estimation errors in magnetically disturbed environments, limiting the pr…

2025

Mix-LN: Unleashing the Power of Deeper Layers by Combining Pre-LN and Post-LN

ICLR 2025poster

Large Language Models (LLMs) have achieved remarkable success, yet recent findings reveal that their deeper layers often contribute minimally and can be pruned without affecting overall performance. While some view this as an opportunity for model compression, we identify it as a training shortfall…

2025

SEBRA : Debiasing through Self-Guided Bias Ranking

ICLR 2025poster

Ranking samples by fine-grained estimates of spuriosity (the degree to which spurious cues are present) has recently been shown to significantly benefit bias mitigation, over the traditional binary biased-vs-unbiased partitioning of train sets. However, this spuriousity ranking comes with the requir…

2025

The Curse of Depth in Large Language Models

NeurIPS 2025poster

In this paper, we re-introduce the Curse of Depth, a concept that re-introduces, explains, and addresses the recent observation in modern Large Language Models (LLMs) where deeper layers are much less effective than expected. We first confirm the wide existence of this phenomenon across the most pop…

Cited by 0SourceScholar
2024

Accurate and Steady Inertial Pose Estimation through Sequence Structure Learning and Modulation

NeurIPS 2024poster

Transformer models excel at capturing long-range dependencies in sequential data, but lack explicit mechanisms to leverage structural patterns inherent in fixed-length input sequences. In this paper, we propose a novel sequence structure learning and modulation approach that endows Transformers wit…

Cited by 1SourcePDFScholar
2024

Advancing Dynamic Sparse Training by Exploring Optimization Opportunities

ICML 2024poster

Dynamic Sparse Training (DST) is an effective approach for addressing the substantial training resource requirements posed by the ever-increasing size of the Deep Neural Networks (DNNs). Characterized by its dynamic "train-prune-grow'' schedule during training, DST implicitly develops a bi-level str…

2024

E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image Segmentation

NeurIPS 2024poster

Deep neural networks have evolved as the leading approach in 3D medical image segmentation due to their outstanding performance. However, the ever-increasing model size and computational cost of deep neural networks have become the primary barriers to deploying them on real-world, resource-limited h…

2024

FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skipping

EMNLP 2024main

Autoregressive Large Language Models (e.g., LLaMa, GPTs) are omnipresent achieving remarkable success in language understanding and generation. However, such impressive capability typically comes with a substantial model size, which presents significant challenges for autoregressive token-by-token g…

Cited by 8SourcePDFScholar
2024

Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning

EMNLP 2024main

Network pruning has emerged as a potential solution to make LLMs cheaper to deploy. However, existing LLM pruning approachesuniversally rely on the C4 dataset as the calibration data for calculating pruning scores, leaving its optimality unexplored. In this study, we evaluate the choice of calibrati…

2024

Junk DNA Hypothesis: Pruning Small Pre-Trained Weights $\textit{Irreversibly}$ and $\textit{Monotonically}$ Impairs ``Difficult" Downstream Tasks in LLMs

ICML 2024poster

We present *Junk DNA Hypothesis* by adopting a novel *task-centric* angle for the pre-trained weights of large language models (LLMs). It has been believed that weights in LLMs contain significant redundancy, leading to the conception that a considerable chunk of the parameters can be removed by *pr…

2024

NeurRev: Train Better Sparse Neural Network Practically via Neuron Revitalization

ICLR 2024poster

Dynamic Sparse Training (DST) employs a greedy search mechanism to identify an optimal sparse subnetwork by periodically pruning and growing network connections during training. To guarantee effectiveness, DST algorithms rely on high search frequency, which consequently, requires large learning rate…

Cited by 3SourcePDFScholar
2024

Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity

ICML 2024poster

Large Language Models (LLMs), renowned for their remarkable performance across diverse domains, present a challenge due to their colossal model size when it comes to practical deployment. In response to this challenge, efforts have been directed toward the application of traditional network pruning…

2023

Are Large Kernels Better Teachers than Transformers for ConvNets?

ICML 2023poster

This paper reveals a new appeal of the recently emerged large-kernel Convolutional Neural Networks (ConvNets): as the teacher in Knowledge Distillation (KD) for small-kernel ConvNets. While Transformers have led state-of-the-art (SOTA) performance in various fields with ever-larger models and labele…

2023

Dynamic Sparsity Is Channel-Level Sparsity Learner

NeurIPS 2023poster

Sparse training has received an upsurging interest in machine learning due to its tantalizing saving potential for both the entire training process as well as the inference. Dynamic sparse training (DST) as a leading approach can train deep neural networks at high sparsity from scratch to match the…

2023

Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost

AAAI 2023technical

Lottery tickets (LTs) is able to discover accurate and sparse subnetworks that could be trained in isolation to match the performance of dense networks. Ensemble, in parallel, is one of the oldest time-proven tricks in machine learning to improve performance by combining the output of multiple indep…

2022

Superposing many tickets into one: A performance booster for sparse neural network training

UAI 2022poster

Recent works on sparse neural network training have shown that a compelling trade-off between performance and efficiency can be achieved. Existing sparse training methods usually strive to find the best sparse subnetwork possible in one single run, without involving any expensive dense or pre-traini…

Cited by 9SourcePDFScholar
2021

Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training

ICML 2021spotlight

In this paper, we introduce a new perspective on training deep neural networks capable of state-of-the-art performance without the need for the expensive over-parameterization by proposing the concept of In-Time Over-Parameterization (ITOP) in sparse training. By starting from a random sparse networ…

Cited by 152SourcePDFScholar
2021

DymSLAM: 4D Dynamic Scene Reconstruction Based on Geometrical Motion Segmentation

RA-L 2021

Most SLAM (Simultaneous Localization and Mapping) algorithms are based on the assumption that the scene is static. However, in practice, most real scenes usually contain moving objects. In this letter, we introduce DymSLAM, a dynamic stereo visual SLAM system being capable of reconstructing a 4D (3D

Cited by 50SourceScholar
2021

Sparse Training via Boosting Pruning Plasticity with Neuroregeneration

NeurIPS 2021poster

Works on lottery ticket hypothesis (LTH) and single-shot network pruning (SNIP) have raised a lot of attention currently on post-training pruning (iterative magnitude pruning), and before-training pruning (pruning at initialization). The former method suffers from an extremely large computation cost…

2018

On SDW-MWF and Variable Span Linear Filter with Application to Speech Recognition in Noisy Environments

ICASSP 2018accepted

Neural network based spectral mask estimation for acoustic beamforming, which consists of linear filtering and mask estimation, has shown to be a promising approach for robust speech recognition in noisy environments. Nevertheless, few improvements are made on the linear filtering. In this paper, we…

Cited by 0SourceScholar