← Search

Joachim Denzler

13 accepted papers

2026

TCD-Arena: Assessing Robustness of Time Series Causal Discovery Methods Against Assumption Violations

ICLR 2026poster

Causal Discovery (CD) is a powerful framework for scientific inquiry. Yet, its practical adoption is hindered by a reliance on strong, often unverifiable assumptions and a lack of robust performance assessment. To address these limitations and advance empirical CD evaluation, we present **TCD-Arena*…

Cited by 0SourceScholar
2025

CausalRivers - Scaling up benchmarking of causal discovery for real-world time-series

ICLR 2025spotlight

Causal discovery, or identifying causal relationships from observational data, is a notoriously challenging task, with numerous methods proposed to tackle it. Despite this, in-the-wild evaluation of these methods is still lacking, as works frequently rely on synthetic data evaluation and sparse real…

Cited by 0SourcePDFScholar
2025

Diffusion-based Identity-Preserving Facial Privacy Protection

ICASSP 2025accepted

The efficacy of facial recognition systems that utilize deep learning techniques has led to significant concerns over privacy, since they possess the capability to facilitate unauthorized monitoring of individuals in the digital realm. Current techniques for improving privacy are ineffective in prod…

Cited by 0SourceScholar
2025

Electromyography-Informed Facial Expression Reconstruction for Physiological-Based Synthesis and Analysis

CVPR 2025highlight

The relationship between muscle activity and resulting facial expressions is crucial for various fields, including psychology, medicine, and entertainment. The synchronous recording of facial mimicry and muscular activity via surface electromyography (sEMG) provides a unique window into these comple…

Cited by 0SourcePDFScholar
2025

FastCAV: Efficient Computation of Concept Activation Vectors for Explaining Deep Neural Networks

ICML 2025poster

Concepts such as objects, patterns, and shapes are how humans understand the world. Building on this intuition, concept-based explainability methods aim to study representations learned by deep neural networks in relation to human-understandable concepts. Here, Concept Activation Vectors (CAVs) are…

2025

Probabilistic Embeddings for Frozen Vision-Language Models: Uncertainty Quantification with Gaussian Process Latent Variable Models

UAI 2025

Vision-Language Models (VLMs) learn joint representations by mapping images and text into a shared latent space. However, recent research highlights that deterministic embeddings from standard VLMs often struggle to capture the uncertainties arising from the ambiguities in visual and textual descrip

2021

WikiChurches: A Fine-Grained Dataset of Architectural Styles with Real-World Challenges

NeurIPS 2021poster

We introduce a novel dataset for architectural style classification, consisting of 9,485 images of church buildings. Both images and style labels were sourced from Wikipedia. The dataset can serve as a benchmark for various research fields, as it combines numerous real-world challenges: fine-grained…

Cited by 12SourceScholar
2020

Determining the Relevance of Features for Deep Neural Networks

ECCV 2020poster

Deep neural networks are tremendously successful in many applications, but end-to-end trained networks often result in hard to understand black-box classifiers or predictors. In this work, we present a novel method to identify whether a specific feature is relevant to a classifier’s decision or not.…

Cited by 29SourcePDFScholar
2017

Generalized Orderless Pooling Performs Implicit Salient Matching

ICCV 2017poster

Most recent CNN architectures use average pooling as a final feature encoding step. In the field of fine-grained recognition, however, recent global representations like bilinear pooling offer improved performance. In this paper, we generalize average and bilinear pooling to "alpha-pooling", allowin…

Cited by 52PDFcodeScholar
2015

Active Learning and Discovery of Object Categories in the Presence of Unnameable Instances

CVPR 2015poster

Current visual recognition algorithms are "hungry" for data but massive annotation is extremely costly. Therefore, active learning algorithms are required that reduce labeling efforts to a minimum by selecting examples that are most valuable for labeling. In active learning, all categories occurring…

Cited by 73SourcePDFScholar