Shadow loss: Memory-linear deep metric learning for efficient training
Alif Elham Khan, Mohammad Junayed Hasan, Humayra Anjum, Nabeel Mohammed

TL;DR
Shadow Loss introduces a memory-efficient, scalar projection-based deep metric learning objective that reduces buffer size, accelerates convergence, and improves representation quality across various benchmarks.
Contribution
It proposes a novel, memory-linear loss function that maintains triplet structure without high-dimensional buffers, enabling efficient training on memory-constrained hardware.
Findings
Outperforms recent objectives on multiple benchmarks.
Converges 1.5-2 times faster with the same backbone.
Enhances representation separability as shown by silhouette scores.
Abstract
Deep metric learning objectives (e.g., triplet loss) require storing and comparing high-dimensional embeddings, making the per-batch loss buffer scale as , where is the number of samples in a batch and is the feature dimension, thus limiting training on memory-constrained hardware. We propose Shadow Loss, a proxy-free, parameter-free objective that measures similarity via scalar projections onto the anchor direction, reducing the loss-specific buffer from to while preserving the triplet structure. We analyze gradients, provide a Lipschitz continuity bound, and show that Shadow Loss penalizes trivial collapse for stable optimization. Across fine-grained retrieval (CUB-200, CARS196), large-scale product retrieval (Stanford Online Products, In-Shop Clothes), and standard/medical benchmarks (CIFAR-10/100, Tiny-ImageNet, HAM-10K, ODIR-5K), Shadow…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Healthcare · COVID-19 diagnosis using AI · Domain Adaptation and Few-Shot Learning
MethodsTriplet Loss
