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,695 papers · 148 categories

Trend · papers per month

107214321428 · Jun 202019922001200920172026
48 results for observational equivalence

Geometric duality connects graph isomorphism and knot equivalence.

problem Understanding the equivalence of graph isomorphism and knot equivalence.
method Observation of geometric duality in planar graphs and links.
result The equivalence relation defined by isomorphisms of checkerboard graphs is the same as 2-isomorphisms of checkerboard graphs.

Proposes ENVAR for causal discovery in structural VAR models with equal noise variance.

problem Challenges in causal discovery from multivariate time series with contemporaneous effects.
method Introduces observational equivalence and the observational alignment discrepancy for structural VAR models with equal noise variance.
result Shows that multiple structural VAR parameterizations can induce the same stationary observed process law.

The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.

problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.

The neural tangent kernel equivalence theorem fails in practice.

problem Does the neural tangent kernel (NTK) equivalence theorem hold in practical neural network training?
method Rigorously derived NTK and conducted numerical experiments to evaluate the equivalence theorem.
result Adding a layer to a neural network and the corresponding updated NTK do not yield matching changes in predictor error.

Study tackles causal structure learning in linear models with unobserved variables and measurement error.

problem Challenges of unobserved common causes and measurement error in causal structure learning.
method Introduces LV-SEM-ME model with four types of variables and characterizes identifiability under separability condition.
result Establishes form of identification robustness for target effect in broader LV-SEM-ME model.

New approach to neural networks by incorporating observation noise and arbitrary prior means.

problem Misspecification on noisy data and limitations of NTK-GP equivalence.
method Introducing a regularizer for observation noise and proposing a shifted network for arbitrary prior means.
result Removes key obstacles to practical Gaussian process modeling in neural networks.

Characterizes causal structure dominance for latent variables.

problem Determining dominance relations between causal structures with latent variables.
method Complete characterization for three visible variables, partial for four; uses nontrivial inequality constraints.
result Equivalence classes with nontrivial inequality constraints become ubiquitous as the number of visible variables increases.

Paper designs energy-based controllers and observers for complex systems.

problem Controlling and observing infinite-dimensional systems with in-domain actuation.
method Uses Stokes-Dirac structures and jet-bundle structures to derive controllers and observers.
result Control schemes derived in both frameworks are equivalent.

This work uses a scalable approach to identify partially observed nonlinear systems.

problem Offline identification of partially observed nonlinear systems.
method Certainty-equivalent expectation-maximization (CEEM) as block coordinate-ascent.
result The CEEM approach can identify high-dimensional systems reliably and efficiently.

MEC-IP uses IP to efficiently find MECs in BNs from observational data.

problem Discovering Markov Equivalent Classes (MECs) in Bayesian Networks (BNs) efficiently.
method Clique-focusing strategy and EMSG for MEC discovery via Integer Programming.
result Significant reduction in computational time and improved accuracy.

The paper develops methods to bound causal effects using Partial Ancestral Graphs.

problem Bounding causal effects from observational data when true causal diagrams are unknown.
method Proposes a method using Partial Ancestral Graphs to derive bounds on causal effects from observational data.
result Demonstrates the effectiveness of the method with synthetic and real data examples.

We consider a continuous-time model for inventory management with Markov modulated non-stationary demands. We introduce active learning by assuming that the state of the world is unobserved and must be inferred by the manager. We also assume that demands are observed only when they are completely met. We first derive t…

2012-06-27abs ↗pdf ↗

Transforms between neural networks using manifold-learning techniques.

problem Establish equivalence between different neural networks.
method Diffusion maps with a Mahalanobis-like metric to construct transformations between network outputs and internal neuron activations.
result Established equivalence classes between neural networks trained on various data types.

We shrink confidence sets for equivalent discrete distributions using permutation equivalence.

problem Building high-probability confidence sets for equivalent discrete distributions.
method Exploiting permutation-equivalence to refine confidence sets.
result Confidence sets shrink at asymptotic rates of O(1/kKnk)O(1/\sqrt{\sum_{k\in \mathcal K} n_k}) and O(1/maxkKnk)O(1/\max_{k\in K} n_{k}).

We study the performance of the certainty equivalent controller on Linear Quadratic (LQ) control problems with unknown transition dynamics. We show that for both the fully and partially observed settings, the sub-optimality gap between the cost incurred by playing the certainty equivalent controller on the true system …

2019-02-21abs ↗pdf ↗

Model identifies causal structure from paired observational and interventional data with unknown soft interventions.

problem Identifying causal structure from observational and interventional data with unknown soft interventions.
method Proposes a scalable causal discovery model that aggregates subset-level PDAGs and applies contrastive cross-regime orientation rules.
result The model asymptotically recovers the identifiable PDAG and can orient additional edges compared to non-contrastive subset-restricted methods.

