arXiv Machine Learning By Prasanjit Dubey, Aritra Guha, Xiaoming Huo

Byzantine-Robust Federated RAG via Aligned Calibration and Fixed-Membership Conformal Prediction

Read the original on arXiv Machine Learning →

This paper introduces a Byzantine‑robust federated retrieval‑augmented generation (RAG) framework that uses aligned calibration and fixed‑membership conformal prediction to ensure that the answer set contains the correct answer with a chosen probability, even when some nodes are compromised. By having all nodes score the same calibration questions and retaining only candidates that could be kept by a plausible group of honest nodes, the method guarantees correctness in finite samples and produces smaller answer sets than simpler approaches. Experiments on medical exam question‑answering tasks with language‑model nodes demonstrate that the method meets the target coverage whenever the number of misbehaving nodes does not exceed the declared bound, while plain averaging often fails.

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 24

Meet, Compare, or Abstain: LatWeave for Deterministic Multi-Hop Question Answering on Knowledge Lattices

LatWeave is a deterministic multi‑hop question‑answering framework that structures knowledge into a multidimensional lattice and reduces QA to three operators—meet, compare, and abstain—while limiting LLM use to extraction and planning. It achieves near‑lossless performance on complete knowledge benchmarks (e.g., MetaQA) and strong results on templated multi‑hop datasets (e.g., 2WikiMultihopQA), while transparently handling incomplete knowledge through abstention. The approach offers reproducible, auditable answer paths with no performance penalty within its operating envelope.

By Yuze Ren, Shaoheng Fan, Tao Wang, Yabo Yan, Han Han
arXiv Machine Learning
Aug 13

LODESTAR: Trustworthy Entropy Is Navigated, Not Merely Measured -- Reinforced Polarizer Keeps a Frozen LLM from Being Confidently Misled by the Wrong Evidence

arXiv:2608. 11922v1 Announce Type: cross Abstract: Predictive-distribution entropy makes a strong selection rule in retrieval-augmented question answering: across five QA benchmarks, keeping the candidate answer that a frozen respondent LLM produces with the lowest answer-token entropy lifts mean answer $F_1$ from 0.

By Po-Jen Ko, Che-Cheng Wu, Hung-Chun Hsu, Li-Yang Chang, Chuan-Ju Wang
arXiv Machine Learning
Jul 14

Byzantine Accountability Without Consensus: Strong Eventual Consistency for Non-Associative, Stochastic, Robust Aggregation

arXiv:2607. 10305v1 Announce Type: cross Abstract: Byzantine-robust aggregation rules such as multi-Krum assume a central coordinator, and decentralising them is obstructed by the rules themselves: they are globally coupled, non-associative, and discontinuous, so an ulpscale perturbation can flip the selected subset, moving the output by a non-vanishing amount.

By Ryan Gillespie