Related papers: Distributing mass under a pointwise bound and an a…

Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…

In this work, we study non-parametric hypothesis testing problem with distribution function constraints. The empirical likelihood ratio test has been widely used in testing problems with moment (in)equality constraints. However, some…

The small amount of measurements in distribution grids makes their monitoring more difficult. Topological observability may not be possible, and thus, pseudo-measurements are needed to perform state estimation, which is required to control…

This paper deals with a bilevel approach of the location-allocation problem with dimensional facilities. We present a general model that allows us to consider very general shapes of domains for the dimensional facilities and we prove the…

In this work, we consider the problem of distributed approximation of functions over multiple-access channels with additive noise. In contrast to previous works, we take fast fading into account and give explicit probability bounds for the…

In his book on Convex Polyhedra (section 7.2), A.D. Aleksandrov raised a general question of finding variational statements and proofs of existence of polytopes with given geometric data. The first goal of this paper is to give a…

An often-cited fact regarding mixing or mixture distributions is that their density functions are able to approximate the density function of any unknown distribution to arbitrary degrees of accuracy, provided that the mixing or mixture…

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…

We consider the energy norm arising from elliptic problems with discontinuous piecewise constant diffusion. We prove that under the quasi-monotonicity property on the diffusion coefficient, the best approximation error with continuous…

We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

Let $A$ be a compact $d$-dimensional $C^2$ Riemannian manifold with boundary, embedded in ${\bf R}^m$ where $m \geq d \geq 2$, and let $B$ be a nice subset of $A$ (possibly $B=A$). Let $X_1,X_2, \ldots $ be independent random uniform points…

In this paper, two distributed multi-proximal primal-dual algorithms are proposed to deal with a class of distributed nonsmooth resource allocation problems. In these problems, the global cost function is the summation of local convex and…

Area under ROC curve (AUC) is a widely used performance measure for classification models. We propose two new distributionally robust AUC maximization models (DR-AUC) that rely on the Kantorovich metric and approximate the AUC with the…

In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

We study a weighted generalization of the fractional cut-covering problem, which we relate to the maximum cut problem via antiblocker and gauge duality. This relationship allows us to introduce a semidefinite programming (SDP) relaxation…

In this paper we consider the problem of distributed nonlinear optimisation of a separable convex cost function over a graph subject to cone constraints. We show how to generalise, using convex analysis, monotone operator theory and…

The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$…

We consider best approximation problems in a nonlinear subset $\mathcal{M}$ of a Banach space of functions $(\mathcal{V},\|\bullet\|)$. The norm is assumed to be a generalization of the $L^2$-norm for which only a weighted Monte Carlo…