Muon combines current and past gradients into matrix momentum. For $M=U\Sigma V^\top$, the idealized polar update $Q=UV^\top$ gives every singular direction the same weight. We refer to this as the flat profile. Several recent optimizers replace this flat profile with fine-grained spectral maps that give each direction...
Meher Chaitanya, Tian-Yi Zhou, A. Gionis· 0 citations
CAST (Canonical Approximate Schur Tree) is introduced, which replaces this clique with a weighted random spanning tree sampled directly from it, and it is proved that its leverage-score marginals minimize the largest normalized reweighted-edge contribution among unbiased inverse-marginal one-tree estimators.
Meher Chaitanya, Cameron Musco, A. Gionis· 1 citation
This work introduces FALCON (Filtration-based hypergrAph aLignment via Cross-scale Optimal traNsport), an unsupervised optimal-transport framework for hypergraph alignment that constructs a filtration-induced sequence of clique-based co-occurrence dissimilarity matrices and jointly aligns all levels through one shared...
Lutz Oettershagen, Honglian Wang, A. Gionis· 0 citations
This paper generalises the existing PTAS for complete graphs from a fixed to an arbitrary number of intervals and disprove an existing conjecture, which states that every instance of BIA admits a solution satisfying at least three quarters of all edges.
PeterBlohm, FlorianChen, A. Gionis et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.