Cover Image

Explainable Clustering Beyond Worst-Case Guarantees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fleissner, Maximilian, Zarvandi, Maedeh, Ghoshdastidar, Debarghya
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Interpretable Self-Supervised Learning via Representer Landmarks and Nyström Approximation
by: Zarvandi, Maedeh, et al.
Published: (2025)

Explaining Kernel Clustering via Decision Trees
by: Fleissner, Maximilian, et al.
Published: (2024)

Impact of Bottleneck Layers and Skip Connections on the Generalization of Linear Denoising Autoencoders
by: Ham, Jonghyun, et al.
Published: (2025)

Theoretical Foundations of Representation Learning using Unlabeled Data: Statistics and Optimization
by: Esser, Pascal, et al.
Published: (2025)

A Probabilistic Model for Non-Contrastive Learning
by: Fleissner, Maximilian, et al.
Published: (2025)

A Theoretical Characterization of Optimal Data Augmentations in Self-Supervised Learning
by: Feigin, Shlomo Libo, et al.
Published: (2024)

Infinite Width Limits of Self Supervised Neural Networks
by: Fleissner, Maximilian, et al.
Published: (2024)

Recovering Imbalanced Clusters via Gradient-Based Projection Pursuit
by: Eppert, Martin, et al.
Published: (2025)

Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters
by: Han, Yaomengxi, et al.
Published: (2025)

Non-Singularity of the Gradient Descent map for Neural Networks with Piecewise Analytic Activations
by: Crăciun, Alexandru, et al.
Published: (2025)

Nonparametric Kernel Clustering with Bandit Feedback
by: Thuot, Victor, et al.
Published: (2026)

On the Convergence of Gradient Descent for Large Learning Rates
by: Crăciun, Alexandru, et al.
Published: (2024)

Tight PAC-Bayesian Risk Certificates for Contrastive Learning
by: Van Elst, Anna, et al.
Published: (2024)

Gaussian Process Limit Reveals Structural Benefits of Graph Transformers
by: Ayday, Nil, et al.
Published: (2026)

Exact Generalisation Error Exposes Benchmarks Skew Graph Neural Networks Success (or Failure)
by: Ayday, Nil, et al.
Published: (2025)

When can we Approximate Wide Contrastive Models with Neural Tangent Kernels and Principal Component Analysis?
by: Anil, Gautham Govind, et al.
Published: (2024)

Exact Certification of (Graph) Neural Networks Against Label Poisoning
by: Sabanayagam, Mahalakshmi, et al.
Published: (2024)

Provable Robustness of (Graph) Neural Networks Against Data Poisoning and Backdoor Attacks
by: Gosch, Lukas, et al.
Published: (2024)

Robustness Certificates for Neural Networks against Adversarial Attacks
by: Taheri, Sara, et al.
Published: (2025)

Robust Feature Inference: A Test-time Defense Strategy using Spectral Projections
by: Singh, Anurag, et al.
Published: (2023)

Generalization Certificates for Adversarially Robust Bayesian Linear Regression
by: Sabanayagam, Mahalakshmi, et al.
Published: (2025)

Different Statistical Perspectives for Understanding Generalisation in Graph Neural Networks
by: Ayday, Nil, et al.
Published: (2026)

Exact Certification of Neural Networks and Partition Aggregation Ensembles against Label Poisoning
by: Mohgaonkar, Ajinkya, et al.
Published: (2026)

Distribution Learning with Valid Outputs Beyond the Worst-Case
by: Rittler, Nick, et al.
Published: (2024)

Contextual Decision-Making with Knapsacks Beyond the Worst Case
by: Chen, Zhaohua, et al.
Published: (2022)

Memorization With Neural Nets: Going Beyond the Worst Case
by: Dirksen, Sjoerd, et al.
Published: (2023)

Towards Worst-Case Guarantees with Scale-Aware Interpretability
by: Greenspan, Lauren, et al.
Published: (2026)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
by: Silwal, Sandeep, et al.
Published: (2025)

A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks
by: Montasser, Omar, et al.
Published: (2025)

Dynamic Data Layout Optimization with Worst-case Guarantees
by: Rong, Kexin, et al.
Published: (2024)

Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality
by: Chen, Hanxiao, et al.
Published: (2026)

Clustering with Tangles: Algorithmic Framework and Theoretical Guarantees
by: Klepper, Solveig, et al.
Published: (2020)

Decision-Focused Evaluation of Worst-Case Distribution Shift
by: Ren, Kevin, et al.
Published: (2024)

Learning Performance Maximizing Ensembles with Explainability Guarantees
by: Pisztora, Vincent, et al.
Published: (2023)

Adaptive Sampling and Clipping for Private Worst-Case Group Optimization
by: Cairney-Leeming, Max, et al.
Published: (2026)

Explainable Evidential Clustering
by: de Souza, Victor F. Lopes, et al.
Published: (2025)

Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis
by: Jiang, Minhui, et al.
Published: (2024)

Explainable Neural Networks with Guarantees: A Sparse Estimation Approach
by: Ledent, Antoine, et al.
Published: (2025)

Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
by: Huang, Zhiming, et al.
Published: (2026)