Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization
Quick summary
arXiv:2608.10650v1 Announce Type: new Abstract: Reducing the number of focal elements of a mass function is classically driven by an intrinsic distance, such as Jaccard or Jousselme, that keeps the approximation close to the original as a body of evidence. We consider instead the case where the mass function feeds a linear combinatorial optimisation problem with evidential costs. What should then be preserved is not the closeness of the two mass functions, but the quality of the decision they induce. We introduce a decision-aware approximation that targets the regret of the decision: one decid
Key takeaways
- arXiv:2608.10650v1 Announce Type: new Abstract: Reducing the number of focal elements of a mass function is classically driven by an intrinsic distance, such as Jaccard or Jousselme, that keeps the approximation close to the original as a body of evidence.
- We consider instead the case where the mass function feeds a linear combinatorial optimisation problem with evidential costs.
- What should then be preserved is not the closeness of the two mass functions, but the quality of the decision they induce.
Why it matters
The importance of “Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization” will be measured by what changes in practice. User behavior, access conditions, verifiable performance and responsible-use outcomes are the signals worth following.
Member comments