English
Related papers

Related papers: OPERA: Online Data Pruning for Efficient Retrieval…

200 papers

There are many critical challenges in optimizing neural network models, including distributed computing, compression techniques, and efficient training, regardless of their application to specific tasks. Solving such problems is crucial…

Machine Learning · Computer Science 2025-10-13 Ilia Revin , Leon Strelkov , Vadim A. Potemkin , Ivan Kireev , Andrey Savchenko

Direct Preference Optimization (DPO) has emerged as a compelling approach for training Large Language Models (LLMs) to adhere to human preferences. However, the performance of DPO is sensitive to the fine-tuning of its trade-off parameter…

Artificial Intelligence · Computer Science 2024-10-15 Junkang Wu , Yuexiang Xie , Zhengyi Yang , Jiancan Wu , Jinyang Gao , Bolin Ding , Xiang Wang , Xiangnan He

Dynamic multi-objective optimization problems (DMOPs) remain a challenge to be settled, because of conflicting objective functions change over time. In recent years, transfer learning has been proven to be a kind of effective approach in…

Neural and Evolutionary Computing · Computer Science 2019-10-23 Zhenzhong Wang , Min Jiang , Xing Gao , Liang Feng , Weizhen Hu , Kay Chen Tan

Reinforcement learning (RL) has become an effective approach for fine-tuning large language models (LLMs), particularly to enhance their reasoning capabilities. However, RL fine-tuning remains highly resource-intensive, and existing work…

Machine Learning · Computer Science 2026-02-17 Yifan Sun , Jingyan Shen , Yibin Wang , Tianyu Chen , Zhendong Wang , Mingyuan Zhou , Huan Zhang

We introduce SPARTA, a novel neural retrieval method that shows great promise in performance, generalization, and interpretability for open-domain question answering. Unlike many neural ranking methods that use dense vector nearest neighbor…

Computation and Language · Computer Science 2020-09-29 Tiancheng Zhao , Xiaopeng Lu , Kyusong Lee

Prior work in multi-objective reinforcement learning typically uses linear reward scalarization with fixed weights, which provably fails to capture non-convex Pareto fronts and thus yields suboptimal results. This limitation becomes…

Machine Learning · Computer Science 2026-04-01 Yining Lu , Zilong Wang , Shiyang Li , Xin Liu , Changlong Yu , Qingyu Yin , Zhan Shi , Zixuan Zhang , Meng Jiang

DPO is an effective preference optimization algorithm. However, the DPO-tuned models tend to overfit on the dispreferred samples, manifested as overly long generations lacking diversity. While recent regularization approaches have…

Computation and Language · Computer Science 2025-08-26 Chenxu Yang , Ruipeng Jia , Naibin Gu , Zheng Lin , Siyuan Chen , Chao Pang , Weichong Yin , Yu Sun , Hua Wu , Weiping Wang

Developing policies that can adjust to non-stationary environments is essential for real-world reinforcement learning applications. However, learning such adaptable policies in offline settings, with only a limited set of pre-collected…

Machine Learning · Computer Science 2025-03-28 Xinyu Zhang , Wenjie Qiu , Yi-Chen Li , Lei Yuan , Chengxing Jia , Zongzhang Zhang , Yang Yu

Recent work has demonstrated that using parameter efficient tuning techniques such as prefix tuning (or P-tuning) on pretrained language models can yield performance that is comparable or superior to fine-tuning while dramatically reducing…

Computation and Language · Computer Science 2023-06-30 Stephen Obadinma , Hongyu Guo , Xiaodan Zhu

Over-parameterization of deep neural networks (DNNs) has shown high prediction accuracy for many applications. Although effective, the large number of parameters hinders its popularity on resource-limited devices and has an outsize…

Machine Learning · Computer Science 2023-04-25 Shaoyi Huang , Bowen Lei , Dongkuan Xu , Hongwu Peng , Yue Sun , Mimi Xie , Caiwen Ding

Offline reinforcement learning aims to utilize datasets of previously gathered environment-action interaction records to learn a policy without access to the real environment. Recent work has shown that offline reinforcement learning can be…

Machine Learning · Computer Science 2023-08-30 Hanhan Zhou , Tian Lan , Vaneet Aggarwal

The pretrain-finetune paradigm in modern computer vision facilitates the success of self-supervised learning, which tends to achieve better transferability than supervised learning. However, with the availability of massive labeled data, a…

Computer Vision and Pattern Recognition · Computer Science 2022-11-30 Chengkun Wang , Wenzhao Zheng , Zheng Zhu , Jie Zhou , Jiwen Lu

With the development of pre-trained language models, the dense retrieval models have become promising alternatives to the traditional retrieval models that rely on exact match and sparse bag-of-words representations. Different from most…

Information Retrieval · Computer Science 2024-03-21 Qi Liu , Gang Guo , Jiaxin Mao , Zhicheng Dou , Ji-Rong Wen , Hao Jiang , Xinyu Zhang , Zhao Cao

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

Existing pruning techniques for large language models (LLMs) targeting domain-specific applications typically follow a two-stage process: pruning the pretrained general-purpose LLMs and then fine-tuning the pruned LLMs on specific domains.…

Computation and Language · Computer Science 2024-12-23 Lei Lu , Zhepeng Wang , Runxue Bao , Mengbing Wang , Fangyi Li , Yawen Wu , Weiwen Jiang , Jie Xu , Yanzhi Wang , Shangqian Gao

Training advanced machine learning models demands massive datasets, resulting in prohibitive computational costs. To address this challenge, data pruning techniques identify and remove redundant training samples while preserving model…

Machine Learning · Computer Science 2025-06-23 Sebastian Schmidt , Prasanga Dhungel , Christoffer Löffler , Björn Nieth , Stephan Günnemann , Leo Schwinn

Structured pruning reduces LLM inference cost by removing low-importance architectural components. This can be viewed as learning a multiplicative gate for each component under an l0 sparsity constraint. Due to the discreteness of the l0…

Machine Learning · Computer Science 2026-05-12 Weiyu Huang , Pengle Zhang , Xiaolu Zhang , Jun Zhou , Jun Zhu , Jianfei Chen

Direct Preference Optimisation (DPO) has emerged as a powerful method for aligning Large Language Models (LLMs) with human preferences, offering a stable and efficient alternative to approaches that use Reinforcement learning via Human…

Artificial Intelligence · Computer Science 2025-05-06 Sarvesh Shashidhar , Ritik , Nachiketa Patil , Suraj Racha , Ganesh Ramakrishnan

Online machine learning systems need to adapt to domain shifts. Meanwhile, acquiring label at every timestep is expensive. We propose a surprisingly simple algorithm that adaptively balances its regret and its number of label queries in…

Machine Learning · Computer Science 2021-03-01 Yining Chen , Haipeng Luo , Tengyu Ma , Chicheng Zhang

Achieving good speed and accuracy trade-off on a target platform is very important in deploying deep neural networks in real world scenarios. However, most existing automatic architecture search approaches only concentrate on high…

Computer Vision and Pattern Recognition · Computer Science 2019-04-08 Xin Li , Yiming Zhou , Zheng Pan , Jiashi Feng
‹ Prev 1 4 5 6 7 8 10 Next ›