Search Results for author: David W. Zhang

Found 9 papers, 6 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.

Improved Generalization of Weight Space Networks via Augmentations

no code implementations6 Feb 2024 Aviv Shamsian, Aviv Navon, David W. Zhang, Yan Zhang, Ethan Fetaya, Gal Chechik, Haggai Maron

Learning in deep weight spaces (DWS), where neural networks process the weights of other neural networks, is an emerging research direction, with applications to 2D and 3D neural fields (INRs, NeRFs), as well as making inferences about other types of neural networks.

Contrastive Learning Data Augmentation

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

Robust Scheduling with GFlowNets

2 code implementations17 Jan 2023 David W. Zhang, Corrado Rainone, Markus Peschl, Roberto Bondesan

Finding the best way to schedule operations in a computation graph is a classical NP-hard problem which is central to compiler optimization.

Compiler Optimization Scheduling

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.