Wen Sun
79 papers · 2016–2025 · 10 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 ↓+13 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (80) π Conference Polyglot Β· Gold π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Gold π£ Hot Topic Early Bird
π
Conference Loyalist
(22)
π¬
Deep Specialist
(15)
π€
Dynamic Duo
(12)
π
Keyword Champion
(4)
π§
Keyword Pioneer
π
Triple Crown
π
Renaissance Researcher
(9)
π₯
Unstoppable Β· Silver
β‘
Prolific Year Β· Prolific
π
Conference Pioneer
π
Century Club Β· Silver
π
Trend Setter
ποΈ
Keyword Collector
(304)
Venues
Top co-authors
Research topics
Machine Learning
(62)
Reinforcement Learning
(42)
Learning Types Β· Machine Learning
(35)
Methods
(35)
Optimization & Theory
(33)
Artificial Intelligence
(29)
Core AI
(24)
Core Methods
(13)
Deep Learning
(12)
Learning Paradigms
(9)
Mathematics & Optimization
(6)
Applications
(6)
Learning Types Β· Deep Learning
(6)
Optimization
(6)
Natural Language Processing
(4)
Keywords
reinforcement learning
(14)
imitation learning
(11)
sample complexity
(11)
regret bound
(9)
function approximation
(8)
model-based reinforcement learning
(7)
representation learning
(7)
policy learning
(6)
offline reinforcement learning
(6)
continuous control
(5)
low-rank mdp
(5)
policy gradient
(5)
online learning
(5)
maximum likelihood estimation
(4)
partially observable markov decision process
(4)
policy optimization
(4)
sample efficiency
(4)
contextual bandit
(4)
linear mdp
(4)
linear quadratic regulator
(3)
Papers
A Reductions Approach to Risk-Sensitive Reinforcement Learning with Optimized Certainty Equivalents
ICML 2025
Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics
ICLR 2025
Convergence of Consistency Model with Multistep Sampling under General Data Assumptions
ICML 2025
Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization
ICLR 2025
Diffusing States and Matching Scores: A New Framework for Imitation Learning
ICLR 2025
Efficient Imitation under Misspecification
ICLR 2025
Model-based RL as a Minimalist Approach to Horizon-Free and Second-Order Bounds
ICLR 2025
On Speeding Up Language Model Evaluation
ICLR 2025
Regressing the Relative Future: Efficient Policy Optimization for Multi-turn RLHF
ICLR 2025
SDGO: Self-Discrimination-Guided Optimization for Consistent Safety in Large Language Models
EMNLP 2025
Adversarial Imitation Learning via Boosting
ICLR 2024
Efficient and Sharp Off-Policy Evaluation in Robust Markov Decision Processes
NeurIPS 2024
Faster Recalibration of an Online Predictor via Approachability
AISTATS 2024
Making RL with Preference-based Feedback Efficient via Randomization
ICLR 2024
More Benefits of Being Distributional: Second-Order Bounds for Reinforcement Learning
ICML 2024
Offline Data Enhanced On-Policy Policy Gradient with Provable Guarantees
ICLR 2024
Provable Offline Preference-Based Reinforcement Learning
ICLR 2024
Provable Reward-Agnostic Preference-Based Reinforcement Learning
ICLR 2024
Provably Efficient CVaR RL in Low-rank MDPs
ICLR 2024
REBEL: Reinforcement Learning via Regressing Relative Rewards
NeurIPS 2024
The Importance of Online Data: Understanding Preference Fine-tuning via Coverage
NeurIPS 2024
Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings
ICML 2023
Contextual Bandits and Imitation Learning with Preference-Based Active Queries
NeurIPS 2023
Distributional Offline Policy Evaluation with Predictive Error Guarantees
ICML 2023
Future-Dependent Value-Based Off-Policy Evaluation in POMDPs
NeurIPS 2023
Hybrid RL: Using both offline and online data can make RL efficient
ICLR 2023
Multi-task Representation Learning for Pure Exploration in Linear Bandits
ICML 2023
Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR
ICML 2023
Offline Minimax Soft-Q-learning Under Realizability and Partial Coverage
NeurIPS 2023
PAC Reinforcement Learning for Predictive State Representations
ICLR 2023
Provable Benefits of Representational Transfer in Reinforcement Learning
COLT 2023
Reward Finetuning for Faster and More Accurate Unsupervised Object Discovery
NeurIPS 2023
Selective Sampling and Imitation Learning via Online Regression
NeurIPS 2023
The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning
NeurIPS 2023
Corruption-robust Offline Reinforcement Learning
AISTATS 2022
Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning approach
ICML 2022
Hindsight is 20/20: Leveraging Past Traversals to Aid 3D Perception
ICLR 2022
Learning Bellman Complete Representations for Offline Policy Evaluation
ICML 2022
Learning To Detect Mobile Objects From LiDAR Scans Without Labels
CVPR 2022
Online No-regret Model-Based Meta RL for Personalized Navigation
L4DC 2022
On the Effectiveness of Iterative Learning Control
L4DC 2022
Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage
ICLR 2022
Provably Efficient Reinforcement Learning in Partially Observable Dynamical Systems
NeurIPS 2022
Representation Learning for Online and Offline RL in Low-rank MDPs
ICLR 2022
Transform2Act: Learning a Transform-and-Control Policy for Efficient Agent Design
ICLR 2022
Visual Named Entity Linking: A New Dataset and A Baseline
EMNLP 2022
Bilinear Classes: A Structural Framework for Provable Generalization in RL
ICML 2021
Corruption-robust exploration in episodic reinforcement learning
COLT 2021
Fairness of Exposure in Stochastic Bandits
ICML 2021
Mitigating Covariate Shift in Imitation Learning via Offline Data With Partial Coverage
NeurIPS 2021
MobILE: Model-Based Imitation Learning From Observation Alone
NeurIPS 2021
PC-MLP: Model-based Reinforcement Learning with Policy Cover Guided Exploration
ICML 2021
Robust Policy Gradient against Strong Data Corruption
ICML 2021
Constrained episodic reinforcement learning in concave-convex and knapsack settings
NeurIPS 2020
Disagreement-Regularized Imitation Learning
ICLR 2020
FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs
NeurIPS 2020
Information Theoretic Regret Bounds for Online Nonlinear Control
NeurIPS 2020
Learning the Linear Quadratic Regulator from Nonlinear Observations
NeurIPS 2020
Multi-Robot Collision Avoidance under Uncertainty with Probabilistic Safety Barrier Certificates
NeurIPS 2020
PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
NeurIPS 2020
Provably Efficient Model-based Policy Adaptation
ICML 2020
Contextual Memory Trees
ICML 2019
Contrasting Exploration in Parameter and Action Space: A Zeroth-Order Optimization Perspective
AISTATS 2019
Model-based RL in Contextual Decision Processes: PAC bounds and Exponential Improvements over Model-free Approaches
COLT 2019
Optimal Sketching for Kronecker Product Regression and Low Rank Approximation
NeurIPS 2019
Policy Poisoning in Batch Reinforcement Learning and Control
NeurIPS 2019
Provably Efficient Imitation Learning from Observation Alone
ICML 2019
Dual Policy Iteration
NeurIPS 2018
Recurrent Predictive State Policy Networks
ICML 2018
Sketching for Kronecker Product Regression and P-splines
AISTATS 2018
TRUNCATED HORIZON POLICY SEARCH: COMBINING REINFORCEMENT LEARNING & IMITATION LEARNING
ICLR 2018
Deeply AggreVaTeD: Differentiable Imitation Learning for Sequential Prediction
ICML 2017
Gradient Boosting on Stochastic Data Streams
AISTATS 2017
Predictive-State Decoders: Encoding the Future into Recurrent Networks
NeurIPS 2017
Safety-Aware Algorithms for Adversarial Contextual Bandit
ICML 2017
The Frequency Range of βThe Ling Six Soundsβ in Standard Chinese
Interspeech 2017
Inference Machines for Nonparametric Filter Learning
IJCAI 2016
Learning to Filter with Predictive State Inference Machines
ICML 2016
Online Bellman Residual and Temporal Difference Algorithms with Predictive Error Guarantees
IJCAI 2016