activity
20202025
most citedInversion of Bayesian Networks

1 citations · 3 across the 11 of their papers we have counts for

collaborators

11 papers

math.FA2025

Sharp Quantitative Stability for the Prékopa-Leindler and Borell-Brascamp-Lieb Inequalities

Alessio Figalli, Peter van Hintum, Marius Tiba

The Borell-Brascamp-Lieb inequality is a classical extension of the Prékopa-Leindler inequality, which in turn is a functional counterpart of the Brunn-Minkowski inequality. The st…

math.AP2024

Sharp stability of the Brunn-Minkowski inequality via optimal mass transportation

Alessio Figalli, Peter van Hintum, Marius Tiba

The Brunn-Minkowski inequality, applicable to bounded measurable sets and in , states that . Equality is achieved if and…

math.AP2023

Sharp quantitative stability of the Brunn-Minkowski inequality

Alessio Figalli, Peter van Hintum, Marius Tiba

The Brunn-Minkowski inequality states that for bounded measurable sets and in , we have . Also, equality holds if and on…

math.CO2023

Sharp bounds for the Tao-Vu Discrete John's Theorem

Peter van Hintum, Peter Keevash

Tao and Vu showed that every centrally symmetric convex progression is contained in a generalised arithmetic progression of size . Berg and…

math.CO2023★ 1 cited

On Ruzsa's discrete Brunn-Minkowski conjecture

Peter van Hintum, Peter Keevash, Marius Tiba

We prove a conjecture by Ruzsa from 2006 on a discrete version of the Brunn-Minkowski inequality, stating that for any and with not contained in…

math.MG2023

The sharp doubling threshold for approximate convexity

Peter van Hintum, Peter Keevash

We show for of equal volume and that if , then (up to translation) is bounded. This esta…

math.CO2023

Locality in Sumsets

Peter van Hintum, Peter Keevash

Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with applications to John-type approximation and sets with small doubling. F…

cs.LG2022★ 1 cited

Inversion of Bayesian Networks

Jesse van Oostrum, Peter van Hintum, Nihat Ay

Variational autoencoders and Helmholtz machines use a recognition network (encoder) to approximate the posterior distribution of a generative model (decoder). In this paper we stud…

math.MG2022

Towards Hadwiger's conjecture via Bourgain Slicing

Marcelo Campos, Peter van Hintum, Robert Morris +1

In 1957, Hadwiger conjectured that every convex body in can be covered by translates of its interior. For over 60 years, the best known bound was of the form $…

math.FA2020★ 1 cited

Sharp L1 Inequalities for Sup-Convolution

Peter van Hintum, Hunter Spink, Marius Tiba

Given a compact convex domain and bounded measurable functions , define the sup-convolution t…

math.NT2020

Sets in with doubling are near convex progressions

Peter van Hintum, Hunter Spink, Marius Tiba

For sufficiently small and with , we show either is covered by parallel hyperplanes, or satisfies $|\widehat{\operat…