Robust matroid bandit optimization against adversarial contamination

DOI10.1007/978-981-96-1090-7_27MaRDI QIDQ6970719zbMATH OpenFDO

Authors Youming Tao, Xiuzhen Cheng, Falko Dressler, Zhipeng Cai, Dongxiao Yu

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_27

zbMATH Keywords

combinatorial optimizationcontamination robustnessmatroidsmulti-armed bandits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Cites work

• A Minimum Delay Routing Algorithm Using Distributed Computation
• Agnostic estimation of mean and covariance
• Bandit algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Corruption-tolerant bandit learning
• Finite-time analysis of the multiarmed bandit problem
• From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• Learning from untrusted data
• Regret in online combinatorial optimization
• Robust covariance and scatter matrix estimation under Huber's contamination model
• Robust multivariate mean estimation: the optimality of trimmed mean

This page was built for publication: Robust matroid bandit optimization against adversarial contamination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970719)