Tejaswi Kasarla

dblp:247/8932 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0003-4580-9383ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Representation and self-supervised learning · 29% Trustworthy machine learning · 28% Learning theory · 16%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › geometric representation learning
hyperbolic representation learning
1.922026
Balanced Hyperbolic Embeddings Are Natural Out-of-Distribution Detectors · Int. J. Comput. Vis. 2026
Hyperbolic Safety-Aware Vision-Language Models · CVPR 2025
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
1.222026
Balanced Hyperbolic Embeddings Are Natural Out-of-Distribution Detectors · Int. J. Comput. Vis. 2026
Maximum Class Separation as Inductive Bias in One Matrix · NeurIPS 2022
Machine learning › Trustworthy machine learning
content moderation
0.912025
Hyperbolic Safety-Aware Vision-Language Models · CVPR 2025
Computer vision › Vision and language
vision-language model
0.912025
Hyperbolic Safety-Aware Vision-Language Models · CVPR 2025
Machine learning › Learning theory
classification
0.612022
Maximum Class Separation as Inductive Bias in One Matrix · NeurIPS 2022
Machine learning › Transfer learning and domain adaptation
class separability
0.612022
Maximum Class Separation as Inductive Bias in One Matrix · NeurIPS 2022
Machine learning › Learning theory
inductive bias
0.612022
Maximum Class Separation as Inductive Bias in One Matrix · NeurIPS 2022
Machine learning › Learning paradigms
long-tailed recognition
0.612022
Maximum Class Separation as Inductive Bias in One Matrix · NeurIPS 2022
Machine learning › Representation and self-supervised learning
hierarchical representation
0.312026
Balanced Hyperbolic Embeddings Are Natural Out-of-Distribution Detectors · Int. J. Comput. Vis. 2026

Methods — techniques the papers use, named apart from their topics

contrastive learning · 1.0hyperbolic space embedding · 0.9entailment loss · 0.9fixed maximum-separation matrix · 0.6closed-form construction · 0.6
YearPublicationVenuePosition
2026 Balanced Hyperbolic Embeddings Are Natural Out-of-Distribution Detectors
abstract
Abstract Out-of-distribution recognition forms an important and well-studied problem in deep learning, with the goal to filter out samples that do not belong to the distribution on which a network has been trained. The conclusion of this paper is simple: a good hierarchical hyperbolic embedding is preferred for discriminating in- and out-of-distribution samples. We introduce Balanced Hyperbolic Learning. We outline a hyperbolic class embedding algorithm that jointly optimizes for hierarchical distortion and balancing between shallow and wide subhierarchies. We then use the class embeddings as hyperbolic prototypes for classification on in-distribution data. We outline how to generalize existing out-of-distribution scoring functions to operate with hyperbolic prototypes. Empirical evaluations across 13 datasets and 13 scoring functions show that our hyperbolic embeddings outperform existing out-of-distribution approaches when trained on the same data with the same backbones. We also show that our hyperbolic embeddings outperform other hyperbolic approaches, beat state-of-the-art contrastive methods, and natively enable hierarchical out-of-distribution generalization.
Tejaswi Kasarla, Max van Spengler, Pascal Mettes
Int. J. Comput. Vis.1
2025 Hyperbolic Safety-Aware Vision-Language Models
abstract
Addressing the retrieval of unsafe content from vision-language models such as CLIP is an important step towards real-world integration. Current efforts have relied on unlearning techniques that try to erase the model’s knowledge of unsafe concepts. While effective in reducing unwanted outputs, unlearning limits the model’s capacity to discern between safe and unsafe content. In this work, we introduce a novel approach that shifts from unlearning to an awareness paradigm by leveraging the inherent hierarchical properties of the hyperbolic space. We propose to encode safe and unsafe content as an entailment hierarchy, where both are placed in different regions of hyperbolic space. Our HySAC, Hyperbolic Safety-Aware CLIP, employs entailment loss functions to model the hierarchical and asymmetrical relations between safe and unsafe image-text pairs. This modelling – ineffective in standard vision-language models due to their reliance on Euclidean embeddings – endows the model with awareness of unsafe content, enabling it to serve as both a multimodal unsafe classifier and a flexible content retriever, with the option to dynamically redirect unsafe queries toward safer alternatives or retain the original output. Extensive experiments show that our approach not only enhances safety recognition but also establishes a more adaptable and interpretable framework for content moderation in vision-language models. Our source code is available at: https://github.com/aimagelab/HySAC
Tobia Poppi, Tejaswi Kasarla, Pascal Mettes, Lorenzo Baraldi 0001, Rita Cucchiara
CVPR2
2022 Maximum Class Separation as Inductive Bias in One Matrix
abstract
Maximizing the separation between classes constitutes a well-known inductive bias in machine learning and a pillar of many traditional algorithms. By default, deep networks are not equipped with this inductive bias and therefore many alternative solutions have been proposed through differential optimization. Current approaches tend to optimize classification and separation jointly: aligning inputs with class vectors and separating class vectors angularly. This paper proposes a simple alternative: encoding maximum separation as an inductive bias in the network by adding one fixed matrix multiplication before computing the softmax activations. The main observation behind our approach is that separation does not require optimization but can be solved in closed-form prior to training and plugged into a network. We outline a recursive approach to obtain the matrix consisting of maximally separable vectors for any number of classes, which can be added with negligible engineering effort and computational overhead. Despite its simple nature, this one matrix multiplication provides real impact. We show that our proposal directly boosts classification, long-tailed recognition, out-of-distribution detection, and open-set recognition, from CIFAR to ImageNet. We find empirically that maximum separation works best as a fixed bias; making the matrix learnable adds nothing to the performance. The closed-form implementation and code to reproduce the experiments are available on github.
Tejaswi Kasarla, Gertjan J. Burghouts, Max van Spengler, Elise van der Pol, Rita Cucchiara, Pascal Mettes
NeurIPS1
2019 Region-based active learning for efficient labeling in semantic segmentation
abstract
As vision-based autonomous systems, such as self-driving vehicles, become a reality, there is an increasing need for large annotated datasets for developing solutions to vision tasks. One important task that has seen significant interest in recent years is semantic segmentation. However, the cost of annotating every pixel for semantic segmentation is immense, and can be prohibitive in scaling to various settings and locations. In this paper, we propose a region-based active learning method for efficient labeling in semantic segmentation. Using the proposed active learning strategy, we show that we are able to judiciously select the regions for annotation such that we obtain 93.8% of the baseline performance (when all pixels are labeled) with labeling of 10% of the total number of pixels. Further, we show that this approach can be used to transfer annotations from a model trained on a given dataset (Cityscapes) to a different dataset (Mapillary), thus highlighting its promise and potential.
Tejaswi Kasarla, Gattigorla Nagendar, Guruprasad M. Hegde, Vineeth N. Balasubramanian, C. V. Jawahar
WACV1