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

Trend · papers per month

55110165220 · Jun 202019922001200920172026
48 results for Faithfulness Assumption

Paper relaxes faithfulness assumption for causal discovery using interventions.

problem Violation of faithfulness assumption in natural systems leads to incorrect causal structure identification.
method Use intervention-immediacy faithfulness assumption to identify causal structures with hard interventions.
result Interventions contain information about causal structure that can identify causal structures when faithfulness is violated.

The paper defines conditions for learning causal graphs from data with unobserved variables.

problem Learning causal graphs from data with unobserved variables.
method Formalizes constraint-based structure learning algorithms under conditions and assumptions.
result Natural family of algorithms output Markov equivalent graphs to the causal graph under faithfulness assumption.

This paper deals with chain graphs under the alternative Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. We also show that the extension of Meek's conjecture to AMP chain graphs does n…

2012-04-24abs ↗pdf ↗

We tackle causal discovery in linear systems with measurement error and unobserved causes.

problem Causal discovery in linear systems with measurement error and unobserved causes.
method Characterization of identifiability based on the mixing matrix, proposing causal structure learning methods.
result The structure of causal models can be identified under certain faithfulness assumptions.

Bayesian networks are typically faithful, with implications for causal inference.

problem Determining the typicality of faithfulness in Bayesian networks.
method Analysis of Bayesian networks over a given DAG, parametrized by conditional exponential families, and nonparametric conditional densities.
result The faithful Bayesian networks are dense and open with respect to the total variation metric, extending existing results for specific classes of Bayesian networks.

This thesis relaxes assumptions for causal discovery, making methods applicable to more complex systems.

problem Learning causal structures from observational data with latent variables.
method Alternative definition of k-Triangle Faithfulness for non-Gaussian distributions and uniform consistency proof.
result Uniform consistency of causal discovery algorithm under modified faithfulness assumption.

This work addresses the following question: Under what assumptions on the data generating process can one infer the causal graph from the joint distribution? The approach taken by conditional independence-based causal discovery methods is based on two assumptions: the Markov condition and faithfulness. It has been show…

2012-02-14abs ↗pdf ↗

We study the problem of variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that…

2014-11-07abs ↗pdf ↗

Two new metrics assess LLM faithfulness and entropy, improving model reliability.

problem Evaluating the accuracy of LLMs in generating coherent responses.
method Proposes SF and SEP metrics based on information theory and thermodynamics.
result High SF and SEP scores indicate more faithful LLM responses.

Efficiently learns linear non-Gaussian DAGs with noisy nodes.

problem Learning DAGs with non-Gaussian noise and diverging number of nodes.
method Proposes a novel method using topological layers for bottom-up reconstruction and consistent parent-child relations.
result Topological layers can be exactly reconstructed and parent-child relations established without faithfulness assumption.

New method learns dependencies in high-dimensional data without graph assumptions.

problem Learning dependencies in nonparametric and high-dimensional settings.
method Neighbourhood lattice decomposition for nonparametric CI learning.
result Compact, non-graphical representation of CI exists in any graphical model.

Study evaluates feature ranking methods' faithfulness in ML models, improving with dimensionality reduction.

problem Quantifying and improving the faithfulness of feature ranking methods in ML models.
method Evaluation of multiple feature ranking methods, including SHAP, LIME, ALE variance, and LR coefficients, using permutation importance as a baseline.
result Dimensionality reduction improves the faithfulness of feature ranking methods, making permutation importance the most faithful method.

The Burau representation is a natural action of the braid group B_n on the free Z[t,t^{-1}]-module of rank n-1. It is a longstanding open problem to determine for which values of n this representation is faithful. It is known to be faithful for n=3. Moody has shown that it is not faithful for n>8 and Long and Paton imp…

1999-04-20abs ↗pdf ↗

In this article we study the space of left- and bi-invariant orderings on a torsion-free nilpotent group GG. We will show that generally the set of such orderings is equipped with a faithful action of the automorphism group of GG. We prove a result which allows us to establish the same conclusion when GG is assumed …

2010-11-12abs ↗pdf ↗

We show the set of faithful representations of a closed orientable hyperbolic surface group is dense in both irreducible components of the PSL(2,K) representation variety, where K is the field of real or complex numbers, answering a question of W. Goldman. We also prove the existence of faithful representations into PU…

2004-11-11abs ↗pdf ↗

The Burau representation of 3-strand braid group modulo p is determined and shown to be faithful for small p.

problem Determining the faithfulness of the Burau representation of B3B_3 modulo pp.
method Algorithm and proof for faithfulness, solving Salter's question for all p.
result The Burau representation of B3B_3 modulo pp is faithful for p13p \leq 13 and for all pp.

The study evaluates how well local explanations align with model predictions.

problem Capturing the faithfulness of local explanations to model predictions.
method Introducing consistency and sufficiency as properties, and developing quantitative measures and estimators.
result Quantitative measures of consistency and sufficiency depend on test-time data distribution.

Measures faithfulness of LLM explanations to reveal hidden biases and misleading claims.

problem LLM explanations can misrepresent the model's reasoning process, leading to over-trust and misuse.
method Defines faithfulness in terms of concept influence and uses counterfactuals and Bayesian models to estimate it.
result Can quantify and discover interpretable patterns of unfaithfulness in LLM explanations.

Detect hidden confounding in observational data using multiple environments.

problem Detect hidden confounding in observational data.
method Theoretical framework and simulation studies to test for hidden confounding.
result The proposed procedure correctly predicts hidden confounding, especially when bias is large.

Counterexamples show Salter's question on Burau image is negative for n=4.

problem Conditions for a matrix to be in the Burau image of B4B_4.
method Analyzing the central quotient and using counterexamples.
result The central quotient of the Burau image group does not coincide with the central quotient of a specific subgroup of the unitary group for n=4n=4.

In this paper we investigate the spectral problem in Finsler geometry. Due to the nonlinearity of the Finsler-Laplacian operator, we introduce \textit{faithful dimension pairs} by means of which the spectrum of a compact reversible Finsler metric measure manifold is defined. Various upper and lower bounds of such eigen…

2019-07-02abs ↗pdf ↗

Based on a normal form for braid group elements suggested by Dehornoy, we prove several representations of braid groups by automorphisms of a free group to be faithful. This includes a simple proof of the standard Artin's representation being faithful.

2002-03-17abs ↗pdf ↗

This paper deals with chain graphs under the classic Lauritzen-Wermuth-Frydenberg interpretation. We prove that the regular Gaussian distributions that factorize with respect to a chain graph GG with dd parameters have positive Lebesgue measure with respect to Rd\mathbb{R}^d, whereas those that factorize with respect…

2010-08-13abs ↗pdf ↗

ID-ExpO fine-tunes neural networks for more faithful explanations.

problem Improving the faithfulness of explanations for complex machine learning models.
method Differentiable insertion/deletion metric-aware regularizers for optimization.
result Fine-tuned predictors produce more faithful explanations.

We prove that a free group F_2 admits a faithful discrete representation into Diff_{+}(I). We also prove that F_2 admits a faithful discrete representation into Homeo_{+}(I). Some properties of these representations have been studied. In the last section we raise several questions.

2010-04-12abs ↗pdf ↗