ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: Approximate resilience, monotonicity, and the complexity of agnostic learning
Article URLs:
Alternative Article URLs:
Authors: Dana Dachman-Soled
  • University of Maryland
Vitaly Feldman
  • IBM Research - Almaden
Li-Yang Tan
  • UC Berkeley, Simons Institute
Andrew Wan
  • Institute for Defense Analysis
Karl Wimmer
  • Duquesne University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1115703, 1319788, 0964401, 1117079
DBLP Key: conf/soda/Dachman-SoledFTWW15
Author Comments:

Discuss this paper and its artifacts below