# Sequential auditing of connected forecast errors under partial observations

DevFeed: [Sequential auditing of connected forecast errors under partial observations](<https://devfeed.tech/articles/sequential-auditing-of-connected-forecast-errors-under-partial-observations-116864.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.03928>)

Author: Yuanbo Zhou, Junjie Xiong

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Time Series](<https://devfeed.tech/topics/time-series.md>), [sequential-testing](<https://devfeed.tech/topics/sequential-testing.md>)

Tags: [acquisition](<https://devfeed.tech/tags/acquisition.md>), [auditing](<https://devfeed.tech/tags/auditing.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [errors](<https://devfeed.tech/tags/errors.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [forecast](<https://devfeed.tech/tags/forecast.md>), [graph](<https://devfeed.tech/tags/graph.md>), [hidden](<https://devfeed.tech/tags/hidden.md>), [masking](<https://devfeed.tech/tags/masking.md>), [metr](<https://devfeed.tech/tags/metr.md>), [queries](<https://devfeed.tech/tags/queries.md>), [random](<https://devfeed.tech/tags/random.md>), [time-series](<https://devfeed.tech/tags/time-series.md>), [traversal](<https://devfeed.tech/tags/traversal.md>), [uncertainty](<https://devfeed.tech/tags/uncertainty.md>)

## AI overview

The paper studies auditing whether a connected group of locations violates forecast intervals on the same side when some outcomes are hidden. An auditor selectively queries missing labels and stops once the event is determined or the query budget is exhausted. Across three public graph time series with 30% of labels hidden, MOMS uses 19.6%-38.5% fewer queries on average than screened random acquisition. Under localized masking on METR-LA, shortest witness finds more positive cases within ten queries, with results depending on node ordering. Direct component traversal reproduces all 9,696 screened random traces without enumerating connected subsets. The reported results also show that using fewer queries to reach a decision does not necessarily improve early event discovery or reduce local computation.

## Source excerpt

arXiv:2611.03928v1 Announce Type: new Abstract: Graph forecasting systems often rely on prediction intervals to quantify uncertainty across connected locations, but the true outcomes needed for evaluation may be only partially observed. We study how an auditor can selectively retrieve missing outcomes to determine whether there exists a connected group whose outcomes violate the same side of their respective forecast intervals. The audit stops when the observed labels determine the event or the query budget is exhausted. On three public graph time series, MOMS reduces mean queries by 19.6% to 38.5% relative to screened random acquisition when 30% of labels are hidden. Under localized masking on METR-LA, shortest witness finds more positive cases within ten queries, although the difference depends on node ordering. Direct component traversal reproduces all 9,696 screened random traces without enumerating connected subsets. The experiments show that reducing queries to a decision does not necessarily improve early event discovery or reduce local computation.