← Search

Zhengbao He

9 accepted papers

2026

Compress then Merge: From Multiple LoRAs into One Low-Rank Adapter

ICML 2026poster

Low-rank adaptation (LoRA) enables parameter-efficient specialization of foundation models, but the proliferation of task-specific adapters fragments capabilities across many adapters, complicating reuse and deployment. We study the problem of merging $T$ LoRAs into **a single rank-$r$ LoRA**, there…

Cited by 0SourceScholar
2026

Learn the Ropes, Then Trust the Wins: Self-imitation with Progressive Exploration for Agentic Reinforcement Learning

ICLR 2026poster

Reinforcement learning (RL) is the dominant paradigm for sharpening strategic tool use capabilities of LLMs on long-horizon, sparsely-rewarded agent tasks, yet it faces a fundamental challenge of exploration-exploitation trade-off. Existing studies stimulate exploration through the lens of policy en…

Cited by 0SourcecodeScholar
2026

RAIN-Merging: A Gradient-Free Method to Enhance Instruction Following in Large Reasoning Models with Preserved Thinking Format

ICLR 2026oral

Large reasoning models (LRMs) excel at a long chain of reasoning but often fail to faithfully follow instructions regarding output format, constraints, or specific requirements. We investigate whether this gap can be closed by integrating an instruction-tuned model (ITM) into an LRM. Analyzing their…

Cited by 0SourcecodeScholar
2026

Remaining-data-free Machine Unlearning by Suppressing Sample Contribution

ICLR 2026poster

Machine unlearning (MU) aims to remove the influence of specific training samples from a well-trained model, a task of growing importance due to the ``right to be forgotten.” The unlearned model should approach the retrained model, where forgetting data do not contribute to the training process. The…

Cited by 0SourceScholar
2025

Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscape

ICML 2025poster

Fine-tuning large-scale pre-trained models is prohibitively expensive in terms of computation and memory costs. Low-Rank Adaptation (LoRA), a popular Parameter-Efficient Fine-Tuning (PEFT) method, offers an efficient solution by optimizing only low-rank matrices. Despite recent progress in improving…

2025

Pursuing Feature Separation based on Neural Collapse for Out-of-Distribution Detection

ICLR 2025poster

In the open world, detecting out-of-distribution (OOD) data, whose labels are disjoint with those of in-distribution (ID) samples, is important for reliable deep neural networks (DNNs). To achieve better detection performance, one type of approach proposes to fine-tune the model with auxiliary OOD d…

2025

Simulating Training Dynamics to Reconstruct Training Data from Deep Neural Networks

ICLR 2025poster

Whether deep neural networks (DNNs) memorize the training data is a fundamental open question in understanding deep learning. A direct way to verify the memorization of DNNs is to reconstruct training data from DNNs’ parameters. Since parameters are gradually determined by data throughout training,…

Cited by 0SourcePDFScholar
2024

Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement

NeurIPS 2024spotlight

Machine unlearning (MU) has emerged to enhance the privacy and trustworthiness of deep neural networks. Approximate MU is a practical method for large-scale models. Our investigation into approximate MU starts with identifying the steepest descent direction, minimizing the output Kullback-Leibler di…