default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYossi Arjevani
Person information
- affiliation: The Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i22]Yossi Arjevani:
Symmetry & Critical Points. CoRR abs/2408.14445 (2024)- 2023
- [j3]Yossi Arjevani, Yair Carmon
, John C. Duchi, Dylan J. Foster, Nathan Srebro, Blake E. Woodworth:
Lower bounds for non-convex stochastic optimization. Math. Program. 199(1): 165-214 (2023) - [i21]Yossi Arjevani, Gal Vinograd:
Symmetry & Critical Points for Symmetric Tensor Decomposition Problems. CoRR abs/2306.07886 (2023) - [i20]Yossi Arjevani:
Hidden Minima in Two-Layer ReLU Networks. CoRR abs/2312.16819 (2023) - 2022
- [c11]Yossi Arjevani, Michael Field:
Annihilation of Spurious Minima in Two-Layer ReLU Networks. NeurIPS 2022 - [i19]Yossi Arjevani, Michael Field:
Annihilation of Spurious Minima in Two-Layer ReLU Networks. CoRR abs/2210.06088 (2022) - 2021
- [c10]Yossi Arjevani, Michael Field:
Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks: A Tale of Symmetry II. NeurIPS 2021: 15162-15174 - [i18]Yossi Arjevani, Joan Bruna, Michael Field, Joe Kileel, Matthew Trager, Francis Williams:
Symmetry Breaking in Symmetric Tensor Decomposition. CoRR abs/2103.06234 (2021) - [i17]Yossi Arjevani, Michael Field:
Equivariant bifurcation, quadratic equivariants, and symmetry breaking for the standard representation of Sn. CoRR abs/2107.02422 (2021) - [i16]Yossi Arjevani, Michael Field:
Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks. CoRR abs/2107.10370 (2021) - 2020
- [c9]Yossi Arjevani, Ohad Shamir, Nathan Srebro:
A Tight Convergence Analysis for Stochastic Gradient Descent with Delayed Updates. ALT 2020: 111-132 - [c8]Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Ayush Sekhari, Karthik Sridharan:
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations. COLT 2020: 242-299 - [c7]Yossi Arjevani, Joan Bruna, Bugra Can, Mert Gürbüzbalaban, Stefanie Jegelka, Hongzhou Lin:
IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method. NeurIPS 2020 - [c6]Yossi Arjevani, Michael Field:
Analytic Characterization of the Hessian in Shallow ReLU Models: A Tale of Symmetry. NeurIPS 2020 - [i15]Yossi Arjevani, Amit Daniely, Stefanie Jegelka, Hongzhou Lin:
On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions. CoRR abs/2002.03273 (2020) - [i14]Yossi Arjevani, Michael Field:
Symmetry & critical points for a model shallow neural network. CoRR abs/2003.10576 (2020) - [i13]Yossi Arjevani, Joan Bruna, Bugra Can, Mert Gürbüzbalaban, Stefanie Jegelka, Hongzhou Lin:
IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method. CoRR abs/2006.06733 (2020) - [i12]Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Ayush Sekhari, Karthik Sridharan:
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations. CoRR abs/2006.13476 (2020) - [i11]Yossi Arjevani, Michael Field:
Analytic Characterization of the Hessian in Shallow ReLU Models: A Tale of Symmetry. CoRR abs/2008.01805 (2020)
2010 – 2019
- 2019
- [j2]Yossi Arjevani, Ohad Shamir, Ron Shiff:
Oracle complexity of second-order methods for smooth convex optimization. Math. Program. 178(1-2): 327-360 (2019) - [i10]Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, Blake E. Woodworth:
Lower Bounds for Non-Convex Stochastic Optimization. CoRR abs/1912.02365 (2019) - [i9]Yossi Arjevani, Michael Field:
Spurious Local Minima of Shallow ReLU Networks Conform with the Symmetry of the Target Model. CoRR abs/1912.11939 (2019) - 2018
- [i8]Yossi Arjevani, Ohad Shamir, Nathan Srebro:
A Tight Convergence Analysis for Stochastic Gradient Descent with Delayed Updates. CoRR abs/1806.10188 (2018) - 2017
- [c5]Yossi Arjevani, Ohad Shamir:
Oracle Complexity of Second-Order Methods for Finite-Sum Problems. ICML 2017: 205-213 - [c4]Yossi Arjevani:
Limitations on Variance-Reduction and Acceleration Schemes for Finite Sums Optimization. NIPS 2017: 3540-3549 - [i7]Yossi Arjevani:
Limitations on Variance-Reduction and Acceleration Schemes for Finite Sum Optimization. CoRR abs/1706.01686 (2017) - 2016
- [j1]Yossi Arjevani, Shai Shalev-Shwartz, Ohad Shamir:
On Lower and Upper Bounds in Smooth and Strongly Convex Optimization. J. Mach. Learn. Res. 17: 126:1-126:51 (2016) - [c3]Yossi Arjevani, Ohad Shamir:
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms. ICML 2016: 908-916 - [c2]Yossi Arjevani, Ohad Shamir:
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems. NIPS 2016: 3540-3548 - [i6]Yossi Arjevani, Ohad Shamir:
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms. CoRR abs/1605.03529 (2016) - [i5]Yossi Arjevani, Ohad Shamir:
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems. CoRR abs/1606.09333 (2016) - [i4]Yossi Arjevani, Ohad Shamir:
Oracle Complexity of Second-Order Methods for Finite-Sum Problems. CoRR abs/1611.04982 (2016) - 2015
- [c1]Yossi Arjevani, Ohad Shamir:
Communication Complexity of Distributed Convex Learning and Optimization. NIPS 2015: 1756-1764 - [i3]Yossi Arjevani, Shai Shalev-Shwartz, Ohad Shamir:
On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems. CoRR abs/1503.06833 (2015) - [i2]Yossi Arjevani, Ohad Shamir:
Communication Complexity of Distributed Convex Learning and Optimization. CoRR abs/1506.01900 (2015) - 2014
- [i1]Yossi Arjevani:
On Lower and Upper Bounds in Smooth Strongly Convex Optimization - A Unified Approach via Linear Iterative Methods. CoRR abs/1410.6387 (2014)
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-09-30 01:02 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:
