8 citations · 15 across the 7 of their papers we have counts for
7 papers
MetaDiffuser: Diffusion Model as Conditional Planner for Offline Meta-RL
Fei Ni, Jianye Hao, Yao Mu +4
Recently, diffusion model shines as a promising backbone for the sequence modeling paradigm in offline reinforcement learning(RL). However, these works mostly lack the generalizati…
AdaptDiffuser: Diffusion Models as Adaptive Self-evolving Planners
Zhixuan Liang, Yao Mu, Mingyu Ding +3
Diffusion models have demonstrated their powerful generative capability in many tasks, with great potential to serve as a paradigm for offline reinforcement learning. However, the…
Decomposed Mutual Information Optimization for Generalized Context in Meta-Reinforcement Learning
Yao Mu, Yuzheng Zhuang, Fei Ni +4
Adapting to the changes in transition dynamics is essential in robotic applications. By learning a conditional policy with a compact context, context-aware meta-reinforcement learn…
EUCLID: Towards Efficient Unsupervised Reinforcement Learning with Multi-choice Dynamics Model
Yifu Yuan, Jianye Hao, Fei Ni +6
Unsupervised reinforcement learning (URL) poses a promising paradigm to learn useful behaviors in a task-agnostic environment without the guidance of extrinsic rewards to facilitat…
A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry
Jiahui Duan, Xialiang Tong, Fei Ni +3
The bin packing problem exists widely in real logistic scenarios (e.g., packing pipeline, express delivery), with its goal to improve the packing efficiency and reduce the transpor…
Adaptive Simulated Annealing with Greedy Search for the Circle Bin Packing Problem
Yong Yuan, Kevin Tole, Fei Ni +3
We introduce a new bin packing problem, termed the circle bin packing problem with circular items (CBPP-CI). The problem involves packing all the circular items into multiple ident…
Adaptive Large Neighborhood Search for Circle Bin Packing Problem
Kun He, Kevin Tole, Fei Ni +2
We address a new variant of packing problem called the circle bin packing problem (CBPP), which is to find a dense packing of circle items to multiple square bins so as to minimize…