English
Related papers

Related papers: A Sharp Estimate for Probability Distributions

200 papers

We consider weak non-negative solutions to the stochastic partial differential equation \[ \partial_t Y(t,x) = \Delta Y(t,x) + Y(t,x)^\gamma \dot{L}(t,x), \] for $(t,x) \in \mathbb{R}_+ \times \mathbb{R}^d$, where $\gamma > 0$ and $\dot{L}$…

Probability · Mathematics 2025-08-12 Thomas Hughes

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

Statistics Theory · Mathematics 2011-10-17 Lutz Duembgen , Richard Samworth , Dominic Schuhmacher

Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…

Computational Complexity · Computer Science 2015-02-06 Dorothea Baumeister , Felix Brandt , Felix Fischer , Jan Hoffmann , Joerg Rothe

Here is one of the results obtained in this paper: Let $X, Y$ be two convex sets each in a real vector space, let $J:X\times Y\to {\bf R}$ be convex and without global minima in $X$ and concave in $Y$, and let $\Phi:X\to {\bf R}$ be…

Optimization and Control · Mathematics 2019-09-19 Biagio Ricceri

We demonstrate a phenomenon of condensation of the Fourier transform $\widehat{f}$ of a function $f$ defined on the real line $\mathbb{R}$ which decreases rapidly on one half of the line. For instance, we prove that if $f$ is…

Complex Variables · Mathematics 2023-11-28 Bartosz Malman

Given a set of probability measures $\mathcal{P}$ representing an agent's knowledge on the elements of a sigma-algebra $\mathcal{F}$, we can compute upper and lower bounds for the probability of any event $A\in\mathcal{F}$ of interest. A…

Statistics Theory · Mathematics 2023-05-09 Michele Caprio , Teddy Seidenfeld

Possibility and probability theories are alternative and complementary ways to deal with uncertainty, which has motivated over the last years an interest for the study of ways to transform probability distributions into possibility…

Other Statistics · Statistics 2020-01-03 Esteve del Acebo , Yousef Alizadeh-Q , Sayyed Ali Hossayni

In this paper, we propose a simple yet effective method to deal with the violation of the Closed-World Assumption for a classifier. Previous works tend to apply a threshold either on the classification scores or the loss function to reject…

Computer Vision and Pattern Recognition · Computer Science 2021-08-17 Saeed Bakhshi Germi , Esa Rahtu , Heikki Huttunen

For $\alpha >1$ we consider the initial value problem for the dispersive equation $i\partial_t u +(-\Delta)^{\alpha/2} u= 0$. We prove an endpoint $L^p$ inequality for the maximal function $\sup_{t\in[0,1]}|u(\cdot,t)|$ with initial values…

Classical Analysis and ODEs · Mathematics 2010-05-06 Keith M. Rogers , Andreas Seeger

A well-known conjecture in analytic number theory states that for every pair of sets $X,Y\subset\mathbb{Z}/p\mathbb{Z}$, each of size at least $\log ^C p$ (for some constant $C$) we have that the number of pairs $(x,y)\in X\times Y$ such…

Combinatorics · Mathematics 2015-12-18 Rudi Mrazović

The probability of false discovery proportion (FDP) exceeding $\gamma\in[0,1)$, defined as $\gamma$-FDP, has received much attention as a measure of false discoveries in multiple testing. Although this measure has received acceptance due to…

Statistics Theory · Mathematics 2014-06-03 Wenge Guo , Li He , Sanat K. Sarkar

We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…

Computational Complexity · Computer Science 2025-04-29 Markus Bläser , Julian Dörfler , Maciej Liśkiewicz , Benito van der Zander

Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiple random variables. The problem of efficient representation of probability distributions is central in term of…

Artificial Intelligence · Computer Science 2016-08-16 David Bellot , Pierre Bessiere

This paper proves, in very general settings, that convex risk minimization is a procedure to select a unique conditional probability model determined by the classification problem. Unlike most previous work, we give results that are general…

Machine Learning · Computer Science 2015-06-16 Matus Telgarsky , Miroslav Dudík , Robert Schapire

The aim of this paper is to provide several novel upper bounds on the excess risk with a primal focus on classification problems. We suggest two approaches and the obtained bounds are represented via the distribution dependent local…

Statistics Theory · Mathematics 2018-03-13 Nikita Zhivotovskiy

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

Under the assumption of the Riemann Hypothesis, the Linear Independence Hypothesis, and a bound on negative discrete moments of the Riemann zeta function, we prove the existence of a limiting logarithmic distribution of the normalisation of…

Number Theory · Mathematics 2013-01-14 Peter Humphries

In this paper we prove that a complete Riemannian manifold is $L^p$-positivity preserving for any $p\in(1,\infty)$. This means that any $L^p$ function which solves $(-\Delta + 1)u\ge 0$ in the sense of distributions is necessarily…

Analysis of PDEs · Mathematics 2023-01-16 Stefano Pigola , Giona Veronelli

On a compact group the Haar probability measure plays the role of uniform distribution. The entropy and rate distortion theory for this uniform distribution is studied. New results and simplified proofs on convergence of convolutions on…

Information Theory · Computer Science 2010-05-27 Peter Harremoes

Inspired by applications in weighted polynomial approximation problems, we study an optimal mass distribution problem. Given a gauge function $h$ and a positive "roof" function $R$ compactly supported in $\mathbb{R}^n$, we are interested in…

Classical Analysis and ODEs · Mathematics 2024-08-20 Linus Bergqvist , Bartosz Malman