Paper proposes scalable algorithm to estimate intervention targets in linear models.

problem Estimating intervention targets in linear models from observational and interventional data.
method The paper proposes a scalable algorithm that estimates intervention sites from the difference between precision matrices of observational and interventional datasets.
result The algorithm consistently identifies all intervention targets and updates observational Markov equivalence classes to interventional ones.

Right-angled Artin groups are classified based on measure equivalence.

problem Classifying right-angled Artin groups using measure equivalence.
method Proved measure equivalence implies isomorphic extension graphs, and used quasi-isometry results.
result No right-angled Artin group is superrigid for measure equivalence.

We discuss theoretical aspects of the product rule for classification problems in supervised machine learning for the case of combining classifiers. We show that (1) the product rule arises from the MAP classifier supposing equivalent priors and conditional independence given a class; (2) under some conditions, the pro…

2013-01-17abs ↗pdf ↗

Trajectories of light rays in a static spacetime are described by unparametrised geodesics of the Riemannian optical metric associated with the Lorentzian spacetime metric. We investigate the uniqueness of this structure and demonstrate that two different observers, moving relative to one another, who both see the univ…

2011-01-23abs ↗pdf ↗

A new sampler improves the inference of causal structures from observational data.

problem Inferring causal relationships from observational data when DAGs are Markov equivalent.
method Developed a non-reversible Markov chain, Causal Zig-Zag sampler, targeting Markov Equivalence Classes of DAGs.
result The sampler improves mixing and offers efficient algorithms for DAG inference.

Separates estimation and control in risk-sensitive investment problems with partial observation.

problem Risk-sensitive investment problems with incomplete observation.
method Investigates separability of a general class of risk-sensitive investment management problems using a finite-dimensional filter.
result The separated problem is strictly equivalent to the original control problem.

In this note we make several observations concerning symplectic cobordisms. Among other things we show that every contact 3-manifold has infinitely many concave symplectic fillings and that all overtwisted contact 3-manifolds are ``symplectic cobordism equivalent.''

2001-02-20abs ↗pdf ↗

We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free factor equipped with a quotient topology. Here two such trees are equivalent if the …

2012-11-07abs ↗pdf ↗

If M=(M,)\mathcal{M}=(M,\nabla) is an affine surface, let Q(M):=ker(H+1m1ρs)\mathcal{Q}(\mathcal{M}):=\ker(\mathcal{H}+\frac1{m-1}ρ_s) be the space of solutions to the quasi-Einstein equation for the crucial eigenvalue. Let M~=(M,~)\tilde{\mathcal{M}}=(M,\tilde\nabla) be another affine structure on MM which is strongly projectively flat. We sh…

2018-06-18abs ↗pdf ↗

Joyce observed that the Alexander invariant and the medial quandle of a classical knot are equivalent to each other, as invariants. In the present paper, we discuss the rather complicated extension of Joyce's observation to several different medial quandles and reduced (one-variable) Alexander modules associated with c…

2019-11-24abs ↗pdf ↗

Optimizes experiment design for causal structure learning in linear models with cycles.

problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.
method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.
result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.

We study the classification problem of singularities of function-germs with harmonic leading terms of two variables under the right-equivalence. We observe that the multiple actions of Laplacian appear for the classifications of such class of function-germs.

2016-10-29abs ↗pdf ↗

It is shown that any handle-irreducible summand of every stable-ribbon surface-link is a unique ribbon surface-link up to equivalences, so that every stable-ribbon surface-link is a ribbon surface-link. This is a generalization of a previously observed result for a stably trivial surface-link. Two observations are give…

2019-07-23abs ↗pdf ↗

We develop a method to summarize causal models with cycles in cubic time.

problem Cycles in high-dimensional causal models limit applicability of existing methods.
method We relax the acyclicity assumption in LiNG models and develop a low-dimensional DAG summary.
result Our method allows recovery of a low-dimensional DAG from high-dimensional data with cycles.

We characterize distributional equivalence in latent-variable models with cycles.

problem Lack of an equivalence characterization for latent-variable causal models with cycles.
method Established graphical criterion for distributional equivalence and developed edge rank constraints.
result First equivalence characterization without structural assumptions for latent-variable models with cycles.

It is well known that pseudo-Riemannian metrics in the projective class of a given torsion free affine connection can be obtained from (and are equivalent to) the solutions of a certain overdetermined projectively invariant differential equation. This equation is a special case of a so-called first BGG equation. The ge…

2012-06-30abs ↗pdf ↗

A directed acyclic graph (DAG) is the most common graphical model for representing causal relationships among a set of variables. When restricted to using only observational data, the structure of the ground truth DAG is identifiable only up to Markov equivalence, based on conditional independence relations among the v…

2018-02-05abs ↗pdf ↗