2022
DOI: 10.48550/arxiv.2204.13858
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

One-Way Matching of Datasets with Low Rank Signals

Abstract: We study one-way matching of a pair of datasets with low rank signals. Under a stylized model, we first derive information-theoretic limits of matching. We then show that linear assignment with projected data achieves fast rates of convergence and sometimes even minimax rate optimality for this task. The theoretical error bounds are corroborated by simulated examples. Furthermore, we illustrate practical use of the matching procedure on two single-cell data examples.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 33 publications
(44 reference statements)
0
4
0
Order By: Relevance
“…For instance, a model for correlated randomly growing graphs was studied in [35], graph matching for correlated stochastic block model was studied in [36] and graph matching for correlated random geometric graphs was studied in [40]. In a very recent work [9], a related matching problem (albeit somewhat different from graph matching) was studied and it seems the method developed therein enjoyed direct and successful applications to single-cell problems.…”
Section: Background and Related Resultsmentioning
confidence: 99%
“…For instance, a model for correlated randomly growing graphs was studied in [35], graph matching for correlated stochastic block model was studied in [36] and graph matching for correlated random geometric graphs was studied in [40]. In a very recent work [9], a related matching problem (albeit somewhat different from graph matching) was studied and it seems the method developed therein enjoyed direct and successful applications to single-cell problems.…”
Section: Background and Related Resultsmentioning
confidence: 99%
“…As the columns in and in have correspondences, we can compute an n y × n z distance matrix D ° where measures the distance between the i -th row in and the j -th row in after projecting to respective leading singular subspaces. We obtain an initial matching as the solution to the linear assign-ment problem (33, 60): …”
Section: Methodsmentioning
confidence: 99%
“…m and in Z∘ m have correspondences, we can compute an n y × n z distance matrix D ∘ where D ∘ ij measures the distance between the i-th row in Ỹ ∘ m and the j-th row in Z∘ m after projecting to respective leading singular subspaces. We obtain an initial matching Π∘ as the solution to the linear assignment problem 32,64 :…”
Section: Initial Matching Via Linear Assignment As the Columns In ỹ ∘mentioning
confidence: 99%