default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas J. A. Harvey
Person information
- affiliation: University of British Columbia, Vancouver, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Nicholas J. A. Harvey, Christopher Liaw, Victor S. Portella:
Continuous Prediction with Experts' Advice. J. Mach. Learn. Res. 25: 228:1-228:32 (2024)- [i21]Victor S. Portella, Nick Harvey:
Lower Bounds for Private Estimation of Gaussian Covariance Matrices under All Reasonable Parameter Regimes. CoRR abs/2404.17714 (2024) - 2023
- [c41]Frederik Kunstner, Victor Sanches Portella, Mark Schmidt, Nicholas J. A. Harvey:
Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking. NeurIPS 2023 - [i20]Frederik Kunstner, Victor S. Portella, Mark Schmidt, Nick Harvey:
Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking. CoRR abs/2306.02527 (2023) - 2022
- [j17]Huang Fang, Nicholas J. A. Harvey, Victor S. Portella, Michael P. Friedlander:
Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case. J. Mach. Learn. Res. 23: 121:1-121:38 (2022) - [c40]Laura Greenstreet, Nicholas J. A. Harvey, Victor Sanches Portella:
Efficient and Optimal Fixed-Time Regret with Two Experts. ALT 2022: 436-464 - [i19]Laura Greenstreet
, Nicholas J. A. Harvey, Victor Sanches Portella:
Efficient and Optimal Fixed-Time Regret with Two Experts. CoRR abs/2203.07577 (2022) - [i18]Victor Sanches Portella, Christopher Liaw, Nicholas J. A. Harvey:
Continuous Prediction with Experts' Advice. CoRR abs/2206.00236 (2022) - 2020
- [j16]Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan:
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. J. ACM 67(6): 32:1-32:42 (2020) - [j15]Nicholas J. A. Harvey, Jan Vondrák:
An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles. SIAM J. Comput. 49(2): 394-428 (2020) - [c39]Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa:
Optimal anytime regret for two experts. FOCS 2020: 1404-1415 - [c38]Huang Fang, Nick Harvey, Victor S. Portella, Michael P. Friedlander:
Online mirror descent and dual averaging: keeping pace in the dynamic case. ICML 2020: 3008-3017 - [c37]Nicholas J. A. Harvey, Christopher Liaw, Tasuku Soma:
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. NeurIPS 2020 - [c36]Yihan Zhou, Victor S. Portella, Mark Schmidt, Nicholas J. A. Harvey:
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses. NeurIPS 2020 - [i17]Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa:
Optimal anytime regret with two experts. CoRR abs/2002.08994 (2020) - [i16]Huang Fang, Nicholas J. A. Harvey, Victor S. Portella, Michael P. Friedlander:
Online mirror descent and dual averaging: keeping pace in the dynamic case. CoRR abs/2006.02585 (2020) - [i15]Yihan Zhou, Victor S. Portella, Mark Schmidt, Nicholas J. A. Harvey:
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses. CoRR abs/2010.12033 (2020)
2010 – 2019
- 2019
- [j14]Peter L. Bartlett, Nick Harvey, Christopher Liaw, Abbas Mehrabian:
Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks. J. Mach. Learn. Res. 20: 63:1-63:17 (2019) - [j13]Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi:
A General Framework for Graph Sparsification. SIAM J. Comput. 48(4): 1196-1223 (2019) - [c35]Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa:
Tight analyses for non-smooth stochastic gradient descent. COLT 2019: 1579-1613 - [i14]Nicholas J. A. Harvey, Christopher Liaw, Sikander Randhawa:
Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent. CoRR abs/1909.00843 (2019) - 2018
- [j12]Maria-Florina Balcan, Nicholas J. A. Harvey:
Submodular Functions: Learnability, Structure, and Optimization. SIAM J. Comput. 47(3): 703-754 (2018) - [c34]Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan:
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes. NeurIPS 2018: 3416-3425 - [c33]Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the Independence Polynomial: from the Tree Threshold down to the Roots. SODA 2018: 1557-1576 - [c32]Nicholas J. A. Harvey, Christopher Liaw, Paul Liu:
Greedy and Local Ratio Algorithms in the MapReduce Model. SPAA 2018: 43-52 - [i13]Nicholas J. A. Harvey, Christopher Liaw, Paul Liu:
Greedy and Local Ratio Algorithms in the MapReduce Model. CoRR abs/1806.06421 (2018) - [i12]Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa:
Tight Analyses for Non-Smooth Stochastic Gradient Descent. CoRR abs/1812.05217 (2018) - 2017
- [j11]Nicholas J. A. Harvey, Christopher Liaw:
Rainbow Hamilton cycles and lopsidependency. Discret. Math. 340(6): 1261-1270 (2017) - [c31]Nick Harvey, Christopher Liaw, Abbas Mehrabian:
Nearly-tight VC-dimension bounds for piecewise linear neural networks. COLT 2017: 1064-1068 - [i11]Nick Harvey, Christopher Liaw, Abbas Mehrabian:
Nearly-tight VC-dimension bounds for piecewise linear neural networks. CoRR abs/1703.02930 (2017) - [i10]Nicholas J. A. Harvey, David R. Karger, Virginia Savova, Leonid Peshkin:
Matroids Hitting Sets and Unsupervised Dependency Grammar Induction. CoRR abs/1705.08992 (2017) - 2016
- [j10]Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato:
Sparse Sums of Positive Semidefinite Matrices. ACM Trans. Algorithms 12(1): 9:1-9:17 (2016) - [c30]Nicholas J. A. Harvey, Keyulu Xu:
Generating Random Spanning Trees via Fast Matrix Multiplication. LATIN 2016: 522-535 - [i9]Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák:
Computing the independence polynomial in Shearer's region for the LLL. CoRR abs/1608.02282 (2016) - 2015
- [j9]Nicholas J. A. Harvey:
A note on the discrepancy of matrices with bounded row and column sums. Discret. Math. 338(4): 517-521 (2015) - [j8]Jake Wires, Stephen Ingram, Zachary Drudi, Nicholas J. A. Harvey, Andrew Warfield:
Counter Stacks and the Elusive Working Set. login Usenix Mag. 40(1) (2015) - [c29]Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, Jake Wires:
Approximating Hit Rate Curves using Streaming Algorithms. APPROX-RANDOM 2015: 225-241 - [c28]Nicholas J. A. Harvey, Jan Vondrák:
An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles. FOCS 2015: 1327-1346 - [i8]Nicholas J. A. Harvey, Jan Vondrák:
An Algorithmic Proof of the Lopsided Lovasz Local Lemma. CoRR abs/1504.02044 (2015) - 2014
- [j7]Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO is hard, even for a single player. Theor. Comput. Sci. 521: 51-61 (2014) - [c27]Nicholas J. A. Harvey, Roy Schwartz, Mohit Singh:
Discrepancy Without Partial Colorings. APPROX-RANDOM 2014: 258-273 - [c26]Nick Harvey, Samira Samadi:
Near-Optimal Herding. COLT 2014: 1165-1182 - [c25]Jake Wires, Stephen Ingram, Zachary Drudi, Nicholas J. A. Harvey, Andrew Warfield:
Characterizing Storage Workloads with Counter Stacks. OSDI 2014: 335-349 - [c24]Nicholas J. A. Harvey, Neil Olver:
Pipage Rounding, Pessimistic Estimators and Matrix Concentration. SODA 2014: 926-945 - 2013
- [i7]Nicholas J. A. Harvey, Neil Olver:
Pipage Rounding, Pessimistic Estimators and Matrix Concentration. CoRR abs/1307.2274 (2013) - 2012
- [c23]Maria-Florina Balcan, Nicholas J. A. Harvey:
Learning Submodular Functions. ECML/PKDD (2) 2012: 846-849 - 2011
- [j6]Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau:
On Disjoint Common Bases in Two Matroids. SIAM J. Discret. Math. 25(4): 1792-1803 (2011) - [j5]Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12-14): 1054-1065 (2011) - [c22]Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, Debmalya Panigrahi:
A general framework for graph sparsification. STOC 2011: 71-80 - [c21]Maria-Florina Balcan, Nicholas J. A. Harvey:
Learning submodular functions. STOC 2011: 793-802 - [i6]Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato:
Sparse Sums of Positive Semidefinite Matrices. CoRR abs/1107.0088 (2011) - 2010
- [i5]Wai Shing Fung, Nicholas J. A. Harvey:
Graph Sparsification by Edge-Connectivity and Random Spanning Trees. CoRR abs/1005.0265 (2010) - [i4]Maria-Florina Balcan, Nicholas J. A. Harvey:
Learning Submodular Functions. CoRR abs/1008.2159 (2010)
2000 – 2009
- 2009
- [j4]Nicholas J. A. Harvey:
Algebraic Algorithms for Matching and Matroid Problems. SIAM J. Comput. 39(2): 679-702 (2009) - [c20]Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni:
Approximating submodular functions everywhere. SODA 2009: 535-544 - [i3]Michel X. Goemans, Nicholas J. A. Harvey, Kamal Jain, Mohit Singh:
A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/0909.0941 (2009) - 2008
- [b1]Nicholas J. A. Harvey:
Matchings, matroids and submodular functions. Massachusetts Institute of Technology, Cambridge, MA, USA, 2008 - [c19]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory. FOCS 2008: 489-498 - [c18]Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno:
On the Complexity of Reconfiguration Problems. ISAAC 2008: 28-39 - [c17]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Streaming algorithms for estimating entropy. ITW 2008: 227-231 - [c16]Nicholas J. A. Harvey:
Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. SODA 2008: 542-549 - [i2]Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Sketching and Streaming Entropy via Approximation Theory. CoRR abs/0804.4138 (2008) - 2007
- [c15]Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan:
Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. INFOCOM 2007: 697-705 - [c14]Nicholas J. A. Harvey, Robert Kleinberg, Chandra Nair, Yunnan Wu:
A "Chicken & Egg" Network Coding Problem. ISIT 2007: 131-135 - [c13]Nicholas J. A. Harvey:
An algebraic algorithm for weighted linear matroid intersection. SODA 2007: 444-453 - [c12]John Dunagan, Nicholas J. A. Harvey:
Iteratively constructing preconditioners via the conjugate gradient method. STOC 2007: 207-216 - 2006
- [j3]Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59(1): 53-78 (2006) - [j2]Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. IEEE Trans. Inf. Theory 52(6): 2345-2364 (2006) - [c11]Nicholas J. A. Harvey:
Algebraic Structures and Algorithms for Matching and Matroid Problems. FOCS 2006: 531-542 - [c10]Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman:
On the capacity of information networks. SODA 2006: 241-250 - [c9]Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu:
Lower bounds for asymmetric communication channels and distributed source coding. SODA 2006: 251-260 - [c8]Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin:
The complexity of matrix completion. SODA 2006: 1103-1111 - [i1]Nicholas J. A. Harvey:
Algebraic Structures and Algorithms for Matching and Matroid Problems (Preliminary Version). CoRR abs/cs/0601026 (2006) - 2005
- [c7]Nicholas J. A. Harvey, David R. Karger, Kazuo Murota:
Deterministic network coding by matrix completion. SODA 2005: 489-498 - 2004
- [j1]Nicholas J. A. Harvey, J. Ian Munro:
Deterministic SkipNet. Inf. Process. Lett. 90(4): 205-208 (2004) - [c6]John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostic, Marvin Theimer, Alec Wolman:
FUSE: Lightweight Guaranteed Distributed Failure Notification. OSDI 2004: 151-166 - [c5]Kevin C. Zatloukal, Nicholas J. A. Harvey:
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. SODA 2004: 308-317 - 2003
- [c4]Nicholas J. A. Harvey, Michael B. Jones, Marvin Theimer, Alec Wolman:
Efficient Recovery from Organizational Disconnects in SkipNet. IPTPS 2003: 183-196 - [c3]Nicholas J. A. Harvey, J. Ian Munro:
Brief announcement: deterministic skipnet. PODC 2003: 152 - [c2]Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman:
SkipNet: A Scalable Overlay Network with Practical Locality Properties. USENIX Symposium on Internet Technologies and Systems 2003 - [c1]Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for Bipartite Graphs and Load Balancing. WADS 2003: 294-308
Coauthor Index
aka: Victor Sanches Portella
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
