scholarly journals Checking for model failure and for prior-data conflict with the constrained multinomial model

Metrika ◽  
2021 ◽  
Author(s):  
Berthold-Georg Englert ◽  
Michael Evans ◽  
Gun Ho Jang ◽  
Hui Khoon Ng ◽  
David Nott ◽  
...  

AbstractMultinomial models can be difficult to use when constraints are placed on the probabilities. An exact model checking procedure for such models is developed based on a uniform prior on the full multinomial model. For inference, a nonuniform prior can be used and a consistency theorem is proved concerning a check for prior-data conflict with the chosen prior. Applications are presented and a new elicitation methodology is developed for multinomial models with ordered probabilities.

2013 ◽  
Vol 328 ◽  
pp. 254-260
Author(s):  
Zhi Yuan Chen ◽  
Shao Bin Huang ◽  
Ming Yu Ji ◽  
Lin Shan Shen

For given system to proceed model checking, if system model is discontent with the quality which to be detected, model detector will give counterexample, it will cause the generated counterexample too long when system state-space is very large, it is a very important problem, how to find the reason of model failure from long counterexample quickly, the article uses extractive technique of minimal unsatisfiable subformula to put forward a kind of understanding counterexample way which is extracted minimal unsatisfiable subformula quickly from Boolean formula. The algorithm can pinpoint error and find the reason of model failure. Experimental result indicated that understanding counterexample is based on minimal unsatisfiable subformula can accelerate understanding counterexample speed, improve the efficient of debugging, guide system abstract model improvement effectively.


2013 ◽  
Vol 572 ◽  
pp. 115-118
Author(s):  
Zhi Yuan Chen ◽  
Shao Bin Huang ◽  
Li Li Han

Model checking technique can give a specific counterexample which explains how the system violates some assertion when model does not satisfy the specification. However, it is a tedious work to understand the long counterexamples. We propose a genetic algorithm to enhance the efficiency of understanding long counterexample by computing the minimal unsatisfiable subformula. Besides, we also propose a Craig interpolation computation-based method to understand counterexample. The causes which are responsible for model failure are extracted by deriving interpolation from the proof of the nonsatisfiability of the initial state and the weakest precondition of counterexample. Experimental results show that our methods improve the efficiency of understanding counterexamples and debugging significantly.


2021 ◽  
Author(s):  
◽  
Haizhen Wu

<p><b>Divisible statistics have been widely used in many areas of statistical analysis. For example, Pearson's Chi-square statistic and the log-likelihood ratio statistic are frequently used in goodness of fit (GOF) and categorical analysis; the maximum likelihood (ML) estimators of the Shannon's and Simpson's diversity indices are often used as measure of diversity; and the spectral statistic plays a key role in the theory of large number of rare events. In the classical multinomial model, where the number of disjoint events N and their probabilities are all fixed, limit distributions of many divisible statistics have gradually been established. However, most of the results are based on the asymptotic equivalence of these statistics to Pearson's Chi-square statistic and the known limit distribution of the latter. In fact, with deeper analysis, one can conclude that the key point is not the asymptotic behavior of the Chi-square statistic, but that of the normalized frequencies. Based on the asymptotic normality of the normalized frequencies in the classical model, a unified approach to the limit theorems of more general divisible statistics can be established, of which the case of the Chi-square statistic is simply a natural corollary.</b></p> <p>In many applications, however, the classical multinomial model is not appropriate, and an extension to new models becomes necessary. This new type of model, called "non-classical" multinomial models, considers the case when N increases and the {Pni} change as sample size n increases. As we will see, in these non-classical models, both the asymptotic normality of the normalized frequencies and the asymptotic equivalence of many divisible statistics to the Chi-square statistic are lost, and the limit theorems established in classical model are no longer valid in non-classical models.</p> <p>The extension to non-classical models not only met the demands of many real world applications, but also opened a new research area in statistical analysis, which has not been thoroughly investigated so far. Although some results on the limit distributions of the divisible statistics in non-classical models have been acquired, e.g., Holst (1972); Morris (1975); Ivchenko and Levin (1976); Ivchenko and Medvedev (1979), they are far from complete. Though not yet attracting much attention by many applied statisticians, another advanced approach, introduced by Khmaladze (1984), makes use of modern martingale theory to establish functional limit theorems of the partial sum processes of divisible statistics successfully. In the main part of this thesis, we show that this martingale approach can be extended to more general situations where both Gaussian and Poissonian frequencies exist, and further discuss the properties and applications of the limiting processes, especially in constructing distribution-free statistics.</p> <p>The last part of the thesis is about the statistical analysis of large number of rare events (LNRE), which is an important class of non-classical multinomial models and presented in numerous applications. In LNRE models, most of the frequencies are very small and it is not immediately clear how consistent and reliable inference can be achieved. Based on the definitions and key concepts firstly introduced by Khmaladze (1988), we discuss a particular model with the context of diversity of questionnaires. The advanced statistical techniques such as large deviation, contiguity and Edgeworth expansion used in establishing limit theorems underpin the potential of LNRE theory to become a fruitful research area in future.</p>


