• Corpus ID: 236950661

Localization in 1D non-parametric latent space models from pairwise affinities

@inproceedings{Giraud2021LocalizationI1,
  title={Localization in 1D non-parametric latent space models from pairwise affinities},
  author={Christophe Giraud and Yann Issartel and Nicolas Verzelen},
  year={2021}
}
We consider the problem of estimating latent positions in a one-dimensional torus from pairwise affinities. The observed affinity between a pair of items is modeled as a noisy observation of a function f(xi , x ∗ j ) of the latent positions x ∗ i , x ∗ j of the two items on the torus. The affinity function f is unknown, and it is only assumed to fulfill some shape constraints ensuring that f(x, y) is large when the distance between x and y is small, and vice-versa. This non-parametric modeling… 

Figures from this paper

Matching Map Recovery with an Unknown Number of Outliers

The results of numerical experiments are reported on both synthetic and real-world data that illustrate the theoretical results and provide further insight into the properties of the algorithms studied.

Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms

This work first establishes the fundamental statistical limit for the matrix reordering problem in a decision-theoretic framework and shows that a constrained least square estimator is rate-optimal, and proposes a novel polynomial-time adaptive sorting algorithm.

A simple and optimal algorithm for strict circular seriation

It is proved that the circular Robinson dissimilarities are exactly the pre-circular Robinson Dissimilarities (which are defined by the existence of compatible orders on one of the two arcs between each pair of points).

References

SHOWING 1-10 OF 43 REFERENCES

Spectral Method and Regularized MLE Are Both Optimal for Top-$K$ Ranking

It is demonstrated that under a natural random sampling model, the spectral method alone, or the regularized MLE alone, is minimax optimal in terms of the sample complexity - the number of paired comparisons needed to ensure exact top-K identification, for the fixed dynamic range regime.

On Estimation and Inference in Latent Structure Random Graphs

The latent structure model formulation is used to test bilateral homology in the Drosophila connectome and spectral estimates of the latent positions of an RDPG can be used for efficient estimation of the paramaters of the LSM.

Learning random points from geometric graphs or orderings

In polynomial time the authors can approximately reconstruct the hidden embedding in the sense that, `up to symmetries', for each vertex $v$ they find a point within distance about r of $X_v$; that is, they find an embedding with `displacement' at most about r.

Adaptive estimation of nonparametric geometric graphs

This paper offers an algorithmically and theoretically efficient procedure to estimate smooth NGG and shows a non-asymptotic concentration result on the spectrum of integral operators defined by symmetric kernels (not necessarily positive).

Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisons

This paper describes the minimax limits on identifiability of top-$K$ ranked items, in the presence of random and non-adaptive sampling, and proposes a nearly linear-time ranking scheme, called Spectral MLE, that allows perfect top-K$ item identification under minimal sample complexity.

Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs

If class labels are observed for a number of vertices tending to infinity, then it is shown that the remaining vertices can be classified with error converging to Bayes optimal using the $(k)$-nearest-neighbors classification rule.

Angular Synchronization by Eigenvectors and Semidefinite Programming.

  • A. Singer
  • Computer Science
    Applied and computational harmonic analysis
  • 2011

Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning

P perturbation bounds for classical scaling and trilateration are obtained and applied to derive performance bounds for Isomap, Landmark Isomaps, and Maximum Variance Unfolding and a new perturbations bound for procrustes analysis plays a key role.

Reconstructing Latent Orderings by Spectral Clustering

This work tackles the task of retrieving linear and circular orderings in a unifying framework, and shows how a latent ordering on the data translates into a filamentary structure on the Laplacian embedding.

Latent Space Approaches to Social Network Analysis

This work develops a class of models where the probability of a relation between actors depends on the positions of individuals in an unobserved “social space,” and proposes Markov chain Monte Carlo procedures for making inference on latent positions and the effects of observed covariates.