On Communication Complexity of Classification Problems

v1v2v3 (latest)

On Communication Complexity of Classification Problems

16 November 2017

Amir Yehudayoff

ArXiv (abs)PDF HTML

Papers citing "On Communication Complexity of Classification Problems"

11 / 11 papers shown

Title
Distributional PAC-Learning from Nisan's Natural Proofs Ari Karchmer 22 4 0 05 Oct 2023
On Optimal Learning Under Targeted Data Poisoning Steve Hanneke Amin Karbasi Mohammad Mahmoody Idan Mehalel Shay Moran AAML FedML 54 8 0 06 Oct 2022
A Resilient Distributed Boosting Algorithm Yuval Filmus Idan Mehalel Shay Moran 29 2 0 09 Jun 2022
Memory Bounds for Continual Learning Xi Chen Christos H. Papadimitriou Binghui Peng CLL LRM 69 24 0 22 Apr 2022
Uniform Brackets, Containers, and Combinatorial Macbeath Regions Kunal Dutta Arijit Ghosh Shay Moran 49 2 0 19 Nov 2021
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games Steve Hanneke Roi Livni Shay Moran 61 15 0 02 Feb 2021
Proper Learning, Helly Number, and an Optimal SVM Bound Olivier Bousquet Steve Hanneke Shay Moran Nikita Zhivotovskiy 123 53 0 24 May 2020
Collaborative Top Distribution Identifications with Limited Interaction Nikolai Karpov Qin Zhang Yuanshuo Zhou 64 27 0 20 Apr 2020
The Communication Complexity of Optimization Santosh Vempala Ruosong Wang David P. Woodruff 138 33 0 13 Jun 2019
Space lower bounds for linear prediction in the streaming model Y. Dagan Gil Kur Ohad Shamir 48 24 0 09 Feb 2019
Sample Compression for Real-Valued Learners Steve Hanneke A. Kontorovich Menachem Sadigurschi 60 21 0 21 May 2018