A polylogarithmic bound for list replicability

arXiv:2610.20657v1 Announce Type: cross Abstract: Zhang [Zha26] recently posted a manuscript announcing that the list-replicability number of every class of Mge 2 binary concepts on Nge 2 domain points is O(log^2 Mlog N), which would be the first polylogarithmic upper bound on this quantity. In this note, we present a short, self-contained proof of this bound, following the high-level approach of the manuscript but with considerably simpler arguments.

Source: arXiv cs.LG | 2026-10-16