Web: http://arxiv.org/abs/2106.01260

Sept. 23, 2022, 1:13 a.m. | Nick Whiteley, Annie Gray, Patrick Rubin-Delanchy

stat.ML updates on arXiv.org arxiv.org

Given a graph or similarity matrix, we consider the problem of recovering a
notion of true distance between the nodes, and so their true positions. We show
that this can be accomplished in two steps: matrix factorisation, followed by
nonlinear dimension reduction. This combination is effective because the point
cloud obtained in the first step lives close to a manifold in which latent
distance is encoded as geodesic distance. Hence, a nonlinear dimension
reduction tool, approximating geodesic distance, can recover …

arxiv interpretation

Machine Learning Product Manager (Canada, Remote)

@ FreshBooks | Canada

Data Engineer

@ Amazon.com | Irvine, California, USA

Senior Autonomy Behavior II, Performance Assessment Engineer

@ Cruise LLC | San Francisco, CA

Senior Data Analytics Engineer

@ Intercom | Dublin, Ireland

Data Analyst Intern

@ ADDX | Singapore

Data Science Analyst - Consumer

@ Yelp | London, England, United Kingdom

Senior Data Analyst - Python+Hadoop

@ Capco | India - Bengaluru

DevOps Engineer, Data Team

@ SingleStore | Hyderabad, India

Software Engineer (Machine Learning, AI Platform)

@ Phaidra | Remote

Sr. UI/UX Designer - Artificial Intelligence (ID:1213)

@ Truelogic Software | Remote, anywhere in LATAM

Analytics Engineer

@ carwow | London, England, United Kingdom

HRIS Data Analyst

@ SecurityScorecard | Remote