default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy Kornowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Guy Kornowski, Ohad Shamir:
An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization. J. Mach. Learn. Res. 25: 122:1-122:14 (2024)- 2022
- [j1]Guy Kornowski, Ohad Shamir:
Oracle Complexity in Nonsmooth Nonconvex Optimization. J. Mach. Learn. Res. 23: 314:1-314:44 (2022)
Conference and Workshop Papers
- 2024
- [c6]Steve Hanneke, Aryeh Kontorovich, Guy Kornowski:
Efficient Agnostic Learning with Average Smoothness. ALT 2024: 719-731 - [c5]Guy Kornowski, Ohad Shamir:
Open Problem: Anytime Convergence Rate of Gradient Descent. COLT 2024: 5335-5339 - 2023
- [c4]Michael I. Jordan, Guy Kornowski, Tianyi Lin, Ohad Shamir, Manolis Zampetakis
:
Deterministic Nonsmooth Nonconvex Optimization. COLT 2023: 4570-4597 - [c3]Guy Kornowski, Steve Hanneke, Aryeh Kontorovich:
Near-optimal learning with average Hölder smoothness. NeurIPS 2023 - [c2]Guy Kornowski, Gilad Yehudai, Ohad Shamir:
From Tempered to Benign Overfitting in ReLU Neural Networks. NeurIPS 2023 - 2021
- [c1]Guy Kornowski, Ohad Shamir:
Oracle Complexity in Nonsmooth Nonconvex Optimization. NeurIPS 2021: 324-334
Informal and Other Publications
- 2024
- [i12]Guy Kornowski, Swati Padmanabhan, Kai Wang, Zhe Zhang, Suvrit Sra:
First-Order Methods for Linearly Constrained Bilevel Optimization. CoRR abs/2406.12771 (2024) - [i11]Guy Kornowski, Ohad Shamir:
Open Problem: Anytime Convergence Rate of Gradient Descent. CoRR abs/2406.13888 (2024) - [i10]Guy Kornowski, Swati Padmanabhan, Ohad Shamir:
On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization. CoRR abs/2409.10323 (2024) - [i9]Guy Kornowski:
Differentially Private Bilevel Optimization. CoRR abs/2409.19800 (2024) - 2023
- [i8]Steve Hanneke, Aryeh Kontorovich, Guy Kornowski:
Near-optimal learning with average Hölder smoothness. CoRR abs/2302.06005 (2023) - [i7]Michael I. Jordan, Guy Kornowski, Tianyi Lin, Ohad Shamir, Manolis Zampetakis:
Deterministic Nonsmooth Nonconvex Optimization. CoRR abs/2302.08300 (2023) - [i6]Guy Kornowski, Gilad Yehudai, Ohad Shamir:
From Tempered to Benign Overfitting in ReLU Neural Networks. CoRR abs/2305.15141 (2023) - [i5]Guy Kornowski, Ohad Shamir:
An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization. CoRR abs/2307.04504 (2023) - [i4]Steve Hanneke, Aryeh Kontorovich, Guy Kornowski:
Efficient Agnostic Learning with Average Smoothness. CoRR abs/2309.17016 (2023) - 2022
- [i3]Guy Kornowski, Ohad Shamir:
On the Complexity of Finding Small Subgradients in Nonsmooth Optimization. CoRR abs/2209.10346 (2022) - 2021
- [i2]Guy Kornowski, Ohad Shamir:
Oracle Complexity in Nonsmooth Nonconvex Optimization. CoRR abs/2104.06763 (2021) - 2020
- [i1]Guy Kornowski, Ohad Shamir:
High-Order Oracle Complexity of Smooth and Strongly Convex Optimization. CoRR abs/2010.06642 (2020)
Coauthor Index
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-10-22 21: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:
