Communication Complexity of Universal Features
arXiv:2610.27402v1 Announce Type: new Abstract: Motivated by the notion of features from machine learning, we study the complexity of representing data that allows for evaluation with a given family of functions. Concretely, we consider a deterministic encoder that observes $X\sim D$ and produces a…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-21 04:00 · arXiv stat.ML
Communication Complexity of Universal Features