Papers › Orthogonal Projection Loss

Orthogonal Projection Loss

25 Mar 2021ICCV 2021 10arXiv:2103.14021archive 2025-07-28

Kanchana Ranasinghe, Muzammal Naseer, Munawar Hayat, Salman Khan, Fahad Shahbaz Khan

Deep neural networks have achieved remarkable performance on a range of classification tasks, with softmax cross-entropy (CE) loss emerging as the de-facto objective function. The CE loss encourages features of a class to have a higher projection score on the true class-vector compared to the negative classes. However, this is a relative constraint and does not explicitly force different class features to be well-separated. Motivated by the observation that ground-truth class representations in CE loss are orthogonal (one-hot encoded vectors), we develop a novel loss function termed `Orthogonal Projection Loss' (OPL) which imposes orthogonality in the feature space. OPL augments the properties of CE loss and directly enforces inter-class separation alongside intra-class clustering in the feature space through orthogonality constraints on the mini-batch level. As compared to other alternatives of CE, OPL offers unique advantages e.g., no additional learnable parameters, does not require careful negative mining and is not sensitive to the batch size. Given the plug-and-play nature of OPL, we evaluate it on a diverse range of tasks including image recognition (CIFAR-100), large-scale classification (ImageNet), domain generalization (PACS) and few-shot learning (miniImageNet, CIFAR-FS, tiered-ImageNet and Meta-dataset) and demonstrate its effectiveness across the board. Furthermore, OPL offers better robustness against practical nuisances such as adversarial attacks and label noise. Code is available at: https://github.com/kahnchana/opl.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2103.14021")

Code

Syntology Ran 2 of 14 code samples harvested from 1 repository linked to this paper; 12 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 14 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kahnchana/opl officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 2 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran
12unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from kahnchana/opl. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

format_time kahnchana/opl/label_noise/truncated_loss/utils.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 8d7ec010c29e813b · report
round_channels kahnchana/opl/classification/cifar/models/common.py official repository ran fingerprinted MIT (permissive) · dd12981b28dec323 · report
conv1x1 kahnchana/opl/classification/cifar/models/common.py official repository unverified MIT (permissive) · b58e540015b99393 · report
covariance_loss kahnchana/opl/classification/cifar/losses.py official repository unverified MIT (permissive) · 753c62e00dde9126 · report
get_activation_layer kahnchana/opl/classification/cifar/models/common.py official repository unverified MIT (permissive) · 0df92bd15ff63da7 · report
get_network kahnchana/opl/classification/cifar/utils.py official repository unverified MIT (permissive) · 8b6b7011fdc6d6c4 · report
get_resnet kahnchana/opl/classification/cifar/models/resnet.py official repository unverified MIT (permissive) · 15f95876a5d31c2a · report
get_resnet_cifar kahnchana/opl/classification/cifar/models/resnet_cifar.py official repository unverified MIT (permissive) · 874f5e34aef613bf · report
get_test_dataloader kahnchana/opl/classification/cifar/utils.py official repository unverified MIT (permissive) · 98bd1c9bc8319ae9 · report
get_training_dataloader kahnchana/opl/classification/cifar/utils.py official repository unverified MIT (permissive) · 00216823ab0d5455 · report
resnet18 kahnchana/opl/classification/imagenet/custom_models.py official repository unverified MIT (permissive) · 7717ac5d21296e1f · report
resnet20_cifar10 kahnchana/opl/classification/cifar/models/resnet_cifar.py official repository unverified MIT (permissive) · f157ed0645abe79a · report
resnet20_cifar100 kahnchana/opl/classification/cifar/models/resnet_cifar.py official repository unverified MIT (permissive) · 0b26b805c45c8d6d · report
resnet50 kahnchana/opl/classification/imagenet/custom_models.py official repository unverified MIT (permissive) · fce444af256e4d53 · report

Tasks

Domain GeneralizationFew-Shot Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Softmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections