paper-with-me

홈 › Papers

A central limit theorem concerning uncertainty in estimates of individual admixture

2021-10-15 · Peter Pfaffelhuber, Angelika Rohde

The concept of individual admixture (IA) assumes that the genome of individuals is composed of alleles inherited from $K$ ancestral populations. Each copy of each allele has the same chance $q_k$ to originate from population $k$, and together with the allele frequencies $p$ in all populations at all $M$ markers, comprises the admixture model. Here, we assume a supervised scheme, i.e.\ allele frequencies $p$ are given through a reference database of size $N$, and $q$ is estimated via maximum likelihood for a single sample. We study laws of large numbers and central limit theorems describing effects of finiteness of both, $M$ and $N$, on the estimate of $q$. We recall results for the effect of finite $M$, and provide a central limit theorem for the effect of finite $N$, introduce a new way to express the uncertainty in estimates in standard barplots, give simulation results, and discuss applications in forensic genetics.

📄 PDF Abstract BibTeX arXiv:2110.08348

Code (1)

pfaffelh/mninfty 공식 구현

Similar Papers 제목 키워드 기반

Statistical Inference for Weighted Sample Average Approximation in Contextual Stochastic Optimization

2025-03-17 · Yanyuan Wang, Xiaowei Zhang

Contextual stochastic optimization provides a framework for decision-making under uncertainty incorporating observable contextual information through covariates. We analyze statistical inference for weighted sample avera…

Decision MakingDecision Making Under UncertaintyStochastic Optimizationvalid

A central limit theorem for scaled eigenvectors of random dot product graphs

2013-05-31 · Avanti Athreya, Vince Lyzinski, David J. Marchette, Carey E. Priebe 외

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow t…

Statistical Inference for Polyak-Ruppert Averaged Zeroth-order Stochastic Gradient Algorithm

2021-02-10 · Yanhao Jin, Tesi Xiao, Krishnakumar Balasubramanian

Statistical machine learning models trained with stochastic gradient algorithms are increasingly being deployed in critical scientific applications. However, computing the stochastic gradient in several such applications…

BIG-bench Machine Learningparameter estimationvalid

Uncertainty Quantification and Exploration for Reinforcement Learning

2019-10-12 · ICLR 2020 1 · YI Zhu, Jing Dong, Henry Lam

We investigate statistical uncertainty quantification for reinforcement learning (RL) and its implications in exploration policy. Despite ever-growing literature on RL applications, fundamental questions about inference …

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Uncertainty Quantification+1

Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCA

2025-06-14 · Syamantak Kumar, Shourya Pandey, Purnamrita Sarkar

We propose a novel statistical inference framework for streaming principal component analysis (PCA) using Oja's algorithm, enabling the construction of confidence intervals for individual entries of the estimated eigenve…

Uncertainty Quantification