Related papers: Generalized iterated-sums signatures
Supervised learning has gone beyond the expected risk minimization framework. Central to most of these developments is the introduction of more general aggregation functions for losses incurred by the learner. In this paper, we turn towards…
In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a…
We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…
A qualitative comparison of total variation like penalties (total variation, Huber variant of total variation, total generalized variation, ...) is made in the context of global seismic tomography. Both penalized and constrained…
In past few decades, tensor algebra also known as multi-linear algebra has been developed and customized as a tool to be used for various engineering applications. In particular, with the help of a special form of tensor contracted product,…
We study a fixed point iterative method based on generalized relaxation of strictly quasi-nonexpansive operators. The iterative method is assembled by averaging of strings, and each string is composed of finitely many strictly…
In this paper a new form of the Hossz\'u-Gluskin theorem is presented in terms of polyadic powers and using the language of diagrams. It is shown that the Hossz\'u-Gluskin chain formula is not unique and can be generalized ("deformed")…
We establish certain fundamental properties of $f$-vectors and $F$-matrices for generalized cluster algebras, including the initial and final seed mutation formulas, the compatibility property and the symmetry property. Along the way, we…
We introduce a new approach for smoothing and improving the quality of word embeddings. We consider a method of fusing word embeddings that were trained on the same corpus but with different initializations. We project all the models to a…
This paper generalizes the bordered-algebraic knot invariant introduced in an earlier paper, giving an invariant now with more algebraic structure. It also introduces signs to define these invariants with integral coefficients. We describe…
We prove the quantum modularity of the signature of $ \mathrm{SU}(2) $-TQFT for a genus 2 surface, which was conjectured by March\'{e}--Masbaum in 2025. Our approach is based on a quantum modularity of generalized Dedekind sums associated…
Let X be a smooth algebraic variety over a field of characteristic 0. We introduce the notion of twisted associative (resp. Poisson) deformation of the structure sheaf O_X. These are stack-like versions of usual deformations. We prove that…
Motivated by the pressing needs for capturing complex but interpretable variable relationships in scientific research, here we generalize the squared Pearson correlation to capture a mixture of linear dependences between two real-valued…
Recently proposed forms for gauge transformations with finite parameters in double field theory are discussed and problematic issues are identified. A new form for finite gauge transformations is derived that reveals the underlying gerbe…
Many finance, physics, and engineering phenomena are modeled by continuous-time dynamical systems driven by highly irregular (stochastic) inputs. A powerful tool to perform time series analysis in this context is rooted in rough path theory…
Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we…
In this study, we apply "r" times the binomial transform to the Padovan and Perrin matrix sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we give the…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
Simplification of expressions in computer algebra systems often involves a step known as "canonicalisation", which reduces equivalent expressions to the same form. However, such forms may not be natural from the perspective of a…
The concept of signatures and expected signatures is vital in data science, especially for sequential data analysis. The signature transform, a Cartan type development, translates paths into high-dimensional feature vectors, capturing their…