English(EN) Fast, Parallel, Query-Efficient Binary Classification

新算法提供更快、查询更高效的二元分类

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

研究人员为二元分类问题开发了两种新的随机算法。第一种算法与现有的确定性方法相比，在顺序运行时间和并行深度方面有所改进，使用了有限数量的矩阵向量查询。第二种更快的算法实现了更优的顺序运行时间，但并行深度略有增加，同样依赖于随机方法和类似的查询复杂度。 AI

影响这些算法可以提高各种人工智能应用中使用的机器学习模型的效率。

排序理由详细介绍新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

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

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 详细介绍新算法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
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: High; Clearly on-topic for AI-industry coverage.
Story freshness: 50 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

arXiv cs.LG TIER_1 English(EN) · Ishani Karmarkar, Liam O'Carroll, Aaron Sidford · 2026-07-07 04:00

快速、并行、查询高效的二元分类

arXiv:2607.04062v1 Announce Type: cross Abstract: We study the fundamental classification problem of computing a separating hyperplane for a binary-labeled dataset of size $n$ with normalized $d$-dimensional features. Letting $\Phi \in \mathbb{R}^{n \times d}$ denote the feature …