On the Sample Complexity of Adversarial Multi-Source PAC Learning

v1v2 (latest)

On the Sample Complexity of Adversarial Multi-Source PAC Learning

24 February 2020

Nikola Konstantinov

Dan Alistarh

Christoph H. Lampert

ArXiv (abs)PDF HTML

Papers citing "On the Sample Complexity of Adversarial Multi-Source PAC Learning"

6 / 6 papers shown

Title
GeoERM: Geometry-Aware Multi-Task Representation Learning on Riemannian Manifolds Aoran Chen Yang Feng 84 0 0 05 May 2025
Incentivizing Honesty among Competitors in Collaborative Learning and Optimization Florian E. Dorner Nikola Konstantinov Georgi Pashaliev Martin Vechev FedML 142 7 0 25 May 2023
Adaptive and Robust Multi-Task Learning Yaqi Duan Kaizheng Wang 130 27 0 10 Feb 2022
FLEA: Provably Robust Fair Multisource Learning from Unreliable Training Data Eugenia Iofinova Nikola Konstantinov Christoph H. Lampert FaML 94 0 0 22 Jun 2021
Adaptive Personalized Federated Learning Yuyang Deng Mohammad Mahdi Kamani M. Mahdavi FedML 329 563 0 30 Mar 2020
Byzantine-resilient Decentralized Stochastic Gradient Descent Shangwei Guo Tianwei Zhang Hanzhou Yu Xiaofei Xie Lei Ma Tao Xiang Yang Liu 76 48 0 20 Feb 2020