Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItay Safran
Person information
- affiliation: Princeton University, NJ, USA
- affiliation: Weizmann Institute of Science, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i11]Itay Safran, Daniel Reichman, Paul Valiant:
How Many Neurons Does it Take to Approximate the Maximum? CoRR abs/2307.09212 (2023)- 2022
- [c9]Itay Safran, Jason D. Lee:
Optimization-Based Separations for Neural Networks. COLT 2022: 3-64 - [c8]Itay Safran, Gal Vardi, Jason D. Lee:
On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias. NeurIPS 2022 - [i10]Itay Safran, Gal Vardi, Jason D. Lee:
On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias. CoRR abs/2205.09072 (2022) - 2021
- [c7]Itay Safran, Gilad Yehudai, Ohad Shamir:
The Effects of Mild Over-parameterization on the Optimization Landscape of Shallow ReLU Neural Networks. COLT 2021: 3889-3934 - [c6]Itay Safran, Ohad Shamir:
Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems. NeurIPS 2021: 15151-15161 - [i9]Itay Safran, Ohad Shamir:
Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems. CoRR abs/2106.06880 (2021) - [i8]Itay Safran, Jason D. Lee:
Optimization-Based Separations for Neural Networks. CoRR abs/2112.02393 (2021) - 2020
- [c5]Itay Safran, Ohad Shamir:
How Good is SGD with Random Shuffling? COLT 2020: 3250-3284 - [i7]Itay Safran, Gilad Yehudai, Ohad Shamir:
The Effects of Mild Over-parameterization on the Optimization Landscape of Shallow ReLU Neural Networks. CoRR abs/2006.01005 (2020)
2010 – 2019
- 2019
- [c4]Itay Safran, Ronen Eldan, Ohad Shamir:
Depth Separations in Neural Networks: What is Actually Being Separated? COLT 2019: 2664-2666 - [i6]Adi Shamir, Itay Safran, Eyal Ronen, Orr Dunkelman:
A Simple Explanation for the Existence of Adversarial Examples with Small Hamming Distance. CoRR abs/1901.10861 (2019) - [i5]Itay Safran, Ronen Eldan, Ohad Shamir:
Depth Separations in Neural Networks: What is Actually Being Separated? CoRR abs/1904.06984 (2019) - [i4]Itay Safran, Ohad Shamir:
How Good is SGD with Random Shuffling? CoRR abs/1908.00045 (2019) - 2018
- [c3]Itay Safran, Ohad Shamir:
Spurious Local Minima are Common in Two-Layer ReLU Neural Networks. ICML 2018: 4430-4438 - 2017
- [c2]Itay Safran, Ohad Shamir:
Depth-Width Tradeoffs in Approximating Natural Functions with Neural Networks. ICML 2017: 2979-2987 - [i3]Itay Safran, Ohad Shamir:
Spurious Local Minima are Common in Two-Layer ReLU Neural Networks. CoRR abs/1712.08968 (2017) - 2016
- [c1]Itay Safran, Ohad Shamir:
On the Quality of the Initial Basin in Overspecified Neural Networks. ICML 2016: 774-782 - [i2]Itay Safran, Ohad Shamir:
Depth Separation in ReLU Networks for Approximating Smooth Non-Linear Functions. CoRR abs/1610.09887 (2016) - 2015
- [i1]Itay Safran, Ohad Shamir:
On the Quality of the Initial Basin in Overspecified Neural Networks. CoRR abs/1511.04210 (2015)
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 2023-09-27 22:48 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:
