Related papers: H\"older-continuous rough paths by Fourier normal …
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
We introduce an infinitesimal Hopf algebra of planar trees, generalising the construction of the non-commutative Connes-Kreimer Hopf algebra. A non-degenerate pairing and a dual basis are defined, and a combinatorial interpretation of the…
We construct three new combinatorial Hopf algebras based on the Loday-Ronco operations on planar binary trees. The first and second algebras are defined on planar trees and labeled planar trees extending the Loday-Ronco and…
An appealing property of the natural gradient is that it is invariant to arbitrary differentiable reparameterizations of the model. However, this invariance property requires infinitesimal steps and is lost in practical implementations with…
We study different possibilities to apply the principles of rough paths theory in a non-commutative probability setting. First, we extend previous results obtained by Capitaine, Donati-Martin and Victoir in Lyons' original formulation of…
This work proposes a higher-order iterative framework for solving matrix equations, inspired by the structure and functionality of neural networks. A modification of the classical Jacobi iterative method is introduced to compute…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…
Recursive partitioning is the core of several statistical methods including CART, random forest, and boosted trees. Despite the popularity of tree based methods, to date, there did not exist methods for combining multiple trees into a…
We prove a large deviation principle for the slow-fast rough differential equations under the controlled rough path framework. The driver rough paths are lifted from the mixed fractional Brownian motion with Hurst parameter $H\in…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We study Hopf algebras via tools from geometric invariant theory. We show that all the invariants we get can be constructed using the integrals of the Hopf algebra and its dual together with the multiplication and the comultiplication, and…
We introduce a numerical framework for dispersive equations embedding their underlying resonance structure into the discretisation. This will allow us to resolve the nonlinear oscillations of the PDE and to approximate with high order…
In this paper, we consider an unconstrained optimization model where the objective is a sum of a large number of possibly nonconvex functions, though overall the objective is assumed to be smooth and convex. Our bid to solving such model…
We survey the Munthe-Kaas--Wright Hopf algebra defined on planar rooted trees. This algebra serves a role akin to that of the Butcher--Connes--Kreimer Hopf algebra on non-planar rooted trees within the domain of numerical methods for…
The Hairer-Kelly map has been introduced for establishing a correspondence between geometric and non-geometric rough paths. Recently, a new renormalisation on rough paths has been proposed in (arxiv 1810.12179), built on this map and the…
We prove a rough It\^o formula for path-dependent functionals of $\alpha$-H\"older continuous paths for $\alpha\in(0,1)$. Our approach combines the sewing lemma and a Taylor approximation in terms of path-dependent derivatives.
We introduce two operads which own the set of planar forests as a basis. With its usual product and two other products defined by different types of graftings, the algebra of planar rooted trees H becomes an algebra over these operads. The…
We consider a regular $n$-ary tree of height $h$, for which every vertex except the root is labelled with an independent and identically distributed continuous random variable. Taking motivation from a question in evolutionary biology, we…
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…
We develop a general framework for pathwise stochastic integration that extends F\"ollmer's classical approach beyond gradient-type integrands and standard left-point Riemann sums and provides pathwise counterparts of It\^o, Stratonovich,…