RecKAN introduces a learnable recursive polynomial basis for Kolmogorov–Arnold Networks, replacing fixed bases like B-splines or Chebyshev polynomials. The basis is defined by a second‑order polynomial recurrence whose five coefficients are jointly learned with the network, enabling it to encompass classical families such as Chebyshev, Fibonacci, Pell, and Jacobsthal. Experiments across image, text, biomedical time‑series classification, and forecasting tasks show RecKAN outperforming parameter‑matched KAN baselines and achieving state‑of‑the‑art results on several benchmarks.
By Amirhosein Azarpour
arXiv:2609.24328v1 Announce Type: new
Abstract: Combining predictions from different models can improve performance at machine learning tasks, but the training of the individual models and the rule u...
By Congye Wang, Yan Lin, Zheyang Shen, Matthew A. Fisher, Chris. J. Oates
arXiv:2610. 21363v1 Announce Type: cross Abstract: Test-time scaling can improve the performance of large language models by generating multiple answers to a question and aggregating them.
By Zhi Zhang, Arash A. Amini
arXiv:2607. 19689v1 Announce Type: cross Abstract: We study the problem of recalibrating an online predictor [KE17, OKS24]: given an arbitrary "hint" sequence of forecasts, the learner must output new predictions that are calibrated while incurring small excess error relative to the original forecasts, under a proper loss.
By Lunjia Hu, Kevin Tian, Chutong Yang
arXiv:2511.22435v2 Announce Type: replace
Abstract: Invariant learning on graphs aims to build predictors that rely on causal substructures rather than on environment-specific shortcuts. Current meth...
By Ali Ghasemi, Farooq Ahmad Wani, Maria Sofia Bucarelli, Fabrizio Silvestri
arXiv:2510.10730v3 Announce Type: replace
Abstract: We provide a unified algorithmic framework for ensemble sampling in nonlinear contextual bandits and develop corresponding regret bounds for two mo...
By Jiazheng Sun, Weixin Wang, Pan Xu
The paper argues that Large Language Models (LLMs) do not function as Solomonoff induction estimators because their training objectives—cross‑entropy, negative log‑likelihood, and next‑token prediction—optimize fit to a supplied conditional distribution rather than a program‑weighted universal mixture. It further contends that additional computation alone does not transform these models into optimal predictors without external hyper‑parameter or architectural changes. The authors suggest that neurosymbolic machine learning, exemplified by models such as Fable and Astra, represents a shift toward symbolic model synthesis, moving beyond purely statistical LLMs.
By Hector Zenil, Abicumaran Uthamacumaran, Luan Ozelim
arXiv:2601. 05280v3 Announce Type: replace-cross Abstract: On the one hand, the question of whether large language models (LLMs) are Solomonoff induction estimators has become an explicit question at the intersection of Algorithmic Information Theory (AIT) and Machine Learning (ML) of great interest.
By Hector Zenil
arXiv:2607. 20594v1 Announce Type: cross Abstract: When does a weight-tied looped transformer -- one block applied T times -- implement an actual algorithm?
By Tong Zhang, Junhao Hu, Yun Peng, Tao Xie
arXiv:2105. 07610v5 Announce Type: replace-cross Abstract: Building trustworthy machine learning algorithms for biological applications requires adapting to data heterogeneity from different sources, batches, distributions, or studies.
By Maya Ramchandran, Rajarshi Mukherjee, Giovanni Parmigiani
TIGER is a time‑series classification method that uses a small set of three generic classifiers applied to four different representation families, producing twelve base learners. The predictions are stacked into a meta‑feature matrix and an adaptive meta‑classifier—choosing between a weighted hard majority vote and the pretrained TabICLv2 model—selects the best rule per dataset based on training sample size. On a 142‑dataset UCR benchmark, TIGER achieves the highest mean accuracy, balanced accuracy, and F1‑score among six compared algorithms, outperforming each constituent method and demonstrating strong generalization with a single hyperparameter.
arXiv:2609.14065v1 Announce Type: new
Abstract: When algorithmic predictions inform people's decisions, the models we deploy are performative and actively shape the data we see. This feedback loop be...
By Gabriele Farina, Juan Carlos Perdomo