Can we reconstruct heterogeneous protein conformations from cryo-EM data while respecting molecular geometry? We present a geometry-aware framework that leverages graph-based representations and exhibits high reconstruction accuracy. arxiv.org/pdf/2602.21915

Can GNNs color graphs? We study GNN-based neural algorithmic reasoning for approximate k-coloring, introducing differentiable objectives and recursive warm starts that allow GNNs to outperform classical methods at scale. Led by Knut Vanderbush. Details here: arxiv.org/pdf/2601.05137

Check out our latest work on Geometric Machine Learning at #NeurIPS this week. We are also recruiting PhD students and postdocs — please reach out if you are interested in joining us. sites.harvard.edu/weber-group/...

Congratulations to #KempnerInstitute community members @msalbergo.bsky.social and @mweber.bsky.social — recipients of @schmidtsciences.bsky.social AI2050 Fellowships! 🎉 Discover their innovative research shaping the future of AI 👉 bit.ly/47Do4R3 #AI

How can we reliably optimize on manifolds learned from data? We present an iso-Riemannian optimization framework that overcomes challenges of classical methods, and allows for interpretable clustering and efficient inverse problem solving, even in high dimensions. Lead:@WillemDiepev1. bit.ly/4hG5Seh

How does neural feature geometry evolve during training? Modeling feature spaces as geometric graphs, we show that nonlinear activations drive transformations resembling Ricci flow, revealing how class structure emerges and suggesting geometry-informed training principles. arxiv.org/abs/2509.22362

Convexity verification is central to optimization in ML and data science. We introduce a framework for testing geodesic convexity in nonlinear programs on geometric domains. Julia implementation available to leverage certificates in applications. Led by Andrew Cheng, Vaibhav Dixit. bit.ly/3HIlkJu

Single-cell data reveals developmental hierarchies, but common embeddings distort them. We present Contrastive Poincaré Maps, a self-supervised hyperbolic encoder that preserves hierarchies, scales efficiently, and uncovers lineage across datasets. Lead: @nithyabhasker.bsky.social 🧬 bit.ly/4211hMY

🚀 CALL FOR SUBMISSIONS: Non-Euclidean Foundation Models & Geometric Learning Workshop @ NeurIPS 2025 🚀 ⏰ DEADLINE: Sep 2, 2025 📥 SUBMIT HERE: bit.ly/3UDTvEX Join our reviewer pool: bit.ly/3JvvI7K 🔗 Full details: bit.ly/41PDyiM

4/26 at 3pm: 'Lie Algebra Canonicalization: Equivariant Neural Operators under arbitrary Lie Groups' Zakhar Shumaylov · Peter Zaika · James Rowbottom · Ferdia Sherry · @mweber.bsky.social · Carola-Bibiane Schönlieb Submission: openreview.net/forum?id=7PL...

Community detection is a classical graph learning task. Our new JMLR paper shows how discrete Ricci curvature and geometric flows unveil (mixed) communities and studies relations between the curvature of a graph and its dual. w\ Yu Tian, Zach Lubberts: www.jmlr.org/papers/v26/2...

A postdoc position is available in my group at @harvard.edu Applied Math to perform research in Riemannian Optimization. More details, including on how to apply, can be found here: academicpositions.harvard.edu/postings/14832

Want to learn more?🧐 📺 Subscribe to the NeurReps YouTube channel and find more talks by @mweber.bsky.social @kostaspenn.bsky.social @robinwalters.bsky.social @erikjbekkers.bsky.social S. Ravanbakhsh @andyrepair.bsky.social & more! youtube.com/@neurreps

Hypergraphs naturally parametrize higher-order relations.Yet GNNs on hypergraph expansions often outperform specialized topological models. We show that adding hypergraph-level encodings yields significant performance and expressivity gains.w/ Raphael Pellegrin, Lukas Fesser arxiv.org/pdf/2502.09570