activity
20182026
most citedAdversarial Training against Location-Optimized Adversarial Patches

85 citations · 150 across the 13 of their papers we have counts for

collaborators

14 papers

cs.AI2026

AnyBottle: A Recipe to Only Keep the Concepts You Really Need

Wolfgang Stammer, Sukrut Rao, Hevra Petekkaya +2

Concept bottleneck models (CBMs) make predictions inspectable and intervenable by routing them through human-interpretable concepts, but originally required concept annotations. An…

cs.CV2026

TEVI: Text-Conditioned Editing of Visual Representations via Sparse Autoencoders for Improved Vision-Language Alignment

Sweta Mahajan, Sukrut Rao, Jiahao Xie +2

Vision-language models such as CLIP are highly useful for diverse tasks due to their shared image-text embedding space. Despite this, the image and text embeddings are often poorly…

cs.CV2026

CFM: Language-aligned Concept Foundation Model for Vision

Kai Wittenmayer, Sukrut Rao, Amin Parchami-Araghi +2

Language-aligned vision foundation models perform strongly across diverse downstream tasks. Yet, their learned representations remain opaque, making interpreting their decision-mak…

cs.LG2025

FaCT: Faithful Concept Traces for Explaining Neural Network Decisions

Amin Parchami-Araghi, Sukrut Rao, Jonas Fischer +1

Deep networks have shown remarkable performance across a wide range of tasks, yet getting a global concept-level understanding of how they function remains a key challenge. Many po…

cs.CL2025

B-cos LM: Efficiently Transforming Pre-trained Language Models for Improved Explainability

Yifan Wang, Sukrut Rao, Ji-Ung Lee +2

Post-hoc explanation methods for black-box models often struggle with faithfulness and human interpretability due to the lack of explainability in current neural architectures. Mea…

cs.CV2024★ 1 cited

B-cosification: Transforming Deep Neural Networks to be Inherently Interpretable

Shreyash Arya, Sukrut Rao, Moritz Böhle +1

B-cos Networks have been shown to be effective for obtaining highly human interpretable explanations of model decisions by architecturally enforcing stronger alignment between inpu…

cs.CV2024

Discover-then-Name: Task-Agnostic Concept Bottlenecks via Automated Concept Discovery

Sukrut Rao, Sweta Mahajan, Moritz Böhle +1

Concept Bottleneck Models (CBMs) have recently been proposed to address the 'black-box' problem of deep neural networks, by first mapping images to a human-understandable concept s…

cs.CV2024★ 1 cited

Good Teachers Explain: Explanation-Enhanced Knowledge Distillation

Amin Parchami-Araghi, Moritz Böhle, Sukrut Rao +1

Knowledge Distillation (KD) has proven effective for compressing large teacher models into smaller student models. While it is well known that student models can achieve similar ac…

cs.CV2023★ 8 cited

Studying How to Efficiently and Effectively Guide Models with Explanations

Sukrut Rao, Moritz Böhle, Amin Parchami-Araghi +1

Despite being highly performant, deep neural networks might base their decisions on features that spuriously correlate with the provided labels, thus hurting generalization. To mit…

cs.CV2023★ 5 cited

Better Understanding Differences in Attribution Methods via Systematic Evaluations

Sukrut Rao, Moritz Böhle, Bernt Schiele

Deep neural networks are very successful on many vision tasks, but hard to interpret due to their black box nature. To overcome this, various post-hoc attribution methods have been…

cs.CV2022★ 37 cited

Towards Better Understanding Attribution Methods

Sukrut Rao, Moritz Böhle, Bernt Schiele

Deep neural networks are very successful on many vision tasks, but hard to interpret due to their black box nature. To overcome this, various post-hoc attribution methods have been…

cs.CV2020★ 85 cited

Adversarial Training against Location-Optimized Adversarial Patches

Sukrut Rao, David Stutz, Bernt Schiele

Deep neural networks have been shown to be susceptible to adversarial examples -- small, imperceptible changes constructed to cause mis-classification in otherwise highly accurate…

cs.LO2018

Approximation Strategies for Incomplete MaxSAT

Saurabh Joshi, Prateek Kumar, Ruben Martins +1

Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarante…

stat.ML2018★ 13 cited

Fast Dawid-Skene: A Fast Vote Aggregation Scheme for Sentiment Classification

Vaibhav B Sinha, Sukrut Rao, Vineeth N Balasubramanian

Many real world problems can now be effectively solved using supervised machine learning. A major roadblock is often the lack of an adequate quantity of labeled data for training.…