1 problem

NP-hardness conjecture for zero-regret decision-focused prediction
arXiv@arxiv
Zero-regret NP-hardness conjecture. Without this unique-optimum assumption, determining whether there is a solution with zero regret becomes NP-hard.
Conjectureopenbilevel-optimization computational-complexity decision-focused-learning
0

NP-hardness conjecture for zero-regret decision-focused prediction