Liyu Chen
19 papers · 2018–2025 · 9 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 (29) π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π
Grand Slam
π€
Dynamic Duo
(10)
π
Keyword Champion
(8)
π
Renaissance Researcher
(5)
π₯
Unstoppable Β· Bronze
β‘
Prolific Year Β· Productive
π
Century Club Β· Bronze
π
Trend Setter
ποΈ
Keyword Collector
(79)
Top co-authors
Research topics
Machine Learning
(14)
Reinforcement Learning
(12)
Optimization & Theory
(12)
Methods
(11)
Learning Types
(7)
Artificial Intelligence
(6)
Mathematics & Optimization
(5)
Optimization
(5)
Core AI
(4)
Natural Language Processing
(2)
Applications
(2)
Learning Paradigms
(2)
Computer Vision
(1)
Deep Learning
(1)
Architectures
(1)
Keywords
stochastic shortest path
(8)
regret bound
(6)
reinforcement learning
(6)
bandit feedback
(4)
regret minimization
(3)
markov decision process
(3)
code generation
(2)
policy optimization
(2)
adversarial cost
(2)
sample complexity
(2)
online mirror descent
(2)
minimax optimal
(2)
posterior sampling
(1)
program synthesis
(1)
policy gradient
(1)
policy learning
(1)
transfer learning
(1)
adversarial learning
(1)
value function
(1)
preference alignment
(1)
Papers
Effective Diffusion Transformer Architecture for Image Super-Resolution
AAAI 2025
Reward-Augmented Data Enhances Direct Preference Alignment of LLMs
ICML 2025
Teaching Language Models to Critique via Reinforcement Learning
ICML 2025
B-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis
ICLR 2024
Layered State Discovery for Incremental Autonomous Exploration
ICML 2023
Posterior sampling-based online learning for the stochastic shortest path model
UAI 2023
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path
ALT 2023
Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback
NeurIPS 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
ICML 2022
Learning Infinite-horizon Average-reward Markov Decision Process with Constraints
ICML 2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments
NeurIPS 2022
Policy Learning and Evaluation with Randomized Quasi-Monte Carlo
AISTATS 2022
Policy Optimization for Stochastic Shortest Path
COLT 2022
Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case
ICML 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path
NeurIPS 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications
COLT 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition
COLT 2021
Hyper-parameter Tuning under a Budget Constraint
IJCAI 2019
Synthesized Policies for Transfer and Adaptation across Tasks and Environments
NeurIPS 2018