相关论文: On the Notion of a Generalized Mapping on Multiset…

In this study, multivalued generalizations of certain classes of single-valued transformations defined on metric spaces are obtained. Building upon recently introduced concepts such as mappings contracting perimeters of triangles, new…

Our main aim in this paper is to introduce a general concept of multidimensional fixed point of a mapping in spaces with distance and establish various multidimensional fixed point results. This new concept simplifies the similar notion…

Despite the remarkable success of large large-scale neural networks, we still lack unified notation for thinking about and describing their representational spaces. We lack methods to reliably describe how their representations are…

This paper considers generalizations of open mappings, closed mappings, pseudo-open mappings, and quotient mappings from topological spaces to generalized topological spaces. Characterizations of these classes of mappings are obtained and…

The nonlinear concepts of mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type…

Multisets are sets that allow repetition of elements. As such, multisets pave the way to a number of interesting possibilities of theoretical and applied nature. In the present work, after revising the main aspects of traditional sets, we…

Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*)…

A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…

We introduce a natural notion of holomorphic map between generalized complex manifolds and we prove some related results on Dirac structures and generalized Kaehler manifolds.

Compositional generalization refers to the ability to generalize to novel combinations of previously observed words and syntactic structures. Since it is regarded as a desired property of neural models, recent work has assessed…

In a 1976 landmark paper, Gordon James defined the regularisation maps on integer partition, yielding certain decomposition numbers for modular representations of $\mathfrak{S}_n$. We describe a generalisation of James's regularisation map…

The definition of many-to-one mapping, or $m$-to-$1$ mapping for short, between two finite sets is introduced in this paper, which unifies and generalizes the definitions of $2$-to-$1$ mappings and $n$-to-$1$ mappings. A generalized local…

This paper presents new methods for analyzing and evaluating generalized plans that can solve broad classes of related planning problems. Although synthesis and learning of generalized plans has been a longstanding goal in AI, it remains…

We use the reconfiguration framework to analyze problems that involve the rearrangement of items among groups. In various applications, a group of items could correspond to the files or jobs assigned to a particular machine, and the goal of…

A generally intelligent learner should generalize to more complex tasks than it has previously encountered, but the two common paradigms in machine learning -- either training a separate learner per task or training a single learner for all…

The problem of matching two sets of multiple elements, namely set-to-set matching, has received a great deal of attention in recent years. In particular, it has been reported that good experimental results can be obtained by preparing a…

Compositional generalization is the ability of a model to generalize to complex, previously unseen types of combinations of entities from just having seen the primitives. This type of generalization is particularly relevant to the semantic…

Neural network models often generalize poorly to mismatched domains or distributions. In NLP, this issue arises in particular when models are expected to generalize compositionally, that is, to novel combinations of familiar words and…

In this paper we consider the problem of quantizing theories defined over configuration spaces described by non-commuting parameters. If one tries to do that by generalizing the path-integral formalism, the first problem one has to deal…

We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a word than the original Parikh matrix mapping while…