A decision-aware belief function compressor targets the regret of the induced combinatorial decision, with a one-point regret bound and an exact scalar dynamic program, and flips the decision less often than representation-aware baselines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization
A decision-aware belief function compressor targets the regret of the induced combinatorial decision, with a one-point regret bound and an exact scalar dynamic program, and flips the decision less often than representation-aware baselines.