Pith. sign in

REVIEW 5 major objections 5 minor 79 references

Few-shot Implicit Function Generation via Equivariance

T0 review · 5 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Generating diverse INR weights from a few examples works by exploiting weight-permutation symmetry, the paper argues.

desk verdict A genuinely new few-shot INR weight-generation setting with a plausible equivariance-based pipeline, but the central augmentation mechanism is underspecified and the empirical claims need error bars. read the letter →

arxiv 2501.01601 v1 pith:7TDET7K4 submitted 2025-01-03 cs.CV cs.AI

Suizhi Huang , Xingyi Yang , Hongtao Lu , Xinchao Wang This is my paper · ORCID
classification cs.CVcs.AI
keywords implicitneuralrepresentationfew-shotgenerationweight-spaceequivarianceequivariantencodercontrastivelearningdiffusion3DshapeINRweight
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces Few-shot Implicit Function Generation: given one to ten trained INR checkpoints of a new object class, produce many new checkpoints that are diverse in weight space yet render valid, category-consistent signals. It argues this is possible by exploiting the equivariance group of weight permutations, which relate functionally identical networks. The proposed framework, EquiGen, learns a latent space where equivalent weights cluster, then uses an equivariance-conditioned diffusion model plus controlled latent perturbations to sample new weights. The payoff is that generative modeling of weights no longer needs massive INR datasets, and can transfer knowledge from seen to unseen categories.

What carries the argument

The load-bearing object is the equivariant latent space learned by an equivariant encoder that respects weight-space permutation symmetries. The encoder is pre-trained with a SimCLR-style contrastive loss on positive pairs produced by a smooth augmentation step, which finds a permutation matrix $P^*$ that minimizes total variation over each network subgraph (solved as Shortest Hamiltonian Path problems with 2.5-opt local search), then applies INR-based augmentations such as rotation, translation, scaling, color jittering, and bias perturbation. Generation is carried by a diffusion transformer that predicts denoised weights directly and is conditioned on equivariant features via cross-attention, with an explicit equivariance regularization term $\mathcal{L}_{eq}$; diversity comes from adding bounded Gaussian noise $\gamma\epsilon$ to the guiding features.

What would settle it

Render the original weight and its smooth-augmented version on a dense grid of inputs and measure the maximum or mean pointwise deviation of the output signal; if the deviation is large for typical SIREN or ReLU checkpoints, the positive pairs in the contrastive loss are not functionally equivalent and the learned equivariant subspace would not group functions by their behavior.

Watch

Extended reading notes

Core claim

EquiGen's central claim is that projecting network weights into an equivariant latent space reduces the data burden of weight generation: within that space, a few reference checkpoints suffice to generate diverse samples that stay inside the equivariance group of the target function. The paper implements this with three coupled stages: a contrastively trained equivariant encoder whose positive pairs come from smooth weight augmentations, a diffusion denoiser conditioned on equivariant features and regularized by an equivariance loss that keeps generated weights close in latent feature space, and a bounded Gaussian subspace disturbance that trades diversity against fidelity. On MNIST, CIFAR-10, and ShapeNet INR benchmarks in a 10-shot setting, the paper reports that EquiGen outperforms existing few-shot generation and weight-diffusion baselines on both quality (FID, MMD) and diversity (LPIPS, COV) metrics.

Load-bearing premise

The method assumes that the total-variation-minimizing permutation found by 2.5-opt search is an exact or near-exact symmetry of the rendered function, so that smooth-augmented weights genuinely belong to the same equivariance group.

Editorial extensions

If this is right

  • If EquiGen's claim holds, weight-space generation no longer requires large INR corpora; a handful of checkpoints from a new class is enough to synthesize checkpoints that render valid instances of that class.
  • The equivariance-guided diffusion with the equivariance loss should let a single pre-trained generator adapt to an unseen category with only a few fine-tuning iterations, extending cross-class transfer to weight space.
  • The controlled subspace disturbance gives an explicit knob for trading diversity against fidelity: larger $\gamma$ raises COV and LPIPS but also raises MMD and FID, so a user can set the knob to the desired operating point.
  • Because the equivariant encoder clusters weights by function rather than by element-wise similarity, the framework should be less prone to mode collapse than unconditional diffusion or label-conditioned generation, as the ablation study indicates.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural extension the paper leaves implicit is to validate the smooth augmentation by measuring functional distance (not just visual similarity) between a weight and its augmented counterpart; if the permutation is not an exact symmetry for SIREN's sinusoidal activations, the contrastive positives could be tightened by filtering pairs whose rendered outputs differ beyond a threshold.
  • The equivariant subspace idea transfers to other permutation-symmetric weight spaces beyond INRs, including standard MLPs and transformers, so a testable extension is to apply EquiGen to classifier or language-model checkpoints where the 'function' is the model's input-output behavior.
  • One could also use the equivariant encoder as a functional metric: distances in the learned latent space may serve as a cheaper proxy for functional equivalence than rendering, which would make the framework useful for weight-space editing and model merging.
  • Because the paper reports results only for 10-shot and a few categories, the strongest version of the claim would be tested by scaling to more categories and smaller shot counts (1-, 2-, 5-shot) and checking whether the diversity-quality trade-off with $\gamma$ persists.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 5 minor

