paper-with-me

Papers

Sensitivity analysis, multilinearity and beyond

2015-12-07 · Manuele Leonelli, Christiane Görgen, Jim Q. Smith

Sensitivity methods for the analysis of the outputs of discrete Bayesian networks have been extensively studied and implemented in different software packages. These methods usually focus on the study of sensitivity functions and on the impact of a parameter change to the Chan-Darwiche distance. Although not fully recognized, the majority of these results heavily rely on the multilinear structure of atomic probabilities in terms of the conditional probability parameters associated with this type of network. By defining a statistical model through the polynomial expression of its associated defining conditional probabilities, we develop a unifying approach to sensitivity methods applicable to a large suite of models including extensions of Bayesian networks, for instance context-specific and dynamic ones, and chain event graphs. By then focusing on models whose defining polynomial is multilinear, our algebraic approach enables us to prove that the Chan-Darwiche distance is minimized for a certain class of multi-parameter contemporaneous variations when parameters are proportionally covaried.

📄 PDF Abstract BibTeX arXiv:1512.02266

Code (0)

등록된 구현이 없습니다.

Tasks

Sensitivity

Similar Papers 제목 키워드 기반

A note on Linear Bottleneck networks and their Transition to Multilinearity

2022-06-30 · Libin Zhu, Parthe Pandit, Mikhail Belkin

Randomly initialized wide neural networks transition to linear functions of weights as the width grows, in a ball of radius $O(1)$ around initialization. A necessary condition for this result is that all layers of the ne…

A Sensitivity Analysis of Pathfinder

2013-03-27 · Keung-Chi Ng, Bruce Abramson

Knowledge elicitation is one of the major bottlenecks in expert system design. Systems based on Bayes nets require two types of information--network structure and parameters (or probabilities). Both must be elicited from…

PathfinderSensitivity

Efficient Task Collaboration with Execution Uncertainty

2015-09-17 · Dengji Zhao, Sarvapali D. Ramchurn, Nicholas R. Jennings

We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). …

Several Approximation Algorithms for Sparse Best Rank-1 Approximation to Higher-Order Tensors

2020-12-05 · Xianpeng Mao, Yuning Yang

Sparse tensor best rank-1 approximation (BR1Approx), which is a sparsity generalization of the dense tensor BR1Approx, and is a higher-order extension of the sparse matrix BR1Approx, is one of the most important problems…

Tensor Decomposition

Beyond Accuracy: How AI Metacognitive Sensitivity improves AI-assisted Decision Making

2025-07-30 · ZhaoBin Li, Mark Steyvers arxiv

In settings where human decision-making relies on AI input, both the predictive accuracy of the AI system and the reliability of its confidence estimates influence decision quality. We highlight the role of AI metacognit…

Decision Making