English
Related papers

Related papers: Exact Computation of Minimum Sample Size for Estim…

200 papers

We consider parameter estimation in distributed networks, where each sensor in the network observes an independent sample from an underlying distribution and has $k$ bits to communicate its sample to a centralized processor which computes…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-23 Yanjun Han , Ayfer Özgür , Tsachy Weissman

A new maximum likelihood method for deconvoluting a continuous density with a positive lower bound on a known compact support in additive measurement error models with known error distribution using the approximate Bernstein type polynomial…

Methodology · Statistics 2018-01-30 Zhong Guan

In this paper, we develop efficient randomized algorithms for estimating probabilistic robustness margin and constructing robustness degradation curve for uncertain dynamic systems. One remarkable feature of these algorithms is their…

Optimization and Control · Mathematics 2008-05-13 Xinjia Chen , Kemin Zhou , Jorge L. Aravena

I present a critical review of techniques for estimating confidence intervals on binomial population proportions inferred from success counts in small-to-intermediate samples. Population proportions arise frequently as quantities of…

Instrumentation and Methods for Astrophysics · Physics 2015-05-20 Ewan Cameron

Statistical samples, in order to be representative, have to be drawn from a population in a random and unbiased way. Nevertheless, it is common practice in the field of model-based diagnosis to make estimations from (biased) best-first…

Artificial Intelligence · Computer Science 2022-08-05 Patrick Rodler , Fatima Elichanova

In this paper, we address the probabilistic error quantification of a general class of prediction methods. We consider a given prediction model and show how to obtain, through a sample-based approach, a probabilistic upper bound on the…

Statistics Theory · Mathematics 2021-06-07 Victor Mirasierra , Martina Mammarella , Fabrizio Dabbene , Teodoro Alamo

We consider the problem of approximating an unknown function from point evaluations. This problem is a crucial subproblem in many modern (nonlinear) approximation schemes. When obtaining these point evaluations is costly, minimising the…

Numerical Analysis · Mathematics 2025-12-03 Philipp Trunschke , Anthony Nouy

For many tasks of data analysis, we may only have the information of the explanatory variable and the evaluation of the response values are quite expensive. While it is impractical or too costly to obtain the responses of all units, a…

Computation · Statistics 2023-04-07 Wei Zheng , Ting Tian , Xueqin Wang

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

Information Theory · Computer Science 2023-05-17 Ioannis Papoutsidakis , Angela Doufexi , Robert J. Piechocki

We consider a linear regression model, with the parameter of interest a specified linear combination of the regression parameter vector. We suppose that, as a first step, a data-based model selection (e.g. by preliminary hypothesis tests or…

Statistics Theory · Mathematics 2011-09-27 Paul Kabaila , Khageswor Giri

A reasonable confidence interval should have a confidence coefficient no less than the given nominal level and a small expected length to reliably and accurately estimate the parameter of interest, and the bootstrap interval is considered…

Statistics Theory · Mathematics 2024-02-15 Weizhen Wang , Chongxiu Yu , Zhongzhan Zhang

Experimental comparisons of performance represent an important aspect of research on optimization algorithms. In this work we present a methodology for defining the required sample sizes for designing experiments with desired statistical…

Neural and Evolutionary Computing · Computer Science 2018-10-16 Felipe Campelo , Fernanda Takahashi

Sample complexity of bias estimation is a lower bound on the runtime of any bias detection method. Many regulatory frameworks require the bias to be tested for all subgroups, whose number grows exponentially with the number of protected…

Machine Learning · Computer Science 2025-02-06 German Martinez Matilla , Jakub Marecek

Minimum Bayes-risk (MBR) decoding has recently gained renewed attention in text generation. MBR decoding considers texts sampled from a model as pseudo-references and selects the text with the highest similarity to the others. Therefore,…

Computation and Language · Computer Science 2024-04-02 Atsumoto Ohashi , Ukyo Honda , Tetsuro Morimura , Yuu Jinnai

The basic idea of importance sampling is to use independent samples from a proposal measure in order to approximate expectations with respect to a target measure. It is key to understand how many samples are required in order to guarantee…

Computation · Statistics 2017-01-17 S. Agapiou , O. Papaspiliopoulos , D. Sanz-Alonso , A. M. Stuart

Estimating prevalence, the fraction of a population with a certain medical condition, is fundamental to epidemiology. Traditional methods rely on classification of test samples taken at random from a population. Such approaches to…

Methodology · Statistics 2022-03-25 Paul Patrone , Anthony Kearsley

While conformal predictors reap the benefits of rigorous statistical guarantees on their error frequency, the size of their corresponding prediction sets is critical to their practical utility. Unfortunately, there is currently a lack of…

Machine Learning · Statistics 2024-03-12 Guneet S. Dhillon , George Deligiannidis , Tom Rainforth

When developing a clinical prediction model, the sample size of the development dataset is a key consideration. Small sample sizes lead to greater concerns of overfitting, instability, poor performance and lack of fairness. Previous…

Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…

Information Theory · Computer Science 2007-07-13 Thomas Holenstein , Renato Renner

In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intractable for exact algorithms because of the large number of…

Artificial Intelligence · Computer Science 2012-12-12 David Ephraim Larkin