{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/revisiting-decomposable-submodular-function","title":"Revisiting Decomposable Submodular Function Minimization with Incidence Relations","arxiv_id":"1803.03851","date":"2018-03-10","proceeding":"NeurIPS 2018 12","authors":["Pan Li","Olgica Milenkovic"],"abstract":"We introduce a new approach to decomposable submodular function minimization\n(DSFM) that exploits incidence relations. Incidence relations describe which\nvariables effectively influence the component functions, and when properly\nutilized, they allow for improving the convergence rates of DSFM solvers. Our\nmain results include the precise parametrization of the DSFM problem based on\nincidence relations, the development of new scalable alternative projections\nand parallel coordinate descent methods and an accompanying rigorous analysis\nof their convergence rates.","url_abs":"http://arxiv.org/abs/1803.03851v3","url_pdf":"http://arxiv.org/pdf/1803.03851v3.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":"revisiting-decomposable-submodular-function","repo_url":"https://github.com/lipan00123/DSFM-with-incidence-relations","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}