English
Related papers

Related papers: Optimal disclosure risk assessment

200 papers

In nonlinear deterministic parameter estimation, the maximum likelihood estimator (MLE) is unable to attain the Cramer-Rao lower bound at low and medium signal-to-noise ratios (SNR) due the threshold and ambiguity phenomena. In order to…

Applications · Statistics 2015-06-19 Achraf Mallat , Sinan Gezici , Davide Dardari , Christophe Craeye , Luc Vandendorpe

For nonparametric regression with one-sided errors and a boundary curve model for Poisson point processes we consider the problem of efficient estimation for linear functionals. The minimax optimal rate is obtained by an unbiased estimation…

Statistics Theory · Mathematics 2015-09-25 Markus Reiß , Leonie Selk

Estimating the unknown number of classes in a population has numerous important applications. In a Poisson mixture model, the problem is reduced to estimating the odds that a class is undetected in a sample. The discontinuity of the odds…

Statistics Theory · Mathematics 2007-08-22 Chang Xuan Mao , Bruce G. Lindsay

Consider a data publishing setting for a dataset composed by both private and non-private features. The publisher uses an empirical distribution, estimated from $n$ i.i.d. samples, to design a privacy mechanism which is applied to new fresh…

Information Theory · Computer Science 2020-03-23 Mario Diaz , Hao Wang , Flavio P. Calmon , Lalitha Sankar

Given an implicit $n\times n$ matrix $A$ with oracle access $x^TA x$ for any $x\in \mathbb{R}^n$, we study the query complexity of randomized algorithms for estimating the trace of the matrix. This problem has many applications in quantum…

Computational Complexity · Computer Science 2014-05-29 Karl Wimmer , Yi Wu , Peng Zhang

We present \textit{universal} estimators for the statistical mean, variance, and scale (in particular, the interquartile range) under pure differential privacy. These estimators are universal in the sense that they work on an arbitrary,…

Cryptography and Security · Computer Science 2023-04-04 Wei Dong , Ke Yi

Abundance estimation from capture-recapture data is of great importance in many disciplines. Analysis of capture-recapture data is often complicated by the existence of one-inflation and heterogeneity problems. Simultaneously taking these…

Methodology · Statistics 2025-07-15 Yang Liu , Pengfei Li , Yukun Liu , Riquan Zhang

While a broad range of techniques have been proposed to tackle distribution shift, the simple baseline of training on an $\textit{undersampled}$ balanced dataset often achieves close to state-of-the-art-accuracy across several popular…

Machine Learning · Computer Science 2023-06-21 Niladri S. Chatterji , Saminul Haque , Tatsunori Hashimoto

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal

Objectives: Estimation of areas under receiver operating characteristic curves (AUCs) and their differences is a key task in diagnostic studies. We aimed to derive, evaluate, and implement simple sample size formulas for such studies with a…

Methodology · Statistics 2022-08-03 Di Shu , Guangyong Zou

Constructing valid inferential methods for constrained parameters in normal and Poisson distributions represents two fundamental and important problems in applied statistics, for which there is currently no unified framework for statistical…

Methodology · Statistics 2026-04-13 Hezhi Lu , Qijun Wu

Let $S$ be a finite set, and $X_1,\ldots,X_n$ an i.i.d. uniform sample from $S$. To estimate the size $|S|$, without further structure, one can wait for repeats and use the birthday problem. This requires a sample size of the order…

Statistics Theory · Mathematics 2026-04-28 Sourav Chatterjee , Persi Diaconis , Susan Holmes

We consider the privacy amplification properties of a sampling scheme in which a user's data is used in k steps chosen randomly and uniformly from a sequence (or set) of t steps. This sampling scheme has been recently applied in the context…

Machine Learning · Computer Science 2026-01-16 Vitaly Feldman , Moshe Shenfeld

This paper focuses on nonparametric statistical inference of the hazard rate function of discrete distributions based on $\delta$-record data. We derive the explicit expression of the maximum likelihood estimator and determine its exact…

Statistics Theory · Mathematics 2025-04-03 Martín Alcalde , Miguel Lafuente , F. Javier López , Lina Maldonado , Gerardo Sanz

Missing values arise in most real-world data sets due to the aggregation of multiple sources and intrinsically missing information (sensor failure, unanswered questions in surveys...). In fact, the very nature of missing values usually…

Machine Learning · Statistics 2022-02-04 Alexis Ayme , Claire Boyer , Aymeric Dieuleveut , Erwan Scornet

We consider the problem of computing tight privacy guarantees for the composition of subsampled differentially private mechanisms. Recent algorithms can numerically compute the privacy parameters to arbitrary precision but must be carefully…

Cryptography and Security · Computer Science 2025-04-09 Christian Janos Lebeda , Matthew Regehr , Gautam Kamath , Thomas Steinke

Identifying anomalies and contamination in datasets is important in a wide variety of settings. In this paper, we describe a new technique for estimating contamination in large, discrete valued datasets. Our approach considers the normal…

Information Theory · Computer Science 2015-06-16 Matthew L. Malloy , Scott Alfeld , Paul Barford

The effective sample size (ESS) measures the informational value of a probability distribution in terms of an equivalent number of study participants. The ESS plays a crucial role in estimating the Expected Value of Sample Information…

Methodology · Statistics 2024-01-31 Linke Li , Hawre Jalal , Anna Heath

A fundamental issue in real-world systems, such as sensor networks, is the selection of observations which most effectively reduce uncertainty. More specifically, we address the long standing problem of nonmyopically selecting the most…

Artificial Intelligence · Computer Science 2012-07-09 Andreas Krause , Carlos E. Guestrin

Importance sampling with data-driven proposal distributions is widely used in practice. A common workflow first generates an auxiliary sample of size $N$ from an approximation of the target distribution, constructs a density estimate $\hat…

Statistics Theory · Mathematics 2026-05-20 Cathrine Aeckerle-Willems , Ilja Klebanov , Simon Weissmann
‹ Prev 1 3 4 5 6 7 10 Next ›