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.
Abstract
Learning rate (LR) initialization and decay remain important factors in the optimization of deep vision networks. Although these models exhibit a clear hierarchical structure, training typically starts from a single global learning rate, with little explicit consideration of stage depth. This paper investigates a simple depth-aware alternative. We propose Asynchronous Learning Rate (ALR), which assigns depth-dependent initial learning rates to network modules according to their topological depth, and Smoothed Synchronous Decay (SSD), which coordinates the subsequent decay of heterogeneous parameter groups. A linear depth rule is adopted as a low-complexity, monotonic parameterization that is straightforward to implement across hierarchical architectures. The proposed strategy is evaluated on image classification and semantic segmentation benchmarks, including CIFAR-100, Mini-ImageNet, ImageNet-1K, Pascal VOC 2012, and LiTS. Additional ResNet-50 evaluations under benchmark-specific training protocols show that depth-scaled ALR improves Top-1 accuracy from 77.618% to 78.736% on native CIFAR-100 across five seeds and from 76.33% to 78.58% on ImageNet-1K. The results indicate that ALR generally outperforms uniform learning rate initialization, whereas SSD is most effective when combined with depth-aware initialization, particularly when layer-wise learning rates would otherwise follow misaligned decay trajectories. These findings suggest that a simple hierarchy-aware learning rate design can serve as an effective optimization refinement for hierarchical vision models.
An ultra-lightweight spatial-relational architecture for few-shot image classification that combines fixed Gabor edge-energy guidance with a windowed, content-adaptive patch locator is presented, showing that the architecture's pairwise relational computation, while present, is not the primary driver of its performance...
This paper revisits long-used fundamental operators and proposes three operator-level redesigns: Subtractive Residual Connection, Learnable Gating Response Function (LGRF), and statistics-discrepancy-guided Dynamic Dual Normalization (DDN).
This narrative review examines deep learning for static visual scene classification across indoor, outdoor, and aerial imagery and concludes that useful progress should be assessed through reproducible gains under matched protocols and credible transfer to new environments, rather than isolated accuracy values.
Sandeep Kumar Aazad, Kritika Chaudhary, Taniya Saini et al.· Journal of Computing and Dat...· 0 citations
Visual backbones have evolved from Convolutional Neural Networks (CNNs) with local aggregation to Vision Transformers (ViTs) with global interactions, State-Space Models (SSMs) with input-dependent state transitions, and Test-Time Training (TTT) layers that adapt an inner learner while processing an image. Across this...
Si-Ran Peng, Tian-Shuo Zhang, Tian-Yu Fu et al.· 0 citations
Orthogonal-transformation-based post-training quantization (PTQ) mitigates activation outliers in large language models (LLMs), but its use for vision models remains unclear: when learned rotations are necessary, which training objectives are stable, and how activation quantization granularity affects performance. We e...
Deeper modern networks outperform the older AlexNet by a wide margin on CIFAR-10, and even a relatively compact ResNet can nearly match the accuracy of a much larger VGG16 in far less time.
Jinkuan Chen· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.