{"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":"/task/compressed-sensing/papers/ran/1","list_of":"/task/compressed-sensing","task":"compressed sensing","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,27],"of":27,"counts":{"archive_papers_tagged":992,"with_a_code_link":246,"where_syntology_ran_a_sample":27,"not_listed_spam_title":0,"listed":992,"listed_where_code_ran":27,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":25,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":25,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/compressed-sensing/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/leanvae-an-ultra-efficient-reconstruction-vae","slug":"leanvae-an-ultra-efficient-reconstruction-vae","title":"LeanVAE: An Ultra-Efficient Reconstruction VAE for Video Diffusion Models","date":"2025-03-18","arxiv_id":"2503.14325","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/leanvae-an-ultra-efficient-reconstruction-vae#ran","syntology_url":"https://syntology.ai/paper/2503.14325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.14325"}},"official":{"repos":["westlake-repl/leanvae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/training-physics-driven-deep-learning","slug":"training-physics-driven-deep-learning","title":"Fast MRI for All: Bridging Equity Gaps via Training without Raw Data Access","date":"2024-11-20","arxiv_id":"2411.13022","repositories_listed":0,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/training-physics-driven-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2411.13022","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.13022"}},"official":null}},{"url":"/paper/flow-priors-for-linear-inverse-problems-via","slug":"flow-priors-for-linear-inverse-problems-via","title":"Flow Priors for Linear Inverse Problems via Iterative Corrupted Trajectory Matching","date":"2024-05-29","arxiv_id":"2405.18816","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":6,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flow-priors-for-linear-inverse-problems-via#ran","syntology_url":"https://syntology.ai/paper/2405.18816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.18816"}},"official":{"repos":["yasminzhang/ictm"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/vsharp-variable-splitting-half-quadratic-admm","slug":"vsharp-variable-splitting-half-quadratic-admm","title":"vSHARP: variable Splitting Half-quadratic Admm algorithm for Reconstruction of inverse-Problems","date":"2023-09-18","arxiv_id":"2309.09954","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vsharp-variable-splitting-half-quadratic-admm#ran","syntology_url":"https://syntology.ai/paper/2309.09954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.09954"}},"official":{"repos":["nki-ai/direct"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-physics-guided-unrolling-generalization","slug":"deep-physics-guided-unrolling-generalization","title":"Deep Physics-Guided Unrolling Generalization for Compressed Sensing","date":"2023-07-18","arxiv_id":"2307.08950","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-physics-guided-unrolling-generalization#ran","syntology_url":"https://syntology.ai/paper/2307.08950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08950"}},"official":{"repos":["guaishou74851/prl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ambient-diffusion-learning-clean","slug":"ambient-diffusion-learning-clean","title":"Ambient Diffusion: Learning Clean Distributions from Corrupted Data","date":"2023-05-30","arxiv_id":"2305.19256","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ambient-diffusion-learning-clean#ran","syntology_url":"https://syntology.ai/paper/2305.19256","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19256"}},"official":{"repos":["giannisdaras/ambient-diffusion"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-unified-framework-for-soft-threshold","slug":"a-unified-framework-for-soft-threshold","title":"A Unified Framework for Soft Threshold Pruning","date":"2023-02-25","arxiv_id":"2302.13019","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-unified-framework-for-soft-threshold#ran","syntology_url":"https://syntology.ai/paper/2302.13019","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13019"}},"official":{"repos":["yanqi-chen/lats"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/zero-shot-image-restoration-using-denoising","slug":"zero-shot-image-restoration-using-denoising","title":"Zero-Shot Image Restoration Using Denoising Diffusion Null-Space Model","date":"2022-12-01","arxiv_id":"2212.00490","repositories_listed":4,"syntology":{"n":23,"n_ran":16,"n_constructed":0,"n_ran_checked":11,"n_instrument":5,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":10,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/zero-shot-image-restoration-using-denoising#ran","syntology_url":"https://syntology.ai/paper/2212.00490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.00490"}},"official":{"repos":["wyhuai/ddnm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/relu-neural-networks-learn-the-simplest","slug":"relu-neural-networks-learn-the-simplest","title":"Overparameterized ReLU Neural Networks Learn the Simplest Models: Neural Isometry and Exact Recovery","date":"2022-09-30","arxiv_id":"2209.15265","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relu-neural-networks-learn-the-simplest#ran","syntology_url":"https://syntology.ai/paper/2209.15265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.15265"}},"official":{"repos":["pilancilab/neural-recovery"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/near-exact-recovery-for-tomographic-inverse","slug":"near-exact-recovery-for-tomographic-inverse","title":"Near-Exact Recovery for Tomographic Inverse Problems via Deep Learning","date":"2022-06-14","arxiv_id":"2206.07050","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/near-exact-recovery-for-tomographic-inverse#ran","syntology_url":"https://syntology.ai/paper/2206.07050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07050"}},"official":{"repos":["jmaces/aapm-ct-challenge"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/recurrent-variational-network-a-deep-learning","slug":"recurrent-variational-network-a-deep-learning","title":"Recurrent Variational Network: A Deep Learning Inverse Problem Solver applied to the task of Accelerated MRI Reconstruction","date":"2021-11-18","arxiv_id":"2111.09639","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recurrent-variational-network-a-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2111.09639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.09639"}},"official":{"repos":["directgroup/direct","nki-ai/direct"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/tfpnp-tuning-free-plug-and-play-proximal","slug":"tfpnp-tuning-free-plug-and-play-proximal","title":"TFPnP: Tuning-free Plug-and-Play Proximal Algorithm with Applications to Inverse Imaging Problems","date":"2020-11-18","arxiv_id":"2012.05703","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/tfpnp-tuning-free-plug-and-play-proximal#ran","syntology_url":"https://syntology.ai/paper/2012.05703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.05703"}},"official":{"repos":["Vandermode/TFPnP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/solving-inverse-problems-with-deep-neural","slug":"solving-inverse-problems-with-deep-neural","title":"Solving Inverse Problems With Deep Neural Networks -- Robustness Included?","date":"2020-11-09","arxiv_id":"2011.04268","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/solving-inverse-problems-with-deep-neural#ran","syntology_url":"https://syntology.ai/paper/2011.04268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04268"}},"official":{"repos":["jmaces/robust-nets"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/scobo-sparsity-aware-comparison-oracle-based","slug":"scobo-sparsity-aware-comparison-oracle-based","title":"A One-bit, Comparison-Based Gradient Estimator","date":"2020-10-06","arxiv_id":"2010.02479","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scobo-sparsity-aware-comparison-oracle-based#ran","syntology_url":"https://syntology.ai/paper/2010.02479","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02479"}},"official":{"repos":["caesarcai/SCOBO"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/designing-and-learning-trainable-priors-with","slug":"designing-and-learning-trainable-priors-with","title":"A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding","date":"2020-06-26","arxiv_id":"2006.14859","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/designing-and-learning-trainable-priors-with#ran","syntology_url":"https://syntology.ai/paper/2006.14859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14859"}},"official":null}},{"url":"/paper/robust-compressed-sensing-of-generative","slug":"robust-compressed-sensing-of-generative","title":"Robust Compressed Sensing using Generative Models","date":"2020-06-16","arxiv_id":"2006.09461","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robust-compressed-sensing-of-generative#ran","syntology_url":"https://syntology.ai/paper/2006.09461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09461"}},"official":{"repos":["ajiljalal/csgm-robust-neurips"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/projection-probability-driven-black-box","slug":"projection-probability-driven-black-box","title":"Projection & Probability-Driven Black-Box Attack","date":"2020-05-08","arxiv_id":"2005.03837","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/projection-probability-driven-black-box#ran","syntology_url":"https://syntology.ai/paper/2005.03837","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03837"}},"official":{"repos":["theFool32/PPBA"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-variational-networks-for","slug":"end-to-end-variational-networks-for","title":"End-to-End Variational Networks for Accelerated MRI Reconstruction","date":"2020-04-14","arxiv_id":"2004.06688","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/end-to-end-variational-networks-for#ran","syntology_url":"https://syntology.ai/paper/2004.06688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.06688"}},"official":{"repos":["facebookresearch/fastMRI"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/unsupervised-deep-basis-pursuit-learning","slug":"unsupervised-deep-basis-pursuit-learning","title":"Unsupervised Deep Basis Pursuit: Learning inverse problems without ground-truth data","date":"2020-02-14","arxiv_id":"1910.13110","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unsupervised-deep-basis-pursuit-learning#ran","syntology_url":"https://syntology.ai/paper/1910.13110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13110"}},"official":{"repos":["utcsilab/deepinpy"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deephoyer-learning-sparser-neural-network","slug":"deephoyer-learning-sparser-neural-network","title":"DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measures","date":"2019-08-27","arxiv_id":"1908.09979","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deephoyer-learning-sparser-neural-network#ran","syntology_url":"https://syntology.ai/paper/1908.09979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09979"}},"official":{"repos":["yanghr/DeepHoyer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/surfing-iterative-optimization-over","slug":"surfing-iterative-optimization-over","title":"Surfing: Iterative optimization over incrementally trained deep networks","date":"2019-07-19","arxiv_id":"1907.08653","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/surfing-iterative-optimization-over#ran","syntology_url":"https://syntology.ai/paper/1907.08653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.08653"}},"official":{"repos":["jdlafferty/surfing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/vs-net-variable-splitting-network-for","slug":"vs-net-variable-splitting-network-for","title":"VS-Net: Variable splitting network for accelerated parallel MRI reconstruction","date":"2019-07-19","arxiv_id":"1907.10033","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/vs-net-variable-splitting-network-for#ran","syntology_url":"https://syntology.ai/paper/1907.10033","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10033"}},"official":{"repos":["j-duan/VS-Net"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stability-selection-enables-robust-learning","slug":"stability-selection-enables-robust-learning","title":"Stability selection enables robust learning of partial differential equations from limited noisy data","date":"2019-07-17","arxiv_id":"1907.07810","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stability-selection-enables-robust-learning#ran","syntology_url":"https://syntology.ai/paper/1907.07810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.07810"}},"official":{"repos":["SuryanarayanaMK/PDE-STRIDE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/compressed-sensing-from-research-to-clinical","slug":"compressed-sensing-from-research-to-clinical","title":"Compressed Sensing: From Research to Clinical Practice with Data-Driven Learning","date":"2019-03-19","arxiv_id":"1903.07824","repositories_listed":1,"syntology":{"n":15,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/compressed-sensing-from-research-to-clinical#ran","syntology_url":"https://syntology.ai/paper/1903.07824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.07824"}},"official":{"repos":["MRSRL/dl-cs"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-sparse-deviations-for-compressed","slug":"modeling-sparse-deviations-for-compressed","title":"Modeling Sparse Deviations for Compressed Sensing using Generative Models","date":"2018-07-04","arxiv_id":"1807.01442","repositories_listed":2,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/modeling-sparse-deviations-for-compressed#ran","syntology_url":"https://syntology.ai/paper/1807.01442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.01442"}},"official":null}},{"url":"/paper/hyperparameter-optimization-a-spectral","slug":"hyperparameter-optimization-a-spectral","title":"Hyperparameter Optimization: A Spectral Approach","date":"2017-06-02","arxiv_id":"1706.00764","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyperparameter-optimization-a-spectral#ran","syntology_url":"https://syntology.ai/paper/1706.00764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.00764"}},"official":{"repos":["callowbird/Harmonica"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/compressed-sensing-using-generative-models","slug":"compressed-sensing-using-generative-models","title":"Compressed Sensing using Generative Models","date":"2017-03-09","arxiv_id":"1703.03208","repositories_listed":3,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/compressed-sensing-using-generative-models#ran","syntology_url":"https://syntology.ai/paper/1703.03208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03208"}},"official":{"repos":["AshishBora/csgm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}}],"record_sha256":"4c35d7f432b82ab0548d686c9adcb90b86f5d7bf60d6009ee280cc554917cbbc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}