arXiv Machine Learning By Sourish Dey

F-DACE: Fuzzy Disagreement-Aware Causal Evidence Fusion for Abstention-Safe Conversational Retail Decision Support

Read the original on arXiv Machine Learning →

F-DACE is a decision layer for causal machine‑learning‑based decision‑support systems that fuses multiple causal estimators using fuzzy memberships for precision, overlap, stability, and agreement, and abstains when diagnostics fail or evidence is weak. In simulations it made decisions in 67.2 % of runs while limiting false recommendations to 17.2 %, outperforming individual estimators. In a Walmart retail panel application, F‑DACE abstained on all five markdown indicators and, when integrated with a LangGraph conversational agent, achieved perfect tool‑routing accuracy and high groundedness on live queries.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI
Sep 25

Augur: A Synthetic Decision Lab for Rehearsing Reactions to Product and Policy Changes

Augur is a synthetic decision laboratory that simulates how users will react to product and policy changes before they are released. It constructs a typed knowledge graph from change documents, populates a persona market, runs simulations, and produces an auditable decision memo recommending one of five actions. Using a dataset of 50 real episodes (Gold‑50), the authors evaluate the system’s five‑way release verdicts and find that evaluation design, rather than model capability, largely drives performance differences among frontier and open‑weight models.

By Rahul Khedar, Mayank Malhotra, Avinash Karn
arXiv AI
Aug 24

JuryProbe: An Empirical Consensus-Risk Diagnostic for Routing Reference-Free Factuality Judge Panels to Grounded Verification

JuryProbe is an empirical diagnostic tool designed to assess consensus risk in panels of reference‑free large language model judges used for factuality verification. It estimates risk by measuring false‑negative correlations and false‑consensus lift from a labeled calibration probe, and routes high‑risk majority decisions to judges with trusted references. The approach was validated on FEVER corruptions, showing that flagged decisions can be grounded without additional reference acquisition in most cases, while reducing false accepts by about 0.4% and avoiding 28% of reference acquisitions.

By Tianxin Zhou, Ruixi Lin
arXiv Computation and Language
Oct 16

Jev-as-a-Judge for RAG Claim Verification: Confidence-Gated Cascading Between a Non-Generative Verifier and a Frontier LLM

The paper compares a non‑generative verifier (Jev) with a frontier LLM (Astra) on 495 human‑labelled claims from LLM‑AggreFact. Both models achieve statistically indistinguishable accuracy, yet Jev is 187‑fold cheaper and admits more unsupported claims. A confidence‑gated cascade that escalates uncertain claims improves cost‑efficiency, though the benefit comes mainly from the escalation share rather than the probability estimates.

By Alden Do Rosario, Kirollos Atef
arXiv AI
Oct 16

Human Interventions as Labels: Localizing, Steering, and (Sometimes) Editing the Computations Behind LLM Agent Failures

The paper treats human interventions during LLM agent failures as labels that pinpoint the internal computation that went wrong, rather than merely training data. In a controlled environment, the authors analyze one failure type—over‑asking a clarifying question when the request is already clear—using rule‑based overseer labels validated by blind human judgment. They find that the decision to ask versus act can be causally localized across several models, that over‑asking exhibits distinct mechanistic signatures, and that steering or weight consolidation can mitigate the issue, though outcomes vary by model family.

By Cesare Zavattari, Alessandro Tommasi, Giuseppe Prencipe
arXiv AI
Oct 5

Reasoning Models Are Accurate but Unsound on Identification

The paper introduces CERTID, a formal identification pipeline that uses the sound and complete causal identification algorithm ID to certify whether a causal effect is identifiable from a given graph and query. CERTID also verifies returned formulas against structural causal models with known interventional distributions, mitigating structural leakage and providing grading guarantees. The authors evaluate three frontier reasoning models on 1,200 certified instances, finding that accuracy is a poor proxy for soundness, with false-claim rates on non-identifiable queries varying by seventeen-fold across models.

By Arman Behnam, Binghui Wang