Stochastic Shortest Path with Sparse Adversarial Costs
–Neural Information Processing Systems
We study the adversarial Stochastic Shortest Path (SSP) problem with sparse costs under full-information feedback. In the known transition setting, existing bounds based on Online Mirror Descent (OMD) with negative-entropy regularization scale with?
Neural Information Processing Systems
Jun-22-2026, 03:31:21 GMT
- Country:
- Europe > United Kingdom (0.28)
- Genre:
- Research Report > Experimental Study (1.00)
- Industry:
- Education > Educational Setting (0.46)
- Technology: