Machine Learning on non-Euclidean Domains
We devise methods for learning functions indexed by non-Euclidean domains such as directed graphs, powersets of finite sets, lattices and partially ordered sets. Furthermore, we port deep learning architectures to these index domains. In order to do so, we draw inspiration from our new signal processing frameworks (e.g., for set functions or for lattice data). Our new signal processing frameworks provide the mathematical tools to incorporate the structure of non-Euclidean index domains into machine learning methods. For example, the Fourier basis associated with a non-Euclidean domain naturally defines a feature space embedding suitable for learning linear models, and the associated generalized convolution can be used port convolutional neural networks to the non-Euclidean domain.
References
-
Bastian Seifert, Chris Wendler, Markus Püschel
Learning Fourier-Sparse Functions on DAGs
Workshop on the Elements of Reasoning: Objects, Structure and Causality (ICLR), 2022 -
Jakob Weissteiner, Chris Wendler, Sven Seuken, Ben Lubin, Markus Püschel
Fourier Analysis-based Iterative Combinatorial Auctions
Proc. International Joint Conference on Artificial Intelligence (IJCAI), 2022 -
Chris Wendler, Andisheh Amrollahi, Bastian Seifert, Andreas Krause, Markus Püschel
Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases
Proc. AAAI Conference on Artificial Intelligence (AAAI), 2021 -
Chris Wendler, Dan Alistarh and Markus Püschel
Powerset Convolutional Neural Networks
Proc. Neural Information Processing Systems (NeurIPS), 2019