Learning in structured MDPs with convex cost functions: improved regret bounds for inventory management (Q5095166)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Learning in structured MDPs with convex cost functions: improved regret bounds for inventory management |
scientific article; zbMATH DE number 7568773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning in structured MDPs with convex cost functions: improved regret bounds for inventory management |
scientific article; zbMATH DE number 7568773 |
Statements
Learning in Structured MDPs with Convex Cost Functions: Improved Regret Bounds for Inventory Management (English)
0 references
5 August 2022
0 references
inventory control problem
0 references
censored demand
0 references
reinforcement learning
0 references
online convex optimization
0 references
regret bounds
0 references
0 references
0 references
0.7644869089126587
0 references
0.7536147236824036
0 references
0.7308962941169739
0 references
0.7246220111846924
0 references
