10 citations · 26 across the 21 of their papers we have counts for
23 papers
MUX: Continuous Reasoning via Multiplexed Tokens
Ayhan Suleymanzade, Halil Alperen Gozeten, Michael Bronstein +2
Language models solve complex problems by articulating intermediate reasoning steps in natural language. While effective, this process is computationally bottlenecked: each reasoni…
Topological Flow Matching
Kacper Wyrwal, İsmail İlkan Ceylan, Alexander Tong
Flow matching is a powerful generative modeling framework, valued for its simplicity and strong empirical performance. However, its standard formulation treats signals on structure…
What are the Right Symmetries for Formal Theorem Proving?
Krzysztof Olejniczak, Radoslav Dimitrov, Xingyue Huang +3
Formal theorem provers based on large language models (LLMs) are highly sensitive to superficial variations in problem representation: semantically equivalent statements can exhibi…
MacroGuide: Topological Guidance for Macrocycle Generation
Alicja Maksymiuk, Alexandre Duplessis, Michael Bronstein +3
Macrocycles are ring-shaped molecules that offer a promising alternative to small-molecule drugs due to their enhanced selectivity and binding affinity against difficult targets. D…
Curly Flow Matching for Learning Non-gradient Field Dynamics
Katarina Petrović, Lazar Atanackovic, Viggo Moro +5
Modeling the transport dynamics of natural processes from population-level observations is a ubiquitous problem in the natural sciences. Such models rely on key assumptions about t…
Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models
Ben Finkelshtein, İsmail İlkan Ceylan, Michael Bronstein +1
Graph machine learning architectures are typically tailored to specific tasks on specific datasets, which hinders their broader applicability. This has led to a new quest in graph…