Graph Matching via convex relaxation to the simplex

31 October 2023

Papers citing "Graph Matching via convex relaxation to the simplex"

9 / 9 papers shown

Title
Random graph matching at Otter's threshold via counting chandeliers Cheng Mao Yihong Wu Jiaming Xu Sophie H. Yu 69 41 0 25 Sep 2022
Random Graph Matching in Geometric Models: the Case of Complete Graphs Haoyu Wang Yihong Wu Jiaming Xu Israel Yolou 75 29 0 22 Feb 2022
Testing network correlation efficiently via counting trees Cheng Mao Yihong Wu Jiaming Xu Sophie H. Yu 56 36 0 22 Oct 2021
Exact Matching of Random Graphs with Constant Correlation Cheng Mao M. Rudelson K. Tikhomirov 63 43 0 11 Oct 2021
Learning compositional functions via multiplicative weight updates Jeremy Bernstein Jiawei Zhao M. Meister Xuan Li Anima Anandkumar Yisong Yue 50 26 0 25 Jun 2020
Introduction to Online Convex Optimization Elad Hazan OffRL 188 1,939 0 07 Sep 2019
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates Zeyuan Allen-Zhu Zhenyu A. Liao L. Orecchia 126 90 0 16 Jun 2015
Graph Matching: Relax at Your Own Risk V. Lyzinski D. E. Fishkind Marcelo Fiori Joshua T. Vogelstein Carey E. Priebe Guillermo Sapiro 79 150 0 13 May 2014
A path following algorithm for the graph matching problem M. Zaslavskiy Francis R. Bach Jean-Philippe Vert 153 422 0 23 Jan 2008