Summary. EquiGen proposes a three-stage framework for few-shot generation of implicit neural representation (INR) weights: (1) an equivariant encoder trained with contrastive learning on smooth weight-space augmentations, (2) a diffusion model conditioned on equivariant features with an additional equivariance loss, and (3) controlled perturbations of the equivariant subspace to increase diversity. The authors introduce the Few-shot Implicit Function Generation problem and report experiments on MNIST, CIFAR-10, and ShapeNet INR datasets, claiming consistent improvements in FID, LPIPS, MMD, COV, and 1-NNA over several baselines.

Significance. The core idea of exploiting weight-space permutation equivariance to reduce sample complexity is well-motivated and timely, and the paper is one of the first to address few-shot INR weight generation. If the reported gains are robust, the framework could be useful for weight-space data augmentation, hypernetwork training, and downstream generation tasks. The paper's strengths include a clear problem formulation, an explicit attempt to use symmetry principles throughout the pipeline, and evaluation on multiple datasets. However, the current evidence is incomplete: results are reported without uncertainty, the functional-consistency claim is not directly measured, and key implementation details are deferred to an absent appendix.

major comments (5)
  1. [Sec. 4.2 (Smooth Augmentation), Eq. (4), Eq. (6)] The paper asserts that the total-variation-minimizing permutation P* found by 2.5-opt local search 'preserv[es] functional equivariance' when applied to all weight matrices within each network subdivision, but it never specifies the transformation rule for biases or the relation between permutations of adjacent layers. For a standard MLP with pointwise activations (ReLU or SIREN's sine), the exact functional symmetry is W_l -> P_l W_l P_{l-1}^T and b_l -> P_l b_l with P_0 = P_L = I. If biases are left unchanged or if the same P is applied unilaterally to every matrix, the transformed network is not the same function. Because the contrastive positive pairs in Eq. (4) and the equivariance loss in Eq. (6) both rely on the augmented weights being functionally equivalent, an incorrect permutation rule would train the encoder to map functionally different weights into the same latent region, invalidating the conditioning signal for the diffusion model. The text must specify the full transformation and provide a proof or an experiment verifying functional equivalence after augmentation.
  2. [Sec. 3.1, Sec. 4.2, Sec. 5.1 (repeated appendix references)] The manuscript repeatedly defers essential technical content to an Appendix: the mathematical formalization of the problem, the detailed architecture of the equivariant encoder, the specific INR-based augmentations, and the implementation configurations. In the version under review, no appendix is provided. In particular, the details needed to resolve the smooth-augmentation ambiguity (how P* acts on biases and adjacent layers) are absent. This prevents reproduction and verification of the central mechanism. The paper cannot be accepted in this form; the appendix must be included or the method must be self-contained.
  3. [Sec. 5.2, Tables 1–4] All quantitative results are single point estimates without error bars, confidence intervals, or significance tests. The claim of 'consistent superior performance' across datasets is therefore not statistically supported. Given the few-shot setting (e.g., 10 support samples), run-to-run variance could be substantial. The authors should report means and standard deviations over multiple random seeds and, where possible, perform significance tests or at least show the variance is small relative to the reported gaps.
  4. [Sec. 5.1 (Metrics) and Sec. 1 (claims)] The central claim is that EquiGen generates 'diverse yet functionally consistent INR weights,' but the evaluation metrics (FID, LPIPS, MMD, COV, 1-NNA) are distributional image/shape metrics and do not directly measure functional consistency of the generated weights. A generated set could score well on these metrics while many generated INRs fail to represent the target class or preserve the rendered function. The paper should include a direct functional test: for example, render each generated INR and compute reconstruction error against the source examples, or evaluate classification accuracy of rendered images, or measure the latent distance between generated and source functions using an independent functional-equivalence oracle.
  5. [Sec. 5.1 (Few-shot setting) and Tables 1–2] The problem definition allows support set sizes k from 1 to 10, but the main results are reported only for 10-shot generation. No results are shown for k = 1, 2, 5, etc. This leaves the 'few-shot' claim unsubstantiated for smaller k, which is precisely the regime motivating the paper. The authors should provide a plot or table of performance versus k for at least one dataset.
minor comments (5)
  1. [Abstract] The typesetting has 'F ew-shot' at the start of the abstract; this should be 'Few-shot'.
  2. [Sec. 1] The word 'emperically' is a typo and should be 'empirically'.
  3. [Table 2] The baselines 'HyperDiffsion' and 'Hiperdiffusion' are misspelled; they should be 'HyperDiffusion'.
  4. [Fig. 2] The flowchart is dense and the text labels are difficult to read; consider enlarging and annotating the three stages more clearly.
  5. [Sec. 3.2] In the equivariance definition, the group representations ρ1 and ρ2 are not defined; please define them in the text or refer explicitly to the relevant source.

Circularity Check

1 steps flagged · score 3.0 of 10

Mild partial circularity in the equivariance regularizer: Eq. (6) uses the same encoder as both conditioning source and loss judge, so the 'equivariance' enforced is self-consistency in E_phi's latent space; external rendering metrics keep the central claim largely independent.

  1. self definitional [Sec. 4.3, Equivariance Guided Diffusion, Eq. (6)]
    "we also designed a specific loss to regulate the approximation of the equivariant features of the generated weights and the original smoothed weights: Leq( ¯w, ˜w) = 1/N sum_i ||Eϕ( ¯wi) − Eϕ( ˜wi)||^2_2. (6)"

    In Eq. (5), the denoising network is conditioned on the same encoder: ˜wi = Gθ( ¯wT, Eϕ( ¯wi)). Eq. (6) then penalizes the distance between Eϕ of the generated weight and Eϕ of the conditioning input. The 'equivariance' in this loss is therefore defined as agreement in the latent space of Eϕ, the very representation the model was trained to produce; any generator that returns weights mapping back to the conditioning code would satisfy it, regardless of whether the rendered function is actually permutation-equivalent. The paper uses this loss to claim the generated weights 'retain both distributional properties and equivariance,' but the equivariance term is an autoencoding consistency condition rather than an external functional-equivalence check.

full rationale

The few-shot formulation and the equivariant-group argument in Sec. 3.2 are mathematically standard: the group action in Eq. (1) is defined independently of the encoder, and the generation objective is not derived from the encoder. The smooth augmentation claim in Sec. 4.2 is a correctness risk rather than a circularity: applying a TV-minimizing permutation P* to 'all weight matrices within each network subdivision' is not by itself the function-preserving transform unless biases and adjacent-layer inverse permutations are specified, and the paper does not prove this. Reference [70] is authored by current paper authors and is used for the SHPP decomposition in smooth augmentation, but the cited 'orthogonal independence of permutations' is a parameter-free mathematical fact, not the target result, so it does not become load-bearing circularity under the stated rules. The one genuinely self-referential element is Eq. (6), where the same encoder provides the conditioning features and defines the equivariance loss, making the equivariance claim partially self-defined. Because the main empirical comparisons use rendered FID, LPIPS, MMD, COV, and 1-NNA, the central claim retains substantial independent content; the equivariance-consistency loop is a supporting regularizer rather than the entire derivation.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claim rests on standard permutation equivariance, on an unverified smooth-augmentation symmetry, and on the transferability of a source-pretrained encoder to unseen categories. There are also hand-set hyperparameters (lambda, gamma, feature dimension) that affect the results. No new physical or conceptual entities are introduced.

free parameters (4)
  • equivariance loss weight lambda = 0.1
    Set by default in Eq. (7); controls the balance between reconstruction and equivariant feature matching. No sensitivity analysis or tuning protocol is reported.
  • subspace disturbance intensity gamma = 0.3
    Controls the magnitude of noise added to equivariant features during generation. Fig. 8 sweeps this value, but the default choice is hand-set and no validation criterion is given.
  • equivariant feature dimension = 128
    Output dimension of the equivariant encoder; chosen without justification or ablation.
  • diffusion timesteps = 1000
    Standard diffusion setting with a squared cosine beta schedule; a conventional choice rather than a fitted quantity.
assumptions (4)
  • standard math Weight permutation equivariance for MLPs with pointwise activations: P sigma(x) = sigma(P x), and paired permutations across layers preserve network function (Eq. 1, Sec. 3.2).
    Standard result for pointwise activations, but in this paper it must hold for SIREN and ReLU architectures with biases and positional encoding; biases and adjacent layers must be transformed consistently.
  • ad hoc to paper The total-variation-minimizing permutation P* found by 2.5-opt local search yields a valid function-preserving smooth augmentation.
    Stated in Sec. 4.2 without a proof or empirical check. This is load-bearing because the contrastive encoder and the downstream equivariant features are trained on these smoothed weights.
  • domain assumption An equivariant encoder pretrained on source categories transfers to unseen target categories.
    Few-shot adaptation in Sec. 4.4 relies on equivariant features from unseen classes being meaningful even though the encoder was trained on source classes. The t-SNE analysis in Fig. 7 does not demonstrate target-category transfer.
  • domain assumption A target category weight distribution can be approximated by conditioning the diffusion model on k encodings plus bounded Gaussian disturbance.
    This is the core few-shot mechanism. The paper provides no sample-complexity or theoretical justification, only empirical evidence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Few-shot Implicit Function Generation via Equivariance." pith.science (2026). https://pith.science/paper/7TDET7K4

@misc{pith2026250101601,
  author       = {Pith},
  title        = {Pith review of: Few-shot Implicit Function Generation via Equivariance},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7TDET7K4}},
  note         = {Machine review of arXiv:2501.01601}
}
read the original abstract

