Related papers: Superefficiency from the Vantage Point of Computab…
We provide a strengthened version of the famous Jakobson's theorem. Consider an interval map $f$ satisfying a summability condition. For a generic one-parameter family $f_t$ of maps with $f_0=f$, we prove that $t=0$ is a Lebesgue density…
Inspired by a recent work by Berger, we introduce the concept of pointwise emergence. This concept provides with a new quantitative perspective into the study of non-existence of averages for dynamical systems. We show that high pointwise…
In a smooth semiparametric estimation problem, the marginal posterior for the parameter of interest is expected to be asymptotically normal and satisfy frequentist criteria of optimality if the model is endowed with a suitable prior. It is…
A function f:R -> R is approximately continuous iff it is continuous in the density topology, i.e., for any ordinary open set U the set E=f^{-1}(U) is measurable and has Lebesgue density one at each of its points. Denjoy proved that…
A Steinhaus set $S \subseteq \RR^d$ for a set $A \subseteq \RR^d$ is a set such that $S$ has exactly one point in common with $\tau A$, for every rigid motion $\tau$ of $\RR^d$. We show here that if $A$ is a finite set of at least two…
It is shown that superefficient Monte Carlo computations can be carried out by using chaotic dynamical systems as non-uniform random-number generators. Here superefficiency means that the expectation value of the square of the error…
In Econometrics, the Breusch-Pagan test-statistic has become an iconic application of the Lagrange multipliers (LM) test. We shall introduce beta-score LM tests for heteroscedasticity in linear regression models, which trades-off the degree…
In this work we describe the Non-Equilibrium Statistical Operator Method (NESOM). The NESOM is a powerful formalism that seems to offer an elegant and concise way for an analytical treatment in the theory of irreversible processes, adequate…
For any continuous map f on a compact manifold M, we define the SRB-like (or observable) probabilities as a generalization of Sinai-Ruelle-Bowen (i.e. physical) measures. We prove that f has observable measures, even if SRB measures do not…
The goal of this paper is to provide a way for statisticians to answer the question posed in the title of this article using any Bayesian hierarchical model of their choosing and without imposing additional restrictive model assumptions. We…
This paper describes a new form of unsupervised learning, whose input is a set of unlabeled points that are assumed to be local maxima of an unknown value function v in an unknown subset of the vector space. Two functions are learned: (i) a…
In robust statistics, the breakdown point of an estimator is the percentage of outliers with which an estimator still generates reliable estimation. The upper bound of breakdown point is 50%, which means it is not possible to generate…
In 1934 N. N. Luzin proved in his short (but dense) paper \textit{Sur la decomposition des ensembles} that every set $X\subseteq \mathbb{R}$ can be decomposed into two full, with respect to Lebesgue measure or category, subsets. We will try…
When the experimental data set is contaminated, we usually employ robust alternatives to common location and scale estimators such as the sample median and Hodges-Lehmann estimators for location and the sample median absolute deviation and…
In supervised learning, obtaining a large set of fully-labeled training data is expensive. We show that we do not always need full label information on every single training example to train a competent classifier. Specifically, inspired by…
The study of computability has its origin in Hilbert's conference of 1900, where an adjacent question, to the ones he asked, is to give a precise description of the notion of algorithm. In the search for a good definition arose three…
Change-point detection studies the problem of detecting the changes in the underlying distribution of the data stream as soon as possible after the change happens. Modern large-scale, high-dimensional, and complex streaming data call for…
Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum…
In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…