Approximate Dynamic Programming with Bounds on Model Complexity and Sample Complexity: An Application to an Inventory Forecasting Problem