default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiyu Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Na Su
, Haojin Jia, Liyu Chen, Jiayou Wang, Jie Wang, Youmin Song:
Passive Vision Detection of Torch Pose in Swing Arc Narrow Gap Welding. Sensors 24(15): 4996 (2024)- [c21]Zishun Yu, Yunzhe Tao, Liyu Chen, Tao Sun, Hongxia Yang:
B-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis. ICLR 2024 - [i20]Yufeng Zhang, Liyu Chen, Boyi Liu, Yingxiang Yang, Qiwen Cui, Yunzhe Tao, Hongxia Yang:
(N, K)-Puzzle: A Cost-Efficient Testbed for Benchmarking Reinforcement Learning Algorithms in Generative Language Model. CoRR abs/2403.07191 (2024) - [i19]Liyu Chen, Huaao Tang, Yi Wen, Hanting Chen, Wei Li, Junchao Liu, Jie Hu:
Collaboration of Teachers for Semi-supervised Object Detection. CoRR abs/2405.13374 (2024) - [i18]Kun Cheng, Lei Yu, Zhijun Tu, Xiao He, Liyu Chen, Yong Guo, Mingrui Zhu, Nannan Wang, Xinbo Gao, Jie Hu:
Effective Diffusion Transformer Architecture for Image Super-Resolution. CoRR abs/2409.19589 (2024) - [i17]Xuwu Wang, Qiwen Cui, Yunzhe Tao, Yiran Wang, Ziwei Chai, Xiaotian Han, Boyi Liu, Jianbo Yuan, Jing Su, Guoyin Wang, Tingkai Liu, Liyu Chen, Tianyi Liu, Tao Sun, Yufeng Zhang, Sirui Zheng, Quanzeng You, Yang Yang, Hongxia Yang:
BabelBench: An Omni Benchmark for Code-Driven Analysis of Multimodal and Multistructured Data. CoRR abs/2410.00773 (2024) - [i16]Shenao Zhang, Zhihan Liu, Boyi Liu, Yufeng Zhang, Yingxiang Yang, Yongfei Liu, Liyu Chen, Tao Sun, Zhaoran Wang:
Reward-Augmented Data Enhances Direct Preference Alignment of LLMs. CoRR abs/2410.08067 (2024) - 2023
- [j1]Wei Li, Meng Tong, Haotian Lei, Liyu Chen:
Comparison of different taxation models on cross-border supply chain decisions: Considering disruption forecast and cost differences. Comput. Ind. Eng. 185: 109630 (2023) - [c20]Liyu Chen, Andrea Tirinzoni, Matteo Pirotta, Alessandro Lazaric:
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path. ALT 2023: 310-357 - [c19]Fan Zhang, Liyu Chen, Xiao Tan, Yang Li, Yu Duan:
Research on sports injury recovery detection based on infrared thermography. ICDLT 2023: 15-20 - [c18]Fan Zhang, Xiao Tan, Liyu Chen, Yang Li, Yu Duan:
Optimal control system for safety angle of human ankle joint during sports training. ICDLT 2023: 65-70 - [c17]Fan Zhang, Yang Li, Yu Duan, Liyu Chen, Xiao Tan:
Research on MEMS sensor-based police physical fitness assistance training system. ICDTE 2023: 78-83 - [c16]Liyu Chen, Andrea Tirinzoni, Alessandro Lazaric, Matteo Pirotta:
Layered State Discovery for Incremental Autonomous Exploration. ICML 2023: 4953-5001 - [c15]Mehdi Jafarnia-Jahromi, Liyu Chen, Rahul Jain, Haipeng Luo:
Posterior sampling-based online learning for the stochastic shortest path model. UAI 2023: 922-931 - [i15]Liyu Chen, Andrea Tirinzoni, Alessandro Lazaric, Matteo Pirotta:
Layered State Discovery for Incremental Autonomous Exploration. CoRR abs/2302.03789 (2023) - [i14]Zishun Yu, Yunzhe Tao, Liyu Chen, Tao Sun, Hongxia Yang:
B-Coder: Value-Based Deep Reinforcement Learning for Program Synthesis. CoRR abs/2310.03173 (2023) - 2022
- [c14]Sébastien M. R. Arnold, Pierre L'Ecuyer, Liyu Chen, Yi-Fan Chen, Fei Sha:
Policy Learning and Evaluation with Randomized Quasi-Monte Carlo. AISTATS 2022: 1041-1061 - [c13]Liyu Chen, Haipeng Luo, Aviv Rosenberg:
Policy Optimization for Stochastic Shortest Path. COLT 2022: 982-1046 - [c12]Liyu Chen, Rahul Jain, Haipeng Luo:
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP. ICML 2022: 3204-3245 - [c11]Liyu Chen, Rahul Jain, Haipeng Luo:
Learning Infinite-horizon Average-reward Markov Decision Process with Constraints. ICML 2022: 3246-3270 - [c10]Yan Dai, Haipeng Luo, Liyu Chen:
Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback. NeurIPS 2022 - [c9]Liyu Chen, Haipeng Luo:
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments. NeurIPS 2022 - [i13]Liyu Chen, Rahul Jain, Haipeng Luo:
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints. CoRR abs/2202.00150 (2022) - [i12]Liyu Chen, Haipeng Luo, Aviv Rosenberg:
Policy Optimization for Stochastic Shortest Path. CoRR abs/2202.03334 (2022) - [i11]Sébastien M. R. Arnold, Pierre L'Ecuyer, Liyu Chen, Yi-Fan Chen, Fei Sha:
Policy Learning and Evaluation with Randomized Quasi-Monte Carlo. CoRR abs/2202.07808 (2022) - [i10]Liyu Chen, Haipeng Luo:
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments. CoRR abs/2205.13044 (2022) - [i9]Yan Dai, Haipeng Luo, Liyu Chen:
Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback. CoRR abs/2205.13451 (2022) - [i8]Liyu Chen, Andrea Tirinzoni, Matteo Pirotta, Alessandro Lazaric:
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path. CoRR abs/2210.04946 (2022) - 2021
- [c8]Liyu Chen, Haipeng Luo, Chen-Yu Wei:
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition. COLT 2021: 1180-1215 - [c7]Liyu Chen, Haipeng Luo, Chen-Yu Wei:
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications. COLT 2021: 1216-1259 - [c6]Liyu Chen, Haipeng Luo:
Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case. ICML 2021: 1651-1660 - [c5]Baoming Yan, Qingheng Zhang, Liyu Chen, Lin Wang, Leihao Pei, Jiang Yang, Enyun Yu, Xiaobo Li, Binqiang Zhao:
Learning Hierarchical Visual-Semantic Representation with Phrase Alignment. ICMR 2021: 349-357 - [c4]Liyu Chen, Mehdi Jafarnia-Jahromi, Rahul Jain, Haipeng Luo:
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path. NeurIPS 2021: 10849-10861 - [i7]Liyu Chen, Haipeng Luo, Chen-Yu Wei:
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications. CoRR abs/2102.01046 (2021) - [i6]Liyu Chen, Haipeng Luo:
Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case. CoRR abs/2102.05284 (2021) - [i5]Mehdi Jafarnia-Jahromi, Liyu Chen, Rahul Jain, Haipeng Luo:
Online Learning for Stochastic Shortest Path Model via Posterior Sampling. CoRR abs/2106.05335 (2021) - [i4]Liyu Chen, Mehdi Jafarnia-Jahromi, Rahul Jain, Haipeng Luo:
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path. CoRR abs/2106.08377 (2021) - [i3]Liyu Chen, Rahul Jain, Haipeng Luo:
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP. CoRR abs/2112.09859 (2021) - 2020
- [i2]Liyu Chen, Haipeng Luo, Chen-Yu Wei:
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition. CoRR abs/2012.04053 (2020)
2010 – 2019
- 2019
- [c3]Zhiyun Lu, Liyu Chen, Chao-Kai Chiang, Fei Sha:
Hyper-parameter Tuning under a Budget Constraint. IJCAI 2019: 5744-5750 - [i1]Hexiang Hu, Liyu Chen, Boqing Gong, Fei Sha:
Synthesized Policies for Transfer and Adaptation across Tasks and Environments. CoRR abs/1904.03276 (2019) - 2018
- [c2]Yuqi Wang, Yarnan Li, Fusheng Yang, Xiaoling Zhao, Xiaolong Han, Binxia Zhao, Liyu Chen, Zhen Wu, Xiaoxun Ma:
Reform and Innovation of Multiform Practical Teaching in Chemical Engineering. ICKII 2018: 355-358 - [c1]Hexiang Hu, Liyu Chen, Boqing Gong, Fei Sha:
Synthesize Policies for Transfer and Adaptation across Tasks and Environments. NeurIPS 2018: 1176-1185
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
