{"data":{"full_name":"motasemwed/optimization-algorithms-comparison","name":"optimization-algorithms-comparison","description":"A practical comparison of classical optimization algorithms (GD, SGD, Momentum, Adam, RMSProp, Adagrad, Newton) analyzing convergence speed, stability, and loss minimization for machine learning.","stars":0.0,"forks":0.0,"language":"Jupyter Notebook","license":null,"archived":0.0,"subcategory":"gradient-descent-optimizers","last_pushed_at":"2026-01-29T18:24:36+00:00","pypi_package":null,"npm_package":null,"downloads_monthly":0.0,"dependency_count":0.0,"commits_30d":null,"reverse_dep_count":0.0,"maintenance_score":10.0,"adoption_score":0.0,"maturity_score":1.0,"community_score":0.0,"quality_score":11.0,"quality_tier":"experimental","risk_flags":"['no_license', 'no_package', 'no_dependents']"},"meta":{"timestamp":"2026-04-12T00:11:46.285677+00:00"}}