English
Related papers

Related papers: The broken sample problem revisited: Proof of a co…

200 papers

Consider the regression problem where the response $Y\in\mathbb{R}$ and the covariate $X\in\mathbb{R}^d$ for $d\geq 1$ are \textit{unmatched}. Under this scenario, we do not have access to pairs of observations from the distribution of $(X,…

Statistics Theory · Mathematics 2023-09-19 Mona Azadkia , Fadoua Balabdaoui

Several new methods have been proposed for performing valid inference after model selection. An older method is sampling splitting: use part of the data for model selection and part for inference. In this paper we revisit sample splitting…

Statistics Theory · Mathematics 2018-04-04 Alessandro Rinaldo , Larry Wasserman , Max G'Sell , Jing Lei

The identification of the dependent components in multiple data sets is a fundamental problem in many practical applications. The challenge in these applications is that often the data sets are high-dimensional with few observations or…

Methodology · Statistics 2023-06-02 Martin Gölz , Tanuj Hasija , Michael Muma , Abdelhak M. Zoubir

The interplay between missing data and model uncertainty -- two classic statistical problems -- leads to primary questions that we formally address from an objective Bayesian perspective. For the general regression problem, we discuss the…

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…

Information Theory · Computer Science 2010-08-12 Manjesh Kumar Hanawal , Rajesh Sundaresan

In this paper, a robust non-parametric measure of statistical dependence, or correlation, between two random variables is presented. The proposed coefficient is a permutation-like statistic that quantifies how much the observed sample S_n :…

Methodology · Statistics 2020-07-27 Rami Mahdi

Suppose that two large, multi-dimensional data sets are each noisy measurements of the same underlying random process, and principle components analysis is performed separately on the data sets to reduce their dimensionality. In some…

Machine Learning · Statistics 2024-06-27 Donniell E. Fishkind , Cencheng Shen , Youngser Park , Carey E. Priebe

In typical high dimensional statistical inference problems, confidence intervals and hypothesis tests are performed for a low dimensional subset of model parameters under the assumption that the parameters of interest are unconstrained.…

Methodology · Statistics 2019-11-19 Ming Yu , Varun Gupta , Mladen Kolar

We consider the distributed source coding system for $L$ correlated Gaussian observations $Y_i, i=1,2, ..., L$. Let $X_i,i=1,2, ..., L$ be $L$ correlated Gaussian random variables and $N_i,$ $i=1,2,... L$ be independent additive Gaussian…

Information Theory · Computer Science 2009-08-09 Yasutada Oohama

We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, well-studied problem when the signal is completely observed. High- dimensional…

Information Theory · Computer Science 2011-01-25 Laura Balzano , Bejamin Recht , Robert Nowak

The problem of sequentially detecting an abrupt change in a sequence of independent and identically distributed (IID) random variables is addressed. Whereas previous approaches assume a known probability density function (PDF) at the start…

Statistics Theory · Mathematics 2017-12-11 James Falt , Steven D. Blostein

A collaborative distributed binary decision problem is considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $X^n=(X_1,\dots,X_n)$ and…

Information Theory · Computer Science 2016-04-11 Gil Katz , Pablo Piantanida , Merouane Debbah

In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…

Probability · Mathematics 2025-10-30 Laurent Massoulié

Many inference problems involve inferring the number $N$ of components in some region, along with their properties $\{\mathbf{x}_i\}_{i=1}^N$, from a dataset $\mathcal{D}$. A common statistical example is finite mixture modelling. In the…

Computation · Statistics 2015-01-15 Brendon J. Brewer

In object tracking and state estimation problems, ambiguous evidence such as imprecise measurements and the absence of detections can contain valuable information and thus be leveraged to further refine the probabilistic belief state. In…

Signal Processing · Electrical Eng. & Systems 2023-05-23 Keith A. LeGrand , Silvia Ferrari

Mutual information (MI) is a fundamental measure of statistical dependence between two variables, yet accurate estimation from finite data remains notoriously difficult. No estimator is universally reliable, and common approaches fail in…

Data Analysis, Statistics and Probability · Physics 2025-10-02 Eslam Abdelaleem , K. Michael Martini , Ilya Nemenman

For better learning, large datasets are often split into small batches and fed sequentially to the predictive model. In this paper, we study such batch decompositions from a probabilistic perspective. We assume that data points (possibly…

Machine Learning · Computer Science 2025-04-10 Ghurumuruhan Ganesan

We propose novel methodology for testing equality of model parameters between two high-dimensional populations. The technique is very general and applicable to a wide range of models. The method is based on sample splitting: the data is…

Methodology · Statistics 2013-01-17 Nicolas Städler , Sach Mukherjee

In this paper, we study high-dimensional estimation from truncated samples. We focus on two fundamental and classical problems: (i) inference of sparse Gaussian graphical models and (ii) support recovery of sparse linear models. (i) For…

Machine Learning · Statistics 2020-06-18 Arnab Bhattacharyya , Rathin Desai , Sai Ganesh Nagarajan , Ioannis Panageas

We study the basic statistical problem of testing whether normally distributed $n$-dimensional data has been truncated, i.e. altered by only retaining points that lie in some unknown truncation set $S \subseteq \mathbb{R}^n$. As our main…

Data Structures and Algorithms · Computer Science 2024-11-25 Anindya De , Shivam Nadimpalli , Rocco A. Servedio