{"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","slug":"hypernetwork","name":"HyperNetwork","full_name":"HyperNetwork","full_name_withheld":false,"description_markdown":"A **HyperNetwork** is a network that generates weights for a main network.  The behavior of the main network is the same with any usual neural network: it learns to map some raw inputs to their desired targets; whereas the hypernetwork takes a set of inputs that contain information about the structure of the weights and generates the weight for that layer.","description_state":"present","introduced_year":null,"introduced_by":{"title":"HyperNetworks","paper":"/paper/hypernetworks","first_author":"David Ha","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/hypernetworks"},"source":{"url":"http://arxiv.org/abs/1609.09106v4","title":"HyperNetworks","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/g1910/HyperNetworks/blob/393e30a56c2ba14fa9efee5f2698d8c82e5821f6/hypernetwork_modules.py#L6","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Feedforward Networks","url":"/methods/category/feedforward-networks","pwc_aliases":[]}],"n_papers_tagged":239,"archive_num_papers":239,"papers_newest_first":[{"paper":null,"slug":"acquiring-and-adapting-priors-for-novel-tasks","title":"Acquiring and Adapting Priors for Novel Tasks via Neural Meta-Architectures","date":"2025-07-07","arxiv_id":"2507.10446","n_code_links":0,"syntology":null},{"paper":null,"slug":"beyond-static-models-hypernetworks-for","title":"Beyond Static Models: Hypernetworks for Adaptive and Generalizable Forecasting in Complex Parametric Dynamical Systems","date":"2025-06-24","arxiv_id":"2506.19609","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-personalized-utility-functions-for","title":"Learning Personalized Utility Functions for Drivers in Ride-hailing Systems Using Ensemble Hypernetworks","date":"2025-06-21","arxiv_id":"2506.17672","n_code_links":0,"syntology":null},{"paper":null,"slug":"lfr-pino-a-layered-fourier-reduced-physics","title":"LFR-PINO: A Layered Fourier Reduced Physics-Informed Neural Operator for Parametric PDEs","date":"2025-06-21","arxiv_id":"2506.17582","n_code_links":0,"syntology":null},{"paper":"/paper/generalizable-agent-modeling-for-agent","slug":"generalizable-agent-modeling-for-agent","title":"Generalizable Agent Modeling for Agent Collaboration-Competition Adaptation with Multi-Retrieval and Dynamic Generation","date":"2025-06-20","arxiv_id":"2506.16718","n_code_links":1,"syntology":null},{"paper":"/paper/leveraging-external-factors-in-household","slug":"leveraging-external-factors-in-household","title":"Leveraging External Factors in Household-Level Electrical Consumption Forecasting using Hypernetworks","date":"2025-06-17","arxiv_id":"2506.14472","n_code_links":1,"syntology":null},{"paper":"/paper/propmend-hypernetworks-for-knowledge","slug":"propmend-hypernetworks-for-knowledge","title":"PropMEND: Hypernetworks for Knowledge Propagation in LLMs","date":"2025-06-10","arxiv_id":"2506.08920","n_code_links":1,"syntology":null},{"paper":null,"slug":"2506-08255","title":"SHIELD: Secure Hypernetworks for Incremental Expansion Learning Defense","date":"2025-06-09","arxiv_id":"2506.08255","n_code_links":0,"syntology":null},{"paper":null,"slug":"exarnn-an-environment-driven-adaptive-rnn-for","title":"ExARNN: An Environment-Driven Adaptive RNN for Learning Non-Stationary Power Dynamics","date":"2025-05-23","arxiv_id":"2505.17488","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-conditional-transport-maps","title":"Neural Conditional Transport Maps","date":"2025-05-21","arxiv_id":"2505.15808","n_code_links":0,"syntology":null},{"paper":null,"slug":"editing-across-languages-a-survey-of","title":"Editing Across Languages: A Survey of Multilingual Knowledge Editing","date":"2025-05-20","arxiv_id":"2505.14393","n_code_links":0,"syntology":null},{"paper":null,"slug":"relation-aware-graph-foundation-model","title":"Relation-Aware Graph Foundation Model","date":"2025-05-17","arxiv_id":"2505.12027","n_code_links":0,"syntology":null},{"paper":"/paper/disco-learning-to-discover-an-evolution","slug":"disco-learning-to-discover-an-evolution","title":"DISCO: learning to DISCover an evolution Operator for multi-physics-agnostic prediction","date":"2025-04-28","arxiv_id":"2504.19496","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["rudymorel/disco"],"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"]}}},{"paper":null,"slug":"uncertainty-quantification-of-neural-network","title":"Uncertainty quantification of neural network models of evolving processes via Langevin sampling","date":"2025-04-21","arxiv_id":"2504.14854","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-allocation-hypernetwork-with-adaptive-1","slug":"dynamic-allocation-hypernetwork-with-adaptive-1","title":"Dynamic Allocation Hypernetwork with Adaptive Model Recalibration for Federated Continual Learning","date":"2025-03-25","arxiv_id":"2503.20808","n_code_links":1,"syntology":null},{"paper":"/paper/continual-reinforcement-learning-for-hvac","slug":"continual-reinforcement-learning-for-hvac","title":"Continual Reinforcement Learning for HVAC Systems Control: Integrating Hypernetworks and Transfer Learning","date":"2025-03-24","arxiv_id":"2503.19212","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-allocation-hypernetwork-with-adaptive","slug":"dynamic-allocation-hypernetwork-with-adaptive","title":"Dynamic Allocation Hypernetwork with Adaptive Model Recalibration for FCL","date":"2025-03-23","arxiv_id":"2503.18064","n_code_links":1,"syntology":null},{"paper":null,"slug":"hypernvd-accelerating-neural-video","title":"HyperNVD: Accelerating Neural Video Decomposition via Hypernetworks","date":"2025-03-21","arxiv_id":"2503.17276","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperdas-towards-automating-mechanistic","title":"HyperDAS: Towards Automating Mechanistic Interpretability with Hypernetworks","date":"2025-03-13","arxiv_id":"2503.10894","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyda-hypernetworks-for-test-time-domain","title":"HyDA: Hypernetworks for Test Time Domain Adaptation in Medical Imaging Analysis","date":"2025-03-06","arxiv_id":"2503.04979","n_code_links":0,"syntology":null},{"paper":"/paper/a-hypernetwork-based-approach-to-kan","slug":"a-hypernetwork-based-approach-to-kan","title":"A Hypernetwork-Based Approach to KAN Representation of Audio Signals","date":"2025-03-04","arxiv_id":"2503.02585","n_code_links":1,"syntology":null},{"paper":null,"slug":"foundation-models-secretly-understand-neural","title":"Foundation Models Secretly Understand Neural Network Weights: Enhancing Hypernetwork Architectures with Foundation Models","date":"2025-03-02","arxiv_id":"2503.00838","n_code_links":0,"syntology":null},{"paper":null,"slug":"boost-disentangle-and-customize-a-robust","title":"Boost, Disentangle, and Customize: A Robust System2-to-System1 Pipeline for Code Generation","date":"2025-02-18","arxiv_id":"2502.12492","n_code_links":0,"syntology":null},{"paper":"/paper/2502-05759","slug":"2502-05759","title":"Reinforced Lifelong Editing for Language Models","date":"2025-02-09","arxiv_id":"2502.05759","n_code_links":1,"syntology":null},{"paper":null,"slug":"leveraging-hypernetworks-and-learnable","title":"Leveraging Hypernetworks and Learnable Kernels for Consumer Energy Forecasting Across Diverse Consumer Types","date":"2025-02-07","arxiv_id":"2502.05104","n_code_links":0,"syntology":null},{"paper":null,"slug":"discovering-physics-laws-of-dynamical-systems","title":"Discovering Physics Laws of Dynamical Systems via Invariant Function Learning","date":"2025-02-06","arxiv_id":"2502.04495","n_code_links":0,"syntology":null},{"paper":"/paper/dual-ensembled-multiagent-q-learning-with","slug":"dual-ensembled-multiagent-q-learning-with","title":"Dual Ensembled Multiagent Q-Learning with Hypernet Regularizer","date":"2025-02-04","arxiv_id":"2502.02018","n_code_links":1,"syntology":null},{"paper":null,"slug":"multi-frequency-wavefield-solutions-for","title":"Multi-frequency wavefield solutions for variable velocity models using meta-learning enhanced low-rank physics-informed neural network","date":"2025-02-02","arxiv_id":"2502.00897","n_code_links":0,"syntology":null},{"paper":null,"slug":"scadyg-a-new-paradigm-for-large-scale-dynamic","title":"ScaDyG:A New Paradigm for Large-scale Dynamic Graph Learning","date":"2025-01-27","arxiv_id":"2501.16002","n_code_links":0,"syntology":null},{"paper":null,"slug":"pareto-set-learning-for-multi-objective","title":"Pareto Set Learning for Multi-Objective Reinforcement Learning","date":"2025-01-12","arxiv_id":"2501.06773","n_code_links":0,"syntology":null},{"paper":null,"slug":"hipyrnet-hypernet-guided-feature-pyramid","title":"HipyrNet: Hypernet-Guided Feature Pyramid network for mixed-exposure correction","date":"2025-01-09","arxiv_id":"2501.05195","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperpose-hypernetwork-infused-camera-pose","title":"HyperPose: Hypernetwork-Infused Camera Pose Localization and an Extended Cambridge Landmarks Dataset","date":"2025-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"hypernet-fields-efficiently-training","title":"HyperNet Fields: Efficiently Training Hypernetworks without Ground Truth by Learning Weight Trajectories","date":"2024-12-22","arxiv_id":"2412.17040","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperclip-adapting-vision-language-models","title":"HyperCLIP: Adapting Vision-Language models with Hypernetworks","date":"2024-12-21","arxiv_id":"2412.16777","n_code_links":0,"syntology":null},{"paper":"/paper/fast-and-slow-gradient-approximation-for","slug":"fast-and-slow-gradient-approximation-for","title":"Fast and Slow Gradient Approximation for Binary Neural Network Optimization","date":"2024-12-16","arxiv_id":"2412.11777","n_code_links":1,"syntology":null},{"paper":null,"slug":"benchmarking-and-learning-multi-dimensional","title":"Benchmarking and Learning Multi-Dimensional Quality Evaluator for Text-to-3D Generation","date":"2024-12-15","arxiv_id":"2412.11170","n_code_links":0,"syntology":null},{"paper":"/paper/a-new-federated-learning-framework-against","slug":"a-new-federated-learning-framework-against","title":"A New Federated Learning Framework Against Gradient Inversion Attacks","date":"2024-12-10","arxiv_id":"2412.07187","n_code_links":1,"syntology":null},{"paper":"/paper/lora-rar-learning-to-merge-loras-via","slug":"lora-rar-learning-to-merge-loras-via","title":"LoRA.rar: Learning to Merge LoRAs via Hypernetworks for Subject-Style Conditioned Image Generation","date":"2024-12-06","arxiv_id":"2412.05148","n_code_links":1,"syntology":null},{"paper":null,"slug":"hyperflint-hypernetwork-based-flow-estimation","title":"HyperFLINT: Hypernetwork-based Flow Estimation and Temporal Interpolation for Scientific Ensemble Visualization","date":"2024-12-05","arxiv_id":"2412.04095","n_code_links":0,"syntology":null},{"paper":null,"slug":"lora-diffusion-zero-shot-lora-synthesis-for","title":"LoRA Diffusion: Zero-Shot LoRA Synthesis for Diffusion Model Personalization","date":"2024-12-03","arxiv_id":"2412.02352","n_code_links":0,"syntology":null},{"paper":null,"slug":"retrofitting-large-language-models-with","title":"Retrofitting Large Language Models with Dynamic Tokenization","date":"2024-11-27","arxiv_id":"2411.18553","n_code_links":0,"syntology":null},{"paper":"/paper/decode-domain-aware-continual-domain","slug":"decode-domain-aware-continual-domain","title":"DECODE: Domain-aware Continual Domain Expansion for Motion Prediction","date":"2024-11-26","arxiv_id":"2411.17917","n_code_links":1,"syntology":null},{"paper":null,"slug":"acquire-precise-and-comparable-fundus-image","title":"Acquire Precise and Comparable Fundus Image Quality Score: FTHNet and FQS Dataset","date":"2024-11-19","arxiv_id":"2411.12273","n_code_links":0,"syntology":null},{"paper":null,"slug":"retinal-vessel-segmentation-via-neuron","title":"Retinal Vessel Segmentation via Neuron Programming","date":"2024-11-17","arxiv_id":"2411.11110","n_code_links":0,"syntology":null},{"paper":"/paper/learning-where-to-edit-vision-transformers","slug":"learning-where-to-edit-vision-transformers","title":"Learning Where to Edit Vision Transformers","date":"2024-11-04","arxiv_id":"2411.01948","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":2,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hustyyq/where-to-edit"],"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","unlocated"]}}},{"paper":null,"slug":"sample-compression-hypernetworks-from","title":"Sample Compression Hypernetworks: From Generalization Bounds to Meta-Learning","date":"2024-10-17","arxiv_id":"2410.13577","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyper-adversarial-tuning-for-boosting","title":"Hyper Adversarial Tuning for Boosting Adversarial Robustness of Pretrained Large Vision Models","date":"2024-10-08","arxiv_id":"2410.05951","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperdet-generalizable-detection-of","title":"HyperDet: Generalizable Detection of Synthesized Images by Generating and Merging A Mixture of Hyper LoRAs","date":"2024-10-08","arxiv_id":"2410.06044","n_code_links":0,"syntology":null},{"paper":"/paper/aided-design-of-bridge-aesthetics-based-on","slug":"aided-design-of-bridge-aesthetics-based-on","title":"Aided design of bridge aesthetics based on Stable Diffusion fine-tuning","date":"2024-09-24","arxiv_id":"2409.15812","n_code_links":1,"syntology":null},{"paper":null,"slug":"leia-latent-view-invariant-embeddings-for","title":"LEIA: Latent View-invariant Embeddings for Implicit 3D Articulation","date":"2024-09-10","arxiv_id":"2409.06703","n_code_links":0,"syntology":null},{"paper":null,"slug":"g3dst-generalizing-3d-style-transfer-with","title":"G3DST: Generalizing 3D Style Transfer with Neural Radiance Fields across Scenes and Styles","date":"2024-08-24","arxiv_id":"2408.13508","n_code_links":0,"syntology":null},{"paper":null,"slug":"difflora-generating-personalized-low-rank","title":"DiffLoRA: Generating Personalized Low-Rank Adaptation Weights with Diffusion","date":"2024-08-13","arxiv_id":"2408.06740","n_code_links":0,"syntology":null},{"paper":null,"slug":"characterizing-user-archetypes-and","title":"Characterizing User Archetypes and Discussions on Scored.co","date":"2024-07-31","arxiv_id":"2407.21753","n_code_links":0,"syntology":null},{"paper":null,"slug":"hf-fed-hierarchical-based-customized","title":"HF-Fed: Hierarchical based customized Federated Learning Framework for X-Ray Imaging","date":"2024-07-25","arxiv_id":"2407.17780","n_code_links":0,"syntology":null},{"paper":"/paper/hyperaggregation-aggregating-over-graph-edges","slug":"hyperaggregation-aggregating-over-graph-edges","title":"HyperAggregation: Aggregating over Graph Edges with Hypernetworks","date":"2024-07-16","arxiv_id":"2407.11596","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-survey-of-controllable-learning-methods-and","title":"A Survey of Controllable Learning: Methods and Applications in Information Retrieval","date":"2024-07-04","arxiv_id":"2407.06083","n_code_links":0,"syntology":null},{"paper":"/paper/effective-heterogeneous-federated-learning","slug":"effective-heterogeneous-federated-learning","title":"Effective Heterogeneous Federated Learning via Efficient Hypernetwork-based Weight Generation","date":"2024-07-03","arxiv_id":"2407.03086","n_code_links":1,"syntology":null},{"paper":null,"slug":"hyperloader-integrating-hypernetwork-based","title":"HyperLoader: Integrating Hypernetwork-Based LoRA and Adapter Layers into Multi-Task Transformers for Sequence Labelling","date":"2024-07-01","arxiv_id":"2407.01411","n_code_links":0,"syntology":null},{"paper":null,"slug":"leveraging-parameter-efficient-transfer","title":"Leveraging Parameter-Efficient Transfer Learning for Multi-Lingual Text-to-Speech Adaptation","date":"2024-06-25","arxiv_id":"2406.17257","n_code_links":0,"syntology":null},{"paper":"/paper/from-instance-training-to-instruction","slug":"from-instance-training-to-instruction","title":"From Instance Training to Instruction Learning: Task Adapters Generation from Instructions","date":"2024-06-18","arxiv_id":"2406.12382","n_code_links":2,"syntology":{"ran":8,"of":10,"n_ran_checked":7,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["Xnhyacinth/TAGI"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/attention-as-a-hypernetwork","slug":"attention-as-a-hypernetwork","title":"Attention as a Hypernetwork","date":"2024-06-09","arxiv_id":"2406.05816","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 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["smonsays/hypernetwork-attention"],"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"]}}},{"paper":null,"slug":"hypernetworks-for-personalizing-asr-to","title":"Hypernetworks for Personalizing ASR to Atypical Speech","date":"2024-06-06","arxiv_id":"2406.04240","n_code_links":0,"syntology":null},{"paper":"/paper/an-application-of-node-and-edge-nonlinear","slug":"an-application-of-node-and-edge-nonlinear","title":"An application of node and edge nonlinear hypergraph centrality to a protein complex hypernetwork","date":"2024-06-04","arxiv_id":"2406.01880","n_code_links":1,"syntology":null},{"paper":null,"slug":"low-dimensional-approximations-of-the","title":"Low-dimensional approximations of the conditional law of Volterra processes: a non-positive curvature approach","date":"2024-05-30","arxiv_id":"2405.20094","n_code_links":0,"syntology":null},{"paper":"/paper/hate-speech-detection-with-generalizable","slug":"hate-speech-detection-with-generalizable","title":"Hate Speech Detection with Generalizable Target-aware Fairness","date":"2024-05-28","arxiv_id":"2406.00046","n_code_links":1,"syntology":null},{"paper":"/paper/hyperinterval-hypernetwork-approach-to","slug":"hyperinterval-hypernetwork-approach-to","title":"HINT: Hypernetwork Approach to Training Weight Interval Regions in Continual Learning","date":"2024-05-24","arxiv_id":"2405.15444","n_code_links":2,"syntology":null},{"paper":null,"slug":"removing-bias-from-maximum-likelihood","title":"Improving Fairness and Mitigating MADness in Generative Models","date":"2024-05-22","arxiv_id":"2405.13977","n_code_links":0,"syntology":null},{"paper":"/paper/zero-shot-tokenizer-transfer","slug":"zero-shot-tokenizer-transfer","title":"Zero-Shot Tokenizer Transfer","date":"2024-05-13","arxiv_id":"2405.07883","n_code_links":2,"syntology":{"ran":7,"of":12,"n_ran_checked":4,"n_instrument":3,"unverified":5,"pointer_only":4,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","official":{"repos":["bminixhofer/zett"],"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":["listed","official"]}}},{"paper":"/paper/scalable-physical-source-to-field-inference","slug":"scalable-physical-source-to-field-inference","title":"Scalable physical source-to-field inference with hypernetworks","date":"2024-05-07","arxiv_id":"2405.05981","n_code_links":1,"syntology":null},{"paper":"/paper/grasper-a-generalist-pursuer-for-pursuit","slug":"grasper-a-generalist-pursuer-for-pursuit","title":"Grasper: A Generalist Pursuer for Pursuit-Evasion Problems","date":"2024-04-19","arxiv_id":"2404.12626","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"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) · 2 unverified","official":{"repos":["ipadli/grasper"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/gpn-generative-point-based-nerf","slug":"gpn-generative-point-based-nerf","title":"GPN: Generative Point-based NeRF","date":"2024-04-12","arxiv_id":"2404.08312","n_code_links":1,"syntology":null},{"paper":null,"slug":"d-oh-decoder-only-random-hypernetworks-for","title":"D'OH: Decoder-Only Random Hypernetworks for Implicit Neural Representations","date":"2024-03-28","arxiv_id":"2403.19163","n_code_links":0,"syntology":null},{"paper":"/paper/imagination-augmented-generation-learning-to","slug":"imagination-augmented-generation-learning-to","title":"Awakening Augmented Generation: Learning to Awaken Internal Knowledge of Large Language Models for Question Answering","date":"2024-03-22","arxiv_id":"2403.15268","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":6,"n_instrument":3,"unverified":3,"pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 2 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":{"repos":["xnhyacinth/iag"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/hyper-cl-conditioning-sentence","slug":"hyper-cl-conditioning-sentence","title":"Hyper-CL: Conditioning Sentence Representations with Hypernetworks","date":"2024-03-14","arxiv_id":"2403.09490","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":5,"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","official":{"repos":["hyu-nlp/hyper-cl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/multi-objective-differentiable-neural","slug":"multi-objective-differentiable-neural","title":"Multi-objective Differentiable Neural Architecture Search","date":"2024-02-28","arxiv_id":"2402.18213","n_code_links":1,"syntology":null},{"paper":"/paper/hyperfast-instant-classification-for-tabular","slug":"hyperfast-instant-classification-for-tabular","title":"HyperFast: Instant Classification for Tabular Data","date":"2024-02-22","arxiv_id":"2402.14335","n_code_links":1,"syntology":{"ran":6,"of":7,"n_ran_checked":3,"n_instrument":3,"unverified":1,"pointer_only":7,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["ai-sandbox/hyperfast"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"non-linear-fusion-in-federated-learning-a","title":"Hypernetwork-Driven Model Fusion for Federated Domain Generalization","date":"2024-02-10","arxiv_id":"2402.06974","n_code_links":0,"syntology":null},{"paper":"/paper/distilling-morphology-conditioned","slug":"distilling-morphology-conditioned","title":"Distilling Morphology-Conditioned Hypernetworks for Efficient Universal Morphology Control","date":"2024-02-09","arxiv_id":"2402.06570","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["masterxiong/universal-morphology-control"],"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"]}}},{"paper":"/paper/a-hyper-transformer-model-for-controllable","slug":"a-hyper-transformer-model-for-controllable","title":"A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints","date":"2024-02-04","arxiv_id":"2402.05955","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"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","official":{"repos":["tuantran23012000/cpfl_hyper_transformer"],"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","unlocated"]}}},{"paper":"/paper/hyperplanes-hypernetwork-approach-to-rapid","slug":"hyperplanes-hypernetwork-approach-to-rapid","title":"HyperPlanes: Hypernetwork Approach to Rapid NeRF Adaptation","date":"2024-02-02","arxiv_id":"2402.01524","n_code_links":1,"syntology":null},{"paper":"/paper/a-cross-view-hierarchical-graph-learning","slug":"a-cross-view-hierarchical-graph-learning","title":"A Cross-View Hierarchical Graph Learning Hypernetwork for Skill Demand-Supply Joint Prediction","date":"2024-01-31","arxiv_id":"2401.17838","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"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) · 2 unverified","official":{"repos":["vincent40416/Skill-Demand-Supply-Joint-Prediction"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/observation-guided-meteorological-field","slug":"observation-guided-meteorological-field","title":"Observation-Guided Meteorological Field Downscaling at Station Scale: A Benchmark and a New Method","date":"2024-01-22","arxiv_id":"2401.11960","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-hypernetwork-based-framework-for-non","title":"A Hypernetwork Based Framework for Non-Stationary Channel Prediction","date":"2024-01-16","arxiv_id":"2401.08338","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperganstrument-instrument-sound-synthesis","title":"HyperGANStrument: Instrument Sound Synthesis and Editing with Pitch-Invariant Hypernetworks","date":"2024-01-09","arxiv_id":"2401.04558","n_code_links":0,"syntology":null},{"paper":null,"slug":"slot-guided-volumetric-object-radiance-fields-1","title":"Slot-guided Volumetric Object Radiance Fields","date":"2024-01-04","arxiv_id":"2401.02241","n_code_links":0,"syntology":null},{"paper":null,"slug":"meter-a-dynamic-concept-adaptation-framework","title":"METER: A Dynamic Concept Adaptation Framework for Online Anomaly Detection","date":"2023-12-28","arxiv_id":"2312.16831","n_code_links":0,"syntology":null},{"paper":null,"slug":"hyperdeeponet-learning-operator-with-complex","title":"HyperDeepONet: learning operator with complex target function space using the limited resources via hypernetwork","date":"2023-12-26","arxiv_id":"2312.15949","n_code_links":0,"syntology":null},{"paper":null,"slug":"infamous-nerf-improving-face-modeling-using","title":"INFAMOUS-NeRF: ImproviNg FAce MOdeling Using Semantically-Aligned Hypernetworks with Neural Radiance Fields","date":"2023-12-23","arxiv_id":"2312.16197","n_code_links":0,"syntology":null},{"paper":null,"slug":"hypermix-out-of-distribution-detection-and","title":"HyperMix: Out-of-Distribution Detection and Classification in Few-Shot Settings","date":"2023-12-22","arxiv_id":"2312.15086","n_code_links":0,"syntology":null},{"paper":null,"slug":"contextual-feature-selection-with-conditional","title":"Contextual Feature Selection with Conditional Stochastic Gates","date":"2023-12-21","arxiv_id":"2312.14254","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-verification-based-face","title":"Efficient Verification-Based Face Identification","date":"2023-12-20","arxiv_id":"2312.13240","n_code_links":0,"syntology":null},{"paper":"/paper/mothernet-a-foundational-hypernetwork-for","slug":"mothernet-a-foundational-hypernetwork-for","title":"MotherNet: Fast Training and Inference via Hyper-Network Transformers","date":"2023-12-14","arxiv_id":"2312.08598","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 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["microsoft/ticl"],"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"]}}},{"paper":"/paper/hyperrouter-towards-efficient-training-and","slug":"hyperrouter-towards-efficient-training-and","title":"HyperRouter: Towards Efficient Training and Inference of Sparse Mixture of Experts","date":"2023-12-12","arxiv_id":"2312.07035","n_code_links":1,"syntology":null},{"paper":null,"slug":"generating-interpretable-networks-using","title":"Generating Interpretable Networks using Hypernetworks","date":"2023-12-05","arxiv_id":"2312.03051","n_code_links":0,"syntology":null},{"paper":null,"slug":"energizing-federated-learning-via-filter","title":"Energizing Federated Learning via Filter-Aware Attention","date":"2023-11-18","arxiv_id":"2311.12049","n_code_links":0,"syntology":null},{"paper":"/paper/learning-physics-inspired-regularization-for","slug":"learning-physics-inspired-regularization-for","title":"Learning Physics-Inspired Regularization for Medical Image Registration with Hypernetworks","date":"2023-11-14","arxiv_id":"2311.08239","n_code_links":1,"syntology":null},{"paper":null,"slug":"interaction-screening-and-pseudolikelihood","title":"Interaction Screening and Pseudolikelihood Approaches for Tensor Learning in Ising Models","date":"2023-10-20","arxiv_id":"2310.13232","n_code_links":0,"syntology":null},{"paper":"/paper/towards-anytime-fine-tuning-continually-pre","slug":"towards-anytime-fine-tuning-continually-pre","title":"Towards Anytime Fine-tuning: Continually Pre-trained Language Models with Hypernetwork Prompt","date":"2023-10-19","arxiv_id":"2310.13024","n_code_links":1,"syntology":null},{"paper":"/paper/learning-to-generate-parameters-of-convnets","slug":"learning-to-generate-parameters-of-convnets","title":"Learning to Generate Parameters of ConvNets for Unseen Image Data","date":"2023-10-18","arxiv_id":"2310.11862","n_code_links":1,"syntology":null},{"paper":"/paper/prototype-based-hyperadapter-for-sample","slug":"prototype-based-hyperadapter-for-sample","title":"Prototype-based HyperAdapter for Sample-Efficient Multi-task Tuning","date":"2023-10-18","arxiv_id":"2310.11670","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"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","official":{"repos":["bumble666/pha"],"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"]}}}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_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":32,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":32,"listed_every_run_a_failure_of_syntologys_instrument":9,"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"},"papers_where_code_ran":41,"papers_where_code_ran_first_page":"/method/hypernetwork/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":3,"url":"/method/hypernetwork/papers/2","json":"/method/hypernetwork/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/method/hypernetwork/papers/3","json":"/method/hypernetwork/papers/3.json","rows":39},{"order":"ran","page":1,"of":1,"url":"/method/hypernetwork/papers/ran/1","json":"/method/hypernetwork/papers/ran/1.json","rows":41}],"tasks":[{"task":"/task/federated-learning","name":"Federated Learning","papers":17},{"task":"/task/meta-learning","name":"Meta-Learning","papers":17},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":15},{"task":"/task/continual-learning","name":"Continual Learning","papers":13},{"task":"/task/decoder","name":"Decoder","papers":11},{"task":"/task/multi-task-learning","name":"Multi-Task Learning","papers":11},{"task":"/task/nerf","name":"NeRF","papers":10},{"task":"/task/personalized-federated-learning","name":"Personalized Federated Learning","papers":9},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":9},{"task":"/task/diversity","name":"Diversity","papers":8},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":8},{"task":"/task/prediction","name":"Prediction","papers":8},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":8},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":8},{"task":"/task/image-generation","name":"Image Generation","papers":7},{"task":"/task/super-resolution","name":"Super-Resolution","papers":7},{"task":"/task/parameter-efficient-fine-tuning","name":"parameter-efficient fine-tuning","papers":7},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":6},{"task":"/task/language-modelling","name":"Language Modelling","papers":6},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":6}],"tasks_shown":20,"n_tasks":251,"usage_by_year":[{"year":"2016","papers":1},{"year":"2017","papers":3},{"year":"2018","papers":5},{"year":"2019","papers":7},{"year":"2020","papers":15},{"year":"2021","papers":31},{"year":"2022","papers":42},{"year":"2023","papers":50},{"year":"2024","papers":53},{"year":"2025","papers":32}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/hypernetwork"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=HyperNetwork","read_at":"2026-10-05T00:57:41+00:00","query":"HyperNetwork","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"hypernetwork","origin_arxiv_id":"2110.13100"},"resolution":"case_insensitive","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1609.09106","repositories":{"listed":3,"in_graph":3,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2110.13100","citations":109},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'HyperNetwork'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2110.13100","page":"/paper/parameter-prediction-for-unseen-deep","syntology_url":"https://syntology.ai/paper/2110.13100","in_graph_layer":true,"samples":7,"ran":6,"n_ran_checked":1,"n_instrument":5,"unverified":1,"phrase":"6 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; 5 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2110.13100: repository known, no verified implementation (declared_code; repositories: 3 listed of 3 in the graph, strongest link: official). The lookup matched 'hypernetwork' ignoring case. About another paper: this answer is about arXiv:2110.13100, while the archive credits arXiv:1609.09106.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"bc4e1e8f682dd1dc9ad67d9955c8b02435b5cbafc651c34762eb29d2629c356c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}