arXiv:2608. 02628v1 Announce Type: cross Abstract: Symbolic regression (SR) is the task of discovering underlying patterns from data and representing them using mathematical expressions.
By Yusong Deng, Yanjie Li, Weijun Li
arXiv:2607. 21188v1 Announce Type: new Abstract: The Single Constant Multiplication problem is a fundamental NP-hard optimization task in hardware design, which seeks to decompose a fixed constant using only additions, subtractions, and bit-shifts.
By Chufeng Jiang (Graduate Center, The City University of New York), Neng-Fa Zhou (Graduate Center, The City University of New York)
arXiv:2610.01519v1 Announce Type: cross
Abstract: Neuro-Symbolic (NeSy) predictors incorporate prior knowledge into the prediction process of neural networks, ensuring that outputs satisfy specified...
By Samuele Bortolotti, Weixin Chen, Han Zhao, Andrea Passerini, Stefano Teso, Antonio Vergari
Neural Symbolic Regression (NSR) uses neural networks as functional preconditioners to learn smooth, noise‑robust approximations of target functions in an interaction‑aware nonlinear feature space. A subsequent LASSO step extracts sparse, interpretable closed‑form expressions, while distributed hyperparameter optimization with Ray Tune and ASHA scheduling improves predictive accuracy and symbolic fidelity. Experiments on the Nguyen benchmark demonstrate that NSR outperforms SINDy and untuned neural baselines in RMSE, noise robustness, and out‑of‑distribution generalization, with ablation studies highlighting the importance of feature interactions, neural depth, and tuning strategies.
By Ravi Kumar U, Sumitra S
SMILE (Sine, Multiplication, Identity, Logarithm, Exponential) is a hybrid framework that merges continuous gradient-based optimization with discrete symbolic recovery for symbolic regression. It operates in three stages: structural analysis to uncover the compositional hierarchy of the target expression, continuous optimization to learn parameters of a network using interpretable activations, and symbolic recovery via structured pruning, coefficient optimization, and rounding to produce a compact expression with exact symbolic constants. Evaluated on SRBench, SMILE achieves the highest symbolic solution rate under high noise, remains on the Pareto front of accuracy versus complexity, and recovers simpler expressions much faster than competing methods.
By Mansooreh Montazerin, Antonio Ortega, Ajitesh Srivastava
arXiv:2608. 03461v1 Announce Type: new Abstract: Decomposition-based Programming-by-example (PBE) scales performance by splitting tasks into subtasks that a learned synthesizer solves: a decomposer predicts intermediate subgoals, and a synthesizer generates programs conditioned on them.
By Janis Zenkner, Tobias Sesterhenn, Tim Grams, Christian Bartelt