Ness Shroff
29 papers · 2017–2026 · 6 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 ↓+9 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (51) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π¬
Deep Specialist
(14)
π
Triple Crown
π€
Dynamic Duo
(10)
β‘
Prolific Year Β· Productive
π₯
Unstoppable Β· Silver
β
The Questioner
π
Century Club Β· Bronze
π
Renaissance Researcher
(6)
ποΈ
Keyword Collector
(131)
Top co-authors
Research topics
Machine Learning
(27)
Optimization & Theory
(22)
Learning Types
(16)
Artificial Intelligence
(10)
Reinforcement Learning
(8)
Core AI
(8)
Mathematics & Optimization
(7)
Optimization
(7)
Deep Learning
(6)
Methods
(6)
Computer Science
(2)
Applications
(2)
Architectures
(2)
Core Methods
(2)
Foundations
(2)
Keywords
regret bound
(11)
sample complexity
(4)
constrained markov decision process
(3)
non-stationary environment
(3)
catastrophic forgetting
(3)
continual learning
(3)
linear function approximation
(3)
generalization error
(3)
model-free reinforcement learning
(3)
upper confidence bound
(2)
learning theory
(2)
multi-armed bandit
(2)
diffusion model
(2)
online learning
(2)
reinforcement learning
(2)
stochastic optimization
(2)
neural tangent kernel
(2)
gradient descent
(2)
active learning
(2)
double descent
(2)
Papers
Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries
UAI 2026
Broadening Target Distributions for Accelerated Diffusion Models via a Novel Analysis Approach
ICLR 2025
How to Find the Exact Pareto Front for Multi-Objective MDPs?
ICLR 2025
Provably Efficient RL for Linear MDPs under Instantaneous Safety Constraints in Non-Convex Feature Spaces
ICML 2025
Theory on Mixture-of-Experts in Continual Learning
ICLR 2025
Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers
ICLR 2025
Unlocking the Power of Rehearsal in Continual Learning: A Theoretical Perspective
ICML 2025
Achieving Fairness in Multi-Agent MDP Using Reinforcement Learning
ICLR 2024
Achieving Sample and Computational Efficient Reinforcement Learning by Action Space Reduction via Grouping
ICLR 2024
Towards Achieving Sub-linear Regret and Hard Constraint Violation in Model-free RL
AISTATS 2024
Achieving Sub-linear Regret in Infinite Horizon Average Reward Constrained MDP with Linear Function Approximation
ICLR 2023
A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints
ICML 2023
Near-Optimal Adversarial Reinforcement Learning with Switching Costs
ICLR 2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions
NeurIPS 2023
Provably Efficient Model-Free Algorithms for Non-stationary CMDPs
AISTATS 2023
Theoretical Characterization of the Generalization Performance of Overfitted Meta-Learning
ICLR 2023
Theory on Forgetting and Generalization of Continual Learning
ICML 2023
On the Generalization Power of the Overfitted Three-Layer Neural Tangent Kernel Model
NeurIPS 2022
Provably Efficient Model-Free Constrained RL with Linear Function Approximation
NeurIPS 2022
Weighted Gaussian Process Bandits for Non-stationary Environments
AISTATS 2022
On the Generalization Power of Overfitted Two-Layer Neural Tangent Kernel Models
ICML 2021
Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons
NeurIPS 2021
The Sample Complexity of Best-k Items Selection from Pairwise Comparisons
ICML 2020
Computation Efficient Coded Linear Transform
AISTATS 2019
Data Poisoning Attacks on Stochastic Bandits
ICML 2019
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
NeurIPS 2019
Coded Sparse Matrix Multiplication
ICML 2018
UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits
IJCAI 2018
A New Alternating Direction Method for Linear Programming
NeurIPS 2017