pith. sign in

Liyu Chen

Identifiers

  • name variant Liyu Chen 0.60 · backfill

Papers (22)

  1. TACLR: A Scalable and Efficient Retrieval-based Method for Industrial Product Attribute Value Identification cs.CL · 2025 · author #6
  2. FullStack Bench: Evaluating LLMs as Full Stack Coders cs.AI · 2024 · author #5
  3. Reward-Augmented Data Enhances Direct Preference Alignment of LLMs cs.LG · 2024 · author #7
  4. BabelBench: An Omni Benchmark for Code-Driven Analysis of Multimodal and Multistructured Data cs.AI · 2024 · author #12
  5. Effective Diffusion Transformer Architecture for Image Super-Resolution cs.CV · 2024 · author #5
  6. Collaboration of Teachers for Semi-supervised Object Detection cs.CV · 2024 · author #1
  7. $\mathbf{(N,K)}$-Puzzle: A Cost-Efficient Testbed for Benchmarking Reinforcement Learning Algorithms in Generative Language Model cs.LG · 2024 · author #2
  8. $\mathcal{B}$-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis cs.CL · 2023 · author #3
  9. Layered State Discovery for Incremental Autonomous Exploration cs.LG · 2023 · author #1
  10. Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path cs.LG · 2022 · author #1
  11. Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback cs.LG · 2022 · author #3
  12. Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments cs.LG · 2022 · author #1
  13. Policy Learning and Evaluation with Randomized Quasi-Monte Carlo cs.LG · 2022 · author #3
  14. Policy Optimization for Stochastic Shortest Path cs.LG · 2022 · author #1
  15. Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints cs.LG · 2022 · author #1
  16. Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP cs.LG · 2021 · author #1
  17. Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path cs.LG · 2021 · author #1
  18. Online Learning for Stochastic Shortest Path Model via Posterior Sampling cs.LG · 2021 · author #2
  19. Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case cs.LG · 2021 · author #1
  20. Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications cs.LG · 2021 · author #1
  21. Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition cs.LG · 2020 · author #1
  22. Synthesized Policies for Transfer and Adaptation across Tasks and Environments cs.LG · 2019 · author #2

Mentions

  • 2501.03835 #6 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2412.00535 #5 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2410.08067 #7 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2410.00773 #12 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2409.19589 #5 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2405.13374 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2310.03173 #3 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2403.07191 #2 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2302.03789 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2210.04946 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2205.13451 #3 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2205.13044 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2202.07808 #3 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2202.03334 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2202.00150 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2112.09859 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2106.08377 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2102.01046 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2012.04053 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2102.05284 #1 · arxiv_oai · confidence 0.70 Liyu Chen
  • 2106.05335 #2 · arxiv_oai · confidence 0.70 Liyu Chen
  • 1904.03276 #2 · arxiv_oai · confidence 0.70 Liyu Chen

Frequent Coauthors