arXiv research

Random Intersection Chains selects important interactions from categorical features.

We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…

James McClure recently showed that the domain for the intersection pairing of PL chains on a PL manifold $M$ is a subcomplex of $C_*(M)\otimes C_*(M)$ that is quasi-isomorphic to $C_*(M)\otimes C_*(M)$ and, more generally, that the intersection pairing endows $C_*(M)$ with the structure of a partially-defined commutati…

Let M be a compact oriented PL manifold and let C_*M be its PL chain complex. The domain of the chain-level intersection pairing is a subcomplex G of C_*M\otimes C_*M. We prove that G is a "full" subcomplex, that is, the inclusion of G in C_*M \otimes C_*M is a quasi-isomorphism. An analogous result is true for the dom…

Method detects interactions for better CTR prediction.

We introduce a singular chain intersection homology theory which generalizes that of King and which agrees with the Deligne sheaf intersection homology of Goresky and MacPherson on any topological stratified pseudomanifold, compact or not, with constant or local coefficients, and with traditional perversities or superp…

We show that intersection homology extends Poincare duality to manifold homotopically stratified spaces (satisfying mild restrictions). This includes showing that, on such spaces, the sheaf of singular intersection chains is quasi-isomorphic to the Deligne sheaf.

A new algorithm speeds up elliptical slice sampling for truncated multivariate normals.

We compare the sheaf-theoretic and singular chain versions of Poincare duality for intersection homology, showing that they are isomorphic via naturally defined maps. Similarly, we demonstrate the existence of canonical isomorphisms between the singular intersection cohomology cup product, the hypercohomology product i…

We introduce a method that uses the Cauchy-Crofton formula and a new curvature formula from integral geometry to reweight the sampling probabilities of Metropolis-within-Gibbs algorithms in order to increase their convergence speed. We consider algorithms that sample from a probability density conditioned on a manifold…

This paper aims at justifying LWF and AMP chain graphs by showing that they do not represent arbitrary independence models. Specifically, we show that every chain graph is inclusion optimal wrt the intersection of the independence models represented by a set of directed and acyclic graphs under conditioning. This impli…

This study aims to improve communication between fragmented blockchain systems in finance.

We develop the intersection theory at relative chain-cochain level, and apply it along with the use of Seifert disks for an oriented link to give a combinatorial algorithm to compute Massey's higher order linking numbers. It is subtle to compute higher-order linking numbers, and it has been a folklore to use the inters…

Unified framework for MCMC and machine learning problems.

A Steiner chain of length k consists of k circles, tangent to two given non-intersecting circles (the parent circles) and tangent to each other in a cyclic pattern. The Steiner porism states that once a chain of k circles exists, there exists a 1-parameter family of such chains with the same parent circles that can be …

Hidden Markov Chains and Linear-chain CRFs are equivalent.

Let M be a closed Riemannian manifold. We extend the product of Goresky-Hingston, on the cohomology of the free loop space of M relative to the constant loops, to a nonrelative product. It is graded associative and commutative, and compatible with the length filtration on the loop space, like the original product. We p…

Computes expected number of real intersection points of essential variety with random linear spaces.

We systematically investigate the problem of representing Markov chains by families of random maps, and which regularity of these maps can be achieved depending on the properties of the probability measures. Our key idea is to use techniques from optimal transport to select optimal such maps. Optimal transport theory a…

Random simple closed curves map Teichmüller space to geodesic currents.

This paper constructs an algebra on a 3-torus with specific properties for fluid dynamics.

Study shows how certain stochastic models reach a steady state over time.

Unified framework for analyzing convergence of RSAs using Wasserstein divergence.

We investigate the distribution of lengths obtained by intersecting a random geodesic with a geodesic lamination. We give an explicit formula for the distribution for the case of a maximal lamination and show that the distribution is independent of the surface and lamination. We also show how the moments of the distrib…

Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the minimum number of transversal self-intersection points of representatives of the class…

The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Markov chain. This kind of block selection is neither i.i.d. random nor cyclic. On the other hand, it is…

Software estimates inequality in random systems with changing communities.

The paper analyzes stability of random matrix products with Markovian noise.

Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciprocal 1/Z are harder to obtain. Unbiased estimates of 1/Z allow Markov chain Monte Carlo sampling of "d…

The paper extends Busemann's inequalities to complex and quaternionic spaces.

We extend Kac-Rice formula to compute expected intersections of random submanifolds.

The paper calculates large genus limits for quadratic differential volumes and constants.

Randomized control methods improve asset pricing and performance analysis.

We propose a novel framework of estimating systemic risk measures and risk allocations based on Markov chain Monte Carlo (MCMC) methods. We consider a class of allocations whose jth component can be written as some risk measure of the jth conditional marginal loss distribution given the so-called crisis event. By consi…

Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a variant of stochastic gradient descent where the random samples are taken on the t…

Matrix Chernoff bound for Markov chains applied to co-occurrence matrices.

Heterogeneous information network (HIN) embedding has gained increasing interests recently. However, the current way of random-walk based HIN embedding methods have paid few attention to the higher-order Markov chain nature of meta-path guided random walks, especially to the stationarity issue. In this paper, we system…

Many random processes can be simulated as the output of a deterministic model accepting random inputs. Such a model usually describes a complex mathematical or physical stochastic system and the randomness is introduced in the input variables of the model. When the statistics of the output event are known, these input …

Develops a chain-level model for Chas-Sullivan products using Morse theory with differential graded coefficients.

SBT model uses randomized sharding and sub-models to improve Bayesian Additive Regression Trees.

BEGIN network models binary data without parametric assumptions.

Smooth curves from polygonal chains with vertex preservation and explicit curvature control.

Random curves on surfaces have predictable properties as they grow.

Constructs manifolds from quantum codes with novel geometric properties.

We define an elementary relatively $\mathbb Z/4$ graded Lagrangian-Floer chain complex for restricted immersions of compact 1-manifolds into the pillowcase, and apply it to the intersection diagram obtained by taking traceless $SU(2)$ character varieties of 2-tangle decompositions of knots. Calculations for torus knots…

New Gibbs sampling method improves MCMC efficiency.

Recently, Tsai-Tseng-Yau constructed new invariants of symplectic manifolds: a sequence of Aoo-algebras built of differential forms on the symplectic manifold. We show that these symplectic Aoo-algebras have a simple topological interpretation. Namely, when the cohomology class of the symplectic form is integral, these…

Deviation inequalities for stochastic approximation methods.