no code implementations • 9 Oct 2023 • Yixuan He, Gesine Reinert, David Wipf, Mihai Cucuringu
The angular synchronization problem aims to accurately estimate (up to a constant additive phase) a set of unknown angles $\theta_1, \dots, \theta_n\in[0, 2\pi)$ from $m$ noisy measurements of their offsets $\theta_i-\theta_j \;\mbox{mod} \; 2\pi.$ Applications include, for example, sensor network localization, phase retrieval, and distributed clock synchronization.
1 code implementation • 23 Jan 2023 • Qitian Wu, Chenxiao Yang, Wentao Zhao, Yixuan He, David Wipf, Junchi Yan
Real-world data generation often involves complex inter-dependencies among instances, violating the IID-data hypothesis of standard learning paradigms and posing a challenge for uncovering the geometric structures for learning desired instance representations.
1 code implementation • 1 Sep 2022 • Yixuan He, Michael Permultter, Gesine Reinert, Mihai Cucuringu
In these experiments, we consider tasks related to signed information, tasks related to directional information, and tasks related to both signed and directional information.
no code implementations • 21 May 2022 • Xuhong Wang, Sirui Chen, Yixuan He, Minjie Wang, Quan Gan, Yupu Yang, Junchi Yan
Many real world applications can be formulated as event forecasting on Continuous Time Dynamic Graphs (CTDGs) where the occurrence of a timed event between two entities is represented as an edge along with its occurrence timestamp in the graphs. However, most previous works approach the problem in compromised settings, either formulating it as a link prediction task on the graph given the event time or a time prediction problem given which event will happen next.
1 code implementation • 22 Feb 2022 • Yixuan He, Xitong Zhang, JunJie Huang, Benedek Rozemberczki, Mihai Cucuringu, Gesine Reinert
While many networks are signed or directed, or both, there is a lack of unified software packages on graph neural networks (GNNs) specially designed for signed and directed networks.
1 code implementation • 1 Feb 2022 • Yixuan He, Quan Gan, David Wipf, Gesine Reinert, Junchi Yan, Mihai Cucuringu
In this paper, we introduce neural networks into the ranking recovery problem by proposing the so-called GNNRank, a trainable GNN-based framework with digraph embedding.
1 code implementation • 13 Oct 2021 • Yixuan He, Gesine Reinert, Songchao Wang, Mihai Cucuringu
Node embeddings are a powerful tool in the analysis of networks; yet, their full potential for the important task of node clustering has not been fully exploited.
1 code implementation • 9 Jun 2021 • Yixuan He, Gesine Reinert, Mihai Cucuringu
DIGRAC optimizes directed flow imbalance for clustering without requiring label supervision, unlike existing graph neural network methods, and can naturally incorporate node features, unlike existing spectral methods.
4 code implementations • 15 Apr 2021 • Benedek Rozemberczki, Paul Scherer, Yixuan He, George Panagopoulos, Alexander Riedel, Maria Astefanoaei, Oliver Kiss, Ferenc Beres, Guzmán López, Nicolas Collignon, Rik Sarkar
We present PyTorch Geometric Temporal a deep learning framework combining state-of-the-art machine learning algorithms for neural spatiotemporal signal processing.
1 code implementation • NeurIPS 2021 • Xitong Zhang, Yixuan He, Nathan Brugnone, Michael Perlmutter, Matthew Hirn
In this paper, we propose MagNet, a spectral GNN for directed graphs based on a complex Hermitian matrix known as the magnetic Laplacian.
1 code implementation • 8 Jun 2019 • Yixuan He, Tianyi Hu, Delu Zeng
Experimental results show that the proposed algorithm can generate precise masks that allow for various machine learning tasks such as supervised training.
Graphics
1 code implementation • 15 May 2018 • Delu Zeng, Yixuan He, Li Liu, Zhihong Chen, Jiabin Huang, Jie Chen, John Paisley
In this paper, we propose an end-to-end generic salient object segmentation model called Metric Expression Network (MEnet) to deal with saliency detection with the tolerance of distortion.