← Search

Shashanka Venkataramanan

9 accepted papers

2026

3DPoV: Improving 3D understanding via Patch Ordering on Videos

ICML 2026poster

Visual foundation models have achieved remarkable progress in scale and versatility, yet understanding the 3D world remains a fundamental challenge. While 2D images contain cues about 3D structure that humans readily interpret, deep models often fail to exploit them, underperforming on tasks such as…

Cited by 0SourceScholar
2026

Franca: Nested Matryoshka Clustering for Scalable Visual Representation Learning

CVPR 2026

We present Franca (pronounced Fran-ka): free one; the first fully open-source (data, code, weights) vision foundation model that matches and in many cases surpasses the performance of state-of-the-art proprietary models, e.g., DINOv2, CLIP, SigLIPv2, etc. Our approach is grounded in a transparent tr

Cited by 0SourceScholar
2025

MoSiC: Optimal-Transport Motion Trajectory for Dense Self-Supervised Learning

ICCV 2025poster

Dense self-supervised learning has shown great promise for learning pixel- and patch-level representations, but extending it to videos remains challenging due to the complexity of motion dynamics. Existing approaches struggle as they rely on static augmentations that fail under object deformations,…

2024

Is ImageNet worth 1 video? Learning strong image encoders from 1 long unlabelled video

ICLR 2024oral

Self-supervised learning has unlocked the potential of scaling up pretraining to billions of images, since annotation is unnecessary. But are we making the best use of data? How more economical can we be? In this work, we attempt to answer this question by making two contributions. First, we investi…

Cited by 22SourcePDFScholar
2024

Skip-Attention: Improving Vision Transformers by Paying Less Attention

ICLR 2024poster

This work aims to improve the efficiency of vision transformers (ViTs). While ViTs use computationally expensive self-attention operations in every layer, we identify that these operations are highly correlated across layers -- a key redundancy that causes unnecessary computations. Based on this o…

Cited by 34SourcePDFScholar
2023

Embedding Space Interpolation Beyond Mini-Batch, Beyond Pairs and Beyond Examples

NeurIPS 2023poster

Mixup refers to interpolation-based data augmentation, originally motivated as a way to go beyond empirical risk minimization (ERM). Its extensions mostly focus on the definition of interpolation and the space (input or feature) where it takes place, while the augmentation process itself is less stu…

Cited by 6SourcePDFScholar
2022

AlignMixup: Improving Representations by Interpolating Aligned Features

CVPR 2022poster

Mixup is a powerful data augmentation method that interpolates between two or more examples in the input or feature space and between the corresponding target labels. However, how to best interpolate images is not well defined. Recent mixup methods overlay or cut-and-paste two or more objects into o…

Cited by 95PDFcodeScholar
2022

It Takes Two to Tango: Mixup for Deep Metric Learning

ICLR 2022poster

Metric learning involves learning a discriminative representation such that embeddings of similar classes are encouraged to be close, while embeddings of dissimilar classes are pushed far apart. State-of-the-art methods focus mostly on sophisticated loss functions or mining strategies. On the one ha…

2020

Attention Guided Anomaly Localization in Images

ECCV 2020poster

Anomaly localization is an important problem in computer vision which involves localizing anomalous regions within images with applications in industrial inspection, surveillance, and medical imaging. This task is challenging due to the small sample size and pixel coverage of the anomaly in real-wor…

Cited by 295SourcePDFScholar