Yossi Arjevani

CoRR, 2024

2023

Lower bounds for non-convex stochastic optimization.

[BibT_eX]

[DOI]

Math. Program., May, 2023

Hidden Minima in Two-Layer ReLU Networks.

[BibT_eX]

[DOI]

CoRR, 2023

Symmetry & Critical Points for Symmetric Tensor Decomposition Problems.

[BibT_eX]

[DOI]

Gal Vinograd

CoRR, 2023

2022

Annihilation of Spurious Minima in Two-Layer ReLU Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2021

Equivariant bifurcation, quadratic equivariants, and symmetry breaking for the standard representation of S<sub>n</sub>.

[BibT_eX]

[DOI]

CoRR, 2021

Symmetry Breaking in Symmetric Tensor Decomposition.

[BibT_eX]

[DOI]

CoRR, 2021

Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks: A Tale of Symmetry II.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Symmetry & critical points for a model shallow neural network.

[BibT_eX]

[DOI]

CoRR, 2020

On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions.

[BibT_eX]

[DOI]

CoRR, 2020

Analytic Characterization of the Hessian in Shallow ReLU Models: A Tale of Symmetry.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

A Tight Convergence Analysis for Stochastic Gradient Descent with Delayed Updates.

[BibT_eX]

[DOI]

Nathan Srebro

Proceedings of the Algorithmic Learning Theory, 2020

2019

Oracle complexity of second-order methods for smooth convex optimization.

[BibT_eX]

[DOI]

Ron Shiff

Math. Program., 2019

Spurious Local Minima of Shallow ReLU Networks Conform with the Symmetry of the Target Model.

[BibT_eX]

[DOI]

CoRR, 2019

2017

Limitations on Variance-Reduction and Acceleration Schemes for Finite Sum Optimization.

[BibT_eX]

[DOI]

CoRR, 2017

Limitations on Variance-Reduction and Acceleration Schemes for Finite Sums Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Oracle Complexity of Second-Order Methods for Finite-Sum Problems.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

On Lower and Upper Bounds in Smooth and Strongly Convex Optimization.

[BibT_eX]

[DOI]

Shai Shalev-Shwartz

J. Mach. Learn. Res., 2016

Dimension-Free Iteration Complexity of Finite Sum Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

On the Iteration Complexity of Oblivious First-Order Optimization Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 33nd International Conference on Machine Learning, 2016

2015

On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems.

[BibT_eX]

[DOI]

Shai Shalev-Shwartz

CoRR, 2015

Communication Complexity of Distributed Convex Learning and Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014

On Lower and Upper Bounds in Smooth Strongly Convex Optimization - A Unified Approach via Linear Iterative Methods.

[BibT_eX]

[DOI]