PulseAugur
实时 16:26:31

新的基于算子的框架推进多任务深度学习理论

研究人员开发了新的理论框架来理解多任务深度学习中的泛化。一种方法利用基于算子的理论框架,结合基于Koopman的方法和草图技术,以获得比传统方法更紧密的泛化界限。另一篇论文介绍了多神经网络算子(MNO)架构,展示了学习算子集合的近乎最优的逼近和统计泛化率。这些发现表明,跨任务的共享表示不会增加整体学习成本,将多任务算子学习与单算子学习相匹配。 AI

影响 推进了对多任务学习的理论理解,可能导致更高效、更鲁棒的深度学习模型。

排序理由 该集群包含多篇arXiv论文,详细介绍了深度学习在多任务学习方面的理论进展。

在 arXiv cs.AI 阅读 →

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

报道来源 [4]

  1. arXiv cs.AI TIER_1 English(EN) · Mahdi Mohammadigohari, Giuseppe Di Fatta, Giuseppe Nicosia, Panos M. Pardalos ·

    Operator-Based Generalization Bound for Deep Learning: Insights on Multi-Task Learning

    arXiv:2512.19184v2 Announce Type: replace-cross Abstract: This paper presents novel generalization bounds for vector-valued neural networks and deep kernel methods, focusing on multi-task learning through an operator-theoretic framework. Our key development lies in strategically …

  2. arXiv cs.AI TIER_1 English(EN) · Mahdi Mohammadigohari, Giuseppe Di Fatta, Giuseppe Nicosia, Panos M. Pardalos ·

    On the Koopman-Based Generalization Bounds for Multi-Task Deep Learning

    arXiv:2512.19199v2 Announce Type: replace-cross Abstract: The paper establishes generalization bounds for multitask deep neural networks using operator-theoretic techniques. The authors propose a tighter bound than those derived from conventional norm based methods by leveraging …

  3. arXiv stat.ML TIER_1 English(EN) · Adrien Weihs, Hayden Schaeffer ·

    Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning

    arXiv:2605.22724v1 Announce Type: cross Abstract: We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting, with a focus on the Multiple Neural Operators (MNO) architecture. For broad classes of Lipschitz multiple o…

  4. arXiv stat.ML TIER_1 English(EN) · Hayden Schaeffer ·

    Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning

    We study the approximation and statistical complexity of learning collections of operators in a shared multi-task setting, with a focus on the Multiple Neural Operators (MNO) architecture. For broad classes of Lipschitz multiple operator maps, we derive near-optimal upper bounds …