English
Related papers

Related papers: DARE the Extreme: Revisiting Delta-Parameter Pruni…

200 papers

Model merging is to combine fine-tuned models derived from multiple domains, with the intent of enhancing the model's proficiency across various domains. The principal concern is the resolution of parameter conflicts. A substantial amount…

Computation and Language · Computer Science 2024-03-06 Yaochen Zhu , Rui Xia , Jiajun Zhang

Despite the success, the process of fine-tuning large-scale PLMs brings prohibitive adaptation costs. In fact, fine-tuning all the parameters of a colossal model and retaining separate instances for different tasks are practically…

With the proliferation of domain-specific models, model merging has emerged as a set of techniques that combine the capabilities of multiple models into one that can multitask without the cost of additional training. In this paper, we…

Computation and Language · Computer Science 2024-06-18 Pala Tej Deep , Rishabh Bhardwaj , Soujanya Poria

Fine-tuning large-scale pre-trained models is inherently a resource-intensive task. While it can enhance the capabilities of the model, it also incurs substantial computational costs, posing challenges to the practical application of…

Computation and Language · Computer Science 2024-06-27 Yulong Mao , Kaiyu Huang , Changhao Guan , Ganglin Bao , Fengran Mo , Jinan Xu

Unstructured neural network pruning algorithms have achieved impressive compression rates. However, the resulting - typically irregular - sparse matrices hamper efficient hardware implementations, leading to additional memory usage and…

Reinforcement learning improves the reasoning ability of large language models but remains costly and sample-inefficient, as many rollouts provide weak learning signals. Difficulty-aware data selection methods attempt to address this by…

Machine Learning · Computer Science 2026-05-12 Yang Zhou , Can Jin , Zihan Dong , Zhepeng Wang , Yanting Yang , Shiyu Zhao , Lei Li , Runxue Bao , Yaochen Xie , Dimitris N. Metaxas

Post-training has emerged as a crucial paradigm for adapting large-scale pre-trained models to various tasks, whose effects are fully reflected by delta parameters (i.e., the disparity between post-trained and pre-trained parameters). While…

Machine Learning · Computer Science 2024-10-18 Qiaoyu Tang , Le Yu , Bowen Yu , Hongyu Lin , Keming Lu , Yaojie Lu , Xianpei Han , Le Sun

With transformer-based models and the pretrain-finetune paradigm becoming mainstream, the high storage and deployment costs of individual finetuned models on multiple tasks pose critical challenges. Delta compression attempts to lower the…

Computer Vision and Pattern Recognition · Computer Science 2025-03-11 Chenyu Huang , Peng Ye , Xiaohui Wang , Shenghe Zheng , Biqing Qi , Lei Bai , Wanli Ouyang , Tao Chen

Dimensionality reduction is a critical step in scaling machine learning pipelines. Principal component analysis (PCA) is a standard tool for dimensionality reduction, but performing PCA over a full dataset can be prohibitively expensive. As…

Databases · Computer Science 2020-08-25 Sahaana Suri , Peter Bailis

Pruning is a widely used method for compressing Deep Neural Networks (DNNs), where less relevant parameters are removed from a DNN model to reduce its size. However, removing parameters reduces model accuracy, so pruning is typically…

Machine Learning · Computer Science 2025-06-17 Wenhao Hu , Paul Henderson , José Cano

Domain-specific finetuning is essential for dense retrievers, yet not all training pairs contribute equally to the learning process. We introduce OPERA, a data pruning framework that exploits this heterogeneity to improve both the…

Information Retrieval · Computer Science 2026-04-02 Haoyang Fang , Shuai Zhang , Yifei Ma , Hengyi Wang , Cuixiong Hu , Katrin Kirchhoff , Bernie Wang , George Karypis

Deep learning architectures with a huge number of parameters are often compressed using pruning techniques to ensure computational efficiency of inference during deployment. Despite multitude of empirical advances, there is a lack of…

Machine Learning · Computer Science 2021-06-14 Rupam Acharyya , Ankani Chattoraj , Boyu Zhang , Shouman Das , Daniel Stefankovic

This paper is devoted to the design of efficient primal-dual algorithm (PDA) for solving convex optimization problems with known saddle-point structure. We present a new PDA with larger acceptable range of parameters and correction, which…

Optimization and Control · Mathematics 2019-12-04 Xiaokai Chang , Sanyang Liu

In this paper, we propose a new decomposition approach named the proximal primal dual algorithm (Prox-PDA) for smooth nonconvex linearly constrained optimization problems. The proposed approach is primal-dual based, where the primal step…

Optimization and Control · Mathematics 2016-04-05 Mingyi Hong

A common explanation for the failure of deep networks to generalize out-of-distribution is that they fail to recover the "correct" features. We challenge this notion with a simple experiment which suggests that ERM already learns sufficient…

Machine Learning · Computer Science 2022-10-31 Elan Rosenfeld , Pradeep Ravikumar , Andrej Risteski

Deep Neural Networks(DNNs) have many parameters and activation data, and these both are expensive to implement. One method to reduce the size of the DNN is to quantize the pre-trained model by using a low-bit expression for weights and…

Computer Vision and Pattern Recognition · Computer Science 2020-11-26 Jun Nishikawa , Ryoji Ikegaya

Over parameterization is a common technique in deep learning to help models learn and generalize sufficiently to the given task; nonetheless, this often leads to enormous network structures and consumes considerable computing resources…

Computer Vision and Pattern Recognition · Computer Science 2022-04-26 Yuanchu Liang , Saeed Anwar , Yang Liu

Video Diffusion Transformers (DiTs) generate high-quality videos but demand substantial compute due to wide blocks, deep architectures, and iterative sampling. Recent methods reduce cost by compressing width, depth, or sampling steps, but…

Computer Vision and Pattern Recognition · Computer Science 2026-05-27 Yutong Wang , Yunke Wang , Tianfan Xue , Yu Qiao , Yaohui Wang , Xinyuan Chen , Chang Xu

LoRA-based large model parameter-efficient fine-tuning (PEFT) methods use low-rank de- composition to approximate updates to model parameters. However, compared to full- parameter fine-tuning, low-rank updates often lead to a performance…

Computation and Language · Computer Science 2025-08-26 Haojie Zhang

In the present noisy intermediate scale quantum computing era, there is a critical need to devise methods for the efficient implementation of gate-based variational quantum circuits. This ensures that a range of proposed applications can be…

Quantum Physics · Physics 2024-08-27 Ankit Kulshrestha , Xiaoyuan Liu , Hayato Ushijima-Mwesigwa , Bao Bach , Ilya Safro
‹ Prev 1 2 3 10 Next ›