Shie Mannor
143 papers · 2003–2025 · 15 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 ↓+17 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Gold πΊοΈ Taxonomy Completionist (123) π Conference Polyglot Β· Gold π Academic Marathon Β· Ultra π£ Hot Topic Early Bird
π±
Topic Pioneer
π
Conference Loyalist
(47)
π
Grand Slam
π
Triple Crown
π¬
Deep Specialist
(43)
π
Keyword Trendsetter Combo
(29)
π€
Dynamic Duo
(19)
π
Keyword Champion
(10)
π§
Keyword Pioneer
ποΈ
Keyword Collector
(586)
β
The Questioner
(2)
π
Trend Setter
β‘
Prolific Year Β· Prolific
π
Conference Pioneer
π
Century Club Β· Gold
π
Renaissance Researcher
(7)
π₯
Unstoppable Β· Gold
Venues
Top co-authors
Research topics
Machine Learning
(117)
Optimization & Theory
(87)
Reinforcement Learning
(81)
Learning Types Β· Machine Learning
(69)
Methods
(69)
Artificial Intelligence
(51)
Core AI
(46)
Mathematics & Optimization
(38)
Optimization
(35)
Applications
(27)
Core Methods
(27)
Deep Learning
(17)
Learning Types Β· Deep Learning
(12)
Application Areas
(9)
Learning Paradigms
(5)
Keywords
reinforcement learning
(33)
online learning
(25)
regret bound
(24)
multi-armed bandit
(15)
policy gradient
(14)
markov decision process
(14)
robust optimization
(10)
stochastic optimization
(8)
policy optimization
(8)
regret minimization
(8)
sample complexity
(7)
model-based reinforcement learning
(7)
contextual bandit
(7)
policy learning
(6)
policy iteration
(6)
value function
(6)
convergence rate
(6)
deep reinforcement learning
(5)
temporal difference learning
(5)
sample efficiency
(5)
Papers
A Classification View on Meta Learning Bandits
ICML 2025
Global Convergence of Policy Gradient in Average Reward MDPs
ICLR 2025
On Bits and Bandits: Quantifying the Regret-Information Trade-off
ICLR 2025
Policy Gradient with Tree Expansion
ICML 2025
Reinforcement Learning with Segment Feedback
ICML 2025
RL-RC-DoT: A Block-level RL agent for Task-Aware Video Compression
CVPR 2025
Bring Your Own (Non-Robust) Algorithm to Solve Robust MDPs by Estimating The Worst Kernel
ICML 2024
Efficient Value Iteration for s-rectangular Robust Markov Decision Processes
ICML 2024
Exploration-Driven Policy Optimization in RLHF: Theoretical Insights on Efficient Data Utilization
ICML 2024
Improving Token-Based World Models with Parallel Observation Prediction
ICML 2024
Prospective Side Information for Latent MDPs
ICML 2024
RL in Latent MDPs is Tractable: Online Guarantees via Off-Policy Evaluation
NeurIPS 2024
Sobolev Space Regularised Pre Density Models
ICML 2024
Solving Non-rectangular Reward-Robust MDPs via Frequency Regularization
AAAI 2024
Tree Search-Based Policy Optimization under Stochastic Execution Delay
ICLR 2024
Individualized Dosing Dynamics via Neural Eigen Decomposition
NeurIPS 2023
Learning Hidden Markov Models When the Locations of Missing Observations are Unknown
ICML 2023
Learning to Initiate and Reason in Event-Driven Cascading Processes
ICML 2023
Optimization or Architecture: How to Hack Kalman Filtering
NeurIPS 2023
Planning and Learning with Adaptive Lookahead
AAAI 2023
Policy Gradient for Rectangular Robust Markov Decision Processes
NeurIPS 2023
PPG Reloaded: An Empirical Study on What Matters in Phasic Policy Gradient
ICML 2023
Representation-Driven Reinforcement Learning
ICML 2023
Reward-Mixing MDPs with Few Latent Contexts are Learnable
ICML 2023
Train Hard, Fight Easy: Robust Meta Reinforcement Learning
NeurIPS 2023
Actor-Critic based Improper Reinforcement Learning
ICML 2022
Analysis of Stochastic Processes through Replay Buffers
ICML 2022
Coordinated Attacks against Contextual Bandits: Fundamental Limits and Defense Mechanisms
ICML 2022
DiffStack: A Differentiable and Modular Control Stack for Autonomous Vehicles
CoRL 2022
Efficient Risk-Averse Reinforcement Learning
NeurIPS 2022
Finite Sample Analysis Of Dynamic Regression Parameter Learning
NeurIPS 2022
Locality Matters: A Scalable Value Decomposition Approach for Cooperative Multi-Agent Reinforcement Learning
AAAI 2022
On Covariate Shift of Latent Confounders in Imitation and Reinforcement Learning
ICLR 2022
Online Apprenticeship Learning
AAAI 2022
Optimizing Tensor Network Contraction Using Reinforcement Learning
ICML 2022
Reinforcement Learning for Datacenter Congestion Control
AAAI 2022
Reinforcement Learning with a Terminator
NeurIPS 2022
The Geometry of Robust Value Functions
ICML 2022
Tractable Optimality in Episodic Latent MABs
NeurIPS 2022
Uncertainty Estimation Using Riemannian Model Dynamics for Offline Reinforcement Learning
NeurIPS 2022
Acting in Delayed Environments with Non-Stationary Markov Policies
ICLR 2021
Action redundancy in reinforcement learning
UAI 2021
Bandits with partially observable confounded data
UAI 2021
Confidence-Budget Matching for Sequential Budgeted Learning
ICML 2021
Controlling Graph Dynamics with Reinforcement Learning and Graph Neural Networks
ICML 2021
Detecting Rewards Deterioration in Episodic Reinforcement Learning
ICML 2021
Improve Agents without Retraining: Parallel Tree Search with Off-Policy Correction
NeurIPS 2021
Known unknowns: Learning novel concepts using reasoning-by-elimination
UAI 2021
Lenient Regret for Multi-Armed Bandits
AAAI 2021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching
ICML 2021
Optimizing Memory Placement using Evolutionary Graph Reinforcement Learning
ICLR 2021
Over-the-Air Adversarial Flickering Attacks Against Video Recognition Networks
CVPR 2021
Reinforcement Learning in Reward-Mixing MDPs
NeurIPS 2021
Reinforcement Learning with Trajectory Feedback
AAAI 2021
RL for Latent MDPs: Regret Guarantees and a Lower Bound
NeurIPS 2021
Robust Value Iteration for Continuous Control Tasks
RSS 2021
Sim and Real: Better Together
NeurIPS 2021
Twice regularized MDPs and the equivalence between robustness and regularization
NeurIPS 2021
Value Iteration in Continuous Actions, States and Time
ICML 2021
Adaptive Trust Region Policy Optimization: Global Convergence and Faster Rates for Regularized MDPs
AAAI 2020
An adaptive stochastic optimization algorithm for resource allocation
ALT 2020
Off-Policy Evaluation in Partially Observable Environments
AAAI 2020
Online Planning with Lookahead Policies
NeurIPS 2020
Optimistic Policy Optimization with Bandit Feedback
ICML 2020
Scalable Detection of Offensive and Non-compliant Content / Logo in Product Images
WACV 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits
COLT 2020
Topic Modeling via Full Dependence Mixtures
ICML 2020
A Bayesian Approach to Robust Reinforcement Learning
UAI 2019
Action Robust Reinforcement Learning and Applications in Continuous Control
ICML 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem
COLT 2019
Distributional Policy Optimization: An Alternative Approach for Continuous Control
NeurIPS 2019
Exploration Conscious Reinforcement Learning Revisited
ICML 2019
How to Combine Tree-Search Methods in Reinforcement Learning
AAAI 2019
Nonlinear Distributional Gradient Temporal-Difference Learning
ICML 2019
On-Line Learning of Linear Dynamical Systems: Exponential Forgetting in Kalman Filters
AAAI 2019
Reward Constrained Policy Optimization
ICLR 2019
The Natural Language of Actions
ICML 2019
Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
NeurIPS 2019
Value Propagation for Decentralized Networked Deep Multi-agent Reinforcement Learning
NeurIPS 2019
A General Approach to Multi-Armed Bandits Under Risk Criteria
COLT 2018
Beyond the One-Step Greedy Approach in Reinforcement Learning
ICML 2018
Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning
COLT 2018
Learn What Not to Learn: Action Elimination with Deep Reinforcement Learning
NeurIPS 2018
Multiple-Step Greedy Policies in Approximate and Online Reinforcement Learning
NeurIPS 2018
Approximate Value Iteration with Temporally Extended Actions (Extended Abstract)
IJCAI 2017
Consistent On-Line Off-Policy Evaluation
ICML 2017
End-to-End Differentiable Adversarial Imitation Learning
ICML 2017
Ignoring Is a Bliss: Learning with Large Noise Through Reweighting-Minimization
COLT 2017
Multi-objective Bandits: Optimizing the Generalized Gini Index
ICML 2017
Rotting Bandits
NeurIPS 2017
Shallow Updates for Deep Reinforcement Learning
NeurIPS 2017
Adaptive Skills Adaptive Partitions (ASAP)
NeurIPS 2016
Graying the black box: Understanding DQNs
ICML 2016
Heteroscedastic Sequences: Beyond Gaussianity
ICML 2016
Hierarchical Decision Making In Electricity Grid Management
ICML 2016
Learning the Variance of the Reward-To-Go
JMLR 2016
Regularized Policy Iteration with Nonparametric Function Spaces
JMLR 2016
Community Detection via Measure Space Embedding
NeurIPS 2015
Dynamic Sensing: Better Classification under Acquisition Constraints
ICML 2015
Off-policy Model-based Learning under Unknown Factored Dynamics
ICML 2015
Online Learning for Adversaries with Memory: Price of Past Mistakes
NeurIPS 2015
Policy Gradient for Coherent Risk Measures
NeurIPS 2015
Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approach
NeurIPS 2015
Sensor Selection for Crowdsensing Dynamical Systems
AISTATS 2015
Thompson Sampling for Learning Parameterized Markov Decision Processes
COLT 2015
Approachability in unknown games: Online learning meets multi-objective optimization
COLT 2014
Concept Drift Detection Through Resampling
ICML 2014
How hard is my MDP?" The distribution-norm to the rescue"
NeurIPS 2014
Latent Bandits.
ICML 2014
Robust Logistic Regression and Classification
NeurIPS 2014
Scaling Up Approximate Value Iteration with Options: Better Policies with Fewer Iterations
ICML 2014
Scaling Up Robust MDPs using Function Approximation
ICML 2014
Set-Valued Approachability and Online Learning with Partial Monitoring
JMLR 2014
Thompson Sampling for Complex Online Problems
ICML 2014
Time-Regularized Interrupting Options (TRIO)
ICML 2014
Approachability, fast and slow
COLT 2013
Learning Multiple Models via Regularized Weighting
NeurIPS 2013
Online Learning for Time Series Prediction
COLT 2013
Online PCA for Contaminated Data
NeurIPS 2013
Opportunistic Strategies for Generalized No-Regret Problems
COLT 2013
Reinforcement Learning in Robust Markov Decision Processes
NeurIPS 2013
Robust Sparse Regression under Adversarial Corruption
ICML 2013
Temporal Difference Methods for the Variance of the Reward To Go
ICML 2013
More Is Better: Large Scale Partially-supervised Sentiment Classification
ACML 2012
Statistical Optimization in High Dimensions
AISTATS 2012
The Perturbed Variation
NeurIPS 2012
Committing Bandits
NeurIPS 2011
Does an Efficient Calibrated Forecasting Strategy Exist?
COLT 2011
From Bandits to Experts: On the Value of Side-Observations
NeurIPS 2011
Robust approachability and regret minimization in games with partial monitoring
COLT 2011
The Sample Complexity of Dictionary Learning
COLT 2011
The Sample Complexity of Dictionary Learning
JMLR 2011
Distributionally Robust Markov Decision Processes
NeurIPS 2010
Online Classification with Specificity Constraints
NeurIPS 2010
Online Learning with Sample Path Constraints
JMLR 2009
Robustness and Regularization of Support Vector Machines
JMLR 2009
Regularized Policy Iteration
NeurIPS 2008
Robust Regression and Lasso
NeurIPS 2008
Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems
JMLR 2006
The Robustness-Performance Tradeoff in Markov Decision Processes
NeurIPS 2006
A Geometric Approach to Multi-Criterion Reinforcement Learning
JMLR 2004
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
JMLR 2004
Greedy Algorithms for Classification -- Consistency, Convergence Rates, and Adaptivity
JMLR 2003