Related papers: Homotopy Iterators
For complex, high-dimensional Markov Decision Processes (MDPs), it may be necessary to represent the policy with function approximation. A problem is misspecified whenever, the representation cannot express any policy with acceptable…
We demonstrate our implementation of a continuation method as described in \cite{HR2015} for solving polynomials systems. Given a sequence of (multi)homogeneous polynomials, the software "multiregeneration" outputs the respective…
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for…
The goal of data selection is to capture the most structural information from a set of data. This paper presents a fast and accurate data selection method, in which the selected samples are optimized to span the subspace of all data. We…
In the paper we suggest the homotopy method for solving of the non linear evolution equation. This method consists of two steps. First is the analytical solution for the linearized version of the non-linear evolution deep in the saturation…
The main deficiency of the algorithms running on digital computers nowadays is their inability to change themselves during the execution. In line with this, the paper introduces the so-called replicated algorithms, inspired by the concept…
We present a new continuation algorithm to find all nondegenerate real solutions to a system of polynomial equations. Unlike homotopy methods, it is not based on a deformation of the system; instead, it traces real curves connecting the…
We introduce the concept of mode-k generalized eigenvalues and eigenvectors of a tensor and prove some properties of such eigenpairs. In particular, we derive an upper bound for the number of equivalence classes of generalized tensor…
This paper aims to help the development of new models of homotopy type theory, in particular with models that are based on realizability toposes. For this purpose it develops the foundations of an internal simplicial homotopy that does not…
We describe the behaviour of the homotopy similarity relations and finite-order invariants under the function $[X,Y]\to[X,Z]$ induced by a map $Y\to Z$ strongly $r$-similar to the constant map.
Hamiltonian Monte Carlo has emerged as a standard tool for posterior computation. In this article, we present an extension that can efficiently explore target distributions with discontinuous densities. Our extension in particular enables…
Continual learning poses a fundamental challenge for modern machine learning systems, requiring models to adapt to new tasks while retaining knowledge from previous ones. Addressing this challenge necessitates the development of efficient…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
In this article we study homotopes of finite-dimensional algebras (not necessarily, associative). In the case of associative algebras we study homotopes by methods of Category theory and give description of so-called well-tempered elements…
We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a…
We construct integrators to be used in Hamiltonian (or Hybrid) Monte Carlo sampling. The new integrators are easily implementable and, for a given computational budget, may deliver five times as many accepted proposals as standard…
In this paper, three Computational Topology methods (namely effective homology, persistent homology and discrete vector fields) are mixed together to produce algorithms for homological digital image processing. The algorithms have been…
We survey some recent advances in the homotopy theory of classifying spaces, and homotopical group theory. We focus on the classification of p-compact groups in terms of root data over the p-adic integers, and discuss some of its…
We introduce the notion of iterated group extensions, which, roughly speaking, is what one obtains by forming a group extension of a group extension. We interpret iterated extensions in terms of group cohomology, in the same way as…
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…