{"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/robust-implicit-networks-via-non-euclidean","title":"Robust Implicit Networks via Non-Euclidean Contractions","arxiv_id":"2106.03194","date":"2021-06-06","proceeding":"NeurIPS 2021 12","authors":["Saber Jafarpour","Alexander Davydov","Anton V. Proskurnikov","Francesco Bullo"],"abstract":"Implicit neural networks, a.k.a., deep equilibrium networks, are a class of implicit-depth learning models where function evaluation is performed by solving a fixed point equation. They generalize classic feedforward models and are equivalent to infinite-depth weight-tied feedforward networks. While implicit models show improved accuracy and significant reduction in memory consumption, they can suffer from ill-posedness and convergence instability. This paper provides a new framework, which we call Non-Euclidean Monotone Operator Network (NEMON), to design well-posed and robust implicit neural networks based upon contraction theory for the non-Euclidean norm $\\ell_{\\infty}$. Our framework includes (i) a novel condition for well-posedness based on one-sided Lipschitz constants, (ii) an average iteration for computing fixed-points, and (iii) explicit estimates on input-output Lipschitz constants. Additionally, we design a training problem with the well-posedness condition and the average iteration as constraints and, to achieve robust models, with the input-output Lipschitz constant as a regularizer. Our $\\ell_{\\infty}$ well-posedness condition leads to a larger polytopic training search space than existing conditions and our average iteration enjoys accelerated convergence. Finally, we evaluate our framework in image classification through the MNIST and the CIFAR-10 datasets. Our numerical results demonstrate improved accuracy and robustness of the implicit models with smaller input-output Lipschitz bounds. Code is available at https://github.com/davydovalexander/Non-Euclidean_Mon_Op_Net.","url_abs":"https://arxiv.org/abs/2106.03194v6","url_pdf":"https://arxiv.org/pdf/2106.03194v6.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":"robust-implicit-networks-via-non-euclidean","repo_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.03194","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03194"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/davydovalexander/non-euclidean_mon_op_net","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"by_repo_kind":{"official":{"samples":5,"ran":0,"repositories":1}},"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,"samples":[{"code_sha256_prefix":"4a761cd1ad3f3745","entry":"compute_eigval","repo":"davydovalexander/non-euclidean_mon_op_net","repo_kind":"official","path":"utils.py","file_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4a761cd1ad3f3745"}},{"code_sha256_prefix":"908f7df143732705","entry":"fft_to_complex_matrix","repo":"davydovalexander/non-euclidean_mon_op_net","repo_kind":"official","path":"NEmon.py","file_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net/blob/HEAD/NEmon.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"908f7df143732705"}},{"code_sha256_prefix":"4acd1142001b7c0e","entry":"fft_to_complex_vector","repo":"davydovalexander/non-euclidean_mon_op_net","repo_kind":"official","path":"NEmon.py","file_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net/blob/HEAD/NEmon.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4acd1142001b7c0e"}},{"code_sha256_prefix":"d6b1ed4e277997d9","entry":"init_fft_conv","repo":"davydovalexander/non-euclidean_mon_op_net","repo_kind":"official","path":"NEmon.py","file_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net/blob/HEAD/NEmon.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d6b1ed4e277997d9"}},{"code_sha256_prefix":"1ecf9b50659d7670","entry":"power_iteration","repo":"davydovalexander/non-euclidean_mon_op_net","repo_kind":"official","path":"utils.py","file_url":"https://github.com/davydovalexander/non-euclidean_mon_op_net/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1ecf9b50659d7670"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}