English
Related papers

Related papers: On measures strongly log-concave on a subspace

200 papers

A key task in Bayesian machine learning is sampling from distributions that are only specified up to a partition function (i.e., constant of proportionality). One prevalent example of this is sampling posteriors in parametric distributions,…

Machine Learning · Computer Science 2020-09-10 Rong Ge , Holden Lee , Andrej Risteski

Results of experimental study of the weak localization phenomenon in 2D system with artificial inhomogeneity of potential relief are presented. It is shown that the shape of the magnetoconductivity curve is determined by the statistics of…

Disordered Systems and Neural Networks · Physics 2008-12-02 G. M. Minkov , A. A. Sherstobitov , A. V. Germanenko , O. E. Rut

By using asymptotic Morse inequalities we give a lower bound for the space of holomorphic sections of high tensor powers in a positive line bundle over a q-concave domain. The curvature of the positive bundle induces a hermitian metric on…

Complex Variables · Mathematics 2016-12-30 George Marinescu

It is well-known that the cross covariogram of two convex bodies in n dimensions is 1/n-concave on its support. This paper provides conditions for strict 1/n-concavity in dimension n>1, and an analysis of how it can fail. Among the…

Metric Geometry · Mathematics 2025-08-07 Gabriele Bianchi , Almut Burchard , Lawrence Lin

We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…

Numerical Analysis · Mathematics 2019-02-05 Frédéric de Gournay , Jonas Kahn , Léo Lebrat , Pierre Weiss

We study the problem of approximate sampling from non-log-concave distributions, e.g., Gaussian mixtures, which is often challenging even in low dimensions due to their multimodality. We focus on performing this task via Markov chain Monte…

Machine Learning · Statistics 2024-05-30 Tim Tsz-Kit Lau , Han Liu , Thomas Pock

Subgradient methods converge linearly on a convex function that grows sharply away from its solution set. In this work, we show that the same is true for sharp functions that are only weakly convex, provided that the subgradient methods are…

Optimization and Control · Mathematics 2018-03-08 Damek Davis , Dmitriy Drusvyatskiy , Kellie J. MacPhee , Courtney Paquette

We extend the Langevin Monte Carlo (LMC) algorithm to compactly supported measures via a projection step, akin to projected Stochastic Gradient Descent (SGD). We show that (projected) LMC allows to sample in polynomial time from a…

Probability · Mathematics 2016-08-08 Sébastien Bubeck , Ronen Eldan , Joseph Lehec

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…

Statistics Theory · Mathematics 2009-09-01 Madeleine Cule , Richard Samworth

We study the compactness problem for moduli spaces of holomorphic supercurves which, being motivated by supergeometry, are perturbed such as to allow for transversality. We give an explicit construction of limiting objects for sequences of…

Symplectic Geometry · Mathematics 2015-02-24 Josua Groeger

Sampling from log-concave distributions is a well researched problem that has many applications in statistics and machine learning. We study the distributions of the form $p^{*}\propto\exp(-f(x))$, where…

Machine Learning · Computer Science 2019-09-13 Ruoqi Shen , Yin Tat Lee

I summarize Bagnoli and Bergstrom (2005)'s review on log-concave functions, make several corrections, and augment the discussion with further results that can be useful in obtaining monotone hazard rate. I also provide an application of…

Theoretical Economics · Economics 2025-12-17 Dihan Zou

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

Cryptography and Security · Computer Science 2007-12-27 Andreas Enge

We consider the class univalent log-harmonic mappings on the unit disk. Firstly, we obtain necessary and sufficient conditions for a complex-valued continuous function to be starlike or convex in the unit disk. Then we present a general…

Complex Variables · Mathematics 2019-05-28 ZhiHong Liu , Saminathan Ponnusamy

The integral with respect to a multidimensional stochastic measure, for which we assume only $\sigma$-additivity in probability, is studied. The continuity and differentiability of its realizations are established.

Probability · Mathematics 2024-07-23 Boris Manikin , Vadym Radchenko

Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling…

Computational Complexity · Computer Science 2013-09-05 Zeyu Guo

We consider two methods to establish log-Sobolev inequalities for the invariant measure of a diffusion process when its density is not explicit and the curvature is not positive everywhere. In the first approach, based on the Holley-Stroock…

Probability · Mathematics 2025-03-25 Pierre Monmarché , Songbo Wang

It is well known that if a random vector satisfies a log-Sobolev inequality, all of its marginals have subgaussian tails. In the spirit of the KLS conjecture, we investigate whether this implication can be reversed under a log-concavity…

Functional Analysis · Mathematics 2026-02-17 Pierre Bizeul

On the class of log-concave functions on $\R^n$, endowed with a suitable algebraic structure, we study the first variation of the total mass functional, which corresponds to the volume of convex bodies when restricted to the subclass of…

Functional Analysis · Mathematics 2011-12-22 Andrea Colesanti , Ilaria Fragala'

We derive two-sided bounds for moments of linear combinations of coordinates od unconditional log-concave vectors. We also investigate how well moments of such combinations may be approximated by moments of Gaussian random variables.

Probability · Mathematics 2015-01-06 Rafał Latała
‹ Prev 1 4 5 6 7 8 10 Next ›