paper-with-me

Papers

RepAn: Enhanced Annealing through Re-parameterization

2024-01-01 · CVPR 2024 1 · Xiang Fei, Xiawu Zheng, Yan Wang, Fei Chao, Chenglin Wu, Liujuan Cao

The simulated annealing algorithm aims to improve model convergence through multiple restarts of training. However existing annealing algorithms overlook the correlation between different cycles neglecting the potential for incremental learning. We contend that a fixed network structure prevents the model from recognizing distinct features at different training stages. To this end we propose RepAn redesigning the irreversible re-parameterization (Rep) method and integrating it with annealing to enhance training. Specifically the network goes through Rep expansion restoration and backpropagation operations during training and iterating through these processes in each annealing round. Such a method exhibits good generalization and is easy to apply and we provide theoretical explanations for its effectiveness. Experiments demonstrate that our method improves baseline performance by 6.38% on the CIFAR-100 dataset and 2.80% on ImageNet achieving state-of-the-art performance in the Rep field. The code is available at https://github.com/xfey/RepAn.

📄 PDF Abstract BibTeX

Code (1)

xfey/repan 공식 구현 pytorch

Tasks

Incremental Learning

Similar Papers 제목 키워드 기반

Variational Neural Annealing

2021-01-25 · Mohamed Hibat-Allah, Estelle M. Inack, Roeland Wiersema, Roger G. Melko 외

Many important challenges in science and technology can be cast as optimization problems. When viewed in a statistical physics framework, these can be tackled by simulated annealing, where a gradual cooling procedure hel…

Cyclical Log Annealing as a Learning Rate Scheduler

2024-03-13 · Philip Naveen

A learning rate scheduler is a predefined set of instructions for varying search stepsizes during model training processes. This paper introduces a new logarithmic method using harsh restarting of step sizes through stoc…

Network Pruning Optimization by Simulated Annealing Algorithm

2021-09-29 · Chun Lin Kuo, Ercan Engin Kuruoglu, Wai Kin Victor Chan

One critical problem of large neural networks is over-parameterization with a large number of weight parameters. This becomes an obstacle to implement networks in edge devices as well as limiting the development of indus…

Network Pruning

MCMC Variational Inference via Uncorrected Hamiltonian Annealing

2021-07-08 · NeurIPS 2021 12 · Tomas Geffner, Justin Domke

Given an unnormalized target distribution we want to obtain approximate samples from it and a tight lower bound on its (log) normalization constant log Z. Annealed Importance Sampling (AIS) with Hamiltonian MCMC is a pow…

Variational Inference

Optimizing LPB Algorithms using Simulated Annealing

2024-12-22 · Dana Rasul Hamad, Tarik A. Rashid

Learner Performance-based Behavior using Simulated Annealing (LPBSA) is an improvement of the Learner Performance-based Behavior (LPB) algorithm. LPBSA, like LPB, has been proven to deal with single and complex problems.…