Research map / Probabilistic and scientific modeling / Molecules and proteins
DASS: A Solver-Agnostic Dynamic Auxiliary Search Strategy for Symbolic Regression
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes DASS, a solver-agnostic dynamic auxiliary search strategy that can be plugged into existing symbolic regression solvers to improve the accuracy-efficiency trade-off.
Problem
Symbolic regression suffers from an enormous search space and combinatorial explosion, making it hard to balance accuracy and algorithmic efficiency.
Approach
Instead of only designing more complex solver-specific algorithms, adds a dynamic auxiliary search strategy that is agnostic to the underlying SR solver, guiding the search independently of solver internals.
Closest papers by meaning
- FunctionEvolve: Structure-Guided Symbolic Regression with LLMs (NeurIPS 2026 · similarity 0.90)
- SMILE: Bridging Continuous Optimization and Discrete Symbolic Recovery (NeurIPS 2026 · similarity 0.90)
- Symbolic regression via MDLformer-guided search: from minimizing prediction error to minimizing description length (ICLR 2025 · similarity 0.89)
- Improving Monte Carlo Tree Search for Symbolic Regression (NeurIPS 2025 · similarity 0.88)
- Ab Initio Nonparametric Variable Selection for Scalable Symbolic Regression with Large $p$ (ICML 2025 · similarity 0.88)
- LLM-SR: Scientific Equation Discovery via Programming with Large Language Models (ICLR 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
