Related papers: Fej\'er monotone sequences revisited
The Lipschitz constant of the map between the input and output space represented by a neural network is a natural metric for assessing the robustness of the model. We present a new method to constrain the Lipschitz constant of dense deep…
The main aim of this paper is to find necessary and sufficient conditions for the convergence of Fej\'er means in terms of the modulus of continuity on the Hardy spaces $H_{p},$ when $0<p\leq 1/2.$
In this paper we prove a complete panel of consistency results for the discrete de Rham (DDR) complex introduced in the companion paper [D. A. Di Pietro and J. Droniou, An arbitrary-order discrete de Rham complex on polyhedral meshes. Part…
We discuss the Dempster-Shafer theory of evidence. We introduce a concept of monotonicity which is related to the diminution of the range between belief and plausibility. We show that the accumulation of knowledge in this framework exhibits…
In two earlier papers, we designed a distributed deterministic asynchronous algorithm for minimizing the sum of subdifferentiable and proximable functions and a regularizing quadratic on time-varying graphs based on Dykstra's algorithm, or…
Opial's Lemma is a fundamental result in the convergence analysis of sequences generated by optimization algorithms in real Hilbert spaces. We introduce the concept of Opial sequences - sequences for which the limit of the distance to each…
Recently, we systematically studied the basic theory of Bregman circumcenters in another paper. In this work, we aim to apply Bregman circumcenters to optimization algorithms. Here, we propose the forward Bregman monotonicity which is a…
The property of learning-curve monotonicity, highlighted in a recent series of work by Loog, Mey and Viering, describes algorithms which only improve in average performance given more data, for any underlying data distribution within a…
We propose a new framework to design and analyze accelerated methods that solve general monotone equation (ME) problems $F(x)=0$. Traditional approaches include generalized steepest descent methods and inexact Newton-type methods. If $F$ is…
The amount of training-data is one of the key factors which determines the generalization capacity of learning algorithms. Intuitively, one expects the error rate to decrease as the amount of training-data increases. Perhaps surprisingly,…
The aim of this paper is to develop analytic techniques to deal with certain monotonicity of combinatorial sequences. (1) A criterion for the monotonicity of the function $\sqrt[x]{f(x)}$ is given, which is a continuous analog for one…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
In this paper, we investigate very general approximation kernels with special properties, called an approximate identity, and prove almost everywhere and norm convergence of these general methods, which consists of a class of summability…
In many practical applications, heuristic or approximation algorithms are used to efficiently solve the task at hand. However their solutions frequently do not satisfy natural monotonicity properties of optimal solutions. In this work we…
The mean shift algorithm is a non-parametric and iterative technique that has been used for finding modes of an estimated probability density function. It has been successfully employed in many applications in specific areas of machine…
Reference [11] investigated the almost sure weak convergence of block-coordinate fixed point algorithms and discussed their applications to nonlinear analysis and optimization. This algorithmic framework features random sweeping rules to…
The main aim of the paper is to present a general version of the Fourier Tauberian theorem for monotone functions. This result, together with Berezin's inequality, allows us to obtain a refined version the Li-Yau estimate for the counting…
This paper deals with an inertial proximal algorithm that contains a Tikhonov regularization term, in connection to the minimization problem of a convex lower semicontinuous function $f$. We show that for appropriate Tikhonov regularization…
Recently, metric learning and similarity learning have attracted a large amount of interest. Many models and optimisation algorithms have been proposed. However, there is relatively little work on the generalization analysis of such…
Fix $\alpha>0$, then by Fej\'er's theorem $ (\alpha(\log n)^{A}\,\mathrm{mod}\,1)_{n\geq1}$ is uniformly distributed if and only if $A>1$. We sharpen this by showing that all correlation functions, and hence the gap distribution, are…