Documentdetail
ID kaart
oai:arXiv.org:2410.15257
Onderwerp
Computer Science - Machine Learnin... Computer Science - Data Structures... Mathematics - Optimization and Con...Auteur
Zhao, Hailiang Tang, Xueyan Chen, Peng Deng, ShuiguangCategorie
Computer Science
Jaar
2024
vermelding datum
23-10-2024
Trefwoorden
bahncard pfsum algorithm learning-augmentedBeschrijving
In this paper, we study learning-augmented algorithms for the Bahncard problem.
The Bahncard problem is a generalization of the ski-rental problem, where a traveler needs to irrevocably and repeatedly decide between a cheap short-term solution and an expensive long-term one with an unknown future.
Even though the problem is canonical, only a primal-dual-based learning-augmented algorithm was explicitly designed for it.
We develop a new learning-augmented algorithm, named PFSUM, that incorporates both history and short-term future to improve online decision making.
We derive the competitive ratio of PFSUM as a function of the prediction error and conduct extensive experiments to show that PFSUM outperforms the primal-dual-based algorithm.
;Comment: This paper has been accepted by the 38th Conference on Neural Information Processing Systems (NeurIPS 2024)
Zhao, Hailiang,Tang, Xueyan,Chen, Peng,Deng, Shuiguang, 2024, Learning-Augmented Algorithms for the Bahncard Problem
Choice Between Partial Trajectories: Disentangling Goals from Beliefs
agents models aligned based bootstrapped learning reward function model return choice choices partial
Adverse and serious adverse events incidence of pharmacological interventions for managing chronic and episodic migraine in adults: a systematic review
aes medications bta incidence migraine drugs disorders