Author(s):  
Michele Chiari ◽  
Dino Mandrioli ◽  
Matteo Pradella

AbstractThe problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL. Recently, the logic OPTL was introduced, based on the class of Operator Precedence Languages (OPL), more powerful than Nested Words. We define the new OPL-based logic POTL, and provide a model checking procedure for it. POTL improves on NWTL by enabling the formulation of requirements involving pre/post-conditions, stack inspection, and others in the presence of exception-like constructs. It improves on OPTL by being FO-complete, and by expressing more easily stack inspection and function-local properties. We developed a model checking tool for POTL, which we experimentally evaluate on some interesting use-cases.


2022 ◽  
pp. 004912412110675
Author(s):  
Michael Schultz

This paper presents a model of recurrent multinomial sequences. Though there exists a quite considerable literature on modeling autocorrelation in numerical data and sequences of categorical outcomes, there is currently no systematic method of modeling patterns of recurrence in categorical sequences. This paper develops a means of discovering recurrent patterns by employing a more restrictive Markov assumption. The resulting model, which I call the recurrent multinomial model, provides a parsimonious representation of recurrent sequences, enabling the investigation of recurrences on longer time scales than existing models. The utility of recurrent multinomial models is demonstrated by applying them to the case of conversational turn-taking in meetings of the Federal Open Market Committee (FOMC). Analyses are effectively able to discover norms around turn-reclaiming, participation, and suppression and to evaluate how these norms vary throughout the course of the meeting.


2021 ◽  
Author(s):  
◽  
Haizhen Wu

