English
Related papers

Related papers: Interpretable hypothesis tests

200 papers

Interpretability is an elusive but highly sought-after characteristic of modern machine learning methods. Recent work has focused on interpretability via $\textit{explanations}$, which justify individual model predictions. In this work, we…

Machine Learning · Computer Science 2019-10-31 David Alvarez-Melis , Hal Daumé , Jennifer Wortman Vaughan , Hanna Wallach

We consider the problem of hypothesis testing in the situation where the first hypothesis is simple and the second one is local one-sided composite. We describe the choice of the thresholds and the power functions of different tests when…

Statistics Theory · Mathematics 2015-02-25 Serguei Dachian , Yury Kutoyants , Lin Yang

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

Logic · Mathematics 2013-12-17 Jesse Alama

Over the past decades, alongside advancements in natural language processing, significant attention has been paid to training models to automatically extract, understand, test, and generate hypotheses in open and scientific domains.…

Computation and Language · Computer Science 2025-09-03 Jian Wu , Sarah Rajtmajer

We discuss the adequacy of tests for intelligent systems and practical problems raised by their implementation. We propose the replacement test as the ability of a system to replace successfully another system performing a task in a given…

Artificial Intelligence · Computer Science 2023-08-15 Joseph Sifakis

While belief functions may be seen formally as a generalization of probabilistic distributions, the question of the interactions between belief functions and probability is still an issue in practice. This question is difficult, since the…

Logic in Computer Science · Computer Science 2011-10-03 Frederic Dambreville

In this paper, we consider the problem of making skeptical inferences for the multi-label ranking problem. We assume that our uncertainty is described by a convex set of probabilities (i.e. a credal set), defined over the set of labels.…

Machine Learning · Statistics 2022-10-18 Yonatan Carlos Carranza Alarcón , Vu-Linh Nguyen

Claims that the standard methodology of scientific testing is inapplicable to Everettian quantum theory, and hence that the theory is untestable, are due to misconceptions about probability and about the logic of experimental testing.…

Quantum Physics · Physics 2016-06-21 David Deutsch

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

From an inconsistent database non-trivial arguments may be constructed both for a proposition, and for the contrary of that proposition. Therefore, inconsistency in a logical database causes uncertainty about which conclusions to accept.…

Artificial Intelligence · Computer Science 2013-08-12 Morten Elvang-Gøransson , Paul J. Krause , John Fox

While the uptake of data-driven approaches for materials science and chemistry is at an exciting, early stage, to realise the true potential of machine learning models for successful scientific discovery, they must have qualities beyond…

Materials Science · Physics 2022-06-28 Felipe Oviedo , Juan Lavista Ferres , Tonio Buonassisi , Keith Butler

The debate around the interpretability of attention mechanisms is centered on whether attention scores can be used as a proxy for the relative amounts of signal carried by sub-components of data. We propose to study the interpretability of…

Machine Learning · Computer Science 2022-07-27 Jonathan Haab , Nicolas Deutschmann , Maria Rodríguez Martínez

The most important problems for society are describable only in vague terms, dependent on subjective positions, and missing highly relevant data. This thesis is intended to revive and further develop the view that giving non-trivial,…

Logic in Computer Science · Computer Science 2018-09-27 Robert Dustin Wehr

We consider the problem of hypotheses testing with the basic simple hypothesis: observed sequence of points corresponds to stationary Poisson process with known intensity against a composite one-sided parametric alternative that this is a…

Statistics Theory · Mathematics 2007-06-13 Serguei Dachian , Yury A. Kutoyants

Mechanistic interpretability is the program of explaining what AI systems are doing in terms of their internal mechanisms. I analyze some aspects of the program, along with setting out some concrete challenges and assessing progress to…

Artificial Intelligence · Computer Science 2025-01-28 David J. Chalmers

Data analysis requires translating higher level questions and hypotheses into computable statistical models. We present a mixed-methods study aimed at identifying the steps, considerations, and challenges involved in operationalizing…

Other Computer Science · Computer Science 2021-04-08 Eunice Jun , Melissa Birchfield , Nicole de Moura , Jeffrey Heer , Rene Just

Could an AI have conscious experiences? Any answer to this question should conform to Evidentialism - that is, it should be based not on intuition, dogma or speculation but on solid scientific evidence. I argue that such evidence is hard to…

Artificial Intelligence · Computer Science 2025-12-22 Tom McClelland

A number of biomedical problems require performing many hypothesis tests, with an attendant need to apply stringent thresholds. Often the data take the form of a series of predictor vectors, each of which must be compared with a single…

Methodology · Statistics 2014-05-13 Yi-Hui Zhou , Fred Wright

I present a critique of the methods used in a typical paper. This leads to three broad conclusions about the conventional use of statistical methods. First, results are often reported in an unnecessarily obscure manner. Second, the null…

Applications · Statistics 2013-03-05 Michael Wood

The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.

Computational Complexity · Computer Science 2007-05-23 Harry Buhrman , Tao Jiang , Ming Li , Paul Vitanyi