跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+816新增论文
+642其中 AI 相关
+95已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-20 13:14 — 2026-11-21 13:14(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v2arXiv:2608.02877

Graph-of-Thoughts for LLM Causal Discovery with a Fairness-Pathway Case Study

Nitish Nagesh, Elahe Khatibi, Thomas Dean Hughes, Mahdi Bagheri, Pratik Gajane, Amir M. Rahmani

原文摘要

Methods that use large language models (LLMs) for causal discovery reason locally, deciding one variable pair or one node at a time, so they never compare alternative whole graphs. We introduce GoT-CD, a Graph-of-Thoughts method that asks an LLM for several complete candidate graphs from variable metadata alone, ranks them with a deterministic validity score, merges them under a hard union constraint, refines the merge, and projects the result to a DAG. We evaluate on Asia, Child, and an Alzheimer's disease graph with 100 samples and GPT-4o-mini. Over five seeds on Alzheimer's and Child, GoT-CD gives the highest mean F1 score and the lowest mean structural Hamming distance of the LLM methods, with 95% intervals of the difference excluding zero in seven of eight comparisons, and it returns a DAG in every run while using three LLM requests per graph. Replaying the logged runs without individual components attributes most of the gain to generating and merging several complete candidates. A case study on the effect of Sex on MOCA Score in the Alzheimer's graph shows the limits of structural scores: the fairness verdict drawn from the discovered graph disagrees with the reference verdict in twelve of fifteen LLM runs, including all five GoT-CD runs, which mostly drop the edge out of Sex. Graphs meant for a specific downstream analysis should therefore also be checked on the pathways that analysis depends on.

cs.LG

版本更新 · v2arXiv:2603.15926

Auditing Path-Specific Fairness Across Causal Discovery Algorithms: A Heart Failure Case Study

Nitish Nagesh, Elahe Khatibi, Thomas Hughes, Mahdi Bagheri, Pratik Gajane, Amir M. Rahmani

原文摘要

Causal discovery is increasingly applied to healthcare data, where the recovered relationships can encode biased pathways that propagate to downstream prediction. Path-specific fairness analysis, through direct, indirect, and spurious effect decompositions along with fairness-utility ratio assessment allows bias quantification and associated prediction cost. However, existing evaluations of causal discovery under fairness constraints have largely used non-clinical datasets and have not separated the contribution of confounders from that of mediators, leaving open how discovery-algorithm choice propagates through path-specific fairness to the utility trade-off in clinical settings. This work addresses that gap by establishing an expert-elicited causal graph benchmark for the heart failure clinical records dataset and tracing discovery algorithms through composite, per-variable fairness decompositions and fairness-utility ratio. ICA-LiNGAM achieves the lowest structural Hamming distance and highest recall, while GES achieves the highest precision. For path-specific effects, there was a 1.2 percentage-point difference in the mediated effect on ejection fraction on overall causal fairness between the original and discovered graphs. This ultimately led to variations in the fairness-utility ratio highlighting need for fine-grained evaluation. These results indicate that discovery-aware, path-specific fairness evaluation is consequential in clinical settings and warrants inclusion in routine auditing of clinical risk models.

cs.LG · cs.AI