Nicholas J. A. Harvey

According to our database, Nicholas J. A. Harvey authored at least 62 papers between 2003 and 2024.

Collaborative distances:

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

2024

Continuous Prediction with Experts' Advice.

Nicholas J. A. Harvey, Christopher Liaw, Victor S. Portella

J. Mach. Learn. Res., 2024

Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes.

Victor S. Portella, Nick Harvey

CoRR, 2024

2023

Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking.

Frederik Kunstner, Victor Sanches Portella, Mark Schmidt, Nicholas J. A. Harvey

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case.

Huang Fang, Nicholas J. A. Harvey, Victor S. Portella, Michael P. Friedlander

J. Mach. Learn. Res., 2022

Efficient and Optimal Fixed-Time Regret with Two Experts.

Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2020

An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles.

Nicholas J. A. Harvey, Jan Vondrák

SIAM J. Comput., 2020

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes.

Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan

J. ACM, 2020

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses.

Yihan Zhou, Victor S. Portella, Mark Schmidt, Nicholas J. A. Harvey

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds.

Nicholas J. A. Harvey, Christopher Liaw, Tasuku Soma

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Optimal anytime regret for two experts.

Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

A General Framework for Graph Sparsification.

Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi

SIAM J. Comput., 2019

Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks.

Peter L. Bartlett, Nick Harvey, Christopher Liaw, Abbas Mehrabian

J. Mach. Learn. Res., 2019

Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent.

Nicholas J. A. Harvey, Christopher Liaw, Sikander Randhawa

CoRR, 2019

Tight analyses for non-smooth stochastic gradient descent.

Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa

Proceedings of the Conference on Learning Theory, 2019

2018

Submodular Functions: Learnability, Structure, and Optimization.

Maria-Florina Balcan, Nicholas J. A. Harvey

SIAM J. Comput., 2018

Greedy and Local Ratio Algorithms in the MapReduce Model.

Nicholas J. A. Harvey, Christopher Liaw, Paul Liu

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Computing the Independence Polynomial: from the Tree Threshold down to the Roots.

Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes.

Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Rainbow Hamilton cycles and lopsidependency.

Nicholas J. A. Harvey, Christopher Liaw

Discret. Math., 2017

Matroids Hitting Sets and Unsupervised Dependency Grammar Induction.

Nicholas J. A. Harvey, David R. Karger, Virginia Savova, Leonid Peshkin

CoRR, 2017

Nearly-tight VC-dimension bounds for piecewise linear neural networks.

Nick Harvey, Christopher Liaw, Abbas Mehrabian

Proceedings of the 30th Conference on Learning Theory, 2017

2016

Sparse Sums of Positive Semidefinite Matrices.

Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato

ACM Trans. Algorithms, 2016

Computing the independence polynomial in Shearer's region for the LLL.

Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák

CoRR, 2016

Generating Random Spanning Trees via Fast Matrix Multiplication.

Nicholas J. A. Harvey, Keyulu Xu

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Counter Stacks and the Elusive Working Set.

Jake Wires, Stephen Ingram, Zachary Drudi, Nicholas J. A. Harvey, Andrew Warfield

login Usenix Mag., 2015

A note on the discrepancy of matrices with bounded row and column sums.

Nicholas J. A. Harvey

Discret. Math., 2015

An Algorithmic Proof of the Lopsided Lovasz Local Lemma.

Nicholas J. A. Harvey, Jan Vondrák

CoRR, 2015

Approximating Hit Rate Curves using Streaming Algorithms.

Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, Jake Wires

Proceedings of the Approximation, 2015

2014

UNO is hard, even for a single player.

Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Theor. Comput. Sci., 2014

Pipage Rounding, Pessimistic Estimators and Matrix Concentration.

Nicholas J. A. Harvey, Neil Olver

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Characterizing Storage Workloads with Counter Stacks.

Jake Wires, Stephen Ingram, Zachary Drudi, Nicholas J. A. Harvey, Andrew Warfield

Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation, 2014

Near-Optimal Herding.

Nick Harvey, Samira Samadi

Proceedings of The 27th Conference on Learning Theory, 2014

Discrepancy Without Partial Colorings.

Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh

Proceedings of the Approximation, 2014

2011

On the complexity of reconfiguration problems.

Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno

Theor. Comput. Sci., 2011

On Disjoint Common Bases in Two Matroids.

Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau

SIAM J. Discret. Math., 2011

Learning submodular functions.

Maria-Florina Balcan, Nicholas J. A. Harvey

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Graph Sparsification by Edge-Connectivity and Random Spanning Trees

Wai Shing Fung, Nicholas J. A. Harvey

CoRR, 2010

2009

Algebraic Algorithms for Matching and Matroid Problems.

Nicholas J. A. Harvey

SIAM J. Comput., 2009

A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem

Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh

CoRR, 2009

Approximating submodular functions everywhere.

Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Matchings, matroids and submodular functions.

Nicholas J. A. Harvey

PhD thesis, 2008

Matroid intersection, pointer chasing, and Young's seminormal representation of <i>S_n</i>.

Nicholas J. A. Harvey

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Streaming algorithms for estimating entropy.

Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Sketching and Streaming Entropy via Approximation Theory.

Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Iteratively constructing preconditioners via the conjugate gradient method.

John Dunagan, Nicholas J. A. Harvey

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

An algebraic algorithm for weighted linear matroid intersection.

Nicholas J. A. Harvey

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

A "Chicken & Egg" Network Coding Problem.

Nicholas J. A. Harvey, Robert Kleinberg, Chandra Nair, Yunnan Wu

Proceedings of the IEEE International Symposium on Information Theory, 2007

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs.

Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

On the capacity of information networks.

Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman

IEEE Trans. Inf. Theory, 2006

Semi-matchings for bipartite graphs and load balancing.

Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir

J. Algorithms, 2006

Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version)

Nicholas J. A. Harvey

CoRR, 2006

The complexity of matrix completion.

Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

On the capacity of information networks.

Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Lower bounds for asymmetric communication channels and distributed source coding.

Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Algebraic Structures and Algorithms for Matching and Matroid Problems.

Nicholas J. A. Harvey

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Deterministic network coding by matrix completion.

Nicholas J. A. Harvey, David R. Karger, Kazuo Murota

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Deterministic SkipNet.

Nicholas J. A. Harvey, J. Ian Munro

Inf. Process. Lett., 2004

Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time.

Kevin C. Zatloukal, Nicholas J. A. Harvey

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

FUSE: Lightweight Guaranteed Distributed Failure Notification.

John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostic, Marvin Theimer, Alec Wolman

Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI 2004), 2004

2003

SkipNet: A Scalable Overlay Network with Practical Locality Properties.

Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman

Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003

Brief announcement: deterministic skipnet.

Nicholas J. A. Harvey, J. Ian Munro

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Efficient Recovery from Organizational Disconnects in SkipNet.

Nicholas J. A. Harvey, Michael B. Jones, Marvin Theimer, Alec Wolman

Proceedings of the Peer-to-Peer Systems II, Second International Workshop, 2003