A Resilience Framework for Bi-Criteria Combinatorial Optimization with Bandit Feedback
📰 ArXiv cs.AI
arXiv:2503.12285v2 Announce Type: replace-cross Abstract: We study bi-criteria combinatorial optimization under noisy function evaluations. While resilience and black-box offline-to-online reductions have been studied in single-objective settings, extending these ideas to bi-criteria problems introduces new challenges due to the coupled degradation of approximation guarantees for objectives and constraints. We introduce a notion of $(\alpha,\beta,\delta,\texttt{N})$-resilience for bi-criteria ap
Full Article
Title: A Resilience Framework for Bi-Criteria Combinatorial Optimization with Bandit Feedback
Abstract:
arXiv:2503.12285v2 Announce Type: replace-cross Abstract: We study bi-criteria combinatorial optimization under noisy function evaluations. While resilience and black-box offline-to-online reductions have been studied in single-objective settings, extending these ideas to bi-criteria problems introduces new challenges due to the coupled degradation of approximation guarantees for objectives and constraints. We introduce a notion of $(\alpha,\beta,\delta,\texttt{N})$-resilience for bi-criteria ap
Abstract:
arXiv:2503.12285v2 Announce Type: replace-cross Abstract: We study bi-criteria combinatorial optimization under noisy function evaluations. While resilience and black-box offline-to-online reductions have been studied in single-objective settings, extending these ideas to bi-criteria problems introduces new challenges due to the coupled degradation of approximation guarantees for objectives and constraints. We introduce a notion of $(\alpha,\beta,\delta,\texttt{N})$-resilience for bi-criteria ap
DeepCamp AI