Related papers: Fixed-Points for Quantitative Equational Logics
In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
In this paper, we study a new iterative method for finding the fixed point of a weak Bregman relatively nonexpansive mapping and the set of solutions of generalized mixed equilibrium problems in Banach spaces.
We use fixed point theory to analyze nonnegative neural networks, which we define as neural networks that map nonnegative vectors to nonnegative vectors. We first show that nonnegative neural networks with nonnegative weights and biases can…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
Motivated by uncertain parameters encountered in Markov decision processes (MDPs), we study the effect of parameter uncertainty on Bellman operator-based methods. Specifically, we consider a family of MDPs where the cost parameters are from…
We introduce and study a new type of mappings in metric spaces termed $n$-point Kannan-type mappings. A fixed-point theorem is proved for these mappings. In general case such mappings are discontinuous in the domain but necessarily…
The goal of this paper is to promote the use of fixed point strategies in data science by showing that they provide a simplifying and unifying framework to model, analyze, and solve a great variety of problems. They are seen to constitute a…
We consider a class of formula equations in first-order logic, Horn formula equations, which are defined by a syntactic restriction on the occurrences of predicate variables. Horn formula equations play an important role in many…
$Q$-learning is one of the most fundamental reinforcement learning algorithms. It is widely believed that $Q$-learning with linear function approximation (i.e., linear $Q$-learning) suffers from possible divergence until the recent work…
We introduce a general theory of quantitative and metric rewriting systems, namely systems with a rewriting relation enriched over quantales modelling abstract quantities. We develop theories of abstract and term-based systems, refining…
The supervaluationist approach to fixed-point semantics is, arguably, the most celebrated and studied competitor to the Strong Kleene approach within Kripkean truth. In this paper, we show how to obtain supervaluationist fixed-point…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
In this paper, we study a new iterative method for a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the frame work of reflexive real Banach spaces. Moreover, we prove the strong convergence theorem for…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
This paper introduces a formal notion of fixed point explanations, inspired by the "why regress" principle, to assess, through recursive applications, the stability of the interplay between a model and its explainer. Fixed point…
We introduce a new type of mappings in metric space which are three-point analogue of the well-known Chatterjea type mappings, and call them generalized Chatterjea type mappings. It is shown that such mappings can be discontinuous as is the…
In this paper, we presented a new type of metric space called $(\alpha,\beta)$-metric space along with some novel contraction mappings named $(\alpha,\beta)$-contraction and weak $(\alpha,\beta)$-contraction mapping. We established some…
In this article, we derive a common fixed point result for a pair of single valued and set-valued mappings on a metric space having graphical structure. In this case, the set-valued map is assumed to be closed valued instead of closed and…