🎉 【动态规划算法题】- 斐波那契类型
Leecode 70. 爬楼梯、509. 斐波那契数、1137. 第 N 个泰波那契数、746. 使用最小花费爬楼梯、198. 打家劫舍、740. 删除并获得点数
I have completed a Bachelor’s degree in Mathematics and am now pursuing a second Bachelor degree in Computer Science at the Beijing Institute of Technology.
My core research interest is centered on Markov Decision Process (MDP) and Deep Reinforcement Learning (DRL). My work primarily spans two key areas:
I am passionate about developing methods that are both theoretically rigorous and practically applicable. I am currently seeking graduate opportunities (M.S. and Ph.D.) in related fields and welcome opportunities for academic collaboration.
B.S. in Computer Science and Technology
Beijing Institute of Technology
B.S. in Mathematics and Applied Mathematics
Beijing Institute of Technology
My research work centers on applying Markov Decision Processes (MDP) and Deep Reinforcement Learning (DRL) to complex decision-making and algorithmic improvement.
As a research assistant in Professor Li Xin’s Reinforcement Learning Group, I focus on developing advanced DRL algorithms, including improving model efficiency and generalization through Bisimulation Metrics and robust state representation learning.
In collaboration with Professor Qingan Qiu, I address reliability-based engineering decision-making under uncertainty. This work has resulted in a first-author publication, with ongoing efforts focused on extending the MDP framework using RL.
I am passionate about advancing methods that are both theoretically sound and practically applicable to real-world problems. I welcome opportunities for academic collaboration. 🤝
Leecode 70. 爬楼梯、509. 斐波那契数、1137. 第 N 个泰波那契数、746. 使用最小花费爬楼梯、198. 打家劫舍、740. 删除并获得点数