Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: John Wilmes
@inproceedings{DBLP:conf/icann/BursteinW20, author = {Will Burstein and John Wilmes}, editor = {Igor Farkas and Paolo Masulli and Stefan Wermter}, title = {Obstacles to Depth Compression of Neural Networks}, booktitle = {Artificial Neural Networks and Machine Learning - {ICANN} 2020 - 29th International Conference on Artificial Neural Networks, Bratislava, Slovakia, September 15-18, 2020, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {12397}, pages = {104--115}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-61616-8\_9}, doi = {10.1007/978-3-030-61616-8\_9}, timestamp = {Tue, 20 Oct 2020 18:10:01 +0200}, biburl = {https://dblp.org/rec/conf/icann/BursteinW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/VempalaW19, author = {Santosh S. Vempala and John Wilmes}, editor = {Alina Beygelzimer and Daniel Hsu}, title = {Gradient Descent for One-Hidden-Layer Neural Networks: Polynomial Convergence and {SQ} Lower Bounds}, booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix, AZ, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {99}, pages = {3115--3117}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v99/vempala19a.html}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/VempalaW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/StefankovicVW18, author = {Daniel Stefankovic and Eric Vigoda and John Wilmes}, editor = {Michael A. Bender and Martin Farach{-}Colton and Miguel A. Mosteiro}, title = {On Counting Perfect Matchings in General Graphs}, booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10807}, pages = {873--885}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-77404-6\_63}, doi = {10.1007/978-3-319-77404-6\_63}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/latin/StefankovicVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-02677, author = {Santosh S. Vempala and John Wilmes}, title = {Polynomial Convergence of Gradient Descent for Training One-Hidden-Layer Neural Networks}, journal = {CoRR}, volume = {abs/1805.02677}, year = {2018}, url = {http://arxiv.org/abs/1805.02677}, eprinttype = {arXiv}, eprint = {1805.02677}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-02677.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/SongVW017, author = {Le Song and Santosh S. Vempala and John Wilmes and Bo Xie}, editor = {Isabelle Guyon and Ulrike von Luxburg and Samy Bengio and Hanna M. Wallach and Rob Fergus and S. V. N. Vishwanathan and Roman Garnett}, title = {On the Complexity of Learning Neural Networks}, booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, {USA}}, pages = {5514--5522}, year = {2017}, url = {https://proceedings.neurips.cc/paper/2017/hash/a78482ce76496fcf49085f2190e675b4-Abstract.html}, timestamp = {Thu, 21 Jan 2021 13:58:27 +0100}, biburl = {https://dblp.org/rec/conf/nips/SongVW017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/SongVW017, author = {Le Song and Santosh S. Vempala and John Wilmes and Bo Xie}, title = {On the Complexity of Learning Neural Networks}, journal = {CoRR}, volume = {abs/1707.04615}, year = {2017}, url = {http://arxiv.org/abs/1707.04615}, eprinttype = {arXiv}, eprint = {1707.04615}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/SongVW017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1712-07504, author = {Daniel Stefankovic and Eric Vigoda and John Wilmes}, title = {On Counting Perfect Matchings in General Graphs}, journal = {CoRR}, volume = {abs/1712.07504}, year = {2017}, url = {http://arxiv.org/abs/1712.07504}, eprinttype = {arXiv}, eprint = {1712.07504}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1712-07504.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SunW15, author = {Xiaorui Sun and John Wilmes}, editor = {Rocco A. Servedio and Ronitt Rubinfeld}, title = {Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {693--702}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2746539.2746617}, doi = {10.1145/2746539.2746617}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SunW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BabaiW15, author = {L{\'{a}}szl{\'{o}} Babai and John Wilmes}, title = {Asymptotic Delsarte cliques in distance-regular graphs}, journal = {CoRR}, volume = {abs/1503.02746}, year = {2015}, url = {http://arxiv.org/abs/1503.02746}, eprinttype = {arXiv}, eprint = {1503.02746}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BabaiW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/SunW15, author = {Xiaorui Sun and John Wilmes}, title = {Structure and automorphisms of primitive coherent configurations}, journal = {CoRR}, volume = {abs/1510.02195}, year = {2015}, url = {http://arxiv.org/abs/1510.02195}, eprinttype = {arXiv}, eprint = {1510.02195}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/SunW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/BabaiCSTW13, author = {L{\'{a}}szl{\'{o}} Babai and Xi Chen and Xiaorui Sun and Shang{-}Hua Teng and John Wilmes}, title = {Faster Canonical Forms for Strongly Regular Graphs}, booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2013, 26-29 October, 2013, Berkeley, CA, {USA}}, pages = {157--166}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/FOCS.2013.25}, doi = {10.1109/FOCS.2013.25}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/BabaiCSTW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BabaiW13, author = {L{\'{a}}szl{\'{o}} Babai and John Wilmes}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {Quasipolynomial-time canonical form for steiner designs}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {261--270}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488642}, doi = {10.1145/2488608.2488642}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BabaiW13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.