← Back to all news
arXiv Statistics ML September 15, 2026 By Mehrdad Pournaderi

On Large-Scale Multiple Testing Over Networks: A Non-Asymptotic Approach

Read the original on arXiv Statistics ML →

The Flow has not summarised this story yet — read it at arXiv Statistics ML.

  • safety

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv Machine Learning
Jul 15

Saturation Makes Quantization Error Additive: A Coverage Model with a Certificate

arXiv:2607. 12266v1 Announce Type: new Abstract: Mixed-precision quantization must decide which parts of a model to keep at higher precision.

By Joshua Hill
efficiency
More like this →
arXiv AI
Sep 10

Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning

arXiv:2608.12134v2 Announce Type: replace-cross Abstract: We study nonnegative submodular maximization on $n$ elements subject to a general matroid of rank $k$, when the offline algorithm is given an...

By Vaneet Aggarwal
reinforcement-learningbenchmarkssafety
More like this →
arXiv Machine Learning
Sep 23

Partially Observed Sparse Graphs: The Unknown Sampling Rate is a Tail Index

arXiv:2609.26199v1 Announce Type: new Abstract: A large graph is often available only in part: a crawl stopped by its budget, a panel, a partial dump. When the sampled fraction $s$ is known by design...

By Jian Xu, Delu Zeng, John Paisley, Qibin Zhao
efficiency
More like this →
arXiv Machine Learning
Jul 8

A Fast Binary Splitting Approach for Non-Adaptive Learning of Erd\H{o}s--R\'enyi Graphs

arXiv:2511. 17240v3 Announce Type: replace-cross Abstract: We study the problem of learning an unknown graph via group queries on node subsets, where each query reports whether at least one edge is present among the queried nodes.

By Hoang Ta, Jonathan Scarlett
More like this →
Hugging Face Trending Papers
Sep 8

Non-Adaptive 1-Bit Mean Estimation: Minimax Rates and the Sample-Interval Tradeoff

We study distributed one-dimensional mean estimation under a 1-bit communication constraint. Each agent observes one sample, drawn independently from an unknown distribution, and returns a single bit in response to a query $Q: \mathbb{R}\to\{0,1\}$ chosen by a central learner.

agents
More like this →
arXiv Machine Learning
Jul 7

How Much of the Routing Gap Is Real? Decomposing the Router-to-Oracle Gap into Reproducible Specialist Advantage and Single-Draw Label Noise

arXiv:2607. 03436v1 Announce Type: new Abstract: Routing among large language models (LLMs) promises better quality at lower cost, motivated by the reported gap between learned routers and a per-instance oracle.

By Teng-Ruei Chen
llmsbenchmarks
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea