Co-occurring keywords · papers mentioning both
Papers
Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexity
COLT 2020
Locally Private Learning without Interaction Requires Separation
NeurIPS 2019
Open Problem: Is Margin Sufficient for Non-Interactive Private Distributed Learning?
COLT 2019
Mistake Bounds for Binary Matrix Completion
NeurIPS 2016
A Close Look to Margin Complexity and Related Parameters
COLT 2011