{"id":15950717,"url":"https://github.com/gerdm/convex_nonconvex","last_synced_at":"2025-04-04T04:41:25.348Z","repository":{"id":88732825,"uuid":"119768373","full_name":"gerdm/convex_nonconvex","owner":"gerdm","description":"A personal essay about convexity problems in machine learning","archived":false,"fork":false,"pushed_at":"2018-02-01T18:20:10.000Z","size":228,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-09T16:12:46.995Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gerdm.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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}},"created_at":"2018-02-01T01:56:33.000Z","updated_at":"2018-02-01T01:57:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"1b9db446-ad17-4d15-be42-f044b2ac25b5","html_url":"https://github.com/gerdm/convex_nonconvex","commit_stats":{"total_commits":6,"total_committers":1,"mean_commits":6.0,"dds":0.0,"last_synced_commit":"9d2a7cf8ecc861b573f6165119008c31c59b1982"},"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gerdm%2Fconvex_nonconvex","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gerdm%2Fconvex_nonconvex/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gerdm%2Fconvex_nonconvex/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gerdm%2Fconvex_nonconvex/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gerdm","download_url":"https://codeload.github.com/gerdm/convex_nonconvex/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247123094,"owners_count":20887259,"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-10-07T13:00:08.382Z","updated_at":"2025-04-04T04:41:25.332Z","avatar_url":"https://github.com/gerdm.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Convexity v.s. Non-Convexity Problems\n[![DOI](https://zenodo.org/badge/119768373.svg)](https://zenodo.org/badge/latestdoi/119768373)\n\nThis is a brief essay about convexity in machine learning problems. It presents a quick overview of what exactly is a convex problem and a practical comparisson between two models in machine learning to contrast convex v.s. non-convex problems.\n\nThe comparisson mentioned above makes use of the $L_2$ loss function considering a linear regression model, and a deep neural network with one hidden layer, sigmoid activation function and linear output.\n\nThis repository contains the code used to make the graphs presented as Jupyter notebooks.\n\n![Neural Network Loss Surface](./images/nnet_loss.png)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgerdm%2Fconvex_nonconvex","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgerdm%2Fconvex_nonconvex","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgerdm%2Fconvex_nonconvex/lists"}