Parameter-efficient fine-tuning for large models: A comprehensive survey

Z Han, C Gao, J Liu, J Zhang, SQ Zhang - arXiv preprint arXiv:2403.14608, 2024 - arxiv.org
Large models represent a groundbreaking advancement in multiple application fields,
enabling remarkable achievements across various tasks. However, their unprecedented …

Deep learning for visual understanding: A review

Y Guo, Y Liu, A Oerlemans, S Lao, S Wu, MS Lew - Neurocomputing, 2016 - Elsevier
Deep learning algorithms are a subset of the machine learning algorithms, which aim at
discovering multiple levels of distributed representations. Recently, numerous deep learning …

Image super-resolution with non-local sparse attention

Y Mei, Y Fan, Y Zhou - … of the IEEE/CVF conference on …, 2021 - openaccess.thecvf.com
Both non-local (NL) operation and sparse representation are crucial for Single Image Super-
Resolution (SISR). In this paper, we investigate their combinations and propose a novel Non …

Vector approximate message passing

S Rangan, P Schniter… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
The standard linear regression (SLR) problem is to recover a vector x 0 from noisy linear
observations y= Ax 0+ w. The approximate message passing (AMP) algorithm proposed by …

An introduction to continuous optimization for imaging

A Chambolle, T Pock - Acta Numerica, 2016 - cambridge.org
A large number of imaging problems reduce to the optimization of a cost function, with
typical structural properties. The aim of this paper is to describe the state of the art in …

AMP-inspired deep networks for sparse linear inverse problems

M Borgerding, P Schniter… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Deep learning has gained great popularity due to its widespread success on many inference
problems. We consider the application of deep learning to the sparse linear inverse …

DC programming and DCA: thirty years of developments

HA Le Thi, T Pham Dinh - Mathematical Programming, 2018 - Springer
The year 2015 marks the 30th birthday of DC (Difference of Convex functions) programming
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …

[图书][B] An invitation to compressive sensing

S Foucart, H Rauhut, S Foucart, H Rauhut - 2013 - Springer
This first chapter formulates the objectives of compressive sensing. It introduces the
standard compressive problem studied throughout the book and reveals its ubiquity in many …

Adaptive restart for accelerated gradient schemes

B O'donoghue, E Candes - Foundations of computational mathematics, 2015 - Springer
In this paper we introduce a simple heuristic adaptive restart technique that can dramatically
improve the convergence rate of accelerated gradient schemes. The analysis of the …

Proximal splitting methods in signal processing

PL Combettes, JC Pesquet - Fixed-point algorithms for inverse problems in …, 2011 - Springer
The proximity operator of a convex function is a natural extension of the notion of a
projection operator onto a convex set. This tool, which plays a central role in the analysis …