Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Mixture of Gaussians + MST lifting (Pointcloud to Hypergraph) #45

Open
wants to merge 8 commits into
base: main
Choose a base branch
from

Conversation

smeznar
Copy link

@smeznar smeznar commented Jul 10, 2024

This approach creates a hypergraph from a point cloud by fitting a mixture of Gaussians to the points in a point cloud and then constructing a minimal spanning tree between the means of the fitted Gaussians. The hypergraph we obtain represents two things; Firstly, it groups points with similar coordinates together. Secondly, it creates discrete dependencies between neighbouring groups of points.

We provide several ways to set the number of components (Gaussians) fitted. By providing the minimal and maximal number of components, our approach selects the number of components with the lowest Akaike information criterion from the range [minimal number of components, maximal number of components]. If only one of these parameters is provided, the number of components is equal to this number. Finally, if no parameter is provided, we select the number of components with the lowest Akaike information criterion from the set $\{2^i, 1\leq i \leq \lfloor log_2(N/2) \rfloor\}$, where $N$ is the number of points in the pointcloud.

For testing purposes, we implemented a pointcloud loader that loads points sampled from a random geometric shape (contained in pytorch geometric data set GeometricShapes) by default.

Lastly, we fixed a bug in the original code (file modules/utils/utils.py, line 236) that returned an error when the user provided a non-square incidence matrix.

Copy link

Check out this pull request on  ReviewNB

See visual diffs & provide feedback on Jupyter Notebooks.


Powered by ReviewNB

@gbg141
Copy link
Member

gbg141 commented Jul 10, 2024

Hello @smeznar! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at guillermo_bernardez@ucsb.edu so I can share access to the voting form. In your email, please include:

Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified.

@gbg141 gbg141 added challenge-icml-2024 award-category-2 Lifting to Combinatorial, Hypergraph or Graph Domain award-category-3 Feature-based Lifting (including those that simultaneously leverage the connectivity) labels Jul 10, 2024
@gbg141 gbg141 added Winner Awarded submission and removed challenge-icml-2024 labels Oct 31, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
award-category-2 Lifting to Combinatorial, Hypergraph or Graph Domain award-category-3 Feature-based Lifting (including those that simultaneously leverage the connectivity) Winner Awarded submission
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants