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

63126189252 · May 202619922001200920172026
48 results for direct causal clause

Paper characterizes and represents pairwise causal background knowledge for improved causal inference.

problem Improving causal inference by handling pairwise causal constraints.
method Graphical characterization, direct causal clause (DCC), unified representation, MPDAG, polynomial-time algorithms.
result Pairwise causal background knowledge uniquely decomposes into MPDAG and DCCs, improving causal effect identification.

We present a case-study demonstrating the usefulness of Bayesian hierarchical mixture modelling for investigating cognitive processes. In sentence comprehension, it is widely assumed that the distance between linguistic co-dependents affects the latency of dependency resolution: the longer the distance, the longer the …

2017-02-02abs ↗pdf ↗

Faster Tsetlin Machines use clause indexing to speed inference and learning.

problem Overfitting and slow inference in Tsetlin Machines.
method Introduced a look-up table that indexes clauses based on feature falsification, enabling faster evaluation of clauses.
result Up to 15 times faster classification and three times faster learning on MNIST and Fashion-MNIST.

Statistical relational frameworks such as Markov logic networks and probabilistic soft logic (PSL) encode model structure with weighted first-order logical clauses. Learning these clauses from data is referred to as structure learning. Structure learning alleviates the manual cost of specifying models. However, this be…

2018-07-03abs ↗pdf ↗

New study shows low-degree polynomial algorithms struggle at clause densities close to Fix's.

problem Finding satisfying assignments in random k-SAT formulas at high clause densities.
method Analysis of low-degree polynomial algorithms and a new many-way overlap gap property.
result No efficient algorithms can find satisfying assignments at clause densities close to Fix's.

Convolutional neural networks (CNNs) have obtained astounding successes for important pattern recognition tasks, but they suffer from high computational complexity and the lack of interpretability. The recent Tsetlin Machine (TM) attempts to address this lack by using easy-to-interpret conjunctive clauses in propositio…

2019-05-23abs ↗pdf ↗

ClauseLens uses reinforcement learning to price reinsurance treaties transparently and auditably.

problem Opaque and difficult-to-audit reinsurance treaty pricing practices.
method ClauseLens models treaty pricing as a Risk-Aware Constrained Markov Decision Process (RA-CMDP), incorporating legal clauses and generating interpretable explanations.
result ClauseLens reduces solvency violations and improves tail-risk performance, achieving 88.2% accuracy in clause-grounded explanations.

The recently introduced Tsetlin Machine (TM) has provided competitive pattern recognition accuracy in several benchmarks, however, requires a 3-dimensional hyperparameter search. In this paper, we introduce the Multigranular Tsetlin Machine (MTM). The MTM eliminates the specificity hyperparameter, used by the TM to con…

2019-09-16abs ↗pdf ↗

We present a dataset and experiments on applying recurrent neural networks (RNNs) for guiding clause selection in the connection tableau proof calculus. The RNN encodes a sequence of literals from the current branch of the partial proof tree to a hidden vector state; using it, the system selects a clause for extending …

2019-05-20abs ↗pdf ↗

This paper works out fair values of stock loan model with automatic termination clause, cap and margin. This stock loan is treated as a generalized perpetual American option with possibly negative interest rate and some constraints. Since it helps a bank to control the risk, the banks charge less service fees compared …

2010-05-09abs ↗pdf ↗

The paper introduces closed-form expressions for interpreting Tsetlin Machines.

problem Interpreting complex Tsetlin Machines with a large number of clauses.
method Developed closed-form expressions for local and global interpretability of Tsetlin Machines.
result The expressions enable real-time feature importance assessment and data clustering.

Identification of causal direction between a causal-effect pair from observed data has recently attracted much attention. Various methods based on functional causal models have been proposed to solve this problem, by assuming the causal process satisfies some (structural) constraints and showing that the reverse direct…

2019-05-23abs ↗pdf ↗

Pricing Chinese convertible bonds using Monte Carlo simulation and dynamic programming.

problem Pricing Chinese convertible bonds accurately.
method Monte Carlo simulation and dynamic programming with regression and backward induction.
result An underpriced strategy significantly outperforms benchmarks.

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 method identifies valid IVs for bi-directional MR with invalid instruments.

problem Estimating causal effects from observational data with invalid instruments and unmeasured confounding.
method Theoretical investigation and cluster fusion-like method to discover valid IV sets.
result Theoretical demonstration and experimental validation of the method's effectiveness.

We fully develop the concept of causal symmetry introduced in Class. Quant. Grav. 20 (2003) L139. A causal symmetry is a transformation of a Lorentzian manifold (V,g) which maps every future-directed vector onto a future-directed vector. We prove that the set of all causal symmetries is not a group under the usual comp…

2003-08-28abs ↗pdf ↗

Paper constructs unfaithful probability distributions in binary causal graphs.

