English
Related papers

Related papers: Distribution Testing Meets Sum Estimation

200 papers

The goal of this paper is to provide some tools for nonparametric estimation and inference in psychological and economic experiments. We consider an experimental framework in which each of $n$subjects provides $T$ responses to a vector of…

Econometrics · Economics 2019-12-10 Raffaello Seri , Samuele Centorrino , Michele Bernasconi

Transfer learning has achieved promising results by leveraging knowledge from the source domain to annotate the target domain which has few or none labels. Existing methods often seek to minimize the distribution divergence between domains,…

Machine Learning · Computer Science 2018-07-03 Jindong Wang , Yiqiang Chen , Shuji Hao , Wenjie Feng , Zhiqi Shen

A classical problem in random number generation is the sampling of elements from a given discrete distribution. Formally, given a set of indices $S = \{1, \dots, n\}$ and sequence of weights $w_1, \dots, w_n \in \mathbb{R}^+$, the task is…

Data Structures and Algorithms · Computer Science 2023-10-19 Daniel Allendorf

It has historically been a challenge to perform Bayesian inference in a design-based survey context. The present paper develops a Bayesian model for sampling inference in the presence of inverse-probability weights. We use a hierarchical…

Methodology · Statistics 2020-06-24 Yajuan Si , Natesh S. Pillai , Andrew Gelman

Consider two problems about an unknown probability distribution $p$: 1. How many samples from $p$ are required to test if $p$ is supported on $n$ elements or not? Specifically, given samples from $p$, determine whether it is supported on at…

Data Structures and Algorithms · Computer Science 2026-05-27 Renato Ferreira Pinto , Nathaniel Harms

Particle filtering is used to compute good nonlinear estimates of complex systems. It samples trajectories from a chosen distribution and computes the estimate as a weighted average. Easy-to-sample distributions often lead to degenerate…

Machine Learning · Computer Science 2021-10-07 Fernando Gama , Nicolas Zilberstein , Richard G. Baraniuk , Santiago Segarra

A default assumption in many machine learning scenarios is that the training and test samples are drawn from the same probability distribution. However, such an assumption is often violated in the real world due to non-stationarity of the…

Machine Learning · Computer Science 2021-05-04 Tianyi Zhang , Ikko Yamane , Nan Lu , Masashi Sugiyama

We propose a unified mixture sampler (UMS) that provides a universal estimation framework for nonlinear state-space models with "exp-exp" likelihood kernels. Unlike existing methods that require deriving new mixture approximations for each…

Methodology · Statistics 2026-04-07 Daichi Hiraki , Yasuhiro Omori

We consider the problem of assigning weights to a set of samples or data records, with the goal of achieving a representative weighting, which happens when certain sample averages of the data are close to prescribed values. We frame the…

Machine Learning · Statistics 2020-05-20 Shane Barratt , Guillermo Angeris , Stephen Boyd

In this paper, we study the Dynamic Parameterized Subset Sampling (DPSS) problem in the Word RAM model. In DPSS, the input is a set,~$S$, of~$n$ items, where each item,~$x$, has a non-negative integer weight,~$w(x)$. Given a pair of query…

Data Structures and Algorithms · Computer Science 2024-09-27 Junhao Gan , Seeun William Umboh , Hanzhi Wang , Anthony Wirth , Zhuo Zhang

In this work, we present a new random sampling method for data streams where the probability of an element's inclusion in the sample is proportional to a weight associated with that element. Our method is based on sampling with replacement,…

Data Structures and Algorithms · Computer Science 2026-03-18 Adriano Meligrana , Adriano Fazzone

In this paper, we consider the problem of noiseless non-adaptive group testing under the for-each recovery guarantee, also known as probabilistic group testing. In the case of $n$ items and $k$ defectives, we provide an algorithm attaining…

Information Theory · Computer Science 2020-06-19 Eric Price , Jonathan Scarlett

We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved…

Data Structures and Algorithms · Computer Science 2017-11-21 Samuel B. Hopkins , Jerry Li

We consider a novel challenge: approximating a distribution without the ability to randomly sample from that distribution. We study how such an approximation can be obtained using *weight queries*. Given some data set of examples, a weight…

Machine Learning · Computer Science 2021-07-15 Nadav Barak , Sivan Sabato

Missing data is an universal problem in statistics. We develop a unified framework for estimating parameters defined by general estimating equations under a missing-at-random (MAR) mechanism, based on generalized entropy calibration…

Methodology · Statistics 2026-03-31 Mst Moushumi Pervin , Hengfang Wang , Jae Kwang Kim

We study the matrix completion problem when the observation pattern is deterministic and possibly non-uniform. We propose a simple and efficient debiased projection scheme for recovery from noisy observations and analyze the error under a…

Information Theory · Computer Science 2019-10-31 Simon Foucart , Deanna Needell , Reese Pathak , Yaniv Plan , Mary Wootters

We observe $n$ pairs of independent (but not necessarily i.i.d.) random variables $X_{1}=(W_{1},Y_{1}),\ldots,X_{n}=(W_{n},Y_{n})$ and tackle the problem of estimating the conditional distributions $Q_{i}^{\star}(w_{i})$ of $Y_{i}$ given…

Statistics Theory · Mathematics 2022-07-07 Yannick Baraud , Juntong Chen

We present large sample results for partitioning-based least squares nonparametric regression, a popular method for approximating conditional expectation functions in statistics, econometrics, and machine learning. First, we obtain a…

Statistics Theory · Mathematics 2020-07-20 Matias D. Cattaneo , Max H. Farrell , Yingjie Feng

This paper concerns estimating a probability density function $f$ based on iid observations from $g(x)=W^{-1} w(x) f(x)$, where the weight function $w$ and the total weight $W=\int w(x) f(x) dx$ may not be known. The length-biased and…

Statistics Theory · Mathematics 2007-06-13 Robert M. Mnatsakanov , Frits H. Ruymgaart

We introduce a nonparametric spectral density estimator for continuous-time and continuous-space processes measured at fully irregular locations. Our estimator is constructed using a weighted nonuniform Fourier sum whose weights yield a…

Methodology · Statistics 2025-10-07 Christopher J. Geoga , Paul G. Beckman