Related papers: Coderivatives at infinity of set-valued mappings
We study reinforcement learning with linear function approximation and finite-memory approximations for partially observed Markov decision processes (POMDPs). We first present an algorithm for the value evaluation of finite-memory feedback…
In this paper, we introduce the concept of nearly convex set-valued mappings and investigate fundamental properties of these mappings. Additionally, we establish a geometric approach for generalized differentiation of nearly convex…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We study completeness properties of reparametrization invariant Sobolev metrics of order $n\ge 2$ on the space of manifold valued open and closed immersed curves. In particular, for several important cases of metrics, we show that Sobolev…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…
Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lov{\'a}sz and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph…
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…
The main result of this note, Theorem 2, is the following: a Borel measure on the space of infinite Hermitian matrices, that is invariant under the action of the infinite unitary group and that admits well-defined projections onto the…
We show a universal algebraic local characterisation of the expressive power of finite-valued languages with domains of arbitrary cardinality and containing arbitrary many cost functions.
This paper rigorously and concisely defines, in the context of our (Elementary) Mathematical Data Model ((E)MDM), the mathematical concepts of self-map, composite mapping, totality, one-to-oneness, non-primeness, ontoness, bijectivity,…
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…
Although average gain optimality is a commonly adopted performance measure in Markov Decision Processes (MDPs), it is often too asymptotic. Further incorporating measures of immediate losses leads to the hierarchy of bias optimalities, all…
The complexity of Pareto fronts imposes a great challenge on the convergence analysis of multi-objective optimization methods. While most theoretical convergence studies have addressed finite-set and/or discrete problems, others have…
We introduce the concept of F-decomposable systems, well-ordered inverse systems of Hausdorff compacta with fully closed bonding mappings. A continuous mapping between Hausdorff compacta is called fully closed if the intersection of the…
This paper presents lossless prefix codes optimized with respect to a pay-off criterion consisting of a convex combination of maximum codeword length and average codeword length. The optimal codeword lengths obtained are based on a new…
In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…
We study measure-valued solutions of the inhomogeneous continuity equation $\partial_t \rho_t + {\rm div}(v\rho_t) = g \rho_t$ where the coefficients $v$ and $g$ are of low regularity. A new superposition principle is proven for positive…