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.

169,051 papers · 148 categories

Trend · papers per month

4998147196 · Jun 202019922001200920172026
48 results for Gaussian SEMs

New method identifies Gaussian SEMs with varying error variances.

problem Identify Gaussian SEMs with both homogeneous and heterogeneous error variances.
method Exploits error variances and edge weights; provides a statistically consistent and feasible structure learning algorithm.
result Proves identifiability of Gaussian SEMs with both homogeneous and heterogeneous unknown error variances.

Bayesian method recovers causal structure in SEMs with equal error variances.

problem Recovering causal structure in SEMs with equal error variances.
method Bayesian DAG selection method using g-priors and the key property of minimum expected squared errors.
result The method consistently recovers the true graph without additional distributional assumptions.

In this paper we provide a new analysis of the SEM algorithm. Unlike previous work, we focus on the analysis of a single run of the algorithm. First, we discuss the algorithm for general mixture distributions. Second, we consider Gaussian mixture models and show that with high probability the update equations of the EM…

2013-10-18abs ↗pdf ↗

Paper develops a method to learn causal networks with non-invertible functions.

problem Identifying causal relationships from observational data with non-invertible functional relationships.
method Proposes a test for non-invertible bivariate causal models and develops a method to incorporate this test in structure learning of DAGs.
result Our algorithms outperform existing DAG learning methods in identifying causal graphical structures.

New method disentangles mixed interventional and observational data in SEMs.

problem Learning causal relationships from mixed interventional and observational data.
method Developed a method to disentangle mixed interventional and observational data in linear SEMs with Gaussian noise.
result The method can identify causal graphs up to their interventional Markov Equivalence Class.

sEM uses optimal transport to improve EM algorithm for better convergence and avoiding local optima.

problem Improving the EM algorithm for better convergence and avoiding local optima.
method sEM uses entropic optimal transport to compute responsibilities in the expectation step, leading to better global convergence guarantees and avoiding local optima.
result sEM learns cell labels significantly better than other approaches, improving convergence and avoiding local optima.

SEM-DNN learns reciprocal interactions from observational data without external instruments.

problem Estimating bidirectional interactions from endogenous data.
method Heteroscedastic neural simultaneous-equation estimator (SEM-DNN) that learns reciprocal structural interactions.
result SEM-DNN recovers structural effects more reliably than other methods under increasing information.

Study combines SEM, OLS, and DML for robustness checks in survey-based research.

problem Stability of SEM findings under alternative estimation frameworks.
method Staged robustness analysis framework connecting SEM, OLS, and DML.
result Identifies stable and unstable relationships across SEM, OLS, and DML checks.

Paper directly estimates structural difference between SEMs from samples.

problem Estimating change in causal relationships between two conditions.
method Principled algorithm that recovers structural difference SEM in O(d^2 log p) samples.
result Method outperforms state-of-the-art and validates usefulness in medical domain.

Novel approach for SEM in small samples with p>np>n.

problem Small sample size and p>np>n issues in factor-based SEM.
method Reformulates covariance structure into self-covariance and cross-covariance, defines a feasible set with relative error constraint.
result Improved stability and directional information in small-sample settings.

The paper tackles generalization in machine learning by finding invariant representations of data.

problem Obtaining robust models that generalize well across different training environments.
method The paper introduces the concept of εε-approximate invariance to study the robustness of models to unseen SEMs.
result The paper provides finite-sample out-of-distribution generalization guarantees for approximate invariance in linear SEMs.

A new snake model improves segmentation of SEM images.

problem Efficiently segmenting overlapping electronic structures in SEM images.
method Geodesic tracking on projective line bundle with a geometric criterion for switching between fast spatial snakes and minimizing geodesics.
result Improved robust and automatic segmentation of overlapping electronic structures in SEM images.

SLEM uses machine learning to improve causal inference from observational data.

problem Improving causal inference from observational data using non-linear relationships.
method Super Learner Equation Modeling integrating machine learning ensembles.
result SLEM provides consistent and unbiased estimates of causal effects.

New neural approach for estimating SEMs with provable convergence.

problem Estimating structural parameters in SEMs.
method Formulated as a min-max game with neural networks, learned using stochastic gradient descent.
result Global convergence in overparametrized regime, improving state-of-the-art.

