{"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/low-rank-inducing-norms-with-optimality","title":"Low-Rank Inducing Norms with Optimality Interpretations","arxiv_id":"1612.03186","date":"2016-12-09","proceeding":null,"authors":["Christian Grussler","Pontus Giselsson"],"abstract":"Optimization problems with rank constraints appear in many diverse fields\nsuch as control, machine learning and image analysis. Since the rank constraint\nis non-convex, these problems are often approximately solved via convex\nrelaxations. Nuclear norm regularization is the prevailing convexifying\ntechnique for dealing with these types of problem. This paper introduces a\nfamily of low-rank inducing norms and regularizers which includes the nuclear\nnorm as a special case. A posteriori guarantees on solving an underlying rank\nconstrained optimization problem with these convex relaxations are provided. We\nevaluate the performance of the low-rank inducing norms on three matrix\ncompletion problems. In all examples, the nuclear norm heuristic is\noutperformed by convex relaxations based on other low-rank inducing norms. For\ntwo of the problems there exist low-rank inducing norms that succeed in\nrecovering the partially unknown matrix, while the nuclear norm fails. These\nlow-rank inducing norms are shown to be representable as semi-definite\nprograms. Moreover, these norms have cheaply computable proximal mappings,\nwhich makes it possible to also solve problems of large size using first-order\nmethods.","url_abs":"http://arxiv.org/abs/1612.03186v2","url_pdf":"http://arxiv.org/pdf/1612.03186v2.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":"low-rank-inducing-norms-with-optimality","repo_url":"https://github.com/LowRankOpt/LRINorm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"low-rank-inducing-norms-with-optimality","repo_url":"https://github.com/LowRankOpt/LRIPy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"matrix-completion","task_name":"Matrix Completion"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"LowRankOpt/LRINorm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"LowRankOpt/LRIPy","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"feb80f977e5fd80e82a3135a4cae4695abc85bcea647e51da60c53ae0ed91337","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}