NIPS Proceedingsβ

Ilias Diakonikolas

12 Papers

  • A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families (2019)
  • Distribution-Independent PAC Learning of Halfspaces with Massart Noise (2019)
  • Equipping Experts/Bandits with Long-term Memory (2019)
  • Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin (2019)
  • Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering (2019)
  • Private Testing of Distributions via Sample Permutations (2019)
  • Robust Learning of Fixed-Structure Bayesian Networks (2018)
  • Sharp Bounds for Generalized Uniformity Testing (2018)
  • Testing for Families of Distributions via the Fourier Transform (2018)
  • Communication-Efficient Distributed Learning of Discrete Distributions (2017)
  • Differentially Private Learning of Structured Discrete Distributions (2015)
  • Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms (2014)