John Wilmes

According to our database, John Wilmes authored at least 10 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Obstacles to Depth Compression of Neural Networks.

Will Burstein, John Wilmes

Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2020, 2020

2019

Gradient Descent for One-Hidden-Layer Neural Networks: Polynomial Convergence and SQ Lower Bounds.

Santosh S. Vempala, John Wilmes

Proceedings of the Conference on Learning Theory, 2019

2018

Polynomial Convergence of Gradient Descent for Training One-Hidden-Layer Neural Networks.

Santosh S. Vempala, John Wilmes

CoRR, 2018

On Counting Perfect Matchings in General Graphs.

Daniel Stefankovic, Eric Vigoda, John Wilmes

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

On the Complexity of Learning Neural Networks.

Le Song, Santosh S. Vempala, John Wilmes, Bo Xie

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2015

Structure and automorphisms of primitive coherent configurations.

Xiaorui Sun, John Wilmes

CoRR, 2015

Asymptotic Delsarte cliques in distance-regular graphs.

László Babai, John Wilmes

CoRR, 2015

Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract.

Xiaorui Sun, John Wilmes

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2013

Quasipolynomial-time canonical form for steiner designs.

László Babai, John Wilmes

Proceedings of the Symposium on Theory of Computing Conference, 2013

Faster Canonical Forms for Strongly Regular Graphs.

László Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013