Algorithmic algorithm development with LLMs

A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks

Authors

DOI:

https://doi.org/10.14279/eceasst.v86.1.2781

Keywords:

Large Language Model, LLM, algorithm engineering, evolutionary coding agents, OpenEvolve, tensor networks, contraction order optimization

Abstract

We consider LLM-based algorithm development through a case study on contraction-order optimization for tensor networks with OpenEvolve. We pay particular attention to the choice of the LLM as well as design choices such as evaluation metric and test instances. Our results highlight both the promise of verifier-guided evolutionary coding agents for algorithm development/improvement and the continuing importance of evaluation, validation, and interpretation—and corresponding challenges—by the human scientist.

Downloads

Published

2026-11-02

How to Cite

[1]
F. Hoppe, M. Röhrig-Zöllner, and P. Knechtges, “Algorithmic algorithm development with LLMs: A Case Study on LLM-Usage for Contraction Order Optimization in Tensor Networks”, ECEASST, vol. 86, no. 1, Nov. 2026.