{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/beyond-alternating-updates-for-matrix","title":"Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms","arxiv_id":"1905.09050","date":"2019-05-22","proceeding":"NeurIPS 2019 12","authors":["Mahesh Chandra Mukkamala","Peter Ochs"],"abstract":"Matrix Factorization is a popular non-convex optimization problem, for which alternating minimization schemes are mostly used. They usually suffer from the major drawback that the solution is biased towards one of the optimization variables. A remedy is non-alternating schemes. However, due to a lack of Lipschitz continuity of the gradient in matrix factorization problems, convergence cannot be guaranteed. A recently developed approach relies on the concept of Bregman distances, which generalizes the standard Euclidean distance. We exploit this theory by proposing a novel Bregman distance for matrix factorization problems, which, at the same time, allows for simple/closed form update steps. Therefore, for non-alternating schemes, such as the recently introduced Bregman Proximal Gradient (BPG) method and an inertial variant Convex--Concave Inertial BPG (CoCaIn BPG), convergence of the whole sequence to a stationary point is proved for Matrix Factorization. In several experiments, we observe a superior performance of our non-alternating schemes in terms of speed and objective value at the limit point.","url_abs":"https://arxiv.org/abs/1905.09050v2","url_pdf":"https://arxiv.org/pdf/1905.09050v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"beyond-alternating-updates-for-matrix","repo_url":"https://github.com/mmahesh/cocain-bpg-matrix-completion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"beyond-alternating-updates-for-matrix","repo_url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1905.09050","atlas_url":"https://app.syntology.ai/?focus=1905.09050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09050"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.09050"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.09050"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.09050\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1905.09050"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1905.09050\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1905.09050"},"call":"get_concepts_for_paper(arxiv_id=\"1905.09050\")"}],"by_repo":[{"repo":"mmahesh/cocain-bpg-matrix-completion","kind":"listed","samples":2,"ran":1,"instrument":0,"unverified":1},{"repo":"mmahesh/cocain-bpg-matrix-factorization","kind":"listed","samples":5,"ran":4,"instrument":0,"unverified":1}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1905.09050.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1905.09050.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mmahesh/cocain-bpg-matrix-completion","reach":null}],"summary":{"ran":4,"ran_honours":1,"unverified":2},"n_samples":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":7,"ran":5,"n_ran_checked":5,"n_instrument":0,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"91b70c2f20574c88","code_sha256_prefix":"91b70c2f20574c88","entry":"abs_func","repo":"mmahesh/cocain-bpg-matrix-factorization","repo_kind":"listed","path":"my_functions.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization/blob/HEAD/my_functions.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"A:ndarray/2/float, U:ndarray/2/float, Z:ndarray/2/float, U1:ndarray/2/float, Z1:ndarray/2/float, lam:float/0/float, abs_fun_num:int/0/int, fun_num:int/0/int","fixture_out_type":"float64","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"91b70c2f20574c88"}},{"code_sha256":"dfebed255091bcc7","code_sha256_prefix":"dfebed255091bcc7","entry":"do_tight_layout_for_fig","repo":"mmahesh/cocain-bpg-matrix-factorization","repo_kind":"listed","path":"create_plots.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization/blob/HEAD/create_plots.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"fig:Figure/0/?","fixture_out_type":"Figure","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"dfebed255091bcc7"}},{"code_sha256":"7de0fb631a5ab4ea","code_sha256_prefix":"7de0fb631a5ab4ea","entry":"grad","repo":"mmahesh/cocain-bpg-matrix-factorization","repo_kind":"listed","path":"my_functions.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization/blob/HEAD/my_functions.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"A:ndarray/2/float, U:ndarray/2/float, Z:ndarray/2/float, lam:float/0/float, fun_num:int/0/int, option:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":"/code/grad","census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7de0fb631a5ab4ea"}},{"code_sha256":"cd198438e27f36b2","code_sha256_prefix":"cd198438e27f36b2","entry":"loss_func1","repo":"mmahesh/cocain-bpg-matrix-completion","repo_kind":"listed","path":"matrix_completion_pytorch.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-completion/blob/HEAD/matrix_completion_pytorch.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"output:Tensor/2/float, target:Tensor/2/float, model:callable/0/?","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"cd198438e27f36b2"}},{"code_sha256":"200fbb5b8e7f0382","code_sha256_prefix":"200fbb5b8e7f0382","entry":"main_func","repo":"mmahesh/cocain-bpg-matrix-factorization","repo_kind":"listed","path":"my_functions.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization/blob/HEAD/my_functions.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"A:ndarray/2/float, U:ndarray/2/float, Z:ndarray/2/float, lam:float/0/float, fun_num:int/0/int","fixture_out_type":"float64","level_recorded_at":"2026-09-24T22:24:42.659479+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"200fbb5b8e7f0382"}},{"code_sha256":"a4a5a170457994fe","code_sha256_prefix":"a4a5a170457994fe","entry":"makeup_for_plot","repo":"mmahesh/cocain-bpg-matrix-factorization","repo_kind":"listed","path":"create_plots.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-factorization/blob/HEAD/create_plots.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a4a5a170457994fe"}},{"code_sha256":"d6dd9c2a3f968978","code_sha256_prefix":"d6dd9c2a3f968978","entry":"train_test_split2","repo":"mmahesh/cocain-bpg-matrix-completion","repo_kind":"listed","path":"create_datasets.py","file_url":"https://github.com/mmahesh/cocain-bpg-matrix-completion/blob/HEAD/create_datasets.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d6dd9c2a3f968978"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0986a74a4e88ae427e7f0174c0ebff00dce905dd733a41d8869dac069a6960f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}