BibTeX records: Ido Nachum

download as .bib file

@inproceedings{DBLP:conf/cie/MoranNPY20,
  author    = {Shay Moran and
               Ido Nachum and
               Itai Panasoff and
               Amir Yehudayoff},
  editor    = {Marcella Anselmo and
               Gianluca Della Vedova and
               Florin Manea and
               Arno Pauly},
  title     = {On the Perceptron's Compression},
  booktitle = {Beyond the Horizon of Computability - 16th Conference on Computability
               in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12098},
  pages     = {310--325},
  publisher = {Springer},
  year      = {2020},
  url       = {https://doi.org/10.1007/978-3-030-51466-2\_29},
  doi       = {10.1007/978-3-030-51466-2\_29},
  timestamp = {Wed, 24 Jun 2020 15:40:40 +0200},
  biburl    = {https://dblp.org/rec/conf/cie/MoranNPY20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/NachumY20,
  author    = {Ido Nachum and
               Amir Yehudayoff},
  editor    = {Yoshiharu Kohayakawa and
               Fl{\'{a}}vio Keidi Miyazawa},
  title     = {On Symmetry and Initialization for Neural Networks},
  booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
               S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12118},
  pages     = {401--412},
  publisher = {Springer},
  year      = {2020},
  url       = {https://doi.org/10.1007/978-3-030-61792-9\_32},
  doi       = {10.1007/978-3-030-61792-9\_32},
  timestamp = {Thu, 03 Dec 2020 14:27:45 +0100},
  biburl    = {https://dblp.org/rec/conf/latin/NachumY20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2004-09590,
  author    = {Emmanuel Abbe and
               Jan Hazla and
               Ido Nachum},
  title     = {Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors},
  journal   = {CoRR},
  volume    = {abs/2004.09590},
  year      = {2020},
  url       = {https://arxiv.org/abs/2004.09590},
  archivePrefix = {arXiv},
  eprint    = {2004.09590},
  timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-09590.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/alt/NachumY19,
  author    = {Ido Nachum and
               Amir Yehudayoff},
  editor    = {Aur{\'{e}}lien Garivier and
               Satyen Kale},
  title     = {Average-Case Information Complexity of Learning},
  booktitle = {Algorithmic Learning Theory, {ALT} 2019, 22-24 March 2019, Chicago,
               Illinois, {USA}},
  series    = {Proceedings of Machine Learning Research},
  volume    = {98},
  pages     = {633--646},
  publisher = {{PMLR}},
  year      = {2019},
  url       = {http://proceedings.mlr.press/v98/nachum19a.html},
  timestamp = {Wed, 29 May 2019 08:41:44 +0200},
  biburl    = {https://dblp.org/rec/conf/alt/NachumY19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1907-00560,
  author    = {Ido Nachum and
               Amir Yehudayoff},
  title     = {On Symmetry and Initialization for Neural Networks},
  journal   = {CoRR},
  volume    = {abs/1907.00560},
  year      = {2019},
  url       = {http://arxiv.org/abs/1907.00560},
  archivePrefix = {arXiv},
  eprint    = {1907.00560},
  timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1907-00560.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/alt/BassilyMNSY18,
  author    = {Raef Bassily and
               Shay Moran and
               Ido Nachum and
               Jonathan Shafer and
               Amir Yehudayoff},
  editor    = {Firdaus Janoos and
               Mehryar Mohri and
               Karthik Sridharan},
  title     = {Learners that Use Little Information},
  booktitle = {Algorithmic Learning Theory, {ALT} 2018, 7-9 April 2018, Lanzarote,
               Canary Islands, Spain},
  series    = {Proceedings of Machine Learning Research},
  volume    = {83},
  pages     = {25--55},
  publisher = {{PMLR}},
  year      = {2018},
  url       = {http://proceedings.mlr.press/v83/bassily18a.html},
  timestamp = {Wed, 03 Apr 2019 18:17:24 +0200},
  biburl    = {https://dblp.org/rec/conf/alt/BassilyMNSY18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/colt/NachumSY18,
  author    = {Ido Nachum and
               Jonathan Shafer and
               Amir Yehudayoff},
  editor    = {S{\'{e}}bastien Bubeck and
               Vianney Perchet and
               Philippe Rigollet},
  title     = {A Direct Sum Result for the Information Complexity of Learning},
  booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9
               July 2018},
  series    = {Proceedings of Machine Learning Research},
  volume    = {75},
  pages     = {1547--1568},
  publisher = {{PMLR}},
  year      = {2018},
  url       = {http://proceedings.mlr.press/v75/nachum18a.html},
  timestamp = {Wed, 03 Apr 2019 18:17:23 +0200},
  biburl    = {https://dblp.org/rec/conf/colt/NachumSY18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1804-05474,
  author    = {Ido Nachum and
               Jonathan Shafer and
               Amir Yehudayoff},
  title     = {A Direct Sum Result for the Information Complexity of Learning},
  journal   = {CoRR},
  volume    = {abs/1804.05474},
  year      = {2018},
  url       = {http://arxiv.org/abs/1804.05474},
  archivePrefix = {arXiv},
  eprint    = {1804.05474},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1804-05474.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1806-05403,
  author    = {Shay Moran and
               Ido Nachum and
               Itai Panasoff and
               Amir Yehudayoff},
  title     = {On the Perceptron's Compression},
  journal   = {CoRR},
  volume    = {abs/1806.05403},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.05403},
  archivePrefix = {arXiv},
  eprint    = {1806.05403},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1806-05403.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1811-09923,
  author    = {Ido Nachum and
               Amir Yehudayoff},
  title     = {Average-Case Information Complexity of Learning},
  journal   = {CoRR},
  volume    = {abs/1811.09923},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.09923},
  archivePrefix = {arXiv},
  eprint    = {1811.09923},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1811-09923.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1710-05233,
  author    = {Raef Bassily and
               Shay Moran and
               Ido Nachum and
               Jonathan Shafer and
               Amir Yehudayoff},
  title     = {Learners that Leak Little Information},
  journal   = {CoRR},
  volume    = {abs/1710.05233},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.05233},
  archivePrefix = {arXiv},
  eprint    = {1710.05233},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1710-05233.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.