Related papers: Mean field approximations via log-concavity
Given a probability measure $\mu $ on ${\mathbb R}^n$, Tukey's half-space depth is defined for any $x\in {\mathbb R}^n$ by $\varphi_{\mu }(x)=\inf\{\mu (H):H\in {\cal H}(x)\}$, where ${\cal H}(x)$ is the set of all half-spaces $H$ of…
The optimal transport map between the standard Gaussian measure and an $\alpha$-strongly log-concave probability measure is $\alpha^{-1/2}$-Lipschitz, as first observed in a celebrated theorem of Caffarelli. In this paper, we apply two…
Langevin dynamics has found a large number of applications in sampling, optimization and estimation. Preconditioning the gradient in the dynamics with the covariance - an idea that originated in literature related to solving estimation and…
The standard formulation of the PDE system of Mean Field Games (MFG) requires the differentiability of the Hamiltonian. However in many cases, the structure of the underlying optimal problem leads to a convex but nondifferentiable…
Variable selection for a multiple regression model (Noisy Linear Perceptron) is studied with a mean field approximation. In our Bayesian framework, variable selection is formulated as estimation of discrete parameters that indicate a subset…
We present theoretical properties of the log-concave maximum likelihood estimator of a density based on an independent and identically distributed sample in $\mathbb{R}^d$. Our study covers both the case where the true underlying density is…
In this paper we establish some explicit and sharp estimates of the spectral gap and the log-Sobolev constant for mean field particles system, uniform in the number of particles, when the confinement potential have many local minimums. Our…
We consider nonparametric maximum-likelihood estimation of a log-concave density in case of interval-censored, right-censored and binned data. We allow for the possibility of a subprobability density with an additional mass at $+\infty$,…
Combinatorial optimization problems are pivotal across many fields. Among these, Quadratic Unconstrained Binary Optimization (QUBO) problems, central to fields like portfolio optimization, network design, and computational biology, are…
We propose a unified framework for likelihood-based regression modeling when the response variable has finite support. Our work is motivated by the fact that, in practice, observed data are discrete and bounded. The proposed methods assume…
In this paper, we use the semi-group method and an adaptation of the $L^2-$method of H\"ormander to establish some $\Phi-$entropy inequalities and asymmetric covariance estimates for the strictly convex measures in $\mathbb R^n$. These…
Quantization for probability distributions refers broadly to estimating a given probability measure by a discrete probability measure supported by a finite number of points. We consider general geometric approaches to quantization using…
We derive explicit bounds for the computation of normalizing constants $Z$ for log-concave densities $\pi = \exp(-U)/Z$ with respect to the Lebesgue measure on $\mathbb{R}^d$. Our approach relies on a Gaussian annealing combined with recent…
Motivated, in part, by the desire to develop an information-theoretic foundation for compound Poisson approximation limit theorems (analogous to the corresponding developments for the central limit theorem and for simple Poisson…
We consider the problem of optimizing an approximately convex function over a bounded convex set in $\mathbb{R}^n$ using only function evaluations. The problem is reduced to sampling from an \emph{approximately} log-concave distribution…
The process of protein synthesis in biological systems resembles a one dimensional driven lattice gas in which the particles (ribosomes) have spatial extent, covering more than one lattice site. Realistic, nonuniform gene sequences lead to…
The log-concave maximum likelihood estimator (MLE) problem answers: for a set of points $X_1,...X_n \in \mathbb R^d$, which log-concave density maximizes their likelihood? We present a characterization of the log-concave MLE that leads to…
Suppose that $\ff \in \reals^{n}$ is a vector of $n$ error-contaminated measurements of $n$ smooth values measured at distinct and strictly ascending abscissae. The following projective technique is proposed for obtaining a vector of smooth…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood and Laplace approximation. In…