A new implementation of the Self-Scaled Broyden family of quasi-Newton methods has been released for JAX, a numerical computation library. This implementation, built on the Optimistix library, includes various BFGS, DFP, and Broyden variants, along with L-BFGS and a Zoom line search. The developers state this is a technical note to facilitate adoption within the JAX community, with the code available on PyPI. AI
IMPACT This implementation could improve the efficiency of numerical computations within JAX, potentially benefiting AI research that relies on such methods.
RANK_REASON The item is a technical note documenting an implementation of existing optimization methods for a specific software library, not a novel research contribution. [lever_c_demoted from research: ic=1 ai=0.7]
- Broyden–Fletcher–Goldfarb–Shanno algorithm
- Ivan Bioli
- Jax
- Limited-memory BFGS
- optimistix
- SSBFGS
- SSBroyden
- ssbroyden-optimistix
- SSDFP
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →