{"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/approximate-vanishing-ideal-computations-at","title":"Approximate Vanishing Ideal Computations at Scale","arxiv_id":"2207.01236","date":"2022-07-04","proceeding":null,"authors":["Elias Wirth","Hiroshi Kera","Sebastian Pokutta"],"abstract":"The vanishing ideal of a set of points $X = \\{\\mathbf{x}_1, \\ldots, \\mathbf{x}_m\\}\\subseteq \\mathbb{R}^n$ is the set of polynomials that evaluate to $0$ over all points $\\mathbf{x} \\in X$ and admits an efficient representation by a finite subset of generators. In practice, to accommodate noise in the data, algorithms that construct generators of the approximate vanishing ideal are widely studied but their computational complexities remain expensive. In this paper, we scale up the oracle approximate vanishing ideal algorithm (OAVI), the only generator-constructing algorithm with known learning guarantees. We prove that the computational complexity of OAVI is not superlinear, as previously claimed, but linear in the number of samples $m$. In addition, we propose two modifications that accelerate OAVI's training time: Our analysis reveals that replacing the pairwise conditional gradients algorithm, one of the solvers used in OAVI, with the faster blended pairwise conditional gradients algorithm leads to an exponential speed-up in the number of features $n$. Finally, using a new inverse Hessian boosting approach, intermediate convex optimization problems can be solved almost instantly, improving OAVI's training time by multiple orders of magnitude in a variety of numerical experiments.","url_abs":"https://arxiv.org/abs/2207.01236v2","url_pdf":"https://arxiv.org/pdf/2207.01236v2.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":"approximate-vanishing-ideal-computations-at","repo_url":"https://github.com/ZIB-IOL/avi_at_scale","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2207.01236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01236"}},"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/ZIB-IOL/avi_at_scale","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"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":"a79e4ea432acccd8","entry":"argsort_list","repo":"ZIB-IOL/avi_at_scale","repo_kind":"official","path":"src/auxiliary_functions/sorting.py","file_url":"https://github.com/ZIB-IOL/avi_at_scale/blob/HEAD/src/auxiliary_functions/sorting.py","link_basis":"harvester_set","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":"a79e4ea432acccd8"}},{"code_sha256_prefix":"692c24e231c05d74","entry":"load_data_frame","repo":"ZIB-IOL/avi_at_scale","repo_kind":"official","path":"src/data_frames/data_frames.py","file_url":"https://github.com/ZIB-IOL/avi_at_scale/blob/HEAD/src/data_frames/data_frames.py","link_basis":"harvester_set","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":"692c24e231c05d74"}},{"code_sha256_prefix":"2709907bee9e0621","entry":"min_max_feature_scaling","repo":"ZIB-IOL/avi_at_scale","repo_kind":"official","path":"src/data_sets/preprocessing.py","file_url":"https://github.com/ZIB-IOL/avi_at_scale/blob/HEAD/src/data_sets/preprocessing.py","link_basis":"harvester_set","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":"2709907bee9e0621"}},{"code_sha256_prefix":"073d2a877daa40af","entry":"translate_names","repo":"ZIB-IOL/avi_at_scale","repo_kind":"official","path":"src/auxiliary_functions/auxiliary_functions.py","file_url":"https://github.com/ZIB-IOL/avi_at_scale/blob/HEAD/src/auxiliary_functions/auxiliary_functions.py","link_basis":"harvester_set","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":"073d2a877daa40af"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}