Learning Complexity vs Communication Complexity
نویسندگان
چکیده
منابع مشابه
On Rank vs. Communication Complexity
This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.
متن کاملElectronic Colloquium on Computational Complexity on Rank vs. Communication Complexity
This paper concerns the open problem of Lovasz and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We rst give an example exhibiting the largest gap known. We then prove two related theorems. y Extended Abstract appeared in FOCS 1994. subject "MAIL ME CLEAR", body "pub/eccc/ftpmail.txt" followed by an empty line, ...
متن کاملTeaching-Learning approach in complexity paradigm
"Teaching-Learning Approach" is a model of interaction between teachers and students in an educational environment and one of the main components of the educational system. This model can be organized and designed on the basis of various opinions and ideas, including philosophical or scientific theories. This research aims to design and explain teaching-learning approach based on the complexity...
متن کاملSample Complexity Bounds on Differentially Private Learning via Communication Complexity
In this work we analyze the sample complexity of classification by differentially private algorithms. Differential privacy is a strong and well-studied notion of privacy introduced by Dwork et al. (2006) that ensures that the output of an algorithm leaks little information about the data point provided by any of the participating individuals. Sample complexity of private PAC and agnostic learni...
متن کاملDistributed Learning, Communication Complexity and Privacy
We consider the problem of PAC-learning from distributed data and analyze fundamental communication complexity questions involved. We provide general upper and lower bounds on the amount of communication needed to learn well, showing that in addition to VCdimension and covering number, quantities such as the teaching-dimension and mistakebound of a class play an important role. We also present ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2009
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548308009656