Search Results for author: Gertjan J. Burghouts

Found 8 papers, 7 papers with code

Graph Neural Networks for Learning Equivariant Representations of Neural Networks

1 code implementation18 Mar 2024 Miltiadis Kofinas, Boris Knyazev, Yan Zhang, Yunlu Chen, Gertjan J. Burghouts, Efstratios Gavves, Cees G. M. Snoek, David W. Zhang

Neural networks that process the parameters of other neural networks find applications in domains as diverse as classifying implicit neural representations, generating neural network weights, and predicting generalization errors.

Data Augmentations in Deep Weight Spaces

no code implementations15 Nov 2023 Aviv Shamsian, David W. Zhang, Aviv Navon, Yan Zhang, Miltiadis Kofinas, Idan Achituve, Riccardo Valperga, Gertjan J. Burghouts, Efstratios Gavves, Cees G. M. Snoek, Ethan Fetaya, Gal Chechik, Haggai Maron

Learning in weight spaces, where neural networks process the weights of other deep neural networks, has emerged as a promising research direction with applications in various fields, from analyzing and editing neural fields and implicit neural representations, to network pruning and quantization.

Data Augmentation Network Pruning +1

Self-Guided Diffusion Models

1 code implementation CVPR 2023 Vincent Tao Hu, David W Zhang, Yuki M. Asano, Gertjan J. Burghouts, Cees G. M. Snoek

Diffusion models have demonstrated remarkable progress in image generation quality, especially when guidance is used to control the generative process.

Image Generation

Maximum Class Separation as Inductive Bias in One Matrix

1 code implementation17 Jun 2022 Tejaswi Kasarla, Gertjan J. Burghouts, Max van Spengler, Elise van der Pol, Rita Cucchiara, Pascal Mettes

This paper proposes a simple alternative: encoding maximum separation as an inductive bias in the network by adding one fixed matrix multiplication before computing the softmax activations.

Inductive Bias Long-tail Learning +3

Pruning Edges and Gradients to Learn Hypergraphs from Larger Sets

1 code implementation26 Jun 2021 David W. Zhang, Gertjan J. Burghouts, Cees G. M. Snoek

We address two common scaling problems encountered in set-to-hypergraph tasks that limit the size of the input set: the exponentially growing number of hyperedges and the run-time complexity, both leading to higher memory requirements.

Combinatorial Optimization

Cannot find the paper you are looking for? You can Submit a new open access paper.