PulseAugur
实时 04:17:43

New algorithms tackle robust multiclass linear classification

Two new research papers published on arXiv introduce novel algorithms for multiclass linear classification under Gaussian distributions. The first paper focuses on achieving polynomial-time robust learning with dimension-independent error guarantees, addressing limitations in prior work for three or more classes. The second paper presents an efficient and noise-tolerant PAC learning algorithm for multiclass linear classifiers, even with maliciously corrupted data, offering improvements over existing methods. AI

影响 These papers introduce theoretical advancements in machine learning algorithms for multiclass classification, potentially improving efficiency and robustness in future applications.

排序理由 Two academic papers published on arXiv present new algorithms for a specific machine learning task.

在 arXiv cs.LG 阅读 →

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

New algorithms tackle robust multiclass linear classification

报道来源 [2]

  1. arXiv cs.LG TIER_1 English(EN) · Mingchen Ma ·

    Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals

    We study the task of agnostic learning of multiclass linear classifiers under the Gaussian distribution. Given labeled examples $(x, y)$ from a distribution over $\mathbb{R}^d \times [k]$, with Gaussian $x$-marginal, the goal is to output a hypothesis whose error is comparable to…

  2. arXiv cs.LG TIER_1 English(EN) · Shiwei Zeng ·

    Efficient and Noise-Tolerant PAC Learning of Multiclass Linear Classifiers

    Noise-tolerant PAC learning of linear models has been of central interests in machine learning community since the last century. In recent years, many computationally-efficient algorithms have been proposed for the problem of learning linear threshold functions under multiple noi…