Don’t Follow Reinforcement Learning Blindly: Lower Sample Complexity of Learning Optimal Inventory Control Policies with Fixed Ordering Cost

We study the sample complexity of offline learning for a class of structured Markov decision processes (MDPs) describing the inventory control system with fixed ordering cost/setup cost, a fundamental problem in supply chains. We find that a naive plug-in sampling-based approach applied to the inventory MDPs leads to strictly lower sample complexity bounds compared to the optimal bounds recently obtained for the general MDPs. More specifically, in the infinite-horizon discounted cost setting, we obtain an O ~ ( min { ( S ¯ − s _ ) 2 ( 1 − γ ) 2 ϵ 2 , 1 ( 1 − γ ) 4 ϵ 2 } ) sample complexity bound, where ( S ¯ − s _ ) 2 corresponds to the number of state-action pairs in a generic MDP with state space S and action space A . As such, O ~ ( ( S ¯ − s _ ) 2 ( 1 − γ ) 2 ϵ 2 ) improves on the optimal generic reinforcement learning (RL) bound Θ ~ ( ( S ¯ − s _ ) 2 ( 1 − γ ) 3 ϵ 2 ) (when directly applying Θ ~ ( | S | | A | ( 1 − γ ) 3 ϵ 2 ) here) by a factor of ( 1 − γ ) − 1 , and O ~ ( 1 ( 1 − γ ) 4 ϵ 2 ) is able to completely remove the dependence on state and action cardinality. In the infinite-horizon average cost setting, we obtain an O ~ ( ( S ¯ − s _ ) 2 ϵ 2 ) bound, improving on the generic optimal RL bound Θ ~ ( ( S ¯ − s _ ) 2 t m i x ϵ 2 ) (when directly applying Θ ~ ( | S | | A | t m i x ϵ 2 ) here) by a factor of t m i x , and hence removing the mixing time dependence. By carefully leveraging the structural properties of the inventory dynamics in various settings, we are able to improve on those “best-possible” bounds developed in the RL literature. Our results demonstrate the drawbacks one could face by blindly following RL algorithms and the necessity of designing sample efficient algorithms that properly incorporate the special structures of the inventory systems.