1 citations · 1 across the 7 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Learning Unbiased Permutations via Flow Matching
Yimeng Min, Carla P. Gomes
Learning permutations is fundamental to sorting, ranking, and matching, but existing differentiable methods based on entropy-regularized Sinkhorn produce a single softened solution…
cs.LG2025
Structure As Search: Unsupervised Permutation Learning for Combinatorial Optimization
Yimeng Min, Carla P. Gomes
We propose a non-autoregressive framework for the Travelling Salesman Problem where solutions emerge directly from learned permutations, without requiring explicit search. By apply…
cs.LG2025
Unsupervised Ordering for Maximum Clique
Yimeng Min, Carla P. Gomes
We propose an unsupervised approach for learning vertex orderings for the maximum clique problem by framing it within a permutation-based framework. We transform the combinatorial…