problem Unfaithful probability distributions in binary causal graphs.
method Constructs unfaithful probability distributions in binary causal graphs.
result Examples of unfaithful probability distributions in binary causal graphs.

New method identifies causal parameters in tree-shaped linear models using cycles.

problem Identifying causal parameters from correlations in tree-shaped linear models.
method Investigates tree-shaped linear models, uses missing cycles to identify causal parameters, solves quadratic equations.
result Shows how missing cycles can be combined to obtain a unique solution for causal parameters.

Causal reasoning has been an indispensable capability for humans and other intelligent animals to interact with the physical world. In this work, we propose to endow an artificial agent with the capability of causal reasoning for completing goal-directed tasks. We develop learning-based approaches to inducing causal kn…

2019-10-03abs ↗pdf ↗

In this work we define and study the relations between Lorentzian Manifolds given by the diffeomorphisms which map causal future directed vectors onto causal future directed vectors. This class of diffeomorphisms, called proper causal relations, contains as a subset the well-known group of conformal relations and are d…

2002-02-04abs ↗pdf ↗

This paper establishes the existence of observable footprints that reveal the "causal dispositions" of the object categories appearing in collections of images. We achieve this goal in two steps. First, we take a learning approach to observational causal discovery, and build a classifier that achieves state-of-the-art …

2016-05-26abs ↗pdf ↗

We define a new type of transformation for Lorentzian manifolds characterized by mapping every causal future-directed vector onto a causal future-directed vector. The set of all such transformations, which we call causal symmetries, has the structure of a submonoid. Some of their properties are investigated and we give…

2002-11-29abs ↗pdf ↗

CASTLE learns causal DAG to improve model generalization.

problem Improving model generalization to out-of-sample data.
method CASTLE learns causal relationships via adjacency matrix embedded in neural network input layers, reconstructing only causal features.
result CASTLE leads to better out-of-sample predictions compared to other regularizers.

A novel framework infers causal direction from symbolic sequences using pattern entropy.

problem Challenges in discovering causal direction from temporal symbolic data.
method Dictionary Based Pattern Entropy (DPEDPE) framework integrating AIT and Shannon Information Theory.
result Minimizing pattern level uncertainty yields a robust framework for causal discovery.

We propose a method to learn causal response representations through direct effect analysis.

problem Uncovering direct causal effects in complex, multivariate settings.
method Our method bridges conditional independence testing with causal representation learning, formulating an optimisation problem to maximise evidence against conditional independence.
result The largest eigenvalue distribution can be bounded by an FF-distribution, providing testable conditional independence.

Local causal structure learning aims to discover and distinguish direct causes (parents) and direct effects (children) of a variable of interest from data. While emerging successes have been made, existing methods need to search a large space to distinguish direct causes from direct effects of a target variable \emph{T…

2019-10-03abs ↗pdf ↗

We propose a new method of discovering causal relationships in temporal data based on the notion of causal compression. To this end, we adopt the Pearlian graph setting and the directed information as an information theoretic tool for quantifying causality. We introduce chain rule for directed information and use it to…

2016-11-01abs ↗pdf ↗

A framework infers causal direction from symbolic sequences using compression measures.

problem Inferring causal direction from two observed discrete symbolic sequences.
method Lossless compressors for inferring context-free grammars (CFGs) and quantifying compression extent.
result Grammar inferred from one sequence better compresses the other sequence, indicating causal direction.

We identify direct causes of a target variable from observational data without full DAG identifiability.

problem Learning direct causes of a target variable from observational data.
method Developed algorithms under relaxed identifiability assumptions for one environment without interventions.
result Identifiable set of direct causes from observational data under specific assumptions.

We consider learning the possible causal direction of two observed variables in the presence of latent confounding variables. Several existing methods have been shown to consistently estimate causal direction assuming linear or some type of nonlinear relationship and no latent confounders. However, the estimation resul…

2013-10-24abs ↗pdf ↗

DAG-FM discovers causal relationships from heterogeneous data.

problem Challenges in causal discovery from heterogeneous causal mechanisms.
method DAG-FM uses two specialized Transformer-based sub-modules and a robust tabular interaction block to model complex row-column interactions.
result DAG-FM achieves state-of-the-art performance on synthetic and real-world datasets.

Autoregressive flow models can perform causal discovery and inference tasks.

problem Causal inference tasks such as causal discovery and interventional predictions.
method Using autoregressive flow models to estimate causal directions and make predictions.
result Autoregressive flows can accurately perform causal inference tasks without restrictive assumptions.

Causal autoregressive flows enable accurate causal inference and prediction.

problem Causal discovery and interventional predictions in machine learning.
method Autoregressive normalizing flows with fixed variable orderings.
result Causal models derived from autoregressive flows are identifiable and allow for accurate interventional and counterfactual predictions.