Kfir Y. Levy

Orcid: 0000-0003-1236-2626

Affiliations:
  • Technion, Haifa, Faculty of Industrial Engineering and Management


According to our database1, Kfir Y. Levy authored at least 66 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization.
Math. Program., May, 2024

Improved Sample Complexity for Global Convergence of Actor-Critic Algorithms.
CoRR, 2024

EXAQ: Exponent Aware Quantization For LLMs Acceleration.
CoRR, 2024

On the Global Convergence of Policy Gradient in Average Reward Markov Decision Processes.
CoRR, 2024

Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Efficient Value Iteration for s-rectangular Robust Markov Decision Processes.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

A Study of First-Order Methods with a Deterministic Relative-Error Gradient Oracle.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Bring Your Own (Non-Robust) Algorithm to Solve Robust MDPs by Estimating The Worst Kernel.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Dynamic Byzantine-Robust Learning: Adapting to Switching Byzantine Workers.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Fault Tolerant ML: Efficient Meta-Aggregation and Synchronous Training.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Policy Gradient for Reinforcement Learning with General Utilities.
Proceedings of the Second Tiny Papers Track at ICLR 2024, 2024

Learning the Uncertainty Set in Robust Markov Decision Process.
Proceedings of the Second Tiny Papers Track at ICLR 2024, 2024

Towards Faster Global Convergence of Robust Policy Gradient Methods.
Proceedings of the Second Tiny Papers Track at ICLR 2024, 2024

Policy Gradient with Tree Search (PGTS) in Reinforcement Learning Evades Local Maxima.
Proceedings of the Second Tiny Papers Track at ICLR 2024, 2024

Solving Non-rectangular Reward-Robust MDPs via Frequency Regularization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Meta-Learning Adversarial Bandit Algorithms.
CoRR, 2023

Robust Reinforcement Learning via Adversarial Kernel Approximation.
CoRR, 2023

μ<sup>2</sup>-SGD: Stable Stochastic Optimization via a Double Momentum Mechanism.
CoRR, 2023

SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization.
CoRR, 2023

An Efficient Solution to s-Rectangular Robust Markov Decision Processes.
CoRR, 2023

Policy Gradient for s-Rectangular Robust Markov Decision Processes.
CoRR, 2023

Policy Gradient for Rectangular Robust Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Meta-Learning Adversarial Bandit Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

DropCompute: simple and more robust distributed synchronous training via compute variance reduction.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

DoCoFL: Downlink Compression for Cross-Device Federated Learning.
Proceedings of the International Conference on Machine Learning, 2023

Robust Linear Regression for General Feature Distribution.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Measuring Explainability and Trustworthiness of Power Quality Disturbances Classifiers Using XAI - Explainable Artificial Intelligence.
IEEE Trans. Ind. Informatics, 2022

Policy Gradient for Reinforcement Learning with General Utilities.
CoRR, 2022

Online Meta-Learning in Adversarial Multi-Armed Bandits.
CoRR, 2022

Efficient Policy Iteration for Robust Markov Decision Processes via Regularization.
CoRR, 2022

Adapting to Mixing Time in Stochastic Optimization with Markovian Data.
Proceedings of the International Conference on Machine Learning, 2022

UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees.
Proceedings of the International Conference on Machine Learning, 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

Learning Under Delayed Feedback: Implicitly Adapting to Gradient Delays.
CoRR, 2021

Generative Minimization Networks: Training GANs Without Competition.
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

Faster Neural Network Training with Approximate Tensor Operations.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fast Projection Onto Convex Smooth Constraints.
Proceedings of the 38th International Conference on Machine Learning, 2021

Asynchronous Distributed Learning : Adapting to Gradient Delays without Prior Knowledge.
Proceedings of the 38th International Conference on Machine Learning, 2021

LAGA: Lagged AllReduce with Gradient Accumulation for Minimal Idle Time.
Proceedings of the IEEE International Conference on Data Mining, 2021

2020
Multi-Player Bandits: The Adversarial Case.
J. Mach. Learn. Res., 2020

Adaptive Sampling for Stochastic Risk-Averse Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Convex Optimization in the Random Order Model.
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

A Domain Agnostic Measure for Monitoring and Evaluating GANs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Online Variance Reduction with Mixtures.
Proceedings of the 36th International Conference on Machine Learning, 2019

A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise.
Proceedings of the Conference on Learning Theory, 2019

Adaptive Input Estimation in Linear Dynamical Systems with Applications to Learning-from-Observations.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

Projection Free Online Learning over Smooth Sets.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Evaluating GANs via Duality.
CoRR, 2018

Unsupervised Imitation Learning.
CoRR, 2018

Online Adaptive Methods, Universality and Acceleration.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

An Online Learning Approach to Generative Adversarial Networks.
Proceedings of the 6th International Conference on Learning Representations, 2018

Online Variance Reduction for Stochastic Optimization.
Proceedings of the Conference On Learning Theory, 2018

Faster Rates for Convex-Concave Games.
Proceedings of the Conference On Learning Theory, 2018

2017
Online to Offline Conversions, Universality and Adaptive Minibatch Sizes.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Non-monotone Continuous DR-submodular Maximization: Structure and Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
The Power of Normalization: Faster Evasion of Saddle Points.
CoRR, 2016

k*-Nearest Neighbors: From Global to Local.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

On Graduated Optimization for Stochastic Non-Convex Problems.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Fast Rates for Exp-concave Empirical Risk Minimization.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Beyond Convexity: Stochastic Quasi-Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014
Bandit Convex Optimization: Towards Tight Bounds.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Logistic Regression: Tight Bounds for Stochastic and Online Optimization.
Proceedings of The 27th Conference on Learning Theory, 2014

2011
Unified Inter and Intra Options Learning Using Policy Gradient Methods.
Proceedings of the Recent Advances in Reinforcement Learning - 9th European Workshop, 2011


  Loading...