{"id":20841027,"url":"https://github.com/benchopt/benchmark_nmf","last_synced_at":"2025-07-13T06:32:53.249Z","repository":{"id":46604204,"uuid":"515488681","full_name":"benchopt/benchmark_nmf","owner":"benchopt","description":null,"archived":false,"fork":false,"pushed_at":"2024-02-07T12:56:48.000Z","size":57,"stargazers_count":5,"open_issues_count":1,"forks_count":6,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-05-08T22:06:30.724Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/benchopt.png","metadata":{"files":{"readme":"README.rst","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2022-07-19T07:54:26.000Z","updated_at":"2023-08-25T01:22:23.000Z","dependencies_parsed_at":"2024-02-07T13:56:13.107Z","dependency_job_id":null,"html_url":"https://github.com/benchopt/benchmark_nmf","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":"benchopt/template_benchmark","purl":"pkg:github/benchopt/benchmark_nmf","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benchopt%2Fbenchmark_nmf","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benchopt%2Fbenchmark_nmf/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benchopt%2Fbenchmark_nmf/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benchopt%2Fbenchmark_nmf/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/benchopt","download_url":"https://codeload.github.com/benchopt/benchmark_nmf/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benchopt%2Fbenchmark_nmf/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265099035,"owners_count":23711247,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-18T01:18:34.338Z","updated_at":"2025-07-13T06:32:53.200Z","avatar_url":"https://github.com/benchopt.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nBenchmark Repository for Nonnegative Matrix Factorization\n=====================\n|Build Status| |Python 3.6+|\n\nBenchopt is a package to simplify and make more transparent and\nreproducible the comparisons of optimization algorithms.\nThis benchmark is dedicated to solver of Nonnegative Matrix Factorization:\n\n\n$$\\\\min_{W\\\\in \\\\mathbb{R}^{m\\\\times r}_+, H\\\\in \\\\mathbb{R}^{r\\\\times n}_+} f(X, WH)$$\n\n\nwhere $m, n$ stand for respectively for the number of rows and columns of the data matrix $X$ which may have negative entries, \n\n$$X \\\\in \\\\mathbb{R}^{m \\\\times n}$$\n\nIn short, matrix $X$ is approximated by a low rank matrix $WH$ where each low-rank factor $W$ and $H$ have nonnegative entries, which makes NMF a part-based decomposition.\n\nThe rank for the NMF must be provided in the dataset. Several values may be specified, but the responsability of chosing candidate rank values by default does not fall on the solvers, nor the objective.\n\nInstall\n--------\n\nThis benchmark can be run using the following commands:\n\n.. code-block::\n\n   $ pip install -U benchopt\n   $ git clone https://github.com/cohenjer/benchmark_nmf\n   $ benchopt run benchmark_nmf\n\nApart from the problem, options can be passed to ``benchopt run``, to restrict the benchmarks to some solvers or datasets, e.g.:\n\n.. code-block::\n\n\t$ benchopt run benchmark_nmf -s apg -d simulated --max-runs 10 --n-repetitions 10\n\n\nUse ``benchopt run -h`` for more details about these options, or visit https://benchopt.github.io/api.html.\n\nTodo:\n-----\n\n- Use optimal permutations for Factor Match Score metric\n- Fix Nimfa early stopping\n- Standardise loss naming conventions\n- Adding more dataset from various applications\n- Improve support for various loss tracking vs loss/update options in solvers\n\n.. |Build Status| image:: https://github.com/cohenjer/benchmark_nmf/workflows/Tests/badge.svg\n   :target: https://github.com/cohenjer/benchmark_nmf/actions\n.. |Python 3.6+| image:: https://img.shields.io/badge/python-3.6%2B-blue\n   :target: https://www.python.org/downloads/release/python-360/\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbenchopt%2Fbenchmark_nmf","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbenchopt%2Fbenchmark_nmf","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbenchopt%2Fbenchmark_nmf/lists"}