The Computational Complexity of Sensitivity Analysis and Parameter Tuning

06/13/2012
by   Johan Kwisthout, et al.
0

While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact computational complexity of these problems has not been established as yet. In this paper we study several variants of the tuning problem and show that these problems are NPPP-complete in general. We further show that the problems remain NP-complete or PP-complete, for a number of restricted variants. These complexity results provide insight in whether or not recent achievements in sensitivity analysis and tuning can be extended to more general, practicable methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2021

Computational Complexity of Quadratic Unconstrained Binary Optimization

In this paper, we study the computational complexity of the quadratic un...
research
01/28/2020

On the complexity of the middle curve problem

For a set of curves, Ahn et al. introduced the notion of a middle curve ...
research
06/05/2023

Computational Complexity of Detecting Proximity to Losslessly Compressible Neural Network Parameters

To better understand complexity in neural networks, we theoretically inv...
research
02/02/2019

Computational Complexity of Queries Based on Itemsets

We investigate determining the exact bounds of the frequencies of conjun...
research
05/25/2021

The Complexity of Subelection Isomorphism Problems

We study extensions of the Election Isomorphism problem, focused on the ...
research
05/18/2023

On the Computational Complexity of Generalized Common Shape Puzzles

In this study, we investigate the computational complexity of some varia...
research
07/11/2012

Evidence-invariant Sensitivity Bounds

The sensitivities revealed by a sensitivity analysis of a probabilistic ...

Please sign up or login with your details

Forgot password? Click here to reset