Kfir Levy
13 papers · 2014–2024 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Silver π Conference Polyglot Β· Bronze π Academic Marathon Β· Half πΊοΈ Taxonomy Completionist (26) π£ Hot Topic Early Bird
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(70)
Venues
Top co-authors
Research topics
Keywords
stochastic gradient descent
(5)
non-convex optimization
(3)
online learning
(3)
convex optimization
(3)
stochastic optimization
(2)
primal-dual method
(2)
online gradient descent
(2)
regret bound
(2)
online algorithm
(2)
empirical risk minimization
(1)
computational efficiency
(1)
constrained optimization
(1)
black-box optimization
(1)
nearest neighbor
(1)
policy gradient
(1)
exp-concave loss
(1)
logistic regression
(1)
reward function
(1)
online convex optimization
(1)
variance reduction
(1)
Papers
Solving Non-rectangular Reward-Robust MDPs via Frequency Regularization
AAAI 2024
UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees
ICML 2022
Faster Neural Network Training with Approximate Tensor Operations
NeurIPS 2021
Fast Projection Onto Convex Smooth Constraints
ICML 2021
STORM+: Fully Adaptive SGD with Recursive Momentum for Nonconvex Optimization
NeurIPS 2021
Online Convex Optimization in the Random Order Model
ICML 2020
Projection Free Online Learning over Smooth Sets
AISTATS 2019
Continuous DR-submodular Maximization: Structure and Algorithms
NeurIPS 2017
Online to Offline Conversions, Universality and Adaptive Minibatch Sizes
NeurIPS 2017
k*-Nearest Neighbors: From Global to Local
NeurIPS 2016
Beyond Convexity: Stochastic Quasi-Convex Optimization
NeurIPS 2015
Fast Rates for Exp-concave Empirical Risk Minimization
NeurIPS 2015
Bandit Convex Optimization: Towards Tight Bounds
NeurIPS 2014