287 search results - page 1 / 58 » Communication complexity as a lower bound for learning in ga... |
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
CC
2010
Springer
13 years 2 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
ECCC
2011
12 years 12 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...