English(EN) Bayesian Tensor Train Kernel Machines with Automatic Model Complexity Inference

新的贝叶斯张量训练核方法可自动推断模型复杂度

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

研究人员推出贝叶斯张量训练核方法（BTT-KM），这是对现有张量网络核方法的改进。与需要手动调整的确定性方法不同，BTT-KM 利用分层 ARD 类型先验从数据中自动推断张量训练秩和特征维度。该新框架基于张量训练分解，提供了闭式后验更新和贝叶斯交替最小二乘算法，其计算效率可与确定性方法相媲美。 AI

影响为张量网络核方法引入了自动模型复杂度推断，有望提高监督学习任务的效率和准确性。

排序理由该集群描述了一篇介绍一种新机器学习方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

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

本文如何被排名

Signal score: 32 / 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, model release; 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: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

报道来源 [1]

arXiv stat.ML TIER_1 English(EN) · Afra Kilic, Kim Batselier · 2026-11-06 05:00

具有自动模型复杂度推断的贝叶斯张量训练核机

arXiv:2611.07129v1 Announce Type: new Abstract: Tensor Network (TN) kernel machines accelerate supervised learning by using low-rank TNs to reduce computation and memory. However, most TN-based methods are deterministic with manually tuned ranks and feature dimensions, while the …

本文如何被排名

报道来源 [1]

具有自动模型复杂度推断的贝叶斯张量训练核机

相关实体

相关话题