<p><b>Divisible statistics have been widely used in many areas of statistical analysis. For example, Pearson's Chi-square statistic and the log-likelihood ratio statistic are frequently used in goodness of fit (GOF) and categorical analysis; the maximum likelihood (ML) estimators of the Shannon's and Simpson's diversity indices are often used as measure of diversity; and the spectral statistic plays a key role in the theory of large number of rare events. In the classical multinomial model, where the number of disjoint events N and their probabilities are all fixed, limit distributions of many divisible statistics have gradually been established. However, most of the results are based on the asymptotic equivalence of these statistics to Pearson's Chi-square statistic and the known limit distribution of the latter. In fact, with deeper analysis, one can conclude that the key point is not the asymptotic behavior of the Chi-square statistic, but that of the normalized frequencies. Based on the asymptotic normality of the normalized frequencies in the classical model, a unified approach to the limit theorems of more general divisible statistics can be established, of which the case of the Chi-square statistic is simply a natural corollary.</b></p> <p>In many applications, however, the classical multinomial model is not appropriate, and an extension to new models becomes necessary. This new type of model, called "non-classical" multinomial models, considers the case when N increases and the {Pni} change as sample size n increases. As we will see, in these non-classical models, both the asymptotic normality of the normalized frequencies and the asymptotic equivalence of many divisible statistics to the Chi-square statistic are lost, and the limit theorems established in classical model are no longer valid in non-classical models.</p> <p>The extension to non-classical models not only met the demands of many real world applications, but also opened a new research area in statistical analysis, which has not been thoroughly investigated so far. Although some results on the limit distributions of the divisible statistics in non-classical models have been acquired, e.g., Holst (1972); Morris (1975); Ivchenko and Levin (1976); Ivchenko and Medvedev (1979), they are far from complete. Though not yet attracting much attention by many applied statisticians, another advanced approach, introduced by Khmaladze (1984), makes use of modern martingale theory to establish functional limit theorems of the partial sum processes of divisible statistics successfully. In the main part of this thesis, we show that this martingale approach can be extended to more general situations where both Gaussian and Poissonian frequencies exist, and further discuss the properties and applications of the limiting processes, especially in constructing distribution-free statistics.</p> <p>The last part of the thesis is about the statistical analysis of large number of rare events (LNRE), which is an important class of non-classical multinomial models and presented in numerous applications. In LNRE models, most of the frequencies are very small and it is not immediately clear how consistent and reliable inference can be achieved. Based on the definitions and key concepts firstly introduced by Khmaladze (1988), we discuss a particular model with the context of diversity of questionnaires. The advanced statistical techniques such as large deviation, contiguity and Edgeworth expansion used in establishing limit theorems underpin the potential of LNRE theory to become a fruitful research area in future.</p>


2000 ◽  
Vol 90 (1) ◽  
pp. 131-146 ◽  
Author(s):  
Ralf Ott ◽  
Immo Curio ◽  
O. Berndt Scholz

The investigation of unconscious cognition involves especially problems with the methodology of measuring implicit and explicit proportions of different task performances. In this study the process dissociation procedure of Jacoby and its modification within the multinomial modelling framework for an indirect word-nonword-discrimination task is applied to a sample of 45 healthy students. The paradigm includes acoustically presented stimuli. During a learning phase, subjects listened to a series of neutral and threatening words. Performance was tested by letting subjects decide whether a presented stimulus (masked with white noise at signal-noise ratio of −17dB or unmasked) had been a word or a nonword. Within this paradigm, implicit cognition occurs when (a) a word is more probably correctly recognized as “word” after presentation during the learning phase (typical priming effect) or when (b) a nonword derived from a word is more probably falsely recognized as “word” after its corresponding word had been presented during the learning phase (effect of implicit cognition given perceptual fluency). Frequencies for hits and false alarms were analyzed within the multinomial model which allows estimating parameters for the correct discrimination of words (c), the response bias (b), the classical priming effect ( u1), and the parameter for the priming effect of “old” nonwords (u2). Under masked stimuli the multinomial model showed implicit cognition, an effect not equally found for neutral and threatening words. Threatening words exhibited a significantly higher portion of implicit cognition than neutral ones. Given the statistical complexity of multinomial models, the application of this method was explained in detail.


Author(s):  
Fu Song ◽  
Yedi Zhang ◽  
Taolue Chen ◽  
Yu Tang ◽  
Zhiwu Xu

Reasoning about strategic abilities is key to an AI system consisting of multiple agents with random behaviors. We propose a probabilistic extension of Alternating µ-Calculus (AMC), named PAMC, for reasoning about strategic abilities of agents in stochastic multi-agent systems. PAMC subsumes existing logics AMC and PµTL. The usefulness of PAMC is exemplified by applications in genetic regulatory networks. We show that, for PAMC, the model checking problem is in UP∩co-UP, and the satisfiability problem is EXPTIME-complete, both of which are the same as those for AMC. Moreover, PAMC admits the small model property. We implement the satisfiability checking procedure in a tool PAMCSolver.


Sign in / Sign up

Export Citation Format

Share Document