@inproceedings{DBLP:conf/nips/AshtianiBHLMP18,
  author    = {Hassan Ashtiani and
               Shai Ben{-}David and
               Nicholas J. A. Harvey and
               Christopher Liaw and
               Abbas Mehrabian and
               Yaniv Plan},
  editor    = {Samy Bengio and
               Hanna M. Wallach and
               Hugo Larochelle and
               Kristen Grauman and
               Nicol{\`{o}} Cesa{-}Bianchi and
               Roman Garnett},
  title     = {Nearly tight sample complexity bounds for learning mixtures of Gaussians
               via sample compression schemes},
  booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
               on Neural Information Processing Systems 2018, NeurIPS 2018, December
               3-8, 2018, Montr{\'{e}}al, Canada},
  pages     = {3416--3425},
  year      = {2018},
  url       = {https://proceedings.neurips.cc/paper/2018/hash/70ece1e1e0931919438fcfc6bd5f199c-Abstract.html},
  timestamp = {Thu, 21 Jan 2021 15:15:20 +0100},
  biburl    = {https://dblp.org/rec/conf/nips/AshtianiBHLMP18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"CTz8yQtoYmwTBGuK2","bibbaseid":"ashtiani-bendavid-harvey-liaw-mehrabian-plan-nearlytightsamplecomplexityboundsforlearningmixturesofgaussiansviasamplecompressionschemes-2018","authorIDs":[],"author_short":["Ashtiani, H.","Ben-David, S.","Harvey, N. J. A.","Liaw, C.","Mehrabian, A.","Plan, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Hassan"],"propositions":[],"lastnames":["Ashtiani"],"suffixes":[]},{"firstnames":["Shai"],"propositions":[],"lastnames":["Ben-David"],"suffixes":[]},{"firstnames":["Nicholas","J.","A."],"propositions":[],"lastnames":["Harvey"],"suffixes":[]},{"firstnames":["Christopher"],"propositions":[],"lastnames":["Liaw"],"suffixes":[]},{"firstnames":["Abbas"],"propositions":[],"lastnames":["Mehrabian"],"suffixes":[]},{"firstnames":["Yaniv"],"propositions":[],"lastnames":["Plan"],"suffixes":[]}],"editor":[{"firstnames":["Samy"],"propositions":[],"lastnames":["Bengio"],"suffixes":[]},{"firstnames":["Hanna","M."],"propositions":[],"lastnames":["Wallach"],"suffixes":[]},{"firstnames":["Hugo"],"propositions":[],"lastnames":["Larochelle"],"suffixes":[]},{"firstnames":["Kristen"],"propositions":[],"lastnames":["Grauman"],"suffixes":[]},{"firstnames":["Nicolò"],"propositions":[],"lastnames":["Cesa-Bianchi"],"suffixes":[]},{"firstnames":["Roman"],"propositions":[],"lastnames":["Garnett"],"suffixes":[]}],"title":"Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes","booktitle":"Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montréal, Canada","pages":"3416–3425","year":"2018","url":"https://proceedings.neurips.cc/paper/2018/hash/70ece1e1e0931919438fcfc6bd5f199c-Abstract.html","timestamp":"Thu, 21 Jan 2021 15:15:20 +0100","biburl":"https://dblp.org/rec/conf/nips/AshtianiBHLMP18.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/nips/AshtianiBHLMP18,\n author = {Hassan Ashtiani and\n Shai Ben{-}David and\n Nicholas J. A. Harvey and\n Christopher Liaw and\n Abbas Mehrabian and\n Yaniv Plan},\n editor = {Samy Bengio and\n Hanna M. Wallach and\n Hugo Larochelle and\n Kristen Grauman and\n Nicol{\\`{o}} Cesa{-}Bianchi and\n Roman Garnett},\n title = {Nearly tight sample complexity bounds for learning mixtures of Gaussians\n via sample compression schemes},\n booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference\n on Neural Information Processing Systems 2018, NeurIPS 2018, December\n 3-8, 2018, Montr{\\'{e}}al, Canada},\n pages = {3416--3425},\n year = {2018},\n url = {https://proceedings.neurips.cc/paper/2018/hash/70ece1e1e0931919438fcfc6bd5f199c-Abstract.html},\n timestamp = {Thu, 21 Jan 2021 15:15:20 +0100},\n biburl = {https://dblp.org/rec/conf/nips/AshtianiBHLMP18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Ashtiani, H.","Ben-David, S.","Harvey, N. J. A.","Liaw, C.","Mehrabian, A.","Plan, Y."],"editor_short":["Bengio, S.","Wallach, H. M.","Larochelle, H.","Grauman, K.","Cesa-Bianchi, N.","Garnett, R."],"key":"DBLP:conf/nips/AshtianiBHLMP18","id":"DBLP:conf/nips/AshtianiBHLMP18","bibbaseid":"ashtiani-bendavid-harvey-liaw-mehrabian-plan-nearlytightsamplecomplexityboundsforlearningmixturesofgaussiansviasamplecompressionschemes-2018","role":"author","urls":{"Paper":"https://proceedings.neurips.cc/paper/2018/hash/70ece1e1e0931919438fcfc6bd5f199c-Abstract.html"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/88/8395.bib","creationDate":"2020-02-11T20:02:58.109Z","downloads":0,"keywords":[],"search_terms":["nearly","tight","sample","complexity","bounds","learning","mixtures","gaussians","via","sample","compression","schemes","ashtiani","ben-david","harvey","liaw","mehrabian","plan"],"title":"Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes","year":2018,"dataSources":["9ZC4Jom7ygp8s9git","n3aiTfXmAX6Mt53KD"]}