Yoel Drori

Orcid: 0000-0003-2359-756X

According to our database1, Yoel Drori authored at least 16 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
An optimal gradient method for smooth strongly convex minimization.
Math. Program., May, 2023

Locally Optimal Descent for Dynamic Stepsize Scheduling.
CoRR, 2023

Improving Training Stability for Multitask Ranking Models in Recommender Systems.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

2022
On the oracle complexity of smooth strongly convex minimization.
J. Complex., 2022

2021
An optimal gradient method for smooth (possibly strongly) convex minimization.
CoRR, 2021

Asynchronous Stochastic Optimization Robust to Arbitrary Delays.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Efficient first-order methods for convex minimization: a constructive approach.
Math. Program., 2020

The Complexity of Finding Stationary Points with Stochastic Gradient Descent.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
A Joint Named-Entity Recognizer for Heterogeneous Tag-setsUsing a Tag Hierarchy.
CoRR, 2019

A Joint Named-Entity Recognizer for Heterogeneous Tag-sets Using a Tag Hierarchy.
Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

2017
The exact information-based complexity of smooth convex minimization.
J. Complex., 2017

2016
An optimal variant of Kelley's cutting-plane method.
Math. Program., 2016

2015
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems.
Oper. Res. Lett., 2015

2014
Contributions to the complexity analysis of optimization algorithms
PhD thesis, 2014

Performance of first-order methods for smooth convex minimization: a novel approach.
Math. Program., 2014

2012
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems.
Oper. Res. Lett., 2012


  Loading...