1 code implementation • 4 Jul 2022 • Ernesto Araya, Eglantine Karlé, Hemant Tyagi
In this setup, we are given a sequence of comparison graphs $(G_t)_{t\in \mathcal{T}}$, where $\mathcal{T} \subset [0, 1]$ is a grid representing the time domain, and for each item $i$ and time $t\in \mathcal{T}$ there is an associated unknown strength parameter $z^*_{t, i}\in \mathbb{R}$.
no code implementations • 8 Apr 2022 • Ernesto Araya, Guillaume Braun, Hemant Tyagi
We assume in this work that the observed pair $G, H$ has been drawn from the Correlated Gaussian Wigner (CGW) model -- a popular model for correlated weighted graphs -- where the entries of the adjacency matrices of $G$ and $H$ are independent Gaussians and each edge of $G$ is correlated with one edge of $H$ (determined by the unknown matching) with the edge correlation described by a parameter $\sigma\in [0, 1)$.
1 code implementation • NeurIPS 2019 • Ernesto Araya, Yohann de Castro
We introduce a spectral estimator of the pairwise distance between latent points and we prove that its rate of convergence is the same as the nonparametric estimation of a function on $\mathbb{S}^{d-1}$, up to a logarithmic factor.