Samuel Vaiter
Samuel Vaiter
Idea would be to implement decorators `@dataset @solver @objective` to be able to generate a benchmark from a single .py Typical use case: during numerical experiments dev, be able to...
- [X] Implement a tag field for BaseSolver (e.g. `tags = ['proximal_coordinate_descent', 'python']`) - [X] Serialize it in the html output - [x] Write the necessary JS logic to filter...
Looking at the benchmark_lasso, there is numerous implementation of some algorithms, such as PGD. The idea would be to be able to filter the solver according to some tag (e.g....
Implement Raguet's Generalized Forward Backward http://www.ceremade.dauphine.fr/~raguet/gfb/index.html