纠错旅游
Error-Correcting Tournaments
摘要:
我们提出了一个家庭的成对比赛减少$k$类分类到二进制分类。这些减少是可证明的强大对一个常数分数的二进制错误。结果改进了PECOC结构\cite{SECOC}的计算指数改进,从$O(k)$到$O(\log_2 k)$,并删除了后悔依赖的平方根,匹配最佳可能的计算和后悔一个常数。
英文摘要:
We present a family of pairwise tournaments reducing $k$-class classification to binary classification. These reductions are provably robust against a constant fraction of binary errors. The results improve on the PECOC construction \cite{SECOC} with an exponential improvement in computation, from $O(k)$ to $O(\log_2 k)$, and the removal of a square root in the regret dependence, matching the best possible computation and regret up to a constant.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。