A new framework evaluates LLM calibration in open-ended QA.

problem Evaluating LLM calibration in open-ended QA settings.
method Sem-ECE framework: sampling answers, grouping by semantic classes, and using frequencies as confidence.
result Sem-ECE estimators are unbiased and Sem2_2 achieves smaller calibration error.

IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.

problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.

Complex systems can be modelled at various levels of detail. Ideally, causal models of the same system should be consistent with one another in the sense that they agree in their predictions of the effects of interventions. We formalise this notion of consistency in the case of Structural Equation Models (SEMs) by intr…

2017-07-04abs ↗pdf ↗

In this paper, we introduce and evaluate a data-driven staged mixture modeling technique for building density, regression, and classification models. Our basic approach is to sequentially add components to a finite mixture model using the structural expectation maximization (SEM) algorithm. We show that our technique i…

2012-12-12abs ↗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.

Bayesian method identifies causal DAG structure from non-Gaussian errors.

problem Learning causal structure from non-Gaussian errors in Bayesian networks.
method Bayesian hierarchical model with DAG prior for non-Gaussian errors.
result Posterior DAG selection consistency achieved under mild assumptions.

Improved neural network convergence with causal Bayesian modeling in retail performance.

problem Improving neural network convergence in retail performance models.
method Causal Bayesian neural network implementation, removal of weakest SEM path, Flipout layers, Vadam optimizer.
result Neural network convergence improved with removal of the weakest SEM path.

Efficiently trains GMMs for streaming data with SGD, addressing local optima and numerical instabilities.

problem Local optima and numerical instabilities in training GMMs for high-dimensional streaming data.
method Stochastic Gradient Descent (SGD) with adaptive annealing and exponential-free approximation.
result SGD approach trains GMMs without k-means initialization and outperforms sEM for high-dimensional data.

This paper addresses robust CBs for linear SEMs with model fluctuations.

problem Designing interventions in causal systems with linear SEMs that are robust to model fluctuations.
method Develops a robust CB algorithm and analyzes its regret under model deviation.
result The proposed algorithm achieves nearly optimal ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) regret when CC is o(T)o(\sqrt{T}) and maintains sub-linear regret for a broader range of CC.

The paper tackles causal bandits for SEMs, proposing algorithms that avoid estimating 2N2^N reward distributions.

problem Designing an optimal sequence of interventions in causal graphical models to minimize cumulative regret.
method Proposes two algorithms for causal bandits for linear structural equation models (SEMs), avoiding the estimation of 2N2^N reward distributions.
result Cumulative regrets scale as ildeO(dL+12NT) ilde{\cal O} (d^{L+\frac{1}{2}} \sqrt{NT}) under bounded noise and parameter space.

ExDAG solves DAG learning problems with low structural Hamming distance.

problem Learning DAGs with low structural Hamming distance under identifiability assumptions.
method Mixed-integer quadratic programming (MIQP) with branch-and-bound-and-cut algorithm and lazy constraints.
result ExDAG guarantees global convergence and provides a real-time quality assessment.

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.

Identifies patient-specific root causes of disease using structural equation models.

problem Detecting significant variables in complex diseases that differ between patients.
method Defining patient-specific root causes as exogenous errors in a structural equation model, quantifying predictivity using Shapley values, and developing a fast algorithm called Root Causal Inference.
result Significant improvements in accuracy by uncovering root causes with large effect sizes at the individual level but clinically insignificant effect sizes at the group level.

New algorithm reduces regret in CBs with time-varying models.

problem Designing robust interventions in CBs with unknown, fluctuating causal models.
method Proposes a robust CB algorithm with upper and lower bounds on regret.
result Achieves nearly optimal ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) regret under certain conditions.

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.

Network science provides valuable insights across numerous disciplines including sociology, biology, neuroscience and engineering. A task of major practical importance in these application domains is inferring the network structure from noisy observations at a subset of nodes. Available methods for topology inference t…

2018-05-16abs ↗pdf ↗

In recent years, data dimensionality has increasingly become a concern, leading to many parameter and dimension reduction techniques being proposed in the literature. A parameter-wise co-clustering model, for data modelled via continuous random variables, is presented. The proposed model, although allowing more flexibi…

2018-08-25abs ↗pdf ↗