Basin is a numerical optimization library for the Rust programming language. Numerical optimization is the task of finding the inputs that minimize a function, and it is a fundamental element across the sciences: fitting a model to data, calibrating a simulation, training a machine learning model, or choosing engineering parameters that minimize cost.
The paper presents cvxgenrust, an open‑source tool that generates custom Rust code for solving families of parameterized convex optimization problems defined in CVXPY. It canonicalizes problem families, extracts affine maps to Clarabel cone‑program data, and produces a specialized Rust crate that updates parameters and calls Clarabel natively at runtime. The generated solver can also be exposed to Python and registered as a custom CVXPY solver, supporting a wide range of convex problems up to semidefinite and exponential‑cone programs, and demonstrates reduced runtime compared to direct CVXPY solves and performance comparable to CVXPYgen.
By Hao Zhu, Joschka Boedecker
arXiv:2606. 27895v1 Announce Type: cross Abstract: Differentiable partial differential equation (PDE) solvers underpin solver-in-the-loop ML training, gradient-based optimal control, and inverse problems, yet the practical cost of obtaining correct, usable gradients from a given solver on a given problem is largely undocumented.
By Andrin Rehmann, Heiko Zimmermann, Dion H\"afner
SAILOR is a proof‑of‑concept system that helps language models translate natural‑language optimization problem descriptions into executable code by detecting missing numerical values. It asks users targeted follow‑up questions, prioritizing them based on uncertainty and solver estimates of impact, and updates the model before returning a solution. In tests on 1,723 benchmark instances, SAILOR achieved exact objective‑value agreement between 27.0% and 87.6% while asking an average of 1.4–5.7 questions per instance.
By Shaghayegh Sadeghi, Stephen L. Smith, David C. Del Rey Fern'andez
arXiv:2607. 18256v1 Announce Type: new Abstract: Optimization modeling is the process of translating real-world decision problems, often described in natural language, into formal mathematical formulations and executable solver code.
By Hongliang Lu, Zhong Li, Yuxuan Chen, Yuan Lan, Fan Zhang, Zaiwen Wen
arXiv:2607. 13921v1 Announce Type: cross Abstract: Languages with rich static semantics, such as Rust, provide stronger guarantees for AI-generated code, but their strictness makes generation more difficult.
By Niels M\"undler-Sasahara, Hristo Venev, Dawn Song, Martin Vechev, Jingxuan He
arXiv:2608. 08156v1 Announce Type: new Abstract: In evolutionary algorithms powered by language models, the LLM acts as a single operator that simultaneously updates structural components (like control flow) and continuous parameters.
By V\'ictor Gallego
arXiv:2609.37308v1 Announce Type: cross
Abstract: This paper introduces a hybrid joint-selective optimization (HJSO) framework for large-scale numerical problems in which a small subset of trainable...
By Muhammad Luthfi Shahab, Gabriella Alfa Indahsari, Imam Mukhlash, Hadi Susanto
arXiv:2606. 30328v1 Announce Type: cross Abstract: Rapid prototyping of algorithms is a critical step in modern machine learning.
By Disha Hegde, Jon Cockayne, Chris. J. Oates
arXiv:2509. 08765v4 Announce Type: replace-cross Abstract: Data-driven acceleration of scientific computing workflows has been a high-profile aim of machine learning (ML) for science, with numerical simulation of transient partial differential equations (PDEs) being one of the main applications.
By Mikhail Khodak, Min Ki Jung, Brian Wynne, Edmond Chow, Egemen Kolemen
arXiv:2601. 10222v2 Announce Type: replace-cross Abstract: Optimization is central to both modern machine learning (ML) and scientific machine learning (SciML), yet the structure of the underlying optimization problems differs substantially across these domains.
By Alena Kopani\v{c}\'akov\'a, Elisa Riccietti
The paper introduces a GPU-resident, batched Levenberg–Marquardt solver that efficiently optimizes constants in tree-based genetic programming for symbolic regression. By using reverse-mode automatic differentiation to assemble per-tree Jacobians in a single backward sweep, the solver’s per-iteration cost becomes independent of the number of constants per tree, achieving up to 510,000 trees per second on an NVIDIA A100. Integrated into EvoGP, the solver enables end-to-end search that recovers governing equations on 10 of 18 constructed problems, a significant improvement over stock EvoGP.
By Hao Mao, Xu Tony Liu, Shuai Lu, Peng Zhao, Wenzheng Jiang, Yuntian Chen