Reproduce “A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum, Jason Yang
ABA constructs anticlusters—equal-sized groups intended to be diverse within each group—by ranking objects by distance from the dataset centroid and assigning batches to group centroids. On ImageNet32, with 1,281,167 objects and 3,072 features divided into 5,000 groups, a hierarchical run took 44.3 seconds, with a 0.013% objective-value decrease; this result reflects one experimental setup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.