arXiv AI

Localized Anomaly Detection via Differentiable D-vine Copulas

arXiv:2607. 25020v1 Announce Type: new Abstract: Vine copulas provide a flexible framework for modeling complex multivariate distributions through a hierarchical decomposition into bivariate pair-copulas.

Hugging Face Trending Papers
Jul 27

Localized Anomaly Detection via Differentiable D-vine Copulas

Vine copulas provide a flexible framework for modeling complex multivariate distributions through a hierarchical decomposition into bivariate pair-copulas. Fitting a D-vine requires selecting a copula family and parameter configuration for each pair-copula from a set of candidates encoding different dependence patterns.

arXiv Machine Learning
Sep 16

Copula Adapted Directed Acyclic Graph for Cluster Representation of Biomedical Data

The paper presents Copula Adapted Directed Acyclic Graph (CopDAG), a framework that combines copula models with an ensemble of causal structure discovery methods based on Directed Acyclic Graphs to represent biomedical data. By capturing non‑Gaussian, non‑linear dependencies and stable causal relationships, CopDAG enables clustering of unlabeled biomedical data using K‑means. Across 16 biomedical datasets, CopDAG achieves the highest normalized clustering accuracy and adjusted Rand index among 12 evaluated methods, and it can predict class labels and provide explainable causal visualizations without relying on data annotations.

By Heranga K. Rathnasekara, Norou Diawara, Manar D. Samad
arXiv Machine Learning
Sep 23

Can We Predict Anomaly Detection Performance from Embedding-Space Geometry?

The paper investigates whether the performance of anomaly detection systems can be predicted without labeled anomalies. For kNN-based detectors, it derives a lower bound on AUC that links detection performance to the separation and variance of inlier and outlier scores, and uses this to analyze how density variation, intrinsic dimensionality, and domain mismatch affect score variability. The authors introduce pseudo‑anomaly probes that provide a reference for estimating relative score separation, and demonstrate through experiments on DCASE benchmarks that these probes enable anomaly‑free model selection to outperform conventional development‑set selection, especially under domain shift.

By Kevin Wilkinghoff, Zheng-Hua Tan
Hugging Face Trending Papers
Aug 13

Wasserstein Filtering: A Sample Selection Method for Robust Distribution Learning

Given a dataset where a portion of the samples are contaminated, our goal is to recover the underlying clean population distribution. To this end, we propose Wasserstein Filtering (WF), a novel sample selection framework that discards a fraction of suspicious samples and estimates the target distribution using the empirical measure of the remaining data.

arXiv Statistics ML
Sep 3

Copula Transformations for Data-Consistent Inversion

The paper introduces a copula-based framework to relate Data‑Consistent Inversion (DCI) and its iterative variant (iDCI). By applying Sklar’s theorem, the authors factor the DCI update into marginal and dependence components, showing that any remaining discrepancy after iDCI convergence is fully captured by the copulas of the observed and predicted joint distributions. They prove that an exact copula transformation recovers the original DCI solution and provide convergence results for approximate transformations, supported by numerical examples illustrating adaptive refinement and progressive problem refinement.

By Troy Butler, Tianyi Jiang, Jo\~ao Silva, Harri Hakula, Timothy Wildey
arXiv AI
Sep 15

Variational Template Matching with Statistical Fusion for Anomaly Detection in Patterned Structures

The paper introduces a variational template matching framework for anomaly detection in patterned structures, representing anomaly templates as transformed instances and using normalized cross‑correlation across the transformation space. It enhances robustness by adding a density‑based statistical anomaly score derived from local intensity distributions via kernel density estimation, which captures distributional concentration and tail behavior more effectively than histogram methods. The structural and statistical cues are fused in a unified formulation, and experiments on biological cell images show the method outperforms classical baselines and rivals ResNet‑50 while remaining fully training‑free and providing explicit localization.

By Qinwu Xu, Yifan Jiang
arXiv AI
Jul 7

Towards Diverse and Comprehensive Benchmarks for Mutual Information Estimation

arXiv:2607. 03487v1 Announce Type: cross Abstract: Mutual information (MI) estimation is a central problem in machine learning and statistics; however, existing benchmarks typically evaluate estimators on simplified, low-dimensional distributions, leaving their performance on complex, realistic data largely unexplored.

By Alberto Foresti, Ivan Butakov, Alexander Tolmachev, Giulio Franzese, Alexey Frolov, Pietro Michiardi