English
Related papers

Related papers: Locally minimax optimal confidence sets for the be…

200 papers

In this paper, we develop invariance-based procedures for testing and inference in high-dimensional regression models. These procedures, also known as randomization tests, provide several important advantages. First, for the global null…

Methodology · Statistics 2023-12-27 Wenxuan Guo , Panos Toulis

Under the null hypothesis, the marginal probability of the positive response is symmetric at any specified correlated coefficient, and the discordance probability is also symmetric to the positive response probability. The marginal…

Methodology · Statistics 2022-11-11 Guanghui Huang

We consider the problem of identifying, from its first $m$ noisy moments, a probability distribution on $[0,1]$ of support $k<\infty$. This is equivalent to the problem of learning a distribution on $m$ observable binary random variables…

Machine Learning · Computer Science 2020-09-08 Spencer Gordon , Bijan Mazaheri , Leonard J. Schulman , Yuval Rabani

In this paper, we consider asymptotics of the optimal value and the optimal solutions of parametric minimax estimation problems. Specifically, we consider estimators of the optimal value and the optimal solutions in a sample minimax problem…

Statistics Theory · Mathematics 2025-04-16 Mika Meitz , Alexander Shapiro

High-dimensional statistical inference with general estimating equations are challenging and remain less explored. In this paper, we study two problems in the area: confidence set estimation for multiple components of the model parameters,…

Methodology · Statistics 2021-04-28 Jinyuan Chang , Song Xi Chen , Cheng Yong Tang , Tong Tong Wu

We consider the problem of estimating a $d$-dimensional discrete distribution from its samples observed under a $b$-bit communication constraint. In contrast to most previous results that largely focus on the global minimax error, we study…

Information Theory · Computer Science 2021-11-02 Wei-Ning Chen , Peter Kairouz , Ayfer Özgür

The problem of quickest detection of a change in the mean of a sequence of independent observations is studied. The pre-change distribution is assumed to be stationary, while the post-change distributions are allowed to be non-stationary.…

Signal Processing · Electrical Eng. & Systems 2021-08-26 Yuchen Liang , Venugopal V. Veeravalli

Robust mean estimation is the problem of estimating the mean $\mu \in \mathbb{R}^d$ of a $d$-dimensional distribution $D$ from a list of independent samples, an $\epsilon$-fraction of which have been arbitrarily corrupted by a malicious…

Computational Complexity · Computer Science 2019-06-05 Samuel B. Hopkins , Jerry Li

We consider the problem of finding the maximum of $\mathbb{E}_{\nu}[f(X)]$ where $\nu$ is allowed to vary over all the probability measures on a Polish space $S$ for which $d_c(\mu,\nu)\leq \theta$, in which $d_c$ is an optimal transport…

Probability · Mathematics 2023-05-05 Gusti van Zyl

We make two closely related theoretical contributions to the use of importance sampling schemes. First, for independent sampling, we prove that the minimax optimal trial distribution coincides with the target if and only if the target…

Computation · Statistics 2025-06-25 Quan Zhou

In this correspondence, we introduce a minimax regret criteria to the least squares problems with bounded data uncertainties and solve it using semi-definite programming. We investigate a robust minimax least squares approach that minimizes…

Systems and Control · Computer Science 2012-03-20 Nargiz Kalantarova , Mehmet A. Donmez , Suleyman S. Kozat

In the common time series model $X_{i,n} = \mu (i/n) + \varepsilon_{i,n}$ with non-stationary errors we consider the problem of detecting a significant deviation of the mean function $\mu$ from a benchmark $g (\mu )$ (such as the initial…

Statistics Theory · Mathematics 2020-05-25 Holger Dette , Florian Heinrichs

We consider the problem of closeness testing for two discrete distributions in the practically relevant setting of \emph{unequal} sized samples drawn from each of them. Specifically, given a target error parameter $\varepsilon > 0$, $m_1$…

Machine Learning · Computer Science 2015-04-20 Bhaswar B. Bhattacharya , Gregory Valiant

This paper presents how to perform minimax optimal classification, regression, and density estimation based on fixed-$k$ nearest neighbor (NN) searches. We consider a distributed learning scenario, in which a massive dataset is split into…

Statistics Theory · Mathematics 2024-09-11 J. Jon Ryu , Young-Han Kim

Lack-of-fit testing of a regression model with Berkson measurement error has not been discussed in the literature to date. To fill this void, we propose a class of tests based on minimized integrated square distances between a nonparametric…

Statistics Theory · Mathematics 2009-03-02 Hira L. Koul , Weixing Song

This paper develops a novel unified framework for testing mutual independence among random objects residing in possibly different metric spaces. The framework generalizes existing methodologies and introduces new measures of mutual…

Methodology · Statistics 2025-10-22 Yaqing Chen , Paromita Dubey

We present the first method for assessing the relevance of a model-based clustering result in a general framework. Standard validation criteria, like the adjusted Rand index, rely on external labels to assess partition accuracy;…

Statistics Theory · Mathematics 2026-03-30 Salima El Kolei , Matthieu Marbac

The minimax risk is often considered as a gold standard against which we can compare specific statistical procedures. Nevertheless, as has been observed recently in robust and heavy-tailed estimation problems, the inherent reduction of the…

Statistics Theory · Mathematics 2024-07-08 Tianyi Ma , Kabir A. Verchand , Richard J. Samworth

Given a set of incomplete observations, we study the nonparametric problem of testing whether data are Missing Completely At Random (MCAR). Our first contribution is to characterise precisely the set of alternatives that can be…

Statistics Theory · Mathematics 2022-05-19 Thomas B Berrett , Richard J Samworth

This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-12-25 Amos Korman , Shay Kutten , Toshimitsu Masuzawa