# Parallel Total Variation Distance Estimation with Neural Networks for Merging Over-Clusterings

Source: [Parallel Total Variation Distance Estimation with Neural Networks for Merging Over-Clusterings](<https://www.sota2.com/research/paper/68fa66c71e209131cea122ac>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T21:57:21.263Z

Authors: Christian Reiser, J\\"org Schl\\"otterer, Michael Granitzer

Published: 2019-12-09T13:25:14.000Z

## Abstract

We consider the initial situation where a dataset has been over-partitioned into $k$ clusters and seek a domain independent way to merge those initial clusters. We identify the total variation distance (TVD) as suitable for this goal. By exploiting the relation of the TVD to the Bayes accuracy we show how neural networks can be used to estimate TVDs between all pairs of clusters in parallel. Crucially, the needed memory space is decreased by reducing the required number of output neurons from $k^2$ to $k$. On realistically obtained over-clusterings of ImageNet subsets it is demonstrated that our TVD estimates lead to better merge decisions than those obtained by relying on state-of-the-art unsupervised representations. Further the generality of the approach is verified by evaluating it on a a point cloud dataset.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1912.04022>)

[PDF](<https://arxiv.org/pdf/1912.04022.pdf>)