Related papers: Smooth rough paths, their geometry and algebraic r…
Continuing work begin in arXiv:1910.12609, we interpret the Hurewicz homomorphism for Baker and Richter's noncommutative complex cobordism spectrum $M\xi$ in terms of characteristic numbers (indexed by quasi-symmetric functions) for…
In the last several years, the intimate connection between convex optimization and learning problems, in both statistical and sequential frameworks, has shifted the focus of algorithmic machine learning to examine this interplay. In…
Normalizing flows are a powerful technique for obtaining reparameterizable samples from complex multimodal distributions. Unfortunately, current approaches are only available for the most basic geometries and fall short when the underlying…
The paper is devoted to the numerical solution of elastoplastic constitutive initial value problems. An improved form of the implicit return-mapping scheme for nonsmooth yield surfaces is proposed that systematically builds on a…
We extend the functional Breuer-Major theorem by Nourdin and Nualart (2020) to the space of rough paths. The proof of tightness combines the multiplication formula for iterated Malliavin divergences, due to Furlan and Gubinelli (2019), with…
This paper regroups some of the basic properties of Lipschitz maps and their flows. Many of the results presented here are classical in the case of smooth maps. We prove them here in the Lipschitz case for a better understanding of the…
Transport maps can ease the sampling of distributions with non-trivial geometries by transforming them into distributions that are easier to handle. The potential of this approach has risen with the development of Normalizing Flows (NF)…
We generalize the notion of calibrated submanifolds to smooth maps and show that the several examples of smooth maps appearing in the differential geometry become the examples of our situation. Moreover, we apply these notion to give the…
On social networks, while nodes bear rich attributes, we often lack the `semantics' of why each link is formed-- and thus we are missing the `road signs' to navigate and organize the complex social universe. How to identify relationship…
The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore,…
We introduce a technique for recovering a sufficiently smooth function from its ray transform over a wide class of curves in a general region of Euclidean space. The method is based on a complexification of the underlying vector fields…
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…
We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…
We study the harmonic map equations for maps of a Riemann surface into a Riemannian symmetric space of compact type from the point of view of soliton theory. There is a well-known dressing action of a loop group on the space of harmonic…
Non-smooth optimization is a core ingredient of many imaging or machine learning pipelines. Non-smoothness encodes structural constraints on the solutions, such as sparsity, group sparsity, low-rank and sharp edges. It is also the basis for…
In this work, we study the well-posedness of certain sparse regularized linear regression problems, i.e., the existence, uniqueness and continuity of the solution map with respect to the data. We focus on regularization functions that are…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
Lifelong SLAM considers long-term operation of a robot where already mapped locations are revisited many times in changing environments. As a result, traditional graph-based SLAM approaches eventually become extremely slow due to the…
Rough paths techniques give the ability to define solutions of stochastic differential equations driven by signals $X$ which are not semimartingales and whose $p$-variation is finite only for large values of $p$. In this context, rough…
Motivated by some questions in the path integral approach to (topological) gauge theories, we are led to address the following question: given a smooth map from a manifold $M$ to a compact group $G$, is it possible to smoothly `diagonalize'…