Papers › A Brief Review of Hypernetworks in Deep Learning

A Brief Review of Hypernetworks in Deep Learning

12 Jun 2023arXiv:2306.06955archive 2025-07-28

Vinod Kumar Chauhan, Jiandong Zhou, Ping Lu, Soheila Molaei, David A. Clifton

Hypernetworks, or hypernets for short, are neural networks that generate weights for another neural network, known as the target network. They have emerged as a powerful deep learning technique that allows for greater flexibility, adaptability, dynamism, faster training, information sharing, and model compression. Hypernets have shown promising results in a variety of deep learning problems, including continual learning, causal inference, transfer learning, weight pruning, uncertainty quantification, zero-shot learning, natural language processing, and reinforcement learning. Despite their success across different problem settings, there is currently no comprehensive review available to inform researchers about the latest developments and to assist in utilizing hypernets. To fill this gap, we review the progress in hypernets. We present an illustrative example of training deep neural networks using hypernets and propose categorizing hypernets based on five design criteria: inputs, outputs, variability of inputs and outputs, and the architecture of hypernets. We also review applications of hypernets across different deep learning problem settings, followed by a discussion of general scenarios where hypernets can be effectively employed. Finally, we discuss the challenges and future directions that remain underexplored in the field of hypernets. We believe that hypernetworks have the potential to revolutionize the field of deep learning. They offer a new way to design and train neural networks, and they have the potential to improve the performance of deep learning models on a variety of tasks. Through this review, we aim to inspire further advancements in deep learning through hypernetworks.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2306.06955")

Code

Syntology Ran 0 of 12 code samples harvested from 1 repository linked to this paper; 12 have no recorded run.

By repository: official repository: 12 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

jmdvinodjmd/HyperITE officialpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 0 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

12unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from jmdvinodjmd/HyperITE. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

MLPFunctional jmdvinodjmd/HyperITE/src/models/hn_utils.py official repository unverified MIT (permissive) · 43fc2f08683fd9a1 · report
calc_layer_param_max jmdvinodjmd/HyperITE/src/models/hypernetworks.py official repository unverified MIT (permissive) · 8dd582f3eaadaa64 · report
calc_metrics jmdvinodjmd/HyperITE/src/utils.py official repository unverified MIT (permissive) · b96b4b3c56d7f938 · report
calc_params jmdvinodjmd/HyperITE/src/models/hypernetworks.py official repository unverified MIT (permissive) · db491fe4e6a79756 · report
create_embeddings jmdvinodjmd/HyperITE/src/models/hypernetworks.py official repository unverified MIT (permissive) · 1a4cab9a648afbdf · report
get_dataset jmdvinodjmd/HyperITE/src/load_model_data.py official repository unverified MIT (permissive) · e1d1253359cda097 · report
get_logger jmdvinodjmd/HyperITE/src/utils.py official repository unverified MIT (permissive) · c8f7fcc00a2439dc · report
get_loss jmdvinodjmd/HyperITE/src/training_loop.py official repository unverified MIT (permissive) · 4f0864055cb19cfa · report
get_meta_model jmdvinodjmd/HyperITE/src/load_model_data.py official repository unverified MIT (permissive) · 2d6adf360f806515 · report
shapeWeights jmdvinodjmd/HyperITE/src/models/hn_utils.py official repository unverified MIT (permissive) · 75fcd30fa3971e9b · report
test jmdvinodjmd/HyperITE/src/training_loop.py official repository unverified MIT (permissive) · f478ca191bec1a45 · report
weighted_mse_loss jmdvinodjmd/HyperITE/src/utils.py official repository unverified MIT (permissive) · 39cfd19e3f57f2b0 · report

Tasks

Causal InferenceContinual LearningDeep LearningModel CompressionTransfer LearningUncertainty QuantificationZero-Shot Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections