Skip to content
Open access

Toward Solving the Learning Rate Problem in Convolutional Neural Networks Using an Enhanced Cyclical Learning Rate Strategy

2026 · IEEE Access · Vol 14, pp. 106615-106633 · 0 citations · 40 references
Computer Science

TL;DR

The Cyclical Local Adaptive Learning Rate Strategy (CLARA) is proposed, an enhanced CLR that introduces scheduler-level adaptive learning rate adjustment and dynamically adjusts the lower learning rate bound in response to training behaviour to improve convergence consistency during training.

Abstract

Convolutional neural networks (CNNs) are widely used for image segmentation and classification due to their strong ability to learn spatial representations. However, optimization stability and convergence efficiency remain challenging, particularly for tasks involving unclear or overlapping boundaries. Predefined learning rate schedules, such as cyclical learning rate (CLR), are commonly used in CNN training but offer limited adaptability to training dynamics. This study proposes the Cyclical Local Adaptive Learning Rate Strategy (CLARA), an enhanced CLR that introduces scheduler-level adaptive learning rate adjustment. CLARA dynamically adjusts the lower learning rate bound in response to training behaviour to improve convergence consistency during training. Integrated with U-Net, CLARA was evaluated on overlapping chromosome segmentation and achieved an Intersection over Union of 99.98% with 99.99% validation accuracy, while also producing more consistent segmentation outputs and improved separation in overlapping regions. Experiments on wafer defect classification using ResNet-50 achieved 99.39% validation accuracy, suggesting the applicability of the proposed scheduler across the evaluated segmentation and classification tasks.

Read PDF

Similar papers

Aug 2026

Reinforcement Learning Pruning with Dynamic Reward Function and Joint Selecting Mechanism

A dynamic pruning method that uses reinforcement learning guided by a dynamic reward function to automatically explore the pruning rate of each layer, and uses the designed similarity-based connected graph (SCG) mechanism to perform channel removal operations during training.

Ruisi Cai, Yi-Xin Zhao · 0 citations
Open access Aug 2026

Cross-Architecture Assessment of Hyperparameter Optimization Techniques in Convolutional Neural Networks

It is demonstrated that hyperparameter optimization dynamics depend heavily on dataset complexity, where computational efficiency is the primary differentiator for simpler classification tasks, but optimization architecture selection becomes critical for navigating challenging medical imaging applications.

Sarab Almuhaideb, Ahmad Raza Khan · 0 citations
Open access 2026

Hierarchy-Aligned Learning Rates for Vision Networks

Asynchronous Learning Rate is proposed, which assigns depth-dependent initial learning rates to network modules according to their topological depth, and Smoothed Synchronous Decay is proposed, which coordinates the subsequent decay of heterogeneous parameter groups.

Qiang He, Qiu Zong, Yi-Qi Wang et al. · 0 citations
Open access Sep 2026

A Novel Weight Initialization Scheme for Randomized Leaky Rectified Linear Units and a Comparative Analysis of Rectified Activation Functions for Image Classification

This study proposes a novel weight initialization scheme specifically designed for the randomized leaky rectified linear unit (RReLU) activation function, with the objective of preserving signal statistics during both forward and backward propagation.

M. Turhan, Emrah Dönmez · 0 citations
Review Open access Aug 2026

Systematic Analysis of Deep Learning Models for Performance Assessment

The study establishes a multidimensional framework for assessing deep learning performance and identifies the need for evaluation strategies that jointly consider predictive capability, robustness, computational cost, and deployment constraints.

Aleksandar Iliev, Elena Stojanovsk · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.