Implicit Neural Representations (INRs) have emerged as a powerful framework for representing continuous signals. However, generating diverse INR weights remains challenging due to limited training data. We introduce Few-shot Implicit Function Generation, a new problem setup that aims to generate diverse yet functionally consistent INR weights from only a few examples. This is challenging because even for the same signal, the optimal INRs can vary significantly depending on their initializations. To tackle this, we propose EquiGen, a framework that can generate new INRs from limited data. The core idea is that functionally similar networks can be transformed into one another through weight permutations, forming an equivariance group. By projecting these weights into an equivariant latent space, we enable diverse generation within these groups, even with few examples. EquiGen implements this through an equivariant encoder trained via contrastive learning and smooth augmentation, an equivariance-guided diffusion process, and controlled perturbations in the equivariant subspace. Experiments on 2D image and 3D shape INR datasets demonstrate that our approach effectively generates diverse INR weights while preserving their functional properties in few-shot scenarios.

Figures

Figures reproduced from arXiv: 2501.01601 by the authors.

Figure 1
Figure 1. Illustration of the Few-shot Implicit Function Genera [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Overview of our EQUIGEN framework. The method consists of three stages: (1) Equivariant Encoder Pre-training through contrastive learning with smooth and INR-based augmentations, (2) Distribution Modeling via a diffusion process conditioned on learned equivariant features, and (3) Few-shot Adaptation using equivariant subspace disturbance for diverse weight generation. Our framework leverages the inherent equivarian… view at source ↗
Figure 3
Figure 3. Equivariant architecture Eϕ aims to map weights from the same equivariance group to similar representations, creating a structured latent space that captures the inherent symmetries of neural networks. By leveraging this equivariant subspace, we can implement a controlled disturbance strategy that sample diverse equivariant features while maintaining class consistency. smooth weight space augmentation while preservi… view at source ↗
Figures from the paper (4 more)
Figure 5
Figure 5. Figure 5: Visualizations of generated ShapeNet-INRs from the [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Visualizations of generated ShapeNet-INRs: few-shot [PITH_FULL_IMAGE:figures/full_fig_p007_6.png]
Figure 7
Figure 7. Figure 7: 2D t-SNE visualization of equivariant subspace. Smooth [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: The evaluation on ShapeNet-INRs chair and car cat [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

79 extracted references · 65 canonical work pages

  1. [1]

    Data augmentation generative adversarial net- works

    A Antoniou. Data augmentation generative adversarial net- works. arXiv preprint arXiv:1711.04340, 2017. 7

    arXiv 2017

  2. [2]

    Nern: Learning neural representations for neural networks

    Maor Ashkenazi, Zohar Rimon, Ron Vainshtein, Shir Levi, Elad Richardson, Pinchas Mintz, and Eran Treister. Nern: Learning neural representations for neural networks. In ICLR, 2023. 2

    work page 2023

  3. [3]

    Mip-nerf: A multiscale representation for anti-aliasing neu- ral radiance fields

    Jonathan T Barron, Ben Mildenhall, Matthew Tancik, Peter Hedman, Ricardo Martin-Brualla, and Pratul P Srinivasan. Mip-nerf: A multiscale representation for anti-aliasing neu- ral radiance fields. In CVPR, pages 5855–5864, 2021. 1

    work page 2021

  4. [4]

    Dynamic programming

    Richard Bellman. Dynamic programming. Science, 153 (3731):34–37, 1966. 1

    work page 1966

  5. [5]

    Deep local shapes: Learning local sdf priors for detailed 3d reconstruction

    Rohan Chabra, Jan E Lenssen, Eddy Ilg, Tanner Schmidt, Julian Straub, Steven Lovegrove, and Richard Newcombe. Deep local shapes: Learning local sdf priors for detailed 3d reconstruction. In ECCV, pages 608–625. Springer, 2020. 2

    work page 2020

  6. [6]

    Shapenet: An information-rich 3d model repository

    Angel X Chang, Thomas Funkhouser, Leonidas Guibas, Pat Hanrahan, Qixing Huang, Zimo Li, Silvio Savarese, Manolis Savva, Shuran Song, Hao Su, et al. Shapenet: An information-rich 3d model repository. arXiv preprint arXiv:1512.03012, 2015. 6

    arXiv 2015

  7. [7]

    A simple framework for contrastive learn- ing of visual representations

    Ting Chen, Simon Kornblith, Mohammad Norouzi, and Ge- offrey Hinton. A simple framework for contrastive learn- ing of visual representations. In ICML, pages 1597–1607. PMLR, 2020. 5

    work page 2020

  8. [8]

    Learning con- tinuous image representation with local implicit image func- tion

    Yinbo Chen, Sifei Liu, and Xiaolong Wang. Learning con- tinuous image representation with local implicit image func- tion. In CVPR, pages 8628–8638, 2021. 1, 2

    work page 2021

Show all 79 references
  1. [9]

    Learning implicit fields for generative shape modeling

    Zhiqin Chen and Hao Zhang. Learning implicit fields for generative shape modeling. In CVPR, pages 5939–5948,

  2. [10]

    Neurbf: A neural fields rep- resentation with adaptive radial basis functions

    Zhang Chen, Zhong Li, Liangchen Song, Lele Chen, Jingyi Yu, Junsong Yuan, and Yi Xu. Neurbf: A neural fields rep- resentation with adaptive radial basis functions. In CVPR, pages 4182–4194, 2023. 2

    2023

  3. [11]

    Figr: Few-shot image generation with reptile

    Louis Clou ˆatre and Marc Demers. Figr: Few-shot image generation with reptile. arXiv preprint arXiv:1901.02199 ,

    1901 arXiv

  4. [12]

    Spherical cnns

    Taco S Cohen, Mario Geiger, Jonas K ¨ohler, and Max Welling. Spherical cnns. In ICLR, 2018. 2, 3

    2018

  5. [13]

    Deep learning on implicit neural representations of shapes

    Luca De Luigi, Adriano Cardace, Riccardo Spezialetti, Pier- luigi Zama Ramirez, Samuele Salti, and Luigi di Stefano. Deep learning on implicit neural representations of shapes. In ICLR, 2023. 1, 2, 3, 6, 7

    2023

  6. [14]

    Wedit- gan: Few-shot image generation via latent space relocation

    Yuxuan Duan, Li Niu, Yan Hong, and Liqing Zhang. Wedit- gan: Few-shot image generation via latent space relocation. In AAAI, pages 1653–1661, 2024. 6

    2024

  7. [15]

    From data to functa: Your data point is a function and you can treat it like one

    Emilien Dupont, Hyunjik Kim, SM Ali Eslami, Danilo Jimenez Rezende, and Dan Rosenbaum. From data to functa: Your data point is a function and you can treat it like one. In ICML, pages 5694–5725. PMLR, 2022. 1, 6

    2022

  8. [16]

    Hyperdiffusion: Generating implicit neural fields with weight-space diffusion

    Ziya Erkoc ¸, Fangchang Ma, Qi Shan, Matthias Nießner, and Angela Dai. Hyperdiffusion: Generating implicit neural fields with weight-space diffusion. In CVPR, pages 14300– 14310, 2023. 2, 3, 5, 6, 7

    2023

  9. [17]

    Learning so (3) equivariant repre- sentations with spherical cnns

    Carlos Esteves, Christine Allen-Blanchette, Ameesh Maka- dia, and Kostas Daniilidis. Learning so (3) equivariant repre- sentations with spherical cnns. InECCV, pages 52–68, 2018. 3

    2018

  10. [18]

    Depgraph: Towards any structural pruning

    Gongfan Fang, Xinyin Ma, Mingli Song, Michael Bi Mi, and Xinchao Wang. Depgraph: Towards any structural pruning. In CVPR, pages 16091–16101, 2023. 4

    2023

  11. [19]

    Model- agnostic meta-learning for fast adaptation of deep networks

    Chelsea Finn, Pieter Abbeel, and Sergey Levine. Model- agnostic meta-learning for fast adaptation of deep networks. In ICML, pages 1126–1135. PMLR, 2017. 3

    2017

  12. [20]

    Learning shape templates with structured implicit functions

    Kyle Genova, Forrester Cole, Daniel Vlasic, Aaron Sarna, William T Freeman, and Thomas Funkhouser. Learning shape templates with structured implicit functions. InCVPR, pages 7154–7164, 2019. 2

    2019

  13. [21]

    Hypernetworks

    David Ha, Andrew Dai, and Quoc V Le. Hypernetworks. arXiv preprint arXiv:1609.09106, 2016. 3

    2016 arXiv

  14. [22]

    Deep models of interactions across sets

    Jason Hartford, Devon Graham, Kevin Leyton-Brown, and Siamak Ravanbakhsh. Deep models of interactions across sets. In ICLR, pages 1909–1918. PMLR, 2018. 2, 4

    1909

  15. [23]

    Computers and intractability: a guide to the theory of np-completeness (michael r

    Juris Hartmanis. Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson). Siam Review, 24(1):90, 1982. 4

    1982

  16. [24]

    Learning useful representations of recurrent neural network weight matrices

    Vincent Herrmann, Francesco Faccio, and J ¨urgen Schmid- huber. Learning useful representations of recurrent neural network weight matrices. In ICML, 2024. 1

    2024

  17. [25]

    Gans trained by a two time-scale update rule converge to a local nash equilib- rium

    Martin Heusel, Hubert Ramsauer, Thomas Unterthiner, Bernhard Nessler, and Sepp Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilib- rium. In NeurIPS, 2017. 6

    2017

  18. [26]

    Anomalyd- iffusion: Few-shot anomaly image generation with diffusion model

    Teng Hu, Jiangning Zhang, Ran Yi, Yuzhen Du, Xu Chen, Liang Liu, Yabiao Wang, and Chengjie Wang. Anomalyd- iffusion: Few-shot anomaly image generation with diffusion model. In AAAI, pages 8526–8534, 2024. 2

    2024

  19. [27]

    Highly accurate protein structure prediction with alphafold

    John Jumper, Richard Evans, Alexander Pritzel, Tim Green, Michael Figurnov, Olaf Ronneberger, Kathryn Tunyasu- vunakool, Russ Bates, Augustin ˇZ´ıdek, Anna Potapenko, Alex Bridgland, Clemens Meyer, Simon Kohl, Andrew Bal- lard, Andrew Cowie, Bernardino Romera-Paredes, Stanisla...

    2021

  20. [28]

    Parameter prediction for unseen deep architectures

    Boris Knyazev, Michal Drozdzal, Graham W Taylor, and Adriana Romero Soriano. Parameter prediction for unseen deep architectures. In NeurIPS, pages 29433–29448, 2021. 1

    2021

  21. [29]

    On the generalization of equivariance and convolution in neural networks to the ac- tion of compact groups

    Risi Kondor and Shubhendu Trivedi. On the generalization of equivariance and convolution in neural networks to the ac- tion of compact groups. In ICML, pages 2747–2755. PMLR,

  22. [30]

    Learning multiple layers of features from tiny images

    Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009. 6

    2009

  23. [31]

    Gradient-based learning applied to document recog- nition

    Yann LeCun, L ´eon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recog- nition. Proceedings of the IEEE , 86(11):2278–2324, 1998. 6

    1998

  24. [32]

    Dynibar: Neural dynamic image-based rendering

    Zhengqi Li, Qianqian Wang, Forrester Cole, Richard Tucker, and Noah Snavely. Dynibar: Neural dynamic image-based rendering. In CVPR, pages 4273–4284, 2023. 2 9

    2023

  25. [33]

    Dawson: A domain adaptive few shot generation framework

    Weixin Liang, Zixuan Liu, and Can Liu. Dawson: A domain adaptive few shot generation framework. arXiv preprint arXiv:2001.00576, 2020. 7

    2001 arXiv

  26. [34]

    Dist: Rendering deep implicit signed distance function with differentiable sphere tracing

    Shaohui Liu, Yinda Zhang, Songyou Peng, Boxin Shi, Marc Pollefeys, and Zhaopeng Cui. Dist: Rendering deep implicit signed distance function with differentiable sphere tracing. In CVPR, pages 2019–2028, 2020. 2

    2019

  27. [35]

    Marching cubes: A high resolution 3d surface construction algorithm

    William E Lorensen and Harvey E Cline. Marching cubes: A high resolution 3d surface construction algorithm. InSem- inal graphics: pioneering efforts that shaped the field, pages 347–353. 1998. 6

    1998

  28. [36]

    Diffusion probabilistic models for 3d point cloud generation

    Shitong Luo and Wei Hu. Diffusion probabilistic models for 3d point cloud generation. In CVPR, pages 2837–2845,

  29. [37]

    Deformable neural radiance fields using rgb and event cameras

    Qi Ma, Danda Pani Paudel, Ajad Chhatkuli, and Luc Van Gool. Deformable neural radiance fields using rgb and event cameras. In CVPR, pages 3590–3600, 2023. 2

    2023

  30. [38]

    Continuous pose for monocular cameras in neural implicit representation

    Qi Ma, Danda Pani Paudel, Ajad Chhatkuli, and Luc Van Gool. Continuous pose for monocular cameras in neural implicit representation. In CVPR, pages 5291–5301, 2024. 2

    2024

  31. [39]

    Implicit-zoo: A large-scale dataset of neural im- plicit functions for 2d images and 3d scenes

    Qi Ma, Danda Pani Paudel, Ender Konukoglu, and Luc Van Gool. Implicit-zoo: A large-scale dataset of neural im- plicit functions for 2d images and 3d scenes. arXiv preprint arXiv:2406.17438, 2024. 1, 6

    2024

  32. [40]

    Invariant and equivariant graph networks

    Haggai Maron, Heli Ben-Hamu, Nadav Shamir, and Yaron Lipman. Invariant and equivariant graph networks. In ICLR,

  33. [41]

    Single-subject multi-contrast mri super-resolution via implicit neural representations

    Julian McGinnis, Suprosanna Shit, Hongwei Bran Li, Vasi- liki Sideri-Lampretsa, Robert Graf, Maik Dannecker, Ji- azhen Pan, Nil Stolt-Ans ´o, Mark M ¨uhlau, Jan S Kirschke, et al. Single-subject multi-contrast mri super-resolution via implicit neural representations. In MICCAI...

    2023

  34. [42]

    Occupancy networks: Learning 3d reconstruction in function space

    Lars Mescheder, Michael Oechsle, Michael Niemeyer, Se- bastian Nowozin, and Andreas Geiger. Occupancy networks: Learning 3d reconstruction in function space. In CVPR, pages 4460–4470, 2019. 2

    2019

  35. [43]

    Nerf: Representing scenes as neural radiance fields for view syn- thesis

    Ben Mildenhall, Pratul P Srinivasan, Matthew Tancik, Jonathan T Barron, Ravi Ramamoorthi, and Ren Ng. Nerf: Representing scenes as neural radiance fields for view syn- thesis. Communications of the ACM , 65(1):99–106, 2021. 1

    2021

  36. [44]

    Instant neural graphics primitives with a mul- tiresolution hash encoding

    Thomas M ¨uller, Alex Evans, Christoph Schied, and Alexan- der Keller. Instant neural graphics primitives with a mul- tiresolution hash encoding. ACM transactions on graphics (TOG), 41(4):1–15, 2022. 2

    2022

  37. [45]

    Equivariant architectures for learning in deep weight spaces

    Aviv Navon, Aviv Shamsian, Idan Achituve, Ethan Fetaya, Gal Chechik, and Haggai Maron. Equivariant architectures for learning in deep weight spaces. In ICML, pages 25790– 25816. PMLR, 2023. 1, 2, 4, 6

    2023

  38. [46]

    Improved denoising diffusion probabilistic models

    Alexander Quinn Nichol and Prafulla Dhariwal. Improved denoising diffusion probabilistic models. In ICLR, pages 8162–8171. PMLR, 2021. 6

    2021

  39. [47]

    Image generation from small datasets via batch statistics adaptation

    Atsuhiro Noguchi and Tatsuya Harada. Image generation from small datasets via batch statistics adaptation. In CVPR, pages 2750–2758, 2019. 6

    2019

  40. [48]

    Deepsdf: Learning con- tinuous signed distance functions for shape representation

    Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Lovegrove. Deepsdf: Learning con- tinuous signed distance functions for shape representation. In CVPR, pages 165–174, 2019. 1, 2

    2019

  41. [49]

    Learning to learn with genera- tive models of neural network checkpoints

    William Peebles, Ilija Radosavovic, Tim Brooks, Alexei Efros, and Jitendra Malik. Learning to learn with genera- tive models of neural network checkpoints. arXiv preprint arXiv:2209.12892, 2022. 1, 2, 3, 5

    2022 arXiv

  42. [50]

    Learn- ing transferable visual models from natural language super- vision

    Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al. Learn- ing transferable visual models from natural language super- vision. In ICML, pages 8748–8763. PMLR, 2021. 1

    2021

  43. [51]

    On the spectral bias of neural networks

    Nasim Rahaman, Aristide Baratin, Devansh Arpit, Felix Draxler, Min Lin, Fred Hamprecht, Yoshua Bengio, and Aaron Courville. On the spectral bias of neural networks. In ICML, pages 5301–5310. PMLR, 2019. 2, 4

    2019

  44. [52]

    Beyond periodicity: Towards a unifying framework for activations in coordinate- mlps

    Sameera Ramasinghe and Simon Lucey. Beyond periodicity: Towards a unifying framework for activations in coordinate- mlps. In ECCV, pages 142–158. Springer, 2022. 1

    2022

  45. [53]

    Equivariance through parameter-sharing

    Siamak Ravanbakhsh, Jeff Schneider, and Barnabas Poczos. Equivariance through parameter-sharing. In ICML, pages 2892–2901. PMLR, 2017. 3

    2017

  46. [54]

    High-resolution image syn- thesis with latent diffusion models

    Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Bj¨orn Ommer. High-resolution image syn- thesis with latent diffusion models. In CVPR, pages 10684– 10695, 2022. 5, 6

    2022

  47. [55]

    Nonlinear total variation based noise removal algorithms

    Leonid I Rudin, Stanley Osher, and Emad Fatemi. Nonlinear total variation based noise removal algorithms. Physica D: nonlinear phenomena, 60(1-4):259–268, 1992. 4

    1992

  48. [56]

    Wire: Wavelet implicit neural representations

    Vishwanath Saragadam, Daniel LeJeune, Jasper Tan, Guha Balakrishnan, Ashok Veeraraghavan, and Richard G Bara- niuk. Wire: Wavelet implicit neural representations. In CVPR, pages 18507–18516, 2023. 2

    2023

  49. [57]

    Hyper-representations as genera- tive models: Sampling unseen neural network weights

    Konstantin Sch ¨urholt, Boris Knyazev, Xavier Gir ´o-i Ni- eto, and Damian Borth. Hyper-representations as genera- tive models: Sampling unseen neural network weights. In NeurIPS, pages 27906–27920, 2022. 2, 3, 6

    2022

  50. [58]

    Meshgpt: Generating triangle meshes with decoder-only transformers

    Yawar Siddiqui, Antonio Alliegro, Alexey Artemov, Tatiana Tommasi, Daniele Sirigatti, Vladislav Rosov, Angela Dai, and Matthias Nießner. Meshgpt: Generating triangle meshes with decoder-only transformers. In CVPR, pages 19615– 19625, 2024. 6

    2024

  51. [59]

    Implicit neural representa- tions with periodic activation functions

    Vincent Sitzmann, Julien Martel, Alexander Bergman, David Lindell, and Gordon Wetzstein. Implicit neural representa- tions with periodic activation functions. In NeurIPS, pages 7462–7473, 2020. 1, 2, 6

    2020

  52. [60]

    Denois- ing diffusion implicit models

    Jiaming Song, Chenlin Meng, and Stefano Ermon. Denois- ing diffusion implicit models. In ICLR, 2021. 6

    2021

  53. [61]

    On the neighborhood structure of the traveling salesman problem generated by lo- cal search moves

    G ¨unther Stattenberger, Markus Dankesreiter, Florian Baum- gartner, and Johannes J Schneider. On the neighborhood structure of the traveling salesman problem generated by lo- cal search moves. Journal of Statistical Physics , 129:623– 648, 2007. 4

    2007

  54. [62]

    10 Llama: Open and efficient foundation language models

    Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timoth´ee Lacroix, Baptiste Rozi`ere, Naman Goyal, Eric Hambro, Faisal Azhar, et al. 10 Llama: Open and efficient foundation language models. arXiv preprint arXiv:2302.13971, 2023. 1

    2023 arXiv

  55. [63]

    Lion: Latent point dif- fusion models for 3d shape generation

    Arash Vahdat, Francis Williams, Zan Gojcic, Or Litany, Sanja Fidler, Karsten Kreis, et al. Lion: Latent point dif- fusion models for 3d shape generation. In NeurIPS, pages 10021–10039, 2022. 6

    2022

  56. [64]

    Neural network diffu- sion

    Kai Wang, Zhaopan Xu, Yukun Zhou, Zelin Zang, Trevor Darrell, Zhuang Liu, and Yang You. Neural network diffu- sion. arXiv preprint arXiv:2402.13144, 2024. 2, 3, 6

    2024 arXiv

  57. [65]

    Representation theory and invariant neural networks

    Jeffrey Wood and John Shawe-Taylor. Representation theory and invariant neural networks. Discrete applied mathemat- ics, 69(1-2):33–60, 1996. 3

    1996

  58. [66]

    Few shot generative model adaption via relaxed spatial structural alignment

    Jiayu Xiao, Liang Li, Chaofei Wang, Zheng-Jun Zha, and Qingming Huang. Few shot generative model adaption via relaxed spatial structural alignment. In CVPR, pages 11204– 11213, 2022. 2

    2022

  59. [67]

    Neural fields in visual computing and beyond

    Yiheng Xie, Towaki Takikawa, Shunsuke Saito, Or Litany, Shiqin Yan, Numair Khan, Federico Tombari, James Tomp- kin, Vincent Sitzmann, and Srinath Sridhar. Neural fields in visual computing and beyond. InComputer Graphics Forum, pages 641–676. Wiley Online Library, 2022. 2

    2022

  60. [68]

    Signal processing for implicit neural rep- resentations

    Dejia Xu, Peihao Wang, Yifan Jiang, Zhiwen Fan, and Zhangyang Wang. Signal processing for implicit neural rep- resentations. In NeurIPS, pages 13404–13418, 2022. 1

    2022

  61. [69]

    Nesvor: implicit neural representation for slice-to- volume reconstruction in mri

    Junshen Xu, Daniel Moyer, Borjan Gagoski, Juan Eugenio Iglesias, P Ellen Grant, Polina Golland, and Elfar Adal- steinsson. Nesvor: implicit neural representation for slice-to- volume reconstruction in mri. IEEE TMI, 42(6):1707–1719,

  62. [70]

    Neural metamorphosis

    Xingyi Yang and Xinchao Wang. Neural metamorphosis. In ECCV, pages 1–19. Springer, 2025. 1, 3, 4

    2025

  63. [71]

    Generative neural fields by mixtures of neural implicit functions

    Tackgeun You, Mijeong Kim, Jungtaek Kim, and Bohyung Han. Generative neural fields by mixtures of neural implicit functions. In NeurIPS, 2024. 1

    2024

  64. [72]

    Deep sets

    Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barn- abas Poczos, Russ R Salakhutdinov, and Alexander J Smola. Deep sets. In NeurIPS, 2017. 2, 4

    2017

  65. [73]

    The unreasonable effectiveness of deep features as a perceptual metric

    Richard Zhang, Phillip Isola, Alexei A Efros, Eli Shechtman, and Oliver Wang. The unreasonable effectiveness of deep features as a perceptual metric. In CVPR, pages 586–595,

  66. [74]

    Ex- ploring incompatible knowledge transfer in few-shot image generation

    Yunqing Zhao, Chao Du, Milad Abdollahzadeh, Tianyu Pang, Min Lin, Shuicheng Yan, and Ngai-Man Cheung. Ex- ploring incompatible knowledge transfer in few-shot image generation. In CVPR, pages 7380–7391, 2023. 6

    2023

  67. [75]

    Where is my spot? few-shot image generation via latent subspace optimization

    Chenxi Zheng, Bangzhen Liu, Huaidong Zhang, Xuemiao Xu, and Shengfeng He. Where is my spot? few-shot image generation via latent subspace optimization. In CVPR, pages 3272–3281, 2023. 6

    2023

  68. [76]

    Hypertransformer: Model generation for supervised and semi-supervised few-shot learning

    Andrey Zhmoginov, Mark Sandler, and Maksym Vladymy- rov. Hypertransformer: Model generation for supervised and semi-supervised few-shot learning. In ICML, pages 27075– 27098. PMLR, 2022. 1

    2022

  69. [77]

    Permutation equivariant neural functionals

    Allan Zhou, Kaien Yang, Kaylee Burns, Adriano Cardace, Yiding Jiang, Samuel Sokota, J Zico Kolter, and Chelsea Finn. Permutation equivariant neural functionals. In NeurIPS, 2024. 3

    2024

  70. [78]

    Neural functional transformers

    Allan Zhou, Kaien Yang, Yiding Jiang, Kaylee Burns, Win- nie Xu, Samuel Sokota, J Zico Kolter, and Chelsea Finn. Neural functional transformers. In NeurIPS, 2024. 2

    2024

  71. [79]

    3d shape genera- tion and completion through point-voxel diffusion

    Linqi Zhou, Yilun Du, and Jiajun Wu. 3d shape genera- tion and completion through point-voxel diffusion. InCVPR, pages 5826–5835, 2021. 6, 7 11

    2021

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.