REVIEW 19 cited by
Optimistix: modular optimisation in JAX and Equinox
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Optimistix: modular optimisation in JAX and Equinox
read the original abstract
We introduce Optimistix: a nonlinear optimisation library built in JAX and Equinox. Optimistix introduces a novel, modular approach for its minimisers and least-squares solvers. This modularity relies on new practical abstractions for optimisation which we call search and descent, and which generalise classical notions of line search, trust-region, and learning-rate algorithms. It provides high-level APIs and solvers for minimisation, nonlinear least-squares, root-finding, and fixed-point iteration. Optimistix is available at https://github.com/patrick-kidger/optimistix.
Forward citations
Cited by 19 Pith papers
-
Numerical polology: towards next-generation model-building for cosmology
A numerical polology sampler maps ghost- and tachyon-free regions of bosonic EFT coupling spaces and finds new particle branches, including a spin-one mode in general rank-2 tensor theories.
-
Differentiable design of the PIAA-ZWFS: a flexible wavefront sensor that approaches the fundamental limit
The PIAA-ZWFS, optimized with differentiable modeling and Bayesian design, closes the gap to the fundamental wavefront sensing limit by a factor of 10 versus conventional ZWFS in photon-limited simulations.
-
RAM: Reachability Across Morphologies
RAM is a morphology-conditioned implicit neural representation trained on 3e10 forward-kinematics samples that serves as a fast, differentiable surrogate for pose reachability and generalizes to unseen morphologies wh...
-
AMIGO: a Data-Driven Calibration of the JWST Interferometer
AMIGO is an end-to-end differentiable forward model of JWST AMI that corrects detector systematics to recover high-precision astrometry and detect close high-contrast companions.
-
Complex surface patterning in homo- and heteroepitaxial contexts: (simultaneous) step bunching and step meandering
A (2+1)D continuum Ginzburg–Landau step model and a double-well VicCA both produce coexisting step bunching and meandering with matching morphology diagrams across homo- and heteroepitaxial contexts.
-
jaxdae: A JAX-native Differentiable Solver for Differential-Algebraic Equations in Coupled Multi-physics
jaxdae provides the first JAX-native differentiable DAE solver, using a frozen-grid BDF-2 replay adjoint for reverse-mode gradients and XLA-fused batched sweeps.
-
Thermo-Structural Topology Optimization Considering Nonlinear Creep
A differentiable JAX-based topology-optimization framework minimizes accumulated creep deformation under thermo-mechanical loading using Norton's power law with Arrhenius temperature dependence, demonstrated on 2D ben...
-
Numerical polology: towards next-generation model-building for cosmology
Numerical polology framework samples coupling space to discover ghost-free tensor field theories up to rank three for cosmology, then applies resulting priors to black hole superradiance, dynamical dark energy, and GW data.
-
Efficient High-order Mass-conserving and Energy-balancing Schemes for Schr\"odinger-Poisson Equations
Relaxation techniques applied after each time step to IMEX Runge-Kutta schemes ensure that fully discrete Schrödinger-Poisson systems conserve mass and satisfy energy balance equations up to rounding errors.
-
A guided residual search for nonlinear state-space identification
A three-stage identification method (guided residual search, neural-network residual learning, multiple-shooting refinement) makes nonlinear state-space model fitting more reliable.
-
linrax: A JAX Compatible, Simplex Method Linear Program Solver
linrax implements the simplex method in JAX, enabling JIT-compiled, differentiable LP solving with support for degenerate constraints.
-
Tolerancing the PIAA-ZWFS: a practical and robust wavefront sensor that approaches the fundamental sensitivity limit
Typical manufacturing and alignment errors do not significantly degrade the PIAA-ZWFS's wavefront sensing performance, preserving a large margin over a standard ZWFS.
-
Accelerated Fourier SAT (AFSAT): Fully Realising a GPU-based Symmetric Pseudo-Boolean SAT Solver
AFSAT realizes FastFourierSAT as a production GPU solver for heterogeneous symmetric pseudo-Boolean SAT via JAX-compiled continuous local search, with tailored DFT for stability and near-linear multi-accelerator scaling.
-
On the boundary cost of source-consistent warp shells
Source-consistent warp shells fail energy conditions at the source-vacuum boundary in all examined constructions and parameter scans.
-
Learning Cross-Coupled and Regime Dependent Dynamics for Aerial Manipulation
A nonlinear latent encoder plus linear latent decoder learns cross-coupled, history-dependent, and nonstationary residual dynamics for aerial manipulators, supporting online Bayesian adaptation and improved real-time ...
-
Complex surface patterning in homo- and heteroepitaxial contexts: (simultaneous) step bunching and step meandering
A linked discrete-continuum model demonstrates that step bunching and meandering can coexist as common growth modes on vicinal surfaces, yielding diverse patterns beyond separate limiting cases.
-
A Study of Parallel Continuous Local Search
Empirical study of parallel continuous local search for SAT finds redundant constraints can slow convergence, CLS works as a hybrid sub-solver, and search stabilizes quickly due to saddle-dense objectives.
-
Curvature-Aware Optimization for High-Accuracy Physics-Informed Neural Networks
Curvature-aware optimizers such as natural gradient and self-scaling BFGS/Broyden accelerate PINN convergence and accuracy on PDEs including Helmholtz, Stokes, Burgers, and Euler equations plus stiff ODEs, with new mo...
-
A parallel-in-time Newton's method-based ODE solver
Newton's method on the fully discretized ODE, accelerated by parallel prefix sums, solves nonlinear IVPs with logarithmic span per iteration and beats Parareal in GPU runtime comparisons.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.