English
Related papers

Related papers: New Applications of the Incompressibility Method: …

200 papers

The nature of the scientific method is controversial with claims that a single scientific method does not even exist. However the scientific method does exist. It is the building of logical and self consistent models to describe nature. The…

History and Philosophy of Physics · Physics 2007-07-13 B. K. Jennings

Machine learning methods have been remarkably successful for a wide range of application areas in the extraction of essential information from data. An exciting and relatively recent development is the uptake of machine learning in the…

Machine Learning · Computer Science 2020-03-13 Ribana Roscher , Bastian Bohn , Marco F. Duarte , Jochen Garcke

Interpretable machine learning tackles the important problem that humans cannot understand the behaviors of complex machine learning models and how these models arrive at a particular decision. Although many approaches have been proposed, a…

Machine Learning · Computer Science 2019-05-21 Mengnan Du , Ninghao Liu , Xia Hu

We provide a novel notion of what it means to be interpretable, looking past the usual association with human understanding. Our key insight is that interpretability is not an absolute concept and so we define it relative to a target model,…

Artificial Intelligence · Computer Science 2017-07-14 Amit Dhurandhar , Vijay Iyengar , Ronny Luss , Karthikeyan Shanmugam

Reproducibility is a confused terminology. In this paper, I take a fundamental view on reproducibility rooted in the scientific method. The scientific method is analysed and characterised in order to develop the terminology required to…

Machine Learning · Computer Science 2022-01-19 Odd Erik Gundersen

This chapter provides a comprehensive overview of proof-theoretic methods for establishing interpolation properties across a range of logics, including classical, intuitionistic, modal, and substructural logics. Central to the discussion…

Logic in Computer Science · Computer Science 2026-02-19 Iris van der Giessen , Raheleh Jalali , Roman Kuznets

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

Argumentation theory is a powerful paradigm that formalizes a type of commonsense reasoning that aims to simulate the human ability to resolve a specific problem in an intelligent manner. A classical argumentation process takes into account…

Artificial Intelligence · Computer Science 2019-03-06 Maximiliano C. D. Budán , Gerardo I. Simari , Ignacio Viglizzo , Guillermo R. Simari

Interpretability and explainability have gained more and more attention in the field of machine learning as they are crucial when it comes to high-stakes decisions and troubleshooting. Since both provide information about predictors and…

Machine Learning · Computer Science 2024-04-26 Benjamin Leblanc , Pascal Germain

This paper provides an extension of compressed sensing which bridges a substantial gap between existing theory and its current use in real-world applications. It introduces a mathematical framework that generalizes the three standard…

Information Theory · Computer Science 2014-06-24 Ben Adcock , Anders C. Hansen , Clarice Poon , Bogdan Roman

We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…

Logic in Computer Science · Computer Science 2014-02-13 Carlos Lombardi , Alejandro Ríos , Roel de Vrijer

Explanation methods have emerged as an important tool to highlight the features responsible for the predictions of neural networks. There is mounting evidence that many explanation methods are rather unreliable and susceptible to malicious…

Computation and Language · Computer Science 2022-06-27 Shriya Atmakuri , Tejas Chheda , Dinesh Kandula , Nishant Yadav , Taesung Lee , Hessel Tuinhof

This chapter provides a hands-on tutorial on the important technique known as self-reducibility. Through a series of "Challenge Problems" that are theorems that the reader will---after being given definitions and tools---try to prove, the…

Computational Complexity · Computer Science 2019-03-18 Lane A. Hemaspaandra

In the frequentist program, inferential methods with exact control on error rates are a primary focus. The standard approach, however, is to rely on asymptotic approximations, which may not be suitable. This paper presents a general…

Statistics Theory · Mathematics 2016-01-26 Ryan Martin

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Logic in Computer Science · Computer Science 2018-04-25 AnneMarie Borg

Explainable information retrieval is an emerging research area aiming to make transparent and trustworthy information retrieval systems. Given the increasing use of complex machine learning models in search systems, explainability is…

Information Retrieval · Computer Science 2022-11-07 Avishek Anand , Lijun Lyu , Maximilian Idahl , Yumeng Wang , Jonas Wallat , Zijian Zhang

We discuss the recently developed method of refined absorption and how it is used to provide a new proof of the Existence Conjecture for combinatorial designs. This method can also be applied to resolve open problems in extremal and…

Combinatorics · Mathematics 2025-10-24 Luke Postle

The papers in this collection are superb illustrations of the power of modern Bayesian methods. They give examples of problems which are well suited to being tackled using such methods, but one must not lose sight of the merits of having…

Methodology · Statistics 2014-05-21 David J. Hand

P-values are a mainstay in statistics but are often misinterpreted. We propose a new interpretation of p-value as a meaningful plausibility, where this is to be interpreted formally within the inferential model framework. We show that, for…

Statistics Theory · Mathematics 2014-10-28 Ryan Martin , Chuanhai Liu

The issue of how to make embodied agents explainable has experienced a surge of interest over the last three years, and, there are many terms that refer to this concept, e.g., transparency or legibility. One reason for this high variance in…

Robotics · Computer Science 2021-02-19 Sebastian Wallkotter , Silvia Tulli , Ginevra Castellano , Ana Paiva , Mohamed Chetouani