

























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.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.03841 [cs.LG] |
| (or arXiv:2605.03841v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.03841 arXiv-issued DOI via DataCite (pending registration) |
From: Sergei Garmaev [view email]
[v1]
Tue, 5 May 2026 15:08:08 UTC (126 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。