Complex Equation Learner: Rational Symbolic Regression with Gradient Descent in Complex Domain

Sergei Garmaev, Maurice Gauché, Olga Fink
5/5/2026
cs.LG

No confident code implementation found for this paper.

Abstract

Symbolic regression aims to discover interpretable equations from data, yet modern gradient-based methods fail for operators that introduce singularities or domain constraints, including division, logarithms, and square roots. As a result, Equation Learner-type models typically avoid these operators or impose restrictions, e.g. constraining denominators to prevent poles, which narrows the hypothesis class. We propose a complex weight extension of the Equation Learner that mitigates real-valued optimization pathologies by allowing optimization trajectories to bypass real-axis degeneracies. The proposed approach converges stably even when the target expression has real-domain poles, and it enables unconstrained use of operations such as logarithm and square root. We Validate the method on symbolic regression benchmarks and show it can recover singular behavior from experimental frequency response data.

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!

Cite this paper

@article{garmaev2026complex,
  title  = {Complex Equation Learner: Rational Symbolic Regression with Gradient Descent in Complex Domain},
  author = {Sergei Garmaev and Maurice Gauché and Olga Fink},
  year   = {2026},
  eprint = {2605.03841},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2605.03841v1}
}

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/2605.03841.svg)](https://codeofpaper.com/paper/2605.03841)

Discussion