Metraipolis › archive › dc_c707bd969423

SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery — arXiv:2609.04639

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04639
License (as archived)
CC0-1.0
Archived
2026-10-16T22:58:00.504Z
SHA-256 of the archived text
2ee7c9b95de0febb56dc6155deafdacf5baa2ba2bc8744e084201919bdc559ed
Stable URL of this page
https://metraipolis.com/documento/dc_c707bd969423

How to cite

SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery — arXiv:2609.04639 — arXiv (en), https://arxiv.org/abs/2609.04639 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c707bd969423 (Metraipolis archive dc_c707bd969423, sha256 2ee7c9b95de0febb56dc6155deafdacf5baa2ba2bc8744e084201919bdc559ed)
BibTeX
@misc{dcc707bd969423,
  title = {SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery — arXiv:2609.04639},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04639},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c707bd969423; sha256 2ee7c9b95de0febb56dc6155deafdacf5baa2ba2bc8744e084201919bdc559ed},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.04639. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Symbolic regression (SR) discovers closed-form mathematical expressions from data, offering interpretability beyond black-box models. Existing methods suffer from slow convergence in combinatorial search spaces and lack mechanisms to exploit compositional structure in the data. We introduce SMILE (Sine, Multiplication, Identity, Logarithm, Exponential), a hybrid framework that unifies continuous gradient-based optimization with discrete symbolic recovery through three stages: structural analysis of the data to identify the compositional hierarchy of the target expression, continuous optimization to learn parameters of a network that encodes the target expression using interpretable activations, and symbolic recovery through structured pruning, coefficient optimization, and rounding. This final stage distills the learned network into a compact expression with exact symbolic constants. We evaluate SMILE on SRBench across ground-truth and black-box datasets, with ablation studies validating each component. SMILE achieves the highest symbolic solution rate at the largest noise levels, demonstrating strong robustness where competing methods degrade substantially. It consistently lies on the Pareto front of accuracy versus complexity, recovering significantly simpler expressions in a fraction of the time required by the competing methods.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-07 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.04639 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T22:31:32.179Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).