AI Navigate

大規模スパーステンソル計算のための自動テンソル・リレーショナル分解

arXiv cs.AI / 2026/3/11

Ideas & Deep AnalysisModels & Research

要点

  • 本論文はテンソル演算とリレーショナルデータベースシステムを統合したテンソル・リレーショナル計算フレームワークを紹介し、大規模スパースデータを効率的に処理する。
  • 古典的なアインシュタイン記法をテンソル・リレーショナル適応した大文字・小文字EinSumを提案し、効率的な実行のための計算書き換えを自動化する。
  • 高性能数値カーネルを計算集約的な処理に活用しつつ、スパース性をリレーショナルシステムで管理することでパフォーマンスとスケーラビリティを最適化する。
  • この手法により、大規模スパーステンソル計算がリレーショナルシステムの機能および最適化された数学的演算の恩恵をマニュアルチューニングなしで享受できる。
  • リレーショナルデータ処理とテンソル計算のギャップを埋め、科学計算やデータ分析における大規模スパースデータセットの処理において進展をもたらすことが期待される。

Computer Science > Mathematical Software

arXiv:2603.08957 (cs)
[Submitted on 9 Mar 2026]

Title:Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation

View a PDF of the paper titled Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation, by Yuxin Tang and 6 other authors
View PDF
Abstract:A \emph{tensor-relational} computation is a relational computation where individual tuples carry vectors, matrices, or higher-dimensional arrays. An advantage of tensor-relational computation is that the overall computation can be executed on top of a relational system, inheriting the system's ability to automatically handle very large inputs with high levels of sparsity while high-performance kernels (such as optimized matrix-matrix multiplication codes) can be used to perform most of the underlying mathematical operations. In this paper, we introduce upper-case-lower-case \texttt{EinSum}, which is a tensor-relational version of the classical Einstein Summation Notation. We study how to automatically rewrite a computation in Einstein Notation into upper-case-lower-case \texttt{EinSum} so that computationally intensive components are executed using efficient numerical kernels, while sparsity is managed relationally.
Subjects: Mathematical Software (cs.MS); Artificial Intelligence (cs.AI); Databases (cs.DB)
Cite as: arXiv:2603.08957 [cs.MS]
  (or arXiv:2603.08957v1 [cs.MS] for this version)
  https://doi.org/10.48550/arXiv.2603.08957
Focus to learn more
arXiv-issued DOI via DataCite

Submission history

From: Yuxin Tang [view email]
[v1] Mon, 9 Mar 2026 21:43:39 UTC (221 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Automated Tensor-Relational Decomposition for Large-Scale Sparse Tensor Computation, by Yuxin Tang and 6 other authors
  • View PDF
  • TeX Source
Current browse context:
cs.MS
< prev   |   next >
Change to browse by:

References & Citations

export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.