Остановите войну!
for scientists:
default search action
Nicholas J. A. Harvey
- > Home > Persons > Nicholas J. A. Harvey
Publications
- 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) - [c39]Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa:
Optimal anytime regret for two experts. FOCS 2020: 1404-1415 - [c37]Nicholas J. A. Harvey, Christopher Liaw, Tasuku Soma:
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. 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) - 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) - [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
- [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 - [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)
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-03-03 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint