Related papers: The NC-proximal average for multiple functions
For a continuous function $f$ defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is…
In this paper we make a first attempt at understanding how to build an optimal approximate normal factor analysis model. The criterion we have chosen to evaluate the distance between different models is the I-divergence between the…
In this note, we present a novel measure of similarity between two functions. It quantifies how the sub-optimality gaps of two functions convert to each other, and unifies several existing notions of functional similarity. We show that it…
We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…
The paper considers an extension of factor analysis to moving average processes. The problem is formulated as a rank minimization of a suitable spectral density. It is shown that it can be adequately approximated via a trace norm convex…
We define a free holomorphic function to be a function that is locally a bounded nc-function. We prove that free holomorphic functions are the functions that are locally uniformly approximable by free polynomials. We prove a realization…
The goal of this expository article is a fairly self-contained account of some averaging processes of functions along sequences of the form $(\alpha^n x)^{}_{n\in\mathbb{N}}$, where $\alpha$ is a fixed real number with $| \alpha | > 1$ and…
The piecewise-concave function may be used to approximate a wide range of other functions to arbitrary precision over a bounded set. In this short paper, this property is proven for three function classes: (a) the multivariate twice…
Approximate computing is a research area where we investigate a wide spectrum of techniques to trade off computation accuracy for better performance or energy consumption. In this work, we provide a general introduction to approximate…
Normalizing flows model a complex target distribution in terms of a bijective transform operating on a simple base distribution. As such, they enable tractable computation of a number of important statistical quantities, particularly…
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
Network Calculus (NC) is an algebraic theory that represents traffic and service guarantees as curves in a Cartesian plane, in order to compute performance guarantees for flows traversing a network. NC uses transformation operations, e.g.,…
We provide a proximal average with repect to a $1$-coercive Legendre function. In the sense of Bregman distance, the Bregman envelope of the proximal average is a convex combination of Bregman envelopes of individual functions. The Bregman…
In a prior paper [14], along with P. Ellingsen, P. Felke and A. Tkachenko, we defined a new (output) multiplicative differential, and the corresponding c-differential uniformity, which has the potential of extending differential…
This article shows that on a closed interval $[a,b]$ a continuous function may be approximated to an arbitrary degree of accuracy using scattered translates of the general multiquadric $(x^2+c^2)^{k-1/2}$.
Although there is an extensive literature on the upper bound for cumulative standard normal distribution, there are relatively not sharp for all values of the interested argument x. The aim of this paper is to establish a sharp upper bound…
Parameterized convex minorant (PCM) method is proposed for the approximation of the objective function in amortized optimization. In the proposed method, the objective function approximator is expressed by the sum of a PCM and a nonnegative…
We study the problem of graph clustering under a broad class of objectives in which the quality of a cluster is defined based on the ratio between the number of edges in the cluster, and the total weight of vertices in the cluster. We show…
The purpose of this paper is to extend the definition of quasiarithmetic means by taking a strictly monotone generating function instead of a strictly monotone and continuous one. We establish the properties of such means and compare them…