GO FUND IT NOW

NSF

III: Small: Theoretical Foundations of Hypergraph Learning: Expressiveness and Sample Complexity

III: Small: Theoretical Foundations of Hypergraph Learning: Expressiveness and Sample Complexity is a funding opportunity from NSF, closing August 31, 2029.

Funder
NSF
Funding
Grant / contract
Deadline
Aug 31, 2029
(1129d left)

Overview

This research project aims to develop machine learning methods in order to better understand complex and multi-way interactions in real-world applications, such as webs of social relationships, gene-disease analysis, and brain functional analysis. The key technique this project will pursue is hypergraph learning,…

III: Small: Theoretical Foundations of Hypergraph Learning: Expressiveness and Sample Complexity | Go Fund It Now