Sharan Vaswani
20 papers · 2017–2026 · 5 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 ↓+5 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌍 Conference Polyglot · Silver 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (29)
🏆
Keyword Champion
(2)
🔬
Deep Specialist
(11)
🗃️
Keyword Collector
(89)
💎
Century Club · Bronze
🔥
Unstoppable · Bronze
Venues
Top co-authors
Research topics
Machine Learning
(17)
Optimization & Theory · Machine Learning
(15)
Mathematics & Optimization
(7)
Reinforcement Learning
(7)
Methods
(7)
Optimization
(7)
Learning Types · Machine Learning
(6)
Artificial Intelligence
(4)
Deep Learning
(4)
Core AI
(4)
Optimization & Theory · Deep Learning
(3)
Architectures
(1)
Bayesian & Probabilistic
(1)
Learning Types · Deep Learning
(1)
Keywords
stochastic gradient descent
(5)
policy optimization
(4)
multi-armed bandit
(4)
convergence rate
(3)
online learning
(3)
regret bound
(3)
sample complexity
(2)
social network
(2)
bandit algorithm
(2)
generative model
(2)
learning rate
(2)
contextual bandit
(2)
exploration-exploitation tradeoff
(2)
reinforcement learning
(2)
linear function approximation
(2)
thompson sampling
(2)
constrained markov decision process
(2)
gradient descent
(2)
influence maximization
(2)
overparameterized model
(2)
Papers
Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
ALT 2026
Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
ICML 2025
Fast Convergence of Softmax Policy Mirror Ascent
AISTATS 2025
From Inverse Optimization to Feasibility to ERM
ICML 2024
Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates
NeurIPS 2024
Decision-Aware Actor-Critic with Function Approximation and Theoretical Guarantees
NeurIPS 2023
Target-based Surrogates for Stochastic Optimization
ICML 2023
A general class of surrogate functions for stable and efficient reinforcement learning
AISTATS 2022
Near-Optimal Sample Complexity Bounds for Constrained MDPs
NeurIPS 2022
Towards Noise-adaptive, Problem-adaptive (Accelerated) Stochastic Gradient Descent
ICML 2022
Towards painless policy optimization for constrained MDPs
UAI 2022
Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence
AISTATS 2021
Fast and Furious Convergence: Stochastic Second Order Methods under Interpolation
AISTATS 2020
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems
AISTATS 2020
Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptron
AISTATS 2019
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits
ICML 2019
Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates
NeurIPS 2019
Horde of Bandits using Gaussian Markov Random Fields
AISTATS 2017
Model-Independent Online Learning for Influence Maximization
ICML 2017
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback
NeurIPS 2017