How many bits from how many sensors? A trade-off in distributed nearest-neighbor learning
Stefano Maranò, Vincenzo Matta, Peter Willett · 2014
In one of his landmark papers, Cover established the fundamental scaling laws of learning with nearest-neighbor rules (T.M. Cover, 1968). With the recent advances on distributed nearest-neighbor learning in sensor networks novel trade-offs arise, involving the faithfulness of message representation (quantization bits) and the number of delivered messages (transmitting sensors). This is the main theme of this paper.