Nicholas J. A. Harvey

78 papers A* 28B 7Journal 37Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A second order regret bound for NormalHedge. CoRR Yoav Freund, Nicholas J. A. Harvey, Victor S. Portella, Yabing Qi, Yu-Xiang Wang
2026	A*	`conf`	Spectral Basis Learning for Expressive Graph Neural Networks in Link Prediction. AAAI Niloofar Azizi, Nils M. Kriege, Nicholas J. A. Harvey, Horst Bischof
2025	A*	`conf`	Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes. COLT Victor S. Portella, Nicholas J. A. Harvey
2024	J	`jnl`	Continuous Prediction with Experts' Advice. J. Mach. Learn. Res. Nicholas J. A. Harvey, Christopher Liaw, Victor S. Portella
2024	J	`jnl`	Tight analyses for subgradient descent I: Lower bounds. Open J. Math. Optim. Nicholas J. A. Harvey, Chris Liaw, Sikander Randhawa
2023	A*	`conf`	Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking. NeurIPS Frederik Kunstner, Victor Sanches Portella, Mark Schmidt, Nicholas J. A. Harvey
2022	J	`jnl`	Continuous Prediction with Experts' Advice. CoRR Victor Sanches Portella, Christopher Liaw, Nicholas J. A. Harvey
2022	B	`conf`	Efficient and Optimal Fixed-Time Regret with Two Experts. ALT Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella
2022	J	`jnl`	Efficient and Optimal Fixed-Time Regret with Two Experts. CoRR Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella
2022	J	`jnl`	Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case. J. Mach. Learn. Res. Huang Fang, Nicholas J. A. Harvey, Victor S. Portella, Michael P. Friedlander
2020	J	`jnl`	An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles. SIAM J. Comput. Nicholas J. A. Harvey, Jan Vondrák
2020	A*	`conf`	Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. NeurIPS Nicholas J. A. Harvey, Christopher Liaw, Tasuku Soma
2020	J	`jnl`	Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. J. ACM Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan
2020	J	`jnl`	Online mirror descent and dual averaging: keeping pace in the dynamic case. CoRR Huang Fang, Nicholas J. A. Harvey, Victor S. Portella, Michael P. Friedlander
2020	A*	`conf`	Optimal anytime regret for two experts. FOCS Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa
2020	J	`jnl`	Optimal anytime regret with two experts. CoRR Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa
2020	A*	`conf`	Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses. NeurIPS Yihan Zhou, Victor S. Portella, Mark Schmidt, Nicholas J. A. Harvey
2020	J	`jnl`	Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses. CoRR Yihan Zhou, Victor S. Portella, Mark Schmidt, Nicholas J. A. Harvey
2019	J	`jnl`	A General Framework for Graph Sparsification. SIAM J. Comput. Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi
2019	J	`jnl`	Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent. CoRR Nicholas J. A. Harvey, Christopher Liaw, Sikander Randhawa
2019	A*	`conf`	Tight analyses for non-smooth stochastic gradient descent. COLT Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa
2018	A*	`conf`	Computing the Independence Polynomial: from the Tree Threshold down to the Roots. SODA Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák
2018	B	`conf`	Greedy and Local Ratio Algorithms in the MapReduce Model. SPAA Nicholas J. A. Harvey, Christopher Liaw, Paul Liu
2018	J	`jnl`	Greedy and Local Ratio Algorithms in the MapReduce Model. CoRR Nicholas J. A. Harvey, Christopher Liaw, Paul Liu
2018	A*	`conf`	Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. NeurIPS Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan
2018	J	`jnl`	Submodular Functions: Learnability, Structure, and Optimization. SIAM J. Comput. Maria-Florina Balcan, Nicholas J. A. Harvey
2018	J	`jnl`	Tight Analyses for Non-Smooth Stochastic Gradient Descent. CoRR Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa
2017	J	`jnl`	Matroids Hitting Sets and Unsupervised Dependency Grammar Induction. CoRR Nicholas J. A. Harvey, David R. Karger, Virginia Savova, Leonid Peshkin
2017	J	`jnl`	Rainbow Hamilton cycles and lopsidependency. Discret. Math. Nicholas J. A. Harvey, Christopher Liaw
2016	J	`jnl`	Computing the independence polynomial in Shearer's region for the LLL. CoRR Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák
2016	B	`conf`	Generating Random Spanning Trees via Fast Matrix Multiplication. LATIN Nicholas J. A. Harvey, Keyulu Xu
2016	J	`jnl`	Sparse Sums of Positive Semidefinite Matrices. ACM Trans. Algorithms Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato
2015	J	`jnl`	A note on the discrepancy of matrices with bounded row and column sums. Discret. Math. Nicholas J. A. Harvey
2015	J	`jnl`	An Algorithmic Proof of the Lopsided Lovasz Local Lemma. CoRR Nicholas J. A. Harvey, Jan Vondrák
2015	A*	`conf`	An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles. FOCS Nicholas J. A. Harvey, Jan Vondrák
2015	—	`conf`	Approximating Hit Rate Curves using Streaming Algorithms. APPROX-RANDOM Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, Jake Wires
2015	J	`jnl`	Counter Stacks and the Elusive Working Set. login Usenix Mag. Jake Wires, Stephen Ingram, Zachary Drudi, Nicholas J. A. Harvey, Andrew Warfield
2014	A*	`conf`	Characterizing Storage Workloads with Counter Stacks. OSDI Jake Wires, Stephen Ingram, Zachary Drudi, Nicholas J. A. Harvey, Andrew Warfield
2014	—	`conf`	Discrepancy Without Partial Colorings. APPROX-RANDOM Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh
2014	A*	`conf`	Pipage Rounding, Pessimistic Estimators and Matrix Concentration. SODA Nicholas J. A. Harvey, Neil Olver
2014	J	`jnl`	UNO is hard, even for a single player. Theor. Comput. Sci. Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
2013	J	`jnl`	Pipage Rounding, Pessimistic Estimators and Matrix Concentration. CoRR Nicholas J. A. Harvey, Neil Olver
2012	—	`conf`	Learning Submodular Functions. ECML/PKDD (2) Maria-Florina Balcan, Nicholas J. A. Harvey
2011	A*	`conf`	A general framework for graph sparsification. STOC Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi
2011	A*	`conf`	Learning submodular functions. STOC Maria-Florina Balcan, Nicholas J. A. Harvey
2011	J	`jnl`	On Disjoint Common Bases in Two Matroids. SIAM J. Discret. Math. Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau
2011	J	`jnl`	On the complexity of reconfiguration problems. Theor. Comput. Sci. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2011	J	`jnl`	Sparse Sums of Positive Semidefinite Matrices CoRR Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato
2010	J	`jnl`	Graph Sparsification by Edge-Connectivity and Random Spanning Trees CoRR Wai Shing Fung, Nicholas J. A. Harvey
2010	J	`jnl`	Learning Submodular Functions CoRR Maria-Florina Balcan, Nicholas J. A. Harvey
2009	J	`jnl`	A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem CoRR Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh
2009	J	`jnl`	Algebraic Algorithms for Matching and Matroid Problems. SIAM J. Comput. Nicholas J. A. Harvey
2009	A*	`conf`	Approximating submodular functions everywhere. SODA Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni
2008	—	`—`	Matchings, matroids and submodular functions. Nicholas J. A. Harvey
2008	A*	`conf`	Matroid intersection, pointer chasing, and Young's seminormal representation of SODA Nicholas J. A. Harvey
2008	B	`conf`	On the Complexity of Reconfiguration Problems. ISAAC Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2008	J	`jnl`	Sketching and Streaming Entropy via Approximation Theory CoRR Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak
2008	A*	`conf`	Sketching and Streaming Entropy via Approximation Theory. FOCS Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak
2008	B	`conf`	Streaming algorithms for estimating entropy. ITW Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak
2007	B	`conf`	A "Chicken & Egg" Network Coding Problem. ISIT Nicholas J. A. Harvey, Robert Kleinberg, Chandra Nair, Yunnan Wu
2007	A*	`conf`	An algebraic algorithm for weighted linear matroid intersection. SODA Nicholas J. A. Harvey
2007	A*	`conf`	Iteratively constructing preconditioners via the conjugate gradient method. STOC John Dunagan, Nicholas J. A. Harvey
2007	A*	`conf`	Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. INFOCOM Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan
2006	J	`jnl`	Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version) CoRR Nicholas J. A. Harvey
2006	A*	`conf`	Algebraic Structures and Algorithms for Matching and Matroid Problems. FOCS Nicholas J. A. Harvey
2006	A*	`conf`	Lower bounds for asymmetric communication channels and distributed source coding. SODA Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu
2006	A*	`conf`	On the capacity of information networks. SODA Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman
2006	J	`jnl`	On the capacity of information networks. IEEE Trans. Inf. Theory Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman
2006	J	`jnl`	Semi-matchings for bipartite graphs and load balancing. J. Algorithms Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
2006	A*	`conf`	The complexity of matrix completion. SODA Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin
2005	A*	`conf`	Deterministic network coding by matrix completion. SODA Nicholas J. A. Harvey, David R. Karger, Kazuo Murota
2004	J	`jnl`	Deterministic SkipNet. Inf. Process. Lett. Nicholas J. A. Harvey, J. Ian Munro
2004	A*	`conf`	FUSE: Lightweight Guaranteed Distributed Failure Notification. OSDI John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostic, Marvin Theimer, Alec Wolman
2004	A*	`conf`	Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. SODA Kevin C. Zatloukal, Nicholas J. A. Harvey
2003	A*	`conf`	Brief announcement: deterministic skipnet. PODC Nicholas J. A. Harvey, J. Ian Munro
2003	—	`conf`	Efficient Recovery from Organizational Disconnects in SkipNet. IPTPS Nicholas J. A. Harvey, Michael B. Jones, Marvin Theimer, Alec Wolman
2003	B	`conf`	Semi-matchings for Bipartite Graphs and Load Balancing. WADS Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir
2003	—	`conf`	SkipNet: A Scalable Overlay Network with Practical Locality Properties. USENIX Symposium on Internet Technologies and Systems Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman