Related papers: Yet another delooping machine
In this presentation, we review the general features of integrand-reduction techniques, with a particular focus on their generalization beyond one loop. We start with a brief discussion of the one-loop scenario, a case in which…
We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic)…
For a given a normally hyperbolic invariant manifold, whose stable and unstable manifolds intersect transversally, we consider several tools and techniques to detect trajectories with prescribed itineraries: the scattering map, the…
We develop theory for nonlinear dimensionality reduction (NLDR). A number of NLDR methods have been developed, but there is limited understanding of how these methods work and the relationships between them. There is limited basis for using…
Intelligent perception and interaction with the world hinges on internal representations that capture its underlying structure (''disentangled'' or ''abstract'' representations). Disentangled representations serve as world models, isolating…
In the "Beyond Moore's Law" era, with increasing edge intelligence, domain-specific computing embracing unconventional approaches will become increasingly prevalent. At the same time, adopting a variety of nanotechnologies will offer…
We define a notion of equivariant non-degeneracy of $G$-maps to introduce the class of equivariantly non-degenerate flows on smooth compact manifolds with compact Lie group action. We prove genericity of this class and use this result to…
An algorithm is described for the construction of actions for scalar, spinor, and vector gauge fields that remains well-defined when the metric is degenerate and that involve no contravariant tensor fields. These actions produce the…
Normalizing Flows are a promising new class of algorithms for unsupervised learning based on maximum likelihood optimization with change of variables. They offer to learn a factorized component representation for complex nonlinear data and,…
With the of advent rich classification models and high computational power visual recognition systems have found many operational applications. Recognition in the real world poses multiple challenges that are not apparent in controlled lab…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
In previous work we established a multilinear duality and factorisation theory for norm inequalities for pointwise weighted geometric means of positive linear operators defined on normed lattices. In this paper we extend the reach of the…
Koopman operator theory has proven to be a promising approach to nonlinear system identification and global linearization. For nearly a century, there had been no efficient means of calculating the Koopman operator for applied engineering…
An earlier work of the author's showed that it was possible to adapt the Alekseev-Meinrenken Chern-Weil proof of the Duflo isomorphism to obtain a completely combinatorial proof of the Wheeling isomorphism. That work depended on a certain…
We construct an operational formulation of classical mechanics without presupposing previous results from analytical mechanics. In doing so, several concepts from analytical mechanics will be rediscovered from an entirely new perspective.…
The spontaneous disentanglement hypothesis is motivated by some outstanding issues in standard quantum mechanics, including the problem of quantum measurement. The current study compares between some possible methods that can be used to…
This work establishes a rigorous theoretical foundation for analyzing deep learning systems by leveraging Infinite Time Turing Machines (ITTMs), which extend classical computation into transfinite ordinal steps. Using ITTMs, we reinterpret…
Visual place recognition methods struggle with occlusions and partial visual overlaps. We propose a novel visual place recognition approach based on overlap prediction, called VOP, shifting from traditional reliance on global image…
Deconvolution is the most commonly used image processing method to remove the blur caused by the point-spread-function (PSF) in optical imaging systems. While this method has been successful in deblurring, it suffers from several…