English
Related papers

Related papers: On the Relation between Realizable and Nonrealizab…

200 papers

The main question is: why and how can we ever predict based on a finite sample? The question is not answered by statistical learning theory. Here, I suggest that prediction requires belief in "predictability" of the underlying dependence,…

Machine Learning · Computer Science 2022-01-28 Marina Sapir

We investigate the almost everywhere convergence of sequences of convolution operators given by probability measures $\mu_n$ on $\mathbb R$. If this sequence of operators constitutes an approximate identity on a particular class of…

Dynamical Systems · Mathematics 2024-07-15 Andrew Parrish , Joseph Rosenblatt

We consider a class of sequential decision-making problems under uncertainty that can encompass various types of supervised learning concepts. These problems have a completely observed state process and a partially observed modulation…

Optimization and Control · Mathematics 2021-08-24 R. Reid Bishop , Chelsea C. White

In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…

Quantum Physics · Physics 2012-07-20 J. Eisert , M. P. Mueller , C. Gogolin

We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…

Logic · Mathematics 2013-05-16 Jan Reimann , Theodore A. Slaman

We use machine learning to provide a tractable measure of the amount of predictable variation in the data that a theory captures, which we call its "completeness." We apply this measure to three problems: assigning certain equivalents to…

Theoretical Economics · Economics 2019-10-17 Drew Fudenberg , Jon Kleinberg , Annie Liang , Sendhil Mullainathan

Calibration is a classical notion from the forecasting literature which aims to address the question: how should predicted probabilities be interpreted? In a world where we only get to observe (discrete) outcomes, how should we evaluate a…

Machine Learning · Computer Science 2025-09-03 Parikshit Gopalan , Lunjia Hu

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

Logic in Computer Science · Computer Science 2023-08-02 Artur Jeż , Anthony W. Lin , Oliver Markgraf , Philipp Rümmer

In general relativity, the causal structure between events is dynamical, but it is definite and observer-independent; events are point-like and the membership of an event A in the future or past light-cone of an event B is an…

Quantum Physics · Physics 2020-07-13 Philippe Allard Guérin , Časlav Brukner

We prove uncertainty relations that quantitatively express the impossibility of jointly sharp preparation of pre- and post-selected quantum states for measuring incompatible observables during the weak measurement. By defining a suitable…

Quantum Physics · Physics 2014-11-27 Arun Kumar Pati , Junde Wu

Solomonoff's uncomputable universal prediction scheme $\xi$ allows to predict the next symbol $x_k$ of a sequence $x_1...x_{k-1}$ for any Turing computable, but otherwise unknown, probabilistic environment $\mu$. This scheme will be…

Machine Learning · Computer Science 2007-05-23 Marcus Hutter

We develop a general, non-probabilistic model of prediction which is suitable for assessing the (un)predictability of individual physical events. We use this model to provide, for the first time, a rigorous proof of the unpredictability of…

Quantum Physics · Physics 2015-10-06 Alastair A. Abbott , Cristian S. Calude , Karl Svozil

Reimann and Slaman initiated the study of sequences that are Martin-L\"of random with respect to a continuous measure, establishing fundamental facts about NCR, the collection of sequences that are not Martin-L\"of random with respect to…

Logic · Mathematics 2024-03-08 Christopher P. Porter

The presence of latent variables can greatly complicate inferences about causal relations between measured variables from statistical data. In many cases, the presence of latent variables makes it impossible to determine for two measured…

Artificial Intelligence · Computer Science 2013-03-26 Peter L. Spirtes

Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…

Number Theory · Mathematics 2021-05-10 László Mérai , Arne Winterhof

Bayesian model comparison (BMC) offers a principled probabilistic approach to study and rank competing models. In standard BMC, we construct a discrete probability distribution over the set of possible models, conditional on the observed…

Machine Learning · Statistics 2023-02-22 Marvin Schmitt , Stefan T. Radev , Paul-Christian Bürkner

In many Phase II statistical process control (SPC) problems, the main concern is not whether a monitored process has ever changed, but whether it is currently operating at an acceptable level. This distinction is especially important when…

Computation · Statistics 2026-05-06 Gordon J. Ross

We consider problems where multiple predictions can be considered correct, but only one of them is given as supervision. This setting differs from both the regression and class-conditional generative modelling settings: in the former, there…

Machine Learning · Computer Science 2020-12-02 Shichong Peng , Ke Li

Several performance measures can be used for evaluating classification results: accuracy, F-measure, and many others. Can we say that some of them are better than others, or, ideally, choose one measure that is best in all situations? To…

Machine Learning · Computer Science 2022-01-25 Martijn Gösgens , Anton Zhiyanov , Alexey Tikhonov , Liudmila Prokhorenkova

We study strong universal Bayes-consistency in the realizable setting for learning with general metric losses, extending classical characterizations beyond $0$-$1$ classification (Bousquet et al., 2020; Hanneke et al., 2021) and real-valued…

Machine Learning · Computer Science 2026-05-15 Dan Tsir Cohen , Steve Hanneke , Aryeh Kontorovich