English
Related papers

Related papers: On the Competitive Analysis and High Accuracy Opti…

200 papers

Estimating symmetric properties of a distribution, e.g. support size, coverage, entropy, distance to uniformity, are among the most fundamental problems in algorithmic statistics. While each of these properties have been studied extensively…

Data Structures and Algorithms · Computer Science 2019-05-22 Moses Charikar , Kirankumar Shiragur , Aaron Sidford

The advent of data science has spurred interest in estimating properties of distributions over large alphabets. Fundamental symmetric properties such as support size, support coverage, entropy, and proximity to uniformity, received most…

Information Theory · Computer Science 2016-11-29 Jayadev Acharya , Hirakendu Das , Alon Orlitsky , Ananda Theertha Suresh

We study three fundamental statistical-learning problems: distribution estimation, property estimation, and property testing. We establish the profile maximum likelihood (PML) estimator as the first unified sample-optimal approach to a wide…

Machine Learning · Statistics 2019-07-12 Yi Hao , Alon Orlitsky

We provide an efficient unified plug-in approach for estimating symmetric properties of distributions given $n$ independent samples. Our estimator is based on profile-maximum-likelihood (PML) and is sample optimal for estimating various…

Machine Learning · Statistics 2022-10-14 Moses Charikar , Zhihao Jiang , Kirankumar Shiragur , Aaron Sidford

In this paper we provide a new efficient algorithm for approximately computing the profile maximum likelihood (PML) distribution, a prominent quantity in symmetric property estimation. We provide an algorithm which matches the previous best…

Data Structures and Algorithms · Computer Science 2020-11-06 Nima Anari , Moses Charikar , Kirankumar Shiragur , Aaron Sidford

Recent years have witnessed the success of adaptive (or unified) approaches in estimating symmetric properties of discrete distributions, where one first obtains a distribution estimator independent of the target property, and then plugs…

Statistics Theory · Mathematics 2021-03-04 Yanjun Han

We propose an efficient algorithm for approximate computation of the profile maximum likelihood (PML), a variant of maximum likelihood maximizing the probability of observing a sufficient statistic rather than the empirical sample. The PML…

Machine Learning · Computer Science 2017-12-21 Dmitri S. Pavlichin , Jiantao Jiao , Tsachy Weissman

In this paper we consider the problem of computing the likelihood of the profile of a discrete distribution, i.e., the probability of observing the multiset of element frequencies, and computing a profile maximum likelihood (PML)…

Data Structures and Algorithms · Computer Science 2020-04-07 Nima Anari , Moses Charikar , Kirankumar Shiragur , Aaron Sidford

In this paper we provide a general framework for estimating symmetric properties of distributions from i.i.d. samples. For a broad class of symmetric properties we identify the easy region where empirical estimation works and the difficult…

Data Structures and Algorithms · Computer Science 2020-03-03 Moses Charikar , Kirankumar Shiragur , Aaron Sidford

Triangular distributions are a well-known class of distributions that are often used as elementary example of a probability model. In the past, enumeration and order statistic-based methods have been suggested for the maximum likelihood…

Computation · Statistics 2016-02-16 Hien D Nguyen , Geoffrey J McLachlan

We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…

Data Structures and Algorithms · Computer Science 2020-09-15 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , John Peebles , Eric Price

Score matching is an alternative to maximum likelihood (ML) for estimating a probability distribution parametrized up to a constant of proportionality. By fitting the ''score'' of the distribution, it sidesteps the need to compute this…

Machine Learning · Computer Science 2023-06-06 Chirag Pabbaraju , Dhruv Rohatgi , Anish Sevekari , Holden Lee , Ankur Moitra , Andrej Risteski

We consider the problem of estimating functionals of discrete distributions, and focus on tight nonasymptotic analysis of the worst case squared error risk of widely used estimators. We apply concentration inequalities to analyze the random…

Information Theory · Computer Science 2017-08-11 Jiantao Jiao , Kartik Venkat , Yanjun Han , Tsachy Weissman

Distributional regression aims to find the best candidate in a given parametric family of conditional distributions to model a given dataset. As each candidate in the distribution family can be identified by the corresponding distribution…

Statistics Theory · Mathematics 2026-05-18 Gitte Kremling , Gerhard Dikta

The consistency of the maximum likelihood estimator for mixtures of elliptically-symmetric distributions for estimating its population version is shown, where the underlying distribution $P$ is nonparametric and does not necessarily belong…

Statistics Theory · Mathematics 2024-10-14 Pietro Coretto , Christian Hennig

Consider a setting with $N$ independent individuals, each with an unknown parameter, $p_i \in [0, 1]$ drawn from some unknown distribution $P^\star$. After observing the outcomes of $t$ independent Bernoulli trials, i.e., $X_i \sim…

Statistics Theory · Mathematics 2019-02-13 Ramya Korlakai Vinayak , Weihao Kong , Gregory Valiant , Sham M. Kakade

A new maximum approximate likelihood (ML) estimation algorithm for the mixture of Kent distribution is proposed. The new algorithm is constructed via the BSLM (block successive lower-bound maximization) framework and incorporates manifold…

Computation · Statistics 2017-09-15 Hien D. Nguyen

The pattern maximum likelihood (PML) estimate, introduced by Orlitsky et al., is an estimate of the multiset of probabilities in an unknown probability distribution $\mathbf{p}$, the estimate being obtained from $n$ i.i.d. samples drawn…

Discrete Mathematics · Computer Science 2015-06-03 Chun Lam Chan , Winston Fernandes , Navin Kashyap , Manjunath Krishnapur

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

For a parametric model of distributions, the closest distribution in the model to the true distribution located outside the model is considered. Measuring the closeness between two distributions with the Kullback-Leibler (K-L) divergence,…

Statistics Theory · Mathematics 2025-10-14 Yo Sheena
‹ Prev 1 2 3 10 Next ›