English
Related papers

Related papers: Random multifunctions as the set minimizers of inf…

200 papers

Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable…

Differential Geometry · Mathematics 2013-07-02 Yuliy Baryshnikov , Robert Ghrist , Matthew Wright

Graphical models trained using maximum likelihood are a common tool for probabilistic inference of marginal distributions. However, this approach suffers difficulties when either the inference process or the model is approximate. In this…

Machine Learning · Computer Science 2012-06-18 Justin Domke

We study the approximation of functions which are invariant with respect to certain permutations of the input indices using flow maps of dynamical systems. Such invariant functions includes the much studied translation-invariant ones…

Machine Learning · Computer Science 2022-08-19 Qianxiao Li , Ting Lin , Zuowei Shen

In this paper, we consider functionals of the form $H_\alpha(u)=F(u)+\alpha G(u)$ with $\alpha\in[0,+\infty)$, where $u$ varies in a set $U\neq\emptyset$ (without further structure). We first revisit a result stating that, excluding at most…

Optimization and Control · Mathematics 2025-01-28 Massimo Fornasier , Jona Klemenc , Alessandro Scagliotti

Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…

Optimization and Control · Mathematics 2009-12-17 Tim Netzer

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

Optimization and Control · Mathematics 2015-04-13 Amos Uderzo

In a recent paper, Basu, Hildebrand, and Molinaro established that the set of continuous minimal functions for the 1-dimensional Gomory-Johnson infinite group relaxation possesses a dense subset of extreme functions. The $n$-dimensional…

Optimization and Control · Mathematics 2017-08-16 Teresa M. Lebair , Amitabh Basu

A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…

Probability · Mathematics 2023-07-04 Yue Liu

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

We prove partial regularity of stationary solutions and minimizers $u$ from a set $\Omega\subset \mathbb R^n$ to a Riemannian manifold $N$, for the functional $\int_\Omega F(x,u,|\nabla u|^2) dx$. The integrand $F$ is convex and satisfies…

Differential Geometry · Mathematics 2017-08-21 Zahra Sinaei

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

Statistics Theory · Mathematics 2024-07-22 Peter Orbanz

We present a general procedure to construct examples of convex scalar variational problems which admit a minimizers with large singular sets. The dimension of the set of singularities is maximal and the minimizer has no higher integrability…

Analysis of PDEs · Mathematics 2023-12-27 Anna Balci , Lars Diening , Mikhail Surnachev

This paper concerns the characterisation of second order marginals for random sets in a discrete setting. Under the instance of unit covariances, this problem possesses a combinatorial symmetry, exploited jointly in the companion paper to…

Probability · Mathematics 2013-01-21 Raphael Lachieze-Rey

We present quantitative results for the homogenization of uniformly convex integral functionals with random coefficients under independence assumptions. The main result is an error estimate for the Dirichlet problem which is algebraic (but…

Analysis of PDEs · Mathematics 2015-01-28 Scott N. Armstrong , Charles K. Smart

The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite…

Numerical Analysis · Mathematics 2019-11-01 F. Dai , A. Prymak , V. N. Temlyakov , S. Tikhonov

We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…

Probability · Mathematics 2020-09-23 Floris Persiau , Jasper De Bock , Gert de Cooman

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

Probability · Mathematics 2019-11-11 Alin Bostan , Alexander Marynych , Kilian Raschel

The wrapped normal distribution arises when a the density of a one-dimensional normal distribution is wrapped around the circle infinitely many times. At first look, evaluation of its probability density function appears tedious as an…

Computation · Statistics 2018-01-01 Gerhard Kurz , Igor Gilitschenski , Uwe D. Hanebeck

We consider infinitely dimensional classes of functions and instead of the relative error setting, which was used in previous papers on the integral norm discretization, we consider the absolute error setting. We demonstrate how known…

Numerical Analysis · Mathematics 2022-03-15 V. N. Temlyakov

An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences. There are only countably many such properties, so it…

Probability · Mathematics 2011-03-18 Peter G. Doyle
‹ Prev 1 8 9 10 Next ›