Related papers: A Rough Path Perspective on Renormalization
Rough sheets are two-parameter analogs of rough paths. In this work the theory of integration over functions of two parameters is extended to cover the case of irregular functions by developing an appropriate notion of rough sheet. The main…
In this paper, we define a new cohomology theory for multiplicative Hom-pre-Lie algebras which controls deformations of Hom-pre-Lie algebra structure. This new cohomology is a natural one by considering the structure map. We develop…
We propose to employ the hierarchical coarse-grained structure in the artificial neural networks explicitly to improve the interpretability without degrading performance. The idea has been applied in two situations. One is a neural network…
In Machine Learning, Artificial Neural Networks (ANNs) are a very powerful tool, broadly used in many applications. Often, the selected (deep) architectures include many layers, and therefore a large amount of parameters, which makes…
Inverse problems and regularization theory is a central theme in contemporary signal processing, where the goal is to reconstruct an unknown signal from partial indirect, and possibly noisy, measurements of it. A now standard method for…
This paper aims to interpret the mechanism of feedforward ReLU networks by exploring their solutions for piecewise linear functions, through the deduction from basic rules. The constructed solution should be universal enough to explain some…
Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…
We give a natural monomorphism from the necklace Lie coalgebra, defined for any quiver, to Connes and Kreimer's Lie coalgebra of trees, and extend this to a map from a certain quiver-theoretic Hopf algebra to Connes and Kreimer's…
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of…
In a recent preprint, Brouder and Schmitt give a careful construction of a `renormalisation' Hopf algebra out of an arbitrary bialgebra. In this note, we point out that this is a special case of the construction of the cooperad of a…
In the first purpose, we concentrate on the theory of quantum integrable systems underlying the Connes-Kreimer approach. We introduce a new family of Hamiltonian systems depended on the perturbative renormalization process in renormalizable…
These lecture notes evolve around mathematical concepts arising in inverse problems. We start by introducing inverse problems through examples such as differentiation, deconvolution, computed tomography and phase retrieval. This then leads…
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context…
Many sequential processing tasks require complex nonlinear transition functions from one step to the next. However, recurrent neural networks with 'deep' transition functions remain difficult to train, even when using Long Short-Term Memory…
We extend the results we obtained in an earlier work. The cocommutative case of rooted ladder trees is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the…
A branched rough path $X$ consists of a rough integral calculus for $X \colon [0, T] \to \mathbb R^d$ which may fail to satisfy integration by parts. Using Kelly's bracket extension [Kel12], we define a notion of pushforward of branched…
We use techniques of relative algebraic K-theory to develop a common refinement of the existing theories of metrized and hermitian Galois structures in arithmetic. As a first application of this very general approach, we then use it to…
Parametric approaches to Learning, such as deep learning (DL), are highly popular in nonlinear regression, in spite of their extremely difficult training with their increasing complexity (e.g. number of layers in DL). In this paper, we…
In this work, we propose a systematic derivation of resonance-based schemes via normal forms. The main idea is to use an arborification map on decorated trees together with a Butcher-Connes-Kreimer type coproduct and lower-dominant parts…
In this note we show that abstract planar algebras are algebras over the topological operad of moduli spaces of stable maps with Lagrangian boundary conditions, which in the case of the projective line are described in terms of real…