English
Related papers

Related papers: Universal Relationships in Measures of Unpredictab…

200 papers

A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…

Logic · Mathematics 2025-09-25 Elijah Gadsby

Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of the system, and an observation function, from the set of runs…

Cryptography and Security · Computer Science 2019-02-20 B. Bérard , J. Mullins , M. Sassolas

A set $P\subset \mathbb N$ is called predictive if for any zero entropy finite-valued stationary process $(X_i)_{i\in \mathbb Z}$, $X_0$ is measurable with respect to $(X_i)_{i\in P}$. We know that $\mathbb N$ is a predictive set. In this…

Dynamical Systems · Mathematics 2020-10-13 Nishant Chandgotia , Benjamin Weiss

The paper established sufficient conditions of predictability with degeneracy for the spectrum at $M$-periodically located isolated points on the unit circle. It is also shown that $m$-periodic subsequences of these sequences are also…

Information Theory · Computer Science 2024-05-31 Nikolai Dokuchaev

A principled approach to understand network structures is to formulate generative models. Given a collection of models, however, an outstanding key task is to determine which one provides a more accurate description of the network at hand,…

Machine Learning · Statistics 2018-06-29 Toni Vallès-Català , Tiago P. Peixoto , Roger Guimerà , Marta Sales-Pardo

We consider pairs of finite-length individual sequences that are realizations of unknown, finite alphabet, stationary sources in a clas M of sources with vanishing memory (e.g. stationary Markov sources). The task of a universal classifier…

Information Theory · Computer Science 2011-11-08 Jacob Ziv

We utilize quantum superposition principle to establish the improvable upper and lower bounds on the stronger uncertainty relation, i.e., the "weighted-like" sum of the variances of observables. Our bounds include some free parameters which…

Quantum Physics · Physics 2017-04-17 Jun Zhang , Yang Zhang , Chang-shui Yu

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

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux

Molecular traits, such as gene expression levels or protein binding affinities, are increasingly accessible to quantitative measurement by modern high-throughput techniques. Such traits measure molecular functions and, from an evolutionary…

Populations and Evolution · Quantitative Biology 2013-11-15 Armita Nourmohammad , Torsten Held , Michael Lässig

The goal of this note is to provide a geometric setting in which generalized arithmetic means are best predictors in an appropriate metric. This characterization provides a geometric interpretation to the concept of certainty equivalent.…

Probability · Mathematics 2020-05-19 Henryk Gzyl

Consequences of the basic and most evident consistency requirement-that measured events cannot happen and not happen at the same time-are shortly reviewed. Particular emphasis is given to event forecast and event control. As a consequence,…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Karl Svozil

Curiously overlooked in physics is its dependence on the transmission of numbers. For example the transmission of numerical clock readings is implicit in the concept of a coordinate system. The transmission of numbers and other logical…

Quantum Physics · Physics 2015-08-06 John M. Myers , F. Hadi Madjid

The uncertainty principle lies at the heart of quantum physics, and is widely thought of as a fundamental limit on the measurement precisions of incompatible observables. Here we show that the traditional uncertainty relation in fact…

Quantum Physics · Physics 2021-02-03 Jun-Li Li , Cong-Feng Qiao

Uncertainty relations are usually formulated as trade-off relations between two or more observables. Here we show that the uncertainty of a single observable already has a nontrivial lower bound originating from the noncommutativity between…

Quantum Physics · Physics 2026-05-27 Haruki Yamashita , Aina Mayumi , Gen Kimura

A source of unpredictability is equivalent to a source of information: unpredictability means not knowing which of a set of alternatives is the actual one; determining the actual alternative yields information. The degree of…

chao-dyn · Physics 2008-02-03 Carlton M. Caves , Ruediger Schack

Sequence classification is the task of predicting a class label given a sequence of observations. In many applications such as healthcare monitoring or intrusion detection, early classification is crucial to prompt intervention. In this…

Machine Learning · Computer Science 2020-10-07 Maayan Shvo , Andrew C. Li , Rodrigo Toro Icarte , Sheila A. McIlraith

Little effort has been devoted to studying generalised notions or models of (un)predictability, yet is an important concept throughout physics and plays a central role in quantum information theory, where key results rely on the supposed…

Quantum Physics · Physics 2020-01-27 Alastair A. Abbott , Cristian S. Calude , Karl Svozil

We find limits to the Transformer architecture for language modeling and show it has a universal prediction property in an information-theoretic sense. We further analyze performance in non-asymptotic data regimes to understand the role of…

Machine Learning · Computer Science 2023-07-18 Sourya Basu , Moulik Choraria , Lav R. Varshney

We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…

General Mathematics · Mathematics 2009-09-09 Florentin Smarandache