We consider observables $X$ whose realizations in a sampled dataset are restricted, for example by measurement resolution, to a finite set of distinguishable categories within their possibly infinite theoretical domain. Given the probabilities of observable categories, we study the coarse-grained probability mass of families of possible datasets generated through a forward sampling process. The combinatorial construction induces an intrinsically discrete $p$-value defined directly from the sampling process rather than through additional probabilistic structure on observables. Specifying the sample means of $d+k$ arbitrary functions $g_\alpha(X)$ defines a linear family of datasets whose probability mass is obtained as a weighted sum over integer lattice points contained within the associated polyhedron. To overcome the intractable large-$N$ combinatorics, we derive via saddle-point techniques a density approximating these probability masses in the continuum limit of forward sampling within the multinomial universality class. As a demonstration, we consider conditional sampling, where $d$ structural means are fixed while $k$ means vary over admissible datasets. The information geometry emerging from the saddle-point density, together with the spherical symmetry arising at large $N$ from the intrinsic $p$-value construction, enables efficient computation of the $p$-value in the Laplace approximation via the $\chi^2_k$ distribution. The resulting statistic is given by the semi-analytic expression $2N$ times the Kullback-Leibler divergence between the information projections associated with the corresponding structural and observed linear families. These projections can be computed efficiently via standard numerical routines converging for sufficiently well-behaved sample means.
This work constructs a proposal that dominates the target by a known constant, generally unavailable for non-Gaussian state space models, yielding independent exact smoothing draws and an unbiased likelihood estimator whose relative variance is at most $1/p-1$ per draw at acceptance probability $p$.
We study large-sample properties of higher-order Markov chains on a finite alphabet $\Sigma$ when the order $m_n$ is allowed to grow with the sequence length $n$. By embedding the process into a first-order chain on $\Sigma^{m_n}$ and exploiting return-time decompositions, we establish a central limit theorem for addit...
We develop a least-action framework for describing how a probability distribution can evolve from an equilibrium state to a prescribed nonequilibrium state under constrained incremental changes. Taking a Gibbs distribution as the equilibrium reference, the framework gives a direct physical meaning to the geometry of th...
Let $X = (X_1, \ldots, X_n)$ be a random vector from any Borel probability law on $\mathbb{R}_+^n$. We revisit the problem of deriving a lower confidence bound (LCB) on a scalar parameter of that law. We recast classical work, beginning with Buehler, in purely probabilistic terms to form a more accessible and extensibl...
G. Bissias, E. Learned-Miller· arXiv.org· 0 citations
This work refine the existing parameter estimation guarantees under the fatness assumption, improving the prior sample complexity to $O( \log n / \epsilon^2)$ for $\ell_\infty$-recovery, matching the untruncated minimax rate.
Rohan Chauhan, Ioannis Panageas· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.