Related papers: Resource bounded Ku\v{c}era-G\'{a}cs Theorems
We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…
We revisit the so-called compressed oracle technique, introduced by Zhandry for analyzing quantum algorithms in the quantum random oracle model (QROM). To start off with, we offer a concise exposition of the technique, which easily extends…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
We introduce the relation of "almost-reduction" in an arbitrary topological Ramsey space R, as a generalization of the relation of "almost-inclusion" on the space of infinite sets of natural numbers (the Ellentuck space). This leads us to a…
Quantum scrambling refers to the spread of local quantum information into the many degrees of freedom of a quantum system. In this work, we introduce a resource theory of scrambling which incorporates two mechanisms, "entanglement…
We investigate the strength of a randomness notion $\mathcal R$ as a set-existence principle in second-order arithmetic: for each $Z$ there is an $X$ that is $\mathcal R$-random relative to $Z$. We show that the equivalence between…
Let $A$ be a residually finite dimensional algebra (not necessarily associative) over a field $k$. Suppose first that $k$ is algebraically closed. We show that if $A$ satisfies a homogeneous almost identity $Q$, then $A$ has an ideal of…
We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…
We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in…
In this paper, we derive rates of convergence in the high-dimensional central limit theorem for Polyak--Ruppert averaged iterates generated by entropy-regularized asynchronous Q-learning with linear function approximation and a polynomial…
In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every…
Several logics for expressing coalitional ability under resource bounds have been proposed and studied in the literature. Previous work has shown that if only consumption of resources is considered or the total amount of resources produced…
Quantum coherence is an essential feature of quantum mechanics and is an important physical resource in quantum information. Recently, the resource theory of quantum coherence has been established parallel with that of entanglement. In the…
We develop a complete resource theory of charge-parity-time (CPT) inversion symmetry for both massive and massless relativistic particles of arbitrary spin. We show that a unitary representation of CPT can be consistently constructed for…
We show that a Kirkwood-Dirac type quasiprobability distribution is sufficient to reveal any arbitrary quantum resource. This is achieved by demonstrating that it is always possible to identify a set of incompatible measurements that…
We discuss the allocation of finite resources in the presence of a logarithmic diminishing return law, in analogy to some results from Information Theory. To exemplify the problem we assume that the proposed logarithmic law is applied to…
Initial knowledge regarding group size can be crucial for collective performance. We study this relation in the context of the {\em Ants Nearby Treasure Search (ANTS)} problem \cite{FKLS}, which models natural cooperative foraging behavior…
We provide a convergence result for sequences of random variables taking values in a metric space that satisfy a stochastic quasi-Fej\'er monotonicity condition, in the context of a (local) compactness assumption. Our result is quantitative…
The Weak approximation theorem describes the closure of $G(Q)$ inside $G(Q_p)$ as well as inside $G(R)$ for $G$ an algebraic group over $Q$; the closure is always an open normal subgroup with finite abelian quotient, and is well understood…
While Bayesian-based exploration often demonstrates superior empirical performance compared to bonus-based methods in model-based reinforcement learning (RL), its theoretical understanding remains limited for model-free settings. Existing…