A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New results on relative simplicial volume using bounded acyclicity.
The paper proposes using low rank assumption to improve causal structure learning in DAGs.
In the previous work ([14]) we introduced the well-posed boundary conditions and for the odd signature operator to define the refined analytic torsion on a compact manifold with boundary. In this paper we discuss the gluing formula of the refined…
New spectral sequences derived from shellable tilings.
Methods for automated discovery of causal relationships from non-interventional data have received much attention recently. A widely used and well understood model family is given by linear acyclic causal models (recursive structural equation models). For Gaussian data both constraint-based methods (Spirtes et al., 199…
We explore non-acyclic GFlowNets in discrete settings.
COSMO learns DAG structure without acyclicity constraints.
Acyclicity proven for curve complex on surfaces.
We show a relationship between the non-acyclic Reidemeister torsion and a zero of the acyclic Reidemeister torsion for a lambda-regular SU(2) or SL(2, C)-representation of a knot group. Then we give a method to calculate the non-acyclic Reidemeister torsion of a knot exterior. We calculate a new example and investigate…
New method tests DAGs without assuming linear or independent data.
New method learns DAGs from data without acyclicity constraint.
New method identifies root causes in presence of latent confounding.
ALIAS uses RL to learn DAGs without acyclicity constraints.
Develops a new method for learning non-parametric DAGs using RKHS.
Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single cau…
Two extremal classes of acyclic groups are discussed. For an arbitrary group G, there is always a homomorphism from an acyclic group of cohomological dimension 2 onto the maximum perfect subgroup of G, and there is always an embedding of G in a binate (hence acyclic) group. In the other direction, there are no nontrivi…
In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology obtained by S.Choi, who estab…
ENCOD learns causal graphs efficiently without acyclicity constraints.
We give a Dehn-Nielsen type theorem for the homology cobordism group of homology cylinders by considering its action on the acyclic closure, which was defined by Levine, of a free group. Then we construct an additive invariant of those homology cylinders which act on the acyclic closure trivially. We also describe some…
The paper explores conditions for homology spheres to bound acyclic smooth manifolds and symplectic fillings.
Proposes an approach to ensure acyclic graphs in Bayesian structure learning.
We consider finite groups which admit a faithful, smooth action on an acyclic manifold of dimension three, four or five (e.g. euclidean space). Our first main result states that a finite group acting on an acyclic 3- or 4-manifold is isomorphic to a subgroup of the orthogonal group O(3) or O(4), respectively. The analo…
We determine which 3-manifolds admit a unitary representation such that the corresponding twisted chain complex is acyclic.
Proposes an evolutionary approach to fitting acyclic VAR models.
Solves linearity problem for acyclic groups, bounds Cheeger-Gromov ρ-invariants.
In terms of Turaev's shadows, we provide a sufficient condition for a compact, smooth, acyclic 4-manifold with boundary the 3-sphere to be diffeomorphic to the standard 4-ball. As a consequence, we prove that if a compact, smooth, acyclic 4-manifold with boundary the 3-sphere has shadow-complexity at most 2, then it is…
Smooth actions on certain 3-spheres can't extend to acyclic 4-manifolds.
DAGMA learns DAGs faster and more accurately using log-determinant acyclicity.
What discuss the problem of obtaining new manifold invariants via different analogues of 6j-symbols and the torsion of acyclic complexes.
The paper tackles learning varying DAG structures based on contextual features.
Let X be a compactum such that dim_Q X < n+1, n>1. We prove that there is a Q-acyclic resolution r: Z-->X from a compactum Z of dim < n+1. This allows us to give a complete description of all the cases when for a compactum X and an abelian group G such that dim_G X < n+1, n>1 there is a G-acyclic resolution r: Z-->X fr…
ProDAG uses variational inference to learn DAGs with uncertainty quantification.
New invariant from non-acyclic flat connections.
DAGgr aggregates multiple DAGs to stabilize causal structure learning.
Study counterfactuals in cyclic systems with shifts and scales.
We provide a correction to the expression for scoring Gaussian directed acyclic graphical models derived in Geiger and Heckerman [Ann. Statist. 30 (2002) 1414-1440] and discuss how to evaluate the score efficiently.
We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.
A combination of Bestvina--Brady Morse theory and an acyclic reflection group trick produces a torsion-free finitely presented Q-Poincaré duality group which is not the fundamental group of an aspherical closed ANR Q-homology manifold. The acyclic construction suggests asking which Q-Poincaré duality groups act freely …
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs".
Study non-acyclic SL2-representations of twist knots and their L-functions.
Unified notion of equivalence for causal graphs, cyclic or acyclic.
Proves conditions for separating regions in homogeneous spaces without trivial topology.
Neural networks with DAGs show linearity as width increases.
Directed acyclic graphs are the basic representation of the structure underlying Bayesian networks, which represent multivariate probability distributions. In many practical applications, such as the reverse engineering of gene regulatory networks, not only the estimation of model parameters but the reconstruction of t…
Study embeddings of manifolds via acyclic maps and surgery.
Motivated by the work of Salvetti and Settepanella we introduce certain total orderings of the faces of any shellable regular CW-complex (called `shelling-type orderings') that can be used to explicitly construct maximum acyclic matchings of the poset of cells of the given complex. Building on an application of this me…
We show that a finite type duality group of dimension is the fundamental group of a -manifold with rationally acyclic universal cover. We use this to find closed manifolds with rationally acyclic universal cover and some nonvanishing -Betti numbers outside the middle dimension, which contradicts a rat…
We prove that every acyclic normal one-dimensional real Ambrosio-Kirchheim current in a Polish (i.e. complete separable metric) space can be decomposed in curves, thus generalizing the analogous classical result proven by S. Smirnov in Euclidean space setting. The same assertion is true for every complete metric space …