English(EN) Nonadaptive One-Sided Testing of Binary Rank

新研究详细介绍了二元秩的非自适应单侧检验

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-11 05:00

一篇新的研究论文介绍了一种测试二元矩阵二元秩的方法。所提出的测试器利用大约 O(d^4/epsilon^2) 的查询，这与矩阵维度无关。这项工作还为这类测试建立了大约 Omega(d^{3/2}/epsilon) 的一般下界。 AI

排序理由该条目是发表在 arXiv 上的研究论文，详细介绍了二元秩测试的新算法。[lever_c_demoted from research: ic=1 ai=0.1]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 3 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该条目是发表在 arXiv 上的研究论文，详细介绍了二元秩测试的新算法。[lever_c_demoted from research: ic=1 ai=0.1]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Low; Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

arXiv cs.LG TIER_1 English(EN) · Nader H. Bshouty · 2026-11-11 05:00

二元秩的非自适应单侧检验

arXiv:2611.14163v1 Announce Type: cross Abstract: The binary rank of a binary matrix is the minimum number of disjoint all-one rectangles that partition its one-entries. We study entry-query testing of binary rank at most $d$, with one-sided error and nonadaptive queries. We give…