paper-with-me

홈 › Papers

Proximal Mapping for Deep Regularization

2020-06-14 · NeurIPS 2020 12 · Mao Li, Yingyi Ma, Xinhua Zhang

Underpinning the success of deep learning is effective regularizations that allow a variety of priors in data to be modeled. For example, robustness to adversarial perturbations, and correlations between multiple modalities. However, most regularizers are specified in terms of hidden layer outputs, which are not themselves optimization variables. In contrast to prevalent methods that optimize them indirectly through model weights, we propose inserting proximal mapping as a new layer to the deep network, which directly and explicitly produces well regularized hidden layer outputs. The resulting technique is shown well connected to kernel warping and dropout, and novel algorithms were developed for robust temporal learning and multiview modeling, both outperforming state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:2006.07822

Code (1)

learndeep2019/ProxNet 공식 구현 pytorch

Similar Papers 제목 키워드 기반

A dual Newton based preconditioned proximal point algorithm for exclusive lasso models

2019-02-01 · Meixia Lin, Defeng Sun, Kim-Chuan Toh, Yancheng Yuan

The exclusive lasso (also known as elitist lasso) regularization has become popular recently due to its superior performance on group sparsity. Compared to the group lasso regularization which enforces the competition on…

Exploiting Strong Convexity from Data with Primal-Dual First-Order Algorithms

2017-03-07 · ICML 2017 8 · Jialei Wang, Lin Xiao

We consider empirical risk minimization of linear predictors with convex loss functions. Such problems can be reformulated as convex-concave saddle point problems, and thus are well suitable for primal-dual first-order a…

regression

Learning-based Image Reconstruction via Parallel Proximal Algorithm

2018-01-29 · Emrah Bostan, Ulugbek S. Kamilov, Laura Waller

In the past decade, sparsity-driven regularization has led to advancement of image reconstruction algorithms. Traditionally, such regularizers rely on analytical models of sparsity (e.g. total variation (TV)). However, m…

Image Reconstruction

Projected Nesterov's Proximal-Gradient Algorithm for Sparse Signal Reconstruction with a Convex Constraint

2015-02-09 · Renliang Gu, Aleksandar Dogandžić

We develop a projected Nesterov's proximal-gradient (PNPG) approach for sparse signal reconstruction that combines adaptive step size with Nesterov's momentum acceleration. The objective function that we wish to minimize…

compressed sensing

FedCanon: Non-Convex Composite Federated Learning with Efficient Proximal Operation on Heterogeneous Data

2025-04-16 · Yuan Zhou, Jiachen Zhong, Xinli Shi, Guanghui Wen 외

Composite federated learning offers a general framework for solving machine learning problems with additional regularization terms. However, many existing methods require clients to perform multiple proximal operations t…

Computational EfficiencyFederated Learning