SOURCE-LINKED INTELLIGENCE

Counting and Covering in Nearest-Neighbour Representations of Boolean Functions

arXiv · AI, language, vision and robotics · article · Sep 19, 2026 · UTC

We study the number of prototypes needed to represent Boolean functions by nearest-neighbour classification. There are two distinct settings: the prototypes may be arbitrary points of Euclidean space, or they may themselves be required to lie in the Boolean cube. For unrestricted prototypes, we strengthen a known lower bound for almost all Boolean functions. The bound applies simultaneously to nearest-neighbour voting rules with any number of voting neighbours, and substantially narrows the gap with the known general upper bound. We obtain a VC-dimension bound for classes with a bounded number

Read original source ↗ Open in workspace

recordType

paper

region

Global