English
Related papers

Related papers: Conditioning by rare sources

200 papers

We develop a theoretical approach to compute the conditioned spectral density of $N \times N$ non-invariant random matrices in the limit $N \rightarrow \infty$. This large deviation observable, defined as the eigenvalue distribution…

Disordered Systems and Neural Networks · Physics 2018-08-15 Isaac Pérez Castillo , Fernando L. Metz

In this paper, we study the weak convergence of the extremes of supercritical branching L\'evy processes $\{\mathbb{X}_t, t \ge0\}$ whose spatial motions are L\'evy processes with regularly varying tails. The result is drastically different…

Probability · Mathematics 2022-10-13 Yan-Xia Ren , Renming Song , Rui Zhang

We obtain the posterior distribution of a random process conditioned on observing the empirical frequencies of a finite sample path. We find under a rather broad assumption on the "dependence structure" of the process, {\em c.f.}…

Probability · Mathematics 2022-03-02 Wenqing Hu , Hong Qian

We propose using a discounted version of a convex combination of the log-likelihood with the corresponding expected log-likelihood such that when they are maximized they yield a filter, predictor and smoother for time series. This paper…

Methodology · Statistics 2026-04-29 Simon Donker van Heel , Neil Shephard

Consider the map $(x, y) \mapsto (x + \epsilon^{-\alpha} \sin (2\pi x) + \epsilon^{-1-\alpha}z, z + \epsilon \sin(2\pi x))$, which is conjugate to the Chirikov standard map with a large parameter. The parameter value $\alpha = 1$ is related…

Dynamical Systems · Mathematics 2020-01-08 Alex Blumenthal , Jacopo De Simoi , Ke Zhang

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…

Information Theory · Computer Science 2007-07-13 Hari Palaiyanur , Anant Sahai

We study lossy source coding under a distortion measure defined by the negative log-likelihood induced by a prescribed conditional distribution $P_{X|U}$. This \emph{log-likelihood distortion} models compression settings in which the…

Information Theory · Computer Science 2026-01-26 Anuj Kumar Yadav , Dan Song , Yanina Shkel , Ayfer Özgür

We study prior distributions for Poisson parameter estimation under $L^1$ loss. Specifically, we construct a new family of prior distributions whose optimal Bayesian estimators (the conditional medians) can be any prescribed increasing…

Statistics Theory · Mathematics 2025-05-28 Leighton P. Barnes , Alex Dytso , H. Vincent Poor

It will be recalled that the classical bivariate normal distributions have normal marginals and normal conditionals. It is natural to ask whether a similar phenomenon can be encountered involving Poisson marginals and conditionals.…

Methodology · Statistics 2020-09-04 Barry C. Arnold , B. G. Manjunath

Conditional diffusion probabilistic models can model the distribution of natural images and can generate diverse and realistic samples based on given conditions. However, oftentimes their results can be unrealistic with observable color…

Computer Vision and Pattern Recognition · Computer Science 2022-12-15 Kangfu Mei , Nithin Gopalakrishnan Nair , Vishal M. Patel

This paper presents a one shot analysis of the lossy compression problem under average distortion constraints. We calculate the exact expected distortion of a random code. The result is given as an integral formula using a newly defined…

Information Theory · Computer Science 2020-05-18 Nir Elkayam , Meir Feder

Constraints are a natural choice for prior information in Bayesian inference. In various applications, the parameters of interest lie on the boundary of the constraint set. In this paper, we use a method that implicitly defines a…

Statistics Theory · Mathematics 2022-09-27 Jasper Marijn Everink , Yiqiu Dong , Martin Skovgaard Andersen

We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if…

Information Theory · Computer Science 2016-03-16 Albert No , Amir Ingber , Tsachy Weissman

Estimations and applications of factor models often rely on the crucial condition that the number of latent factors is consistently estimated, which in turn also requires that factors be relatively strong, data are stationary and weak…

Statistics Theory · Mathematics 2020-06-05 Jianqing Fan , Yuan Liao

There are several estimators of conditional probability from observed frequencies of features. In this paper, we propose using the lower limit of confidence interval on posterior distribution determined by the observed frequencies to…

Information Theory · Computer Science 2017-09-26 Masato Kikuchi , Eiko Yamamoto , Mitsuo Yoshida , Masayuki Okabe , Kyoji Umemura

Consider a one dimensional critical branching L\'{e}vy process $((Z_t)_{t\geq 0}, \mathbb {P}_x)$. Assume that the offspring distribution either has finite second moment or belongs to the domain of attraction to some $\alpha$-stable…

Probability · Mathematics 2024-10-15 Haojie Hou , Yan-Xia Ren , Renming Song

Estimation of parameters that obey specific constraints is crucial in statistics and machine learning; for example, when parameters are required to satisfy boundedness, monotonicity, or linear inequalities. Traditional approaches impose…

Methodology · Statistics 2026-04-03 Lachlan Astfalck , Deborshee Sen , Sayan Patra , Edward Cripps , David Dunson

Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification…

Machine Learning · Statistics 2021-05-31 Yaniv Tenzer , Amit Moscovich , Mary Frances Dorn , Boaz Nadler , Clifford Spiegelman

The context tree source is a source model in which the occurrence probability of symbols is determined from a finite past sequence, and is a broader class of sources that includes i.i.d. and Markov sources. The proposed source model in this…

Information Theory · Computer Science 2021-05-14 Koshi Shimada , Shota Saito , Toshiyasu Matsushima

For a Markov semigroup $P_t$ with invariant probability measure $\mu$, a constant $\ll>0$ is called a lower bound of the ultra-exponential convergence rate of $P_t$ to $\mu$, if there exists a constant $C\in (0,\infty)$ such that $$…

Probability · Mathematics 2014-10-14 Feng-Yu Wang
‹ Prev 1 4 5 6 7 8 10 Next ›