Confidence Sets for Multidimensional Scaling
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912670508122112 |
|---|---|
| author | Vishwanath, Siddharth Arias-Castro, Ery |
| author_facet | Vishwanath, Siddharth Arias-Castro, Ery |
| contents | We develop a formal statistical framework for classical multidimensional scaling (CMDS) applied to noisy dissimilarity data. We establish distributional convergence results for the embeddings produced by CMDS for various noise models, which enable the construction of \emph{bona~fide} uniform confidence sets for the latent configuration, up to rigid transformations. We further propose bootstrap procedures for constructing these confidence sets and provide theoretical guarantees for their validity. We find that the multiplier bootstrap adapts automatically to heteroscedastic noise such as multiplicative noise, while the empirical bootstrap seems to require homoscedasticity. Either form of bootstrap, when valid, is shown to substantially improve finite-sample accuracy. The empirical performance of the proposed methods is demonstrated through numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_22452 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Confidence Sets for Multidimensional Scaling Vishwanath, Siddharth Arias-Castro, Ery Statistics Theory Machine Learning 62H12, 62F40, 62E20, 62G05, 62R07, 91C15 G.3; F.2.2 We develop a formal statistical framework for classical multidimensional scaling (CMDS) applied to noisy dissimilarity data. We establish distributional convergence results for the embeddings produced by CMDS for various noise models, which enable the construction of \emph{bona~fide} uniform confidence sets for the latent configuration, up to rigid transformations. We further propose bootstrap procedures for constructing these confidence sets and provide theoretical guarantees for their validity. We find that the multiplier bootstrap adapts automatically to heteroscedastic noise such as multiplicative noise, while the empirical bootstrap seems to require homoscedasticity. Either form of bootstrap, when valid, is shown to substantially improve finite-sample accuracy. The empirical performance of the proposed methods is demonstrated through numerical experiments. |
| title | Confidence Sets for Multidimensional Scaling |
| topic | Statistics Theory Machine Learning 62H12, 62F40, 62E20, 62G05, 62R07, 91C15 G.3; F.2.2 |
| url | https://arxiv.org/abs/2510.22452 |