Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

0111 · Apr 199719922001200920172026
12 results for V-structures

New algorithm learns any part of a Bayesian network structure efficiently.

problem Learning specific parts of a Bayesian network structure is computationally inefficient.
method APS-L, a new algorithm that divides V-structures into collider and non-collider types and recursively finds them in Markov blankets.
result The APSL algorithm efficiently and accurately learns any part of a Bayesian network structure.

We introduce two kinds of structures, called v-structures and t-structures, on biquandles. These structures are used for colorings of diagrams of virtual links and twisted links such that the numbers of colorings are invariants. Given a biquandle or a quandle, we give a method of constructing a biquandle with these str…

2011-09-24abs ↗pdf ↗

We present Causal Generative Neural Networks (CGNNs) to learn functional causal models from observational data. CGNNs leverage conditional independencies and distributional asymmetries to discover bivariate and multivariate causal structures. CGNNs make no assumption regarding the lack of confounders, and learn a diffe…

2017-11-24abs ↗pdf ↗

Researchers study learning polytree graphs from linear SEMs with exact recovery conditions.

problem Learning polytree graphs from linear SEMs with exact recovery conditions.
method Study Gaussian polytree models, derive sufficient and necessary conditions for sample sizes, and establish estimation error bounds.
result Sharp characterization of difficulty with matching sufficient and necessary conditions.

We introduce kernel nonparametric tests for Lancaster three-variable interaction and for total independence, using embeddings of signed measures into a reproducing kernel Hilbert space. The resulting test statistics are straightforward to compute, and are used in powerful interaction tests, which are consistent against…

2013-06-10abs ↗pdf ↗

We present MRPC, an R package that learns causal graphs with improved accuracy over existing packages, such as pcalg and bnlearn. Our algorithm builds on the powerful PC algorithm, the canonical algorithm in computer science for learning directed acyclic graphs. The improvement in accuracy results from online control o…

2018-06-05abs ↗pdf ↗

CDVI improves variational inference for survival analysis by considering censoring mechanisms.

problem Challenges in applying variational methods to survival data, especially the dependence on censoring.
method Censor-dependent variational inference (CDVI) tailored for latent variable models in survival analysis.
result Significant improvements in estimating individual survival distributions.

Develops a model for causal discovery in path spaces.

problem Discover causal relationships in path spaces using asymmetric independence.
method Theory linking E-separation in DMGs to conditional independence in SDEs, proving global Markov property, characterizing equivalence classes of graphs.
result Each equivalence class of graphs has a greatest element as a parsimonious representation, which can be identified from data.

We introduce a new approach to functional causal modeling from observational data, called Causal Generative Neural Networks (CGNN). CGNN leverages the power of neural networks to learn a generative model of the joint distribution of the observed variables, by minimizing the Maximum Mean Discrepancy between generated an…

2017-09-15abs ↗pdf ↗

For a Lie-Rinehart algebra (A,L), generators for the Gerstenhaber algebra Λ_A L correspond bijectively to right (A,L)-connections on A in such a way that B-V structures correspond to right (A,L)-module structures on A. When L is projective as an A-module, given an exact generator \partial, the homology of the B-V algeb…

1997-04-09abs ↗pdf ↗

This work sets a universal lower bound for learning causal DAGs with atomic interventions.

problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.