CORTEXA
← Browse
arxivcs.LG2026-07-31

ALIVE: Warnings Before Exclusion in Budgeted Multi-Source Learning

Xiyang Zhang, Hongzhi Wang, Yuanhe Tian

A routing decision can be revised at the next transaction, but a latched source exclusion persists across later decisions. We ask what evidence should authorize these unequal-persistence actions when finite-population auditing and learning share a budget. ALIVE (Action-Layered Intervention via Evidence) is an auditable control layer: one randomized without-replacement prefix supplies cached evidence, heuristic warnings drive non-latching floor-bounded routing, and only two fresh simultaneous certificate separations may latch an exclusion request subject to capacity-feasible activation. Conditional on fixed support and labels under an ideal uniform audit permutation, any predictable controller preserving this interface inherits an anytime familywise bound of δon acting against a source that fails the pre-fixed absolute or relative strict-majority-disagreement predicate. With a published known-size, all-strict-majority PPR engine, median evidence count fell from 304 to 96 identities in e40 and from 171 to 62 in e60, while both engines used 48 in e80. In the matched CIFAR controller, the persistent-action layer added +0.1935 accuracy-AUBC percentage points over routing-only in all ten paired seed clusters. The +0.1954-point full-system contrast against CBR was also positive but did not meet the predeclared multiplicity-adjusted criterion (conditional Holm-adjusted sign-flip reference value =.097656). On a fixed natural panel, exploratory PPR used a median closure prefix of 95 rather than 105 for exploratory Serfling/FPC, but still exposed 88.0% of the panel and had no downstream task. Together these results map a restraint--power--cost--utility boundary: the action contract controls a defined persistent decision, while net value depends on evidence margin, audit cost, and budget regime.

View free PDFSource page

Related papers

arxivcs.LG2026-07-11

EvidentialRAG: Quantifying and Mitigating Information Conflict in Multi-Source Retrieval-Augmented Generation via Evidential Deep Learning

S M Asif Hossain, Ruksat Khan Shayoni, M. F. Mridha

Retrieval-augmented generation grounds large language models in external evidence, but most pipelines still treat retrieved passages as deterministic and mutually consistent context. In open information environments, retrieved sources may disagree because of temporal drift, sourc…

View free PDFSource page
arxivcs.CVcs.AIcs.LG2026-07-09

ProsMAE: Multi-Source MAE Pretraining for ISUP Grade Classification

Anna Jung, Kyeonghun Kim, Youngung Han, Eunseob Choi, Jiwon Yang, Ken Ying-Kai Liao, et al.

Whole slide images (WSIs) provide rich diagnostic information for computational pathology, but their gigapixel scale, stain variation, scanner differences, tissue artifacts, and limited expert annotation make robust model training challenging. This paper presents a multi-source M…

View free PDFSource page
arxivcs.LGphysics.comp-ph2026-06-29

Joint discovery of governing partial differential equations from multi-source datasets by competitive optimization

Hao Xu, Siyu Lou, Yuntian Chen, Dongxiao Zhang

Discovering governing equations directly from observational data is a key step towards interpretable scientific machine learning. Current data-driven approaches typically operate on a single dataset, inherently limiting their performance when faced with restricted observations. I…

View free PDFSource page
arxivcs.MAcs.LG2026-07-22

Dreamer-CPC: Message Learning with World Models for Decentralized Multi-agent Reinforcement Learning

Taisuke Takayama, Naoto Yoshida, Tadahiro Taniguchi

In multi-agent reinforcement learning (MARL), inter-agent communication is effective for improving performance under partial observability. Representation learning-based approaches enable decentralized agents to learn messages grounded in their own observations, but they rely onl…

View free PDFSource page
arxivcs.LGcs.AIcs.IT2026-07-17

Capacity and Redundancy Trade-offs in Multi-Task Learning

Asif Khan

In multi-task learning (MTL) negative transfer is often considered as an optimization artifact, but it can also be viewed as a consequence of limited shared capacity and weak task redundancy. We investigate this effect through a Capacity--Redundancy (CR) identity that decomposes…

View free PDFSource page
arxivcs.LGcs.AI2026-07-23

Multi-Task Learning for Heterogeneous Prediction from Video Game State with Transfer Learning

Jonas Peché, Aliaksei Tsishurou, Alexander Zap, Günter Wallner

Multi-task learning (MTL) is a promising approach for prediction tasks derived from video game state data, as modern game telemetry provides multiple related supervision signals from the same structured observations. We study whether a shared model trained jointly across tasks in…

View free PDFSource page