← Search

Claudia Plant

11 accepted papers

2026

CHB: A Diagnostic Toolkit for Hardness-Aware Clustering Evaluation

ICML 2026poster

Clustering is commonly compared through leaderboards that collapse performance into a single aggregate ranking. Such summaries obscure why methods succeed, which data properties align with failure, and how conclusions shift under representation changes and realistic tuning constraints. We present CH…

Cited by 0SourceScholar
2026

Internal Evaluation of Density-Based Clusterings with Noise

ICLR 2026poster

Evaluating the quality of a clustering result without access to ground truth labels is fundamental for research in data mining. However, most cluster validation indices (CVIs) do not consider the noise assignments by density-based clustering methods like DBSCAN or HDBSCAN, even though the ability to…

Cited by 0SourceScholar
2026

Understanding and Improving Hyperbolic Deep Reinforcement Learning

ICLR 2026poster

The performance of reinforcement learning (RL) agents depends critically on the quality of the underlying feature representations. Hyperbolic feature spaces are well-suited for this purpose, as they naturally capture hierarchical and relational structure often present in complex RL environments. How…

Cited by 0SourcecodeScholar
2025

Anomaly Detection by an Ensemble of Random Pairs of Hyperspheres

NeurIPS 2025poster

Anomaly detection is a crucial task in data mining, focusing on identifying data points that deviate significantly from the main patterns in the data. This paper introduces Anomaly Detection by an Ensemble of Random Pairs of Hyperspheres (ADERH), a new isolation-based technique leveraging two key ob…

Cited by 0SourceScholar
2025

Breaking the Reclustering Barrier in Centroid-based Deep Clustering

ICLR 2025poster

This work investigates an important phenomenon in centroid-based deep clustering (DC) algorithms: Performance quickly saturates after a period of rapid early gains. Practitioners commonly address early saturation with periodic reclustering, which we demonstrate to be insufficient to address performa…

2025

H-SPLID: HSIC-based Saliency Preserving Latent Information Decomposition

NeurIPS 2025poster

We introduce H-SPLID, a novel algorithm for learning salient feature representations through the explicit decomposition of salient and non-salient features into separate spaces. We show that H-SPLID promotes learning low-dimensional, task-relevant features. We prove that the expected prediction devi…

Cited by 0SourceScholar
2025

MultiADS: Defect-aware Supervision for Multi-type Anomaly Detection and Segmentation in Zero-Shot Learning

ICCV 2025poster

Precise optical inspection in industrial applications is crucial for minimizing scrap rates and reducing the associated costs. Besides merely detecting if a product is anomalous or not, it is crucial to know the distinct types of defects, such as a bent, cut, or scratch. The ability to recognize the…

2025

Ultrametric Cluster Hierarchies: I Want ‘em All!

NeurIPS 2025poster

Hierarchical clustering is a powerful tool for exploratory data analysis, organizing data into a tree of clusterings from which a partition can be chosen. This paper generalizes these ideas by proving that, for any reasonable hierarchy, one can optimally solve any center-based clustering objective o…

Cited by 0SourceScholar
2025

Weakly Supervised Anomaly Detection via Dual-Tailed Kernel

ICML 2025poster

Detecting anomalies with limited supervision is challenging due to the scarcity of labeled anomalies, which often fail to capture the diversity of abnormal behaviors. We propose Weakly Supervised Anomaly Detection via Dual-Tailed Kernel (WSAD-DT), a novel framework that learns robust latent represen…

Cited by 0SourcePDFScholar
2022

Causal Discovery in Hawkes Processes by Minimum Description Length

AAAI 2022technical

Hawkes processes are a special class of temporal point processes which exhibit a natural notion of causality, as occurrence of events in the past may increase the probability of events in the future. Discovery of the underlying influence network among the dimensions of multi-dimensional temporal proc…

Cited by 7SourcePDFScholar
2021

Details (Don't) Matter: Isolating Cluster Information in Deep Embedded Spaces

IJCAI 2021poster

Deep clustering techniques combine representation learning with clustering objectives to improve their performance. Among existing deep clustering techniques, autoencoder-based methods are the most prevalent ones. While they achieve promising clustering results, they suffer from an inherent conflict…

Cited by 14SourcePDFScholar