Pith. sign in

REVIEW 3 cited by

O-ViT: Orthogonal Vision Transformer

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.12133 v2 pith:HZV3RO4E submitted 2022-01-28 cs.CV cs.LG

classification cs.CVcs.LG
keywords o-vitorthogonalself-attentiontransformervisionachievesexperimentsfeature
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Inspired by the tremendous success of the self-attention mechanism in natural language processing, the Vision Transformer (ViT) creatively applies it to image patch sequences and achieves incredible performance. However, the scaled dot-product self-attention of ViT brings about scale ambiguity to the structure of the original feature space. To address this problem, we propose a novel method named Orthogonal Vision Transformer (O-ViT), to optimize ViT from the geometric perspective. O-ViT limits parameters of self-attention blocks to be on the norm-keeping orthogonal manifold, which can keep the geometry of the feature space. Moreover, O-ViT achieves both orthogonal constraints and cheap optimization overhead by adopting a surjective mapping between the orthogonal group and its Lie algebra.We have conducted comparative experiments on image recognition tasks to demonstrate O-ViT's validity and experiments show that O-ViT can boost the performance of ViT by up to 3.6%.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Deep Delta Learning

    cs.LG 2026-01 unverdicted novelty 7.0 of 10

    Replacing additive residual connections with a gated rank-1 delta update that interpolates identity, projection, and reflection slightly improves language modeling and downstream averages in reported 124M/353M runs.

  2. An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale

    cs.LG 2026-02 conditional novelty 6.0 of 10

    POGO uses a two-step tangent-plus-normal update with lambda = 1/2 to keep iterates near the Stiefel manifold at the cost of five matrix multiplications, making large-scale orthogonality constraints practical.

  3. HOFT: Householder Orthogonal Fine-tuning

    cs.LG 2025-05 conditional novelty 5.0 of 10

    HOFT and SHOFT fine-tune foundation models with two Householder-built orthogonal matrices, matching or beating LoRA, DoRA, OFT, BOFT and HRA on reasoning, translation, image generation and math.

Pith tools