arXiv Machine Learning

Basin: Efficient and Extensible Numerical Optimization in Rust

arXiv:2608. 11279v1 Announce Type: new Abstract: Basin is a numerical optimization library for the Rust programming language.

Hugging Face Trending Papers
Aug 11

Basin: Efficient and Extensible Numerical Optimization in Rust

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.

arXiv Machine Learning
Sep 15

Generation of Custom Solvers in Rust for Convex Optimization

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 Machine Learning
Jun 29

Mosaic: A Benchmark Suite for Differentiable Physics Solvers

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
arXiv AI
Sep 15

SAILOR: Solver-Assisted Interactive LLM-based Optimization Recovery

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 Machine Learning
Jul 21

One-shot acceleration of transient PDE solvers via online-learned preconditioners

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 AI
Jun 3

Introduction to optimization methods for training SciML models

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
arXiv Machine Learning
Sep 4

Efficient Constant Optimization for Symbolic Regression with GPU-Accelerated Tree-Based Genetic Programming

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