Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon.
Nan JiangAlekh AgarwalPublished in: COLT (2018)
Keyphrases
- sample complexity
- lower bound
- planning horizon
- upper bound
- vc dimension
- lot sizing
- total cost
- supply chain
- production planning
- pac learning
- lead time
- expected cost
- optimal solution
- objective function
- theoretical analysis
- service level
- production system
- random variables
- concept class
- concept classes
- np hard
- worst case
- generalization error
- training examples
- learning algorithm
- production cost
- special case
- learning problems
- cost function
- average case
- sample size
- supervised learning
- active learning
- multistage