{"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":"/method/hypernetwork/papers/3","list_of":"/method/hypernetwork","method":"HyperNetwork","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,239],"of":239,"counts":{"archive_papers_tagged":239,"with_a_code_link":115,"where_syntology_ran_a_sample":41,"not_listed_spam_title":0,"listed":239,"listed_where_code_ran":41,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":33,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":33,"listed_every_run_a_failure_of_syntologys_instrument":8,"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":"/method/hypernetwork","prev":"/method/hypernetwork/papers/2","next":null,"papers":[{"paper":null,"slug":"contextual-hypernetworks-for-novel-feature-1","title":"Contextual HyperNetworks for Novel Feature Adaptation","date":"2021-04-12","arxiv_id":"2104.05860","n_code_links":0,"syntology":null},{"paper":"/paper/personalized-federated-learning-using","slug":"personalized-federated-learning-using","title":"Personalized Federated Learning using Hypernetworks","date":"2021-03-08","arxiv_id":"2103.04628","n_code_links":2,"syntology":null},{"paper":"/paper/hyperpocket-generative-point-cloud-completion","slug":"hyperpocket-generative-point-cloud-completion","title":"HyperPocket: Generative Point Cloud Completion","date":"2021-02-11","arxiv_id":"2102.05973","n_code_links":1,"syntology":null},{"paper":"/paper/phase-retrieval-using-expectation-consistent","slug":"phase-retrieval-using-expectation-consistent","title":"Phase Retrieval using Expectation Consistent Signal Recovery Algorithm based on Hypernetwork","date":"2021-01-12","arxiv_id":"2101.04348","n_code_links":1,"syntology":null},{"paper":"/paper/regularization-agnostic-compressed-sensing","slug":"regularization-agnostic-compressed-sensing","title":"Regularization-Agnostic Compressed Sensing MRI Reconstruction with Hypernetworks","date":"2021-01-06","arxiv_id":"2101.02194","n_code_links":2,"syntology":null},{"paper":"/paper/hypermorph-amortized-hyperparameter-learning","slug":"hypermorph-amortized-hyperparameter-learning","title":"HyperMorph: Amortized Hyperparameter Learning for Image Registration","date":"2021-01-04","arxiv_id":"2101.01035","n_code_links":1,"syntology":null},{"paper":"/paper/zero-shot-learning-by-generating-task","slug":"zero-shot-learning-by-generating-task","title":"Learning to Generate Task-Specific Adapters from Task Description","date":"2021-01-02","arxiv_id":"2101.00420","n_code_links":1,"syntology":null},{"paper":null,"slug":"hypergrid-transformers-towards-a-single-model","title":"HyperGrid Transformers: Towards A Single Model for Multiple Tasks","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/hyperseg-patch-wise-hypernetwork-for-real","slug":"hyperseg-patch-wise-hypernetwork-for-real","title":"HyperSeg: Patch-wise Hypernetwork for Real-time Semantic Segmentation","date":"2020-12-21","arxiv_id":"2012.11582","n_code_links":1,"syntology":null},{"paper":null,"slug":"regflow-probabilistic-flow-based-regression","title":"RegFlow: Probabilistic Flow-based Regression for Future Prediction","date":"2020-11-30","arxiv_id":"2011.14620","n_code_links":0,"syntology":null},{"paper":null,"slug":"pcps-patient-cardiac-prototypes-1","title":"PCPs: Patient Cardiac Prototypes","date":"2020-11-28","arxiv_id":"2011.14227","n_code_links":0,"syntology":null},{"paper":"/paper/delta-stn-efficient-bilevel-optimization-for","slug":"delta-stn-efficient-bilevel-optimization-for","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","date":"2020-10-26","arxiv_id":"2010.13514","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"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","official":{"repos":["pomonam/Self-Tuning-Networks"],"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"]}}},{"paper":null,"slug":"controllable-pareto-multi-task-learning-1","title":"Controllable Pareto Multi-Task Learning","date":"2020-10-13","arxiv_id":"2010.06313","n_code_links":0,"syntology":null},{"paper":"/paper/learning-the-pareto-front-with-hypernetworks-1","slug":"learning-the-pareto-front-with-hypernetworks-1","title":"Learning the Pareto Front with Hypernetworks","date":"2020-10-08","arxiv_id":"2010.04104","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":0,"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) · 0 unverified","official":{"repos":["AvivNavon/pareto-hypernetworks"],"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"]}}},{"paper":null,"slug":"hypergrid-efficient-multi-task-transformers","title":"HyperGrid: Efficient Multi-Task Transformers with Grid-wise Decomposable Hyper Projections","date":"2020-07-12","arxiv_id":"2007.05891","n_code_links":0,"syntology":null},{"paper":"/paper/learning-implicit-credit-assignment-for-multi","slug":"learning-implicit-credit-assignment-for-multi","title":"Learning Implicit Credit Assignment for Cooperative Multi-Agent Reinforcement Learning","date":"2020-07-06","arxiv_id":"2007.02529","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["mzho7212/LICA"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/hyperflow-representing-3d-objects-as-surfaces","slug":"hyperflow-representing-3d-objects-as-surfaces","title":"HyperFlow: Representing 3D Objects as Surfaces","date":"2020-06-15","arxiv_id":"2006.08710","n_code_links":1,"syntology":null},{"paper":null,"slug":"hypernetwork-based-augmentation","title":"Hypernetwork-Based Augmentation","date":"2020-06-11","arxiv_id":"2006.06320","n_code_links":0,"syntology":null},{"paper":null,"slug":"metainv-net-meta-inversion-network-for-sparse","title":"MetaInv-Net: Meta Inversion Network for Sparse View CT Image Reconstruction","date":"2020-05-30","arxiv_id":"2006.00171","n_code_links":0,"syntology":null},{"paper":"/paper/on-the-optimization-dynamics-of-wide","slug":"on-the-optimization-dynamics-of-wide","title":"On Infinite-Width Hypernetworks","date":"2020-03-27","arxiv_id":"2003.12193","n_code_links":1,"syntology":null},{"paper":null,"slug":"adwpnas-architecture-driven-weight-prediction","title":"ADWPNAS: Architecture-Driven Weight Prediction for Neural Architecture Search","date":"2020-03-03","arxiv_id":"2003.01335","n_code_links":0,"syntology":null},{"paper":"/paper/comparing-the-parameter-complexity-of","slug":"comparing-the-parameter-complexity-of","title":"On the Modularity of Hypernetworks","date":"2020-02-23","arxiv_id":"2002.10006","n_code_links":1,"syntology":null},{"paper":null,"slug":"isbnet-instance-aware-selective-branching-1","title":"ISBNet: Instance-aware Selective Branching Networks","date":"2020-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"electric-analog-circuit-design-with","title":"Electric Analog Circuit Design with Hypernetworks and a Differential Simulator","date":"2019-11-08","arxiv_id":"1911.03053","n_code_links":0,"syntology":null},{"paper":"/paper/hyper-graph-network-decoders-for-block-codes","slug":"hyper-graph-network-decoders-for-block-codes","title":"Hyper-Graph-Network Decoders for Block Codes","date":"2019-09-05","arxiv_id":"1909.09036","n_code_links":1,"syntology":null},{"paper":"/paper/190600695","slug":"190600695","title":"Continual learning with hypernetworks","date":"2019-06-03","arxiv_id":"1906.00695","n_code_links":9,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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","official":{"repos":["chrhenning/hypercl"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/190600794","slug":"190600794","title":"Blow: a single-scale hyperconditioned flow for non-parallel raw-audio voice conversion","date":"2019-06-03","arxiv_id":"1906.00794","n_code_links":3,"syntology":{"ran":5,"of":5,"n_ran_checked":4,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["joansj/blow","liusongxiang/StarGAN-Voice-Conversion"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-generative-model-for-sampling-high","title":"A Generative Model for Sampling High-Performance and Diverse Weights for Neural Networks","date":"2019-05-07","arxiv_id":"1905.02898","n_code_links":0,"syntology":null},{"paper":"/paper/self-tuning-networks-bilevel-optimization-of","slug":"self-tuning-networks-bilevel-optimization-of","title":"Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functions","date":"2019-03-07","arxiv_id":"1903.03088","n_code_links":3,"syntology":null},{"paper":null,"slug":"multi-task-hypernetworks","title":"Hypernetwork functional image representation","date":"2019-02-27","arxiv_id":"1902.10404","n_code_links":0,"syntology":null},{"paper":"/paper/graph-hypernetworks-for-neural-architecture","slug":"graph-hypernetworks-for-neural-architecture","title":"Graph HyperNetworks for Neural Architecture Search","date":"2018-10-12","arxiv_id":"1810.05749","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":0,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/hypernetwork-knowledge-graph-embeddings","slug":"hypernetwork-knowledge-graph-embeddings","title":"Hypernetwork Knowledge Graph Embeddings","date":"2018-08-21","arxiv_id":"1808.07018","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-to-compose-over-tree-structures-via","title":"Learning to Compose over Tree Structures via POS Tags","date":"2018-08-18","arxiv_id":"1808.06075","n_code_links":0,"syntology":null},{"paper":"/paper/stochastic-hyperparameter-optimization","slug":"stochastic-hyperparameter-optimization","title":"Stochastic Hyperparameter Optimization through Hypernetworks","date":"2018-02-26","arxiv_id":"1802.09419","n_code_links":1,"syntology":{"ran":11,"of":11,"n_ran_checked":11,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/generating-neural-networks-with-neural","slug":"generating-neural-networks-with-neural","title":"Generating Neural Networks with Neural Networks","date":"2018-01-06","arxiv_id":"1801.01952","n_code_links":1,"syntology":null},{"paper":null,"slug":"stochastic-maximum-likelihood-optimization","title":"Stochastic Maximum Likelihood Optimization via Hypernetworks","date":"2017-12-04","arxiv_id":"1712.01141","n_code_links":0,"syntology":null},{"paper":null,"slug":"hypernetworks-with-statistical-filtering-for","title":"HyperNetworks with statistical filtering for defending adversarial examples","date":"2017-11-06","arxiv_id":"1711.01791","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesian-hypernetworks","title":"Bayesian Hypernetworks","date":"2017-10-13","arxiv_id":"1710.04759","n_code_links":0,"syntology":null},{"paper":"/paper/hypernetworks","slug":"hypernetworks","title":"HyperNetworks","date":"2016-09-27","arxiv_id":"1609.09106","n_code_links":10,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":3,"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) · 1 unverified","official":null}}],"record_sha256":"d70c4f8300caa908e34d2809fcebb253000852c22cd23045d5b60d25648fb479","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}