Ali Kavis

Orcid: 0000-0003-1438-6269

According to our database1, Ali Kavis authored at least 13 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Alternation makes the adversary weaker in two-player games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization.
CoRR, 2021

STORM+: Fully Adaptive SGD with Recursive Momentum for Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sifting through the noise: Universal first-order methods for stochastic variational inequalities.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Double-Loop Unadjusted Langevin Algorithm.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient learning of smooth probability functions from Bernoulli tests with guarantees.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Efficient learning of smooth probability functions from Bernoulli tests with guarantees.
CoRR, 2018

Mirrored Langevin Dynamics.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018


  Loading...