Skip to content

Commit

Permalink
Merge pull request #434 from mblondel:release_0.7
Browse files Browse the repository at this point in the history
PiperOrigin-RevId: 535720960
  • Loading branch information
JAXopt authors committed May 26, 2023
2 parents 541bbaa + 7cf0567 commit 58ce7cb
Show file tree
Hide file tree
Showing 5 changed files with 34 additions and 3 deletions.
3 changes: 2 additions & 1 deletion docs/api.rst
Original file line number Diff line number Diff line change
Expand Up @@ -22,8 +22,9 @@ Constrained
.. autosummary::
:toctree: _autosummary

jaxopt.ProjectedGradient
jaxopt.LBFGSB
jaxopt.MirrorDescent
jaxopt.ProjectedGradient
jaxopt.ScipyBoundedMinimize

Quadratic programming
Expand Down
29 changes: 29 additions & 0 deletions docs/changelog.rst
Original file line number Diff line number Diff line change
@@ -1,6 +1,35 @@
Changelog
=========

Version 0.7
-----------

New features
~~~~~~~~~~~~

- Added :class:`jaxopt.LBFGSB`, by Emily Fertig.
- Added :func:`jaxopt.perturbations.make_perturbed_fun`, by Quentin Berthet.

Bug fixes and enhancements
~~~~~~~~~~~~~~~~~~~~~~~~~~

- Allow to pass a function as value_and_grad option, by Chansoo Lee.
- Fixed imaml tutorial (speed and correctness), by Zaccharie Ramzi.
- Misc improvements in resnet_flax example, by Fabian Pedregosa.
- Fixed prox to handle pytrees, by Vincent Roulet.
- Added control variate to make_perturbed_argmax, by Lawrence Stewart.
- Added inverse hessian approximation to the returned state, Aymeric Galan.
- Avoid closing over dynamic jax tracers in the bisection solver, by Roy Frostig.
- Follow pjit API changes, by Yash Katariya and Peter Hawkins.
- Added isotonic module to documentation, by Mathieu Blondel.

Contributors
~~~~~~~~~~~~

Aymeric Galan, Chansoo Lee, Emily Fertig, Fabian Pedregosa,
Lawrence Stewart, Mathieu Blondel, Peter Hawkins, Quentin Berthet,
Roy Frostig, Vincent Roulet, Yash Katariya, Zaccharie Ramzi.

Version 0.6
-----------

Expand Down
1 change: 1 addition & 0 deletions docs/constrained.rst
Original file line number Diff line number Diff line change
Expand Up @@ -146,6 +146,7 @@ descent, we can use our SciPy wrapper.
:toctree: _autosummary

jaxopt.ScipyBoundedMinimize
jaxopt.LBFGSB

This example shows how to apply non-negativity constraints, which can
be achieved by setting box constraints :math:`[0, \infty)`::
Expand Down
2 changes: 1 addition & 1 deletion docs/quadratic_programming.rst
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ The solver specificities are summarized in the table below.
The best choice will depend on the usage.

.. list-table:: Quadratic programming solvers
:widths: 45, 15, 20, 15, 15, 15, 22
:widths: 45, 15, 20, 15, 15, 15, 22, 15
:header-rows: 1

* - Name
Expand Down
2 changes: 1 addition & 1 deletion jaxopt/version.py
Original file line number Diff line number Diff line change
Expand Up @@ -14,4 +14,4 @@

"""JAXopt version."""

__version__ = "0.6"
__version__ = "0.7"

0 comments on commit 58ce7cb

Please sign in to comment.