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

83166248331 · Jun 202019922001200920172026
48 results for common cause principle

New method identifies common cause in causal insufficiency, revealing complex phase transitions.

problem Identifying common cause in causal insufficiency with observed joint probability.
method Generalized maximum likelihood method, closely related to maximum entropy principle.
result Identifies consistent common cause that aligns with the common cause principle.

Quantum theory challenges traditional cause-effect relations, showing causal influences even without Bell inequality violations.

problem Challenging traditional concepts of cause-effect relations in quantum mechanics.
method Introducing a general framework to estimate causal influences without interventions or classical/quantum assumptions.
result Every pure bipartite entangled state violates classical bounds on causal influence, negating the idea that Bell inequalities are the only signature of incompatibility.

Optimizes portfolios by identifying causal drivers of diversification.

problem Achieving efficient portfolio optimization based on asset and diversification dynamics.
method Commonality Principle, Reichenbach Common Cause Principle, conformal maps, Bayesian networks, correlation-based algorithms, neural networks, SDEs.
result Optimal portfolio diversification achieved through causal methodologies and sensitivity forecasting.

The discovery of causal relationships is a fundamental problem in science and medicine. In recent years, many elegant approaches to discovering causal relationships between two variables from observational data have been proposed. However, most of these deal only with purely directed causal relationships and cannot det…

2019-10-22abs ↗pdf ↗

New causal versions of MaxEnt and PIR avoid paradoxical probability updates.

problem Paradoxical probability updates in causal MaxEnt and PIR.
method Separate constraints into cause-specific and mechanism-specific restrictions.
result Causal MaxEnt avoids paradoxical updates and aligns with Information Geometric Causal Inference.

Domain adaptation addresses the common problem when the target distribution generating our test data drifts from the source (training) distribution. While absent assumptions, domain adaptation is impossible, strict conditions, e.g. covariate or label shift, enable principled algorithms. Recently-proposed domain-adversa…

2019-03-05abs ↗pdf ↗

Extract common latent factors from graphs for better representation learning.

problem Graph-level representation learning challenges due to limited labeled data and poor negative sample selection.
method Graph-wise Common Latent Factor Extraction (GCFX) using deepGCFX model.
result Improved graph-level and node-level tasks performance compared to state-of-the-art methods.

Bayesian optimization improves molecule design by addressing three pitfalls.

problem Bayesian optimization pitfalls cause poor performance in molecule design.
method Identified and addressed three pitfalls: incorrect prior width, over-smoothing, and inadequate acquisition function maximization.
result Basic BO setup achieves highest performance on PMO benchmark.

Paper simplifies calculating causation probabilities and ranks root causes.

problem Computational challenges in assessing causal relationships.
method Algorithmic simplifications and novel methodological framework for Root Cause Analysis.
result Significantly reduces computational complexity for calculating causation probabilities.

Jointly models cause-of-death mortality rates across multiple countries and genders.

problem Modeling cause-of-death mortality rates in a multinational setting.
method Multi-Output Gaussian Processes (MOGP) with Kronecker-structured kernels and latent factors.
result Efficiently captures heterogeneity and dependence across different factor inputs.

We consider linear models where dd potential causes X1,...,XdX_1,...,X_d are correlated with one target quantity YY and propose a method to infer whether the association is causal or whether it is an artifact caused by overfitting or hidden common causes. We employ the idea that in the former case the vector of regression c…

2018-03-02abs ↗pdf ↗

New insights into how to inspect and learn from multi-stage processes and AI reasoning.

problem Understanding how to attribute outcomes to early stages in multi-stage operations and AI reasoning.
method Information-theoretic analysis and mathematical proofs of four key results.
result Uniform checkpoint spacing is minimax-optimal for inspection design under homogeneous signal attenuation.

New method identifies causes in time series with latent variables.

problem Identifying direct and indirect causes in time series data with hidden variables.
method Proves necessary and sufficient conditions for causal feature selection using graph constraints and conditional independence tests.
result Method outperforms Granger causality in identifying causes with low false positives and false negatives.

Common fairness definitions in machine learning focus on balancing notions of disparity and utility. In this work, we study fairness in the context of risk disparity among sub-populations. We are interested in learning models that minimize performance discrepancies across sensitive groups without causing unnecessary ha…

2019-11-16abs ↗pdf ↗

Spectral Independence Criterion helps infer cause-effect relationships in time series.

problem Distinguishing cause from effect in time series data.
method Spectral Independence Criterion (SIC) based on PSD and frequency response.
result SIC provides a robust method for causal inference in time series data.

CLOUD method detects causal relationships in various data types without latent variable assumptions.

problem Detecting causal relationships in the presence of unobserved common causes.
method CLOUD method using Normalized Maximum Likelihood (NML) Code for various data types (discrete, mixed, continuous).
result CLOUD method is more effective than existing methods in inferring causal relationships.

New method learns graph structure with hidden causes from observational data.

problem Learning the structure of linear non-Gaussian models with hidden causes.
method Augments hidden variable structure by learning multidirected edges and uses higher order cumulants.
result Correct structure recovery for bow-free acyclic mixed graphs with multi-directed edges.

Domain adaptation refers to the process of learning prediction models in a target domain by making use of data from a source domain. Many classic methods solve the domain adaptation problem by establishing a common latent space, which may cause the loss of many important properties across both domains. In this manuscri…

2018-08-19abs ↗pdf ↗

Operational risk is the risk relative to monetary losses caused by failures of bank internal processes due to heterogeneous causes. A dynamical model including both spontaneous generation of losses and generation via interactions between different processes is presented; the efforts made by the bank to avoid the occurr…

2012-07-26abs ↗pdf ↗

Proposes CSG model to separate semantic and variation factors for OOD prediction.

problem Out-of-distribution examples cause conventional models to mix semantic and variation factors, leading to poor performance.
method Causal Semantic Generative model (CSG) based on causal reasoning, using variational Bayes for efficient learning and prediction.
result CSG can identify semantic factor and improve OOD prediction performance.

The postulate of independence of cause and mechanism (ICM) has recently led to several new causal discovery algorithms. The interpretation of independence and the way it is utilized, however, varies across these methods. Our aim in this paper is to propose a group theoretic framework for ICM to unify and generalize the…

2017-05-05abs ↗pdf ↗

Reinterprets Granger causality with causal Bayesian networks and Reichenbach's principles.

problem Lack of a rigorous causal foundation in Granger causality.
method Reinterpreting Granger causality through Reichenbach's principles and causal Bayesian networks, implementing as c-GC.
result c-GC provides a more principled framework for causal discovery in observational datasets.

We propose a method to classify the causal relationship between two discrete variables given only the joint distribution of the variables, acknowledging that the method is subject to an inherent baseline error. We assume that the causal system is acyclicity, but we do allow for hidden common causes. Our algorithm presu…

2016-11-04abs ↗pdf ↗

Many complex systems can be represented as networks, and the problem of network comparison is becoming increasingly relevant. There are many techniques for network comparison, from simply comparing network summary statistics to sophisticated but computationally costly alignment-based approaches. Yet it remains challeng…

2017-04-02abs ↗pdf ↗

Paper proposes methods to reduce bias and variance in recommender systems.

problem Bias in recommender systems due to users' preferences.
method Proposes a principled approach to reduce bias and variance in DR methods, and a novel semi-parametric collaborative learning approach.
result The proposed methods outperform existing debiasing methods in both theory and experiments.

Why deep neural networks (DNNs) capable of overfitting often generalize well in practice is a mystery [#zhang2016understanding]. To find a potential mechanism, we focus on the study of implicit biases underlying the training process of DNNs. In this work, for both real and synthetic datasets, we empirically find that a…

2018-07-03abs ↗pdf ↗

The so called "globalization" process (i.e. the inexorable integration of markets, currencies, nation-states, technologies and the intensification of consciousness of the world as a whole) has a behavior exactly equivalent to a system that is tending to a maximum entropy state. This globalization process obeys a collec…

2007-10-05abs ↗pdf ↗

Generative models learn from unlabeled videos via object segmentation and scene modeling.

problem Learning generative models from unlabelled videos.
method Decomposed into three subtasks: motion segmentation, background and foreground modeling, and scene sampling.
result Approach allows learning models that generalize beyond occlusions and represent scenes in a modular fashion.

This document provides a tutorial description of the use of the MDL principle in complex graph analysis. We give a brief summary of the preliminary subjects, and describe the basic principle, using the example of analysing the size of the largest clique in a graph. We also provide a discussion of how to interpret the r…

2018-10-31abs ↗pdf ↗

Local convolutions bias neural networks towards high-frequency adversarial examples.

problem High-frequency adversarial examples in neural networks.
method Analysis of different linear and nonlinear architectures, focusing on the impact of local convolution operations.
result Local convolutions induce an implicit bias towards high frequency features, leading to high-frequency adversarial examples.

A novel circuit motif uses sister cells for inference with correlated priors.

problem Structured priors in neural systems pose architectural challenges.
method Proposes a novel circuit motif using sister cells to implement correlated priors without direct interactions.
result Demonstrates the efficacy of correlated priors for inference in noisy environments.

Given data over variables (X1,...,Xm,Y)(X_1,...,X_m, Y) we consider the problem of finding out whether XX jointly causes YY or whether they are all confounded by an unobserved latent variable ZZ. To do so, we take an information-theoretic approach based on Kolmogorov complexity. In a nutshell, we follow the postulate that firs…

2019-01-21abs ↗pdf ↗