Towards LLM-guided Efficient and Interpretable Multi-linear Tensor Network Rank Selection

Giorgos Iacovides, Wuyang Zhou, Danilo Mandic
10/14/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

We propose a novel framework that leverages large language models (LLMs) to guide the rank selection in tensor network models for higher-order data analysis. By utilising the intrinsic reasoning capabilities and domain knowledge of LLMs, our approach offers enhanced interpretability of the rank choices and can effectively optimise the objective function. This framework enables users without specialised domain expertise to utilise tensor network decompositions and understand the underlying rationale within the rank selection process. Experimental results validate our method on financial higher-order datasets, demonstrating interpretable reasoning, strong generalisation to unseen test data, and its potential for self-enhancement over successive iterations. This work is placed at the intersection of large language models and higher-order data analysis.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{iacovides2024towards,
  title  = {Towards LLM-guided Efficient and Interpretable Multi-linear Tensor Network Rank Selection},
  author = {Giorgos Iacovides and Wuyang Zhou and Danilo Mandic},
  year   = {2024},
  eprint = {2410.10728},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.10728v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.10728.svg)](https://codeofpaper.com/paper/2410.10728)

Discussion