English
Related papers

Related papers: Comments on the estimate for Pareto Distribution

200 papers

An important application of Lebesgue integral quadrature arXiv:1807.06007 is developed. Given two random processes, $f(x)$ and $g(x)$, two generalized eigenvalue problems can be formulated and solved. In addition to obtaining two Lebesgue…

Numerical Analysis · Mathematics 2020-12-01 Vladislav Gennadievich Malyshkin

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

The accessibility of spatially distributed data, enabled by affordable sensors, field, and numerical experiments, has facilitated the development of data-driven solutions for scientific problems, including climate change, weather…

Machine Learning · Computer Science 2023-11-09 Vardhan Dongre , Gurpreet Singh Hora

Maximum likelihood estimation (MLE) is a statistical method used to estimate the parameters of a probability distribution that best explain the observed data. In the context of text generation, MLE is often used to train generative language…

Computation and Language · Computer Science 2023-10-27 Chenze Shao , Zhengrui Ma , Min Zhang , Yang Feng

Transmutation is a technique for extending classical probability distributions in order to give them more flexibility. In this paper, we are interested in cubic transmutations of the Pareto distribution. We establish a general formula that…

Methodology · Statistics 2025-03-14 Edoh Katchekpele , Issa Cherif Geraldo , Tchilabalo Abozou Kpanzou

Product models of low dimensional experts are a powerful way to avoid the curse of dimensionality. We present the ``under-complete product of experts' (UPoE), where each expert models a one dimensional projection of the data. The UPoE is…

Machine Learning · Computer Science 2012-12-12 Max Welling , Richard S. Zemel , Geoffrey E. Hinton

We study integer-valued multiplicative dynamics driven by i.i.d. prime multipliers and connect their macroscopic statistics to universal codelengths. We introduce the Multiplicative Turing Ensemble (MTE) and show how it arises naturally -…

Information Theory · Computer Science 2025-10-20 Alexander Kolpakov , Aidan Rocke

We consider estimating the Shannon entropy of a discrete distribution $P$ from $n$ i.i.d. samples. Recently, Jiao, Venkat, Han, and Weissman, and Wu and Yang constructed approximation theoretic estimators that achieve the minimax $L_2$…

Information Theory · Computer Science 2019-01-03 Yanjun Han , Jiantao Jiao , Tsachy Weissman

We discover a theoretical connection between explanation estimation and distribution compression that significantly improves the approximation of feature attributions, importance, and effects. While the exact computation of various machine…

Machine Learning · Computer Science 2025-01-24 Hubert Baniecki , Giuseppe Casalicchio , Bernd Bischl , Przemyslaw Biecek

This paper is a sequel of the 2019 paper [5]. It demonstrates the following: a) the Poisson multi-Bernoulli mixture (PMBM) approach to detected vs. undetected (U/D) targets cannot be rigorously formulated using either the two-step or…

Methodology · Statistics 2025-01-22 Ronald Mahler

In mixtures-of-experts (ME) model, where a number of submodels (experts) are combined, there have been two longstanding problems: (i) how many experts should be chosen, given the size of the training data? (ii) given the total number of…

Statistics Theory · Mathematics 2011-11-02 Eduardo F. Mendes , Wenxin Jiang

We review various methods used to estimate uncertainties in quantum correlation functions, such as parton distribution functions (PDFs). Using a toy model of a PDF, we compare the uncertainty estimates yielded by the traditional Hessian and…

High Energy Physics - Phenomenology · Physics 2022-08-17 N. T. Hunt-Smith , A. Accardi , W. Melnitchouk , N. Sato , A. W. Thomas , M. J. White

In this paper, we study the probability density function, $\mathbb{P}(c,\alpha,\beta, n)\,dc$, of the center of mass of the finite $n$ Jacobi unitary ensembles with parameters $\alpha\,>-1$ and $\beta >-1$; that is the probability that…

Classical Analysis and ODEs · Mathematics 2024-09-24 Longjun Zhan , Gordon Blower , Yang Chen , Mengkun Zhu

According to standard econometric theory, Maximum Likelihood estimation (MLE) is the efficient estimation choice, however, it is not always a feasible one. In network diffusion models with unobserved signal propagation, MLE requires…

Econometrics · Economics 2023-09-06 L. S. Sanna Stephan

Under the condition of Karush-Kuhn-Tucker, the Pareto Set (PS) in the decision area of an m-objective optimization problem is a piecewise continuous (m-1)-D manifold. For illustrate the degree of convergence of the population, we employed…

Neural and Evolutionary Computing · Computer Science 2019-11-27 Abel Sa J. R Malano , Guanjun Du , Guoxiang Tong , Naixue Xiong

We present recent results of the NNPDF collaboration on a full DIS analysis of Parton Distribution Functions (PDFs). Our method is based on the idea of combining a Monte Carlo sampling of the probability measure in the space of PDFs with…

High Energy Physics - Phenomenology · Physics 2008-05-21 NNPDF Collaboration , M. Ubiali , R. D. Ball , L. Del Debbio , S. Forte , A. Guffanti , J. I. Latorre , A. Piccione , J. Rojo

A theoretical framework is developed to describe the transformation that distributes probability density functions uniformly over space. In one dimension, the cumulative distribution can be used, but does not generalize to higher…

Neural and Evolutionary Computing · Computer Science 2016-09-08 Eric Kee

When working with decomposition-based algorithms, an appropriate set of weights might improve quality of the final solution. A set of uniformly distributed weights usually leads to well-distributed solutions on a Pareto front. However,…

Neural and Evolutionary Computing · Computer Science 2020-03-26 Lucas R. C. de Farias , Pedro H. M. Braga , Hansenclever F. Bassani , Aluizio F. R. Araújo

Suppose we are given observations, where each observation is drawn independently from one of $k$ known distributions. The goal is to match each observation to the distribution from which it was drawn. We observe that the maximum likelihood…

Data Structures and Algorithms · Computer Science 2019-10-01 Sinho Chewi , Forest Yang , Avishek Ghosh , Abhay Parekh , Kannan Ramchandran

Estimators derived from a divergence criterion such as $\varphi-$divergences are generally more robust than the maximum likelihood ones. We are interested in particular in the so-called MD$\varphi$DE, an estimator built using a dual…

Computation · Statistics 2016-06-14 Diaa Al Mohamad , Michel Broniatowski
‹ Prev 1 4 5 6 7 8 10 Next ›