Pith. sign in

REVIEW 3 minor 64 references

Manifold Fitting: A Review of Methods and Applications

T0 review · 0 major / 3 minor · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Manifold fitting captures low-dimensional latent geometric structures in high-dimensional data as an alternative to linear dimension reduction.

desk verdict This is a review that organizes manifold fitting into three stages and notes applications, but adds no new methods or results. read the letter →

arxiv 2606.22356 v1 pith:OQAKGJZW submitted 2026-06-21 stat.ME

Zhigang Yao , Jiaji Su This is my paper
classification stat.ME
keywords manifoldfittingdimensionreductionhigh-dimensionaldatageometricstructuresneuralnetworksbioinformaticsstatisticalmethodslatent
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This review establishes manifold fitting as a geometric tool that identifies recoverable low-dimensional structures inside high-dimensional observations. It separates the approach from manifold embedding and denoising, then traces its progress through early nonparametric statistics, mathematical analysis, and current practical methods. Applications in neural networks and bioinformatics demonstrate how the technique aids downstream tasks on complex data. A reader would care if the geometric lens improves analysis where linear methods lose structure.

What carries the argument

Manifold fitting, the recovery of low-dimensional latent geometric structures from high-dimensional data.

What would settle it

Empirical tests on benchmark high-dimensional datasets with known ground-truth low-dimensional geometry where manifold fitting recovers no structure or performs no better than linear methods.

Watch

Extended reading notes

Core claim

Manifold fitting offers an important alternative by capturing low-dimensional latent geometric structures within high-dimensional spaces. This capability allows it to support downstream analysis in complex data settings. The review organizes the field's development into three stages—early nonparametric statistical methods, insights from mathematical analysis, and contemporary practical statistical approaches—and illustrates utility through applications in neural networks and bioinformatics.

Load-bearing premise

High-dimensional data contains recoverable low-dimensional latent geometric structures that manifold fitting methods can reliably capture.

Editorial extensions

If this is right

  • It handles data whose scale and complexity exceed traditional linear techniques.
  • It supplies geometric support for downstream tasks in neural network training and inference.
  • It provides concrete utility for analysis problems in bioinformatics.
  • It leaves open many theoretical and practical questions that further work can address.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same geometric recovery idea could be tested on data from imaging or sensor networks where linear projections currently dominate.
  • Stage-wise historical framing suggests that mathematical analysis may still yield new algorithmic guarantees not yet implemented in practice.
  • If the three-stage narrative holds, future reviews could quantify performance gains across the stages on shared benchmark suites.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The manuscript is a review of manifold fitting methods. It positions manifold fitting as an alternative to linear dimension reduction techniques for recovering low-dimensional latent geometric structure in high-dimensional data. The review distinguishes manifold fitting from manifold embedding and denoising, organizes the literature into three developmental stages (early nonparametric statistical methods, insights from mathematical analysis, and contemporary practical statistical approaches), surveys applications especially in neural networks and bioinformatics, and notes that many theoretical and practical questions remain open.

Significance. If the three-stage organization is accurate and the coverage balanced, the review could serve as a useful entry point and synthesis for researchers working on geometric methods in high-dimensional statistics and machine learning. The explicit separation from embedding/denoising and the emphasis on downstream utility in complex data settings are helpful framing devices. No machine-checked proofs or new empirical results are claimed; the value lies in the organizational clarity and literature mapping.

minor comments (3)
  1. The abstract states that the three stages are 'distinct,' but without a short table or explicit criteria for stage boundaries in the introduction or §2, readers may find the classification boundaries difficult to apply when encountering new papers.
  2. Applications in neural networks and bioinformatics are mentioned as illustrative; adding one or two concrete citations with brief quantitative outcomes (e.g., improved clustering accuracy or reduced reconstruction error) would strengthen the claim that manifold fitting 'supports downstream analysis.'
  3. The final paragraph asserts that 'many theoretical and practical questions remain unanswered.' A short enumerated list of the most pressing open problems (with references to where they are discussed in the review) would make this claim more actionable.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the constructive summary and positive assessment of the manuscript. The recommendation for minor revision is noted. No specific major comments were provided in the report, so we have no points to address point-by-point at this stage. We will incorporate any minor editorial or formatting suggestions in the revised version.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: literature survey with no derivations

full rationale

This is a review paper that introduces basic concepts, distinguishes manifold fitting from embedding/denoising, organizes the literature into three developmental stages, and surveys applications in neural networks and bioinformatics. No equations, fitted parameters, predictions, or load-bearing derivations appear anywhere in the manuscript. All claims are organizational summaries of external work; the motivating premise that high-dimensional data contains recoverable low-dimensional structure is framing, not a result derived or fitted inside the paper. No self-citation chains, ansatzes, or renamings reduce to inputs by construction. The paper is self-contained as a survey and receives the default non-circularity finding.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

The paper is a review and introduces no free parameters, axioms, or invented entities of its own.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Manifold Fitting: A Review of Methods and Applications." pith.science (2026). https://pith.science/paper/OQAKGJZW

@misc{pith2026260622356,
  author       = {Pith},
  title        = {Pith review of: Manifold Fitting: A Review of Methods and Applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OQAKGJZW}},
  note         = {Machine review of arXiv:2606.22356}
}
read the original abstract

With data growing in scale and complexity, traditional linear dimension reduction techniques are becoming inadequate in some settings. Manifold fitting offers an important alternative by capturing low-dimensional latent geometric structures within high-dimensional spaces. This capability allows it to support downstream analysis in complex data settings. In this review, we explore the development and applications of manifold fitting. First, we introduce the basic concepts of manifold fitting and distinguish it from related techniques such as manifold embedding and denoising. We review the development of manifold fitting with three distinct stages: early nonparametric statistical methods, insights from mathematical analysis, and contemporary practical statistical approaches. Furthermore, we present diverse applications of manifold fitting, particularly in neural networks and bioinformatics, which illustrate its utility in complex data scenarios. Despite considerable progress, manifold fitting remains a fertile area for research. Many theoretical and practical questions remain unanswered, and ongoing investigations will further clarify its role in modern data science as a geometric tool for a wide range of data analysis challenges.

Figures

Figures reproduced from arXiv: 2606.22356 by the authors.

Figure 1
Figure 1. Manifold Embedding: This illustration shows observed data points (black) distributed around a [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Manifold Denoising: This illustration shows observed data points (black) distributed around a [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Manifold Fitting: This illustration shows observed data points (black) distributed around a latent [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (8 more)
Figure 4
Figure 4. Figure 4: Left panel: principal flow on a known manifold, starting from the sample Fr´echet mean and [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: Illustration of the ridge-based manifold recovery of Mohammed and Narayanan [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: Illustration of the patching strategy proposed by Fefferman et al. [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 7
Figure 7. Figure 7: Illustration of the noisy refinement strategy proposed by Fefferman et al. [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]
Figure 8
Figure 8. Figure 8: Illustration of the local bias construction proposed by Yao and Xia [PITH_FULL_IMAGE:figures/full_fig_p012_8.png]
Figure 9
Figure 9. Figure 9: Illustration of the denoising construction proposed by Yao et al. [PITH_FULL_IMAGE:figures/full_fig_p013_9.png]
Figure 10
Figure 10. Figure 10: Illustration of fitting the latent manifold using the CycleGAN framework [64]. In the real world, [PITH_FULL_IMAGE:figures/full_fig_p015_10.png]
Figure 11
Figure 11. Figure 11: Overview of the scAMF framework for scRNA-seq data analysis. The schematic depicts the scAMF [PITH_FULL_IMAGE:figures/full_fig_p016_11.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

64 extracted references · 13 canonical work pages

  1. [1]

    A theory of stratification learning.arXiv preprint arXiv:2405.20066, 2024

    Eddie Aamari and Cl´ ement Berenfeld. A theory of stratification learning.arXiv preprint arXiv:2405.20066, 2024

    work page arXiv 2024

  2. [2]

    Nonasymptotic rates for manifold, tangent space and curvature estimation

    Eddie Aamari and Cl´ ement Levrard. Nonasymptotic rates for manifold, tangent space and curvature estimation. The Annals of Statistics, 47(1):177–204, 2019

    2019

  3. [3]

    Non-parametric estimation of manifolds from noisy data.arXiv preprint arXiv:2105.04754, 2021

    Yariv Aizenbud and Barak Sober. Non-parametric estimation of manifolds from noisy data.arXiv preprint arXiv:2105.04754, 2021

    work page arXiv 2021

  4. [4]

    Laplacian eigenmaps for dimensionality reduction and data representation

    Mikhail Belkin and Partha Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373–1396, 2003

    2003

  5. [5]

    Manifold regularization: A geometric framework for learning from labeled and unlabeled examples.Journal of machine learning research, 7(11), 2006

    Mikhail Belkin, Partha Niyogi, and Vikas Sindhwani. Manifold regularization: A geometric framework for learning from labeled and unlabeled examples.Journal of machine learning research, 7(11), 2006

    2006

  6. [6]

    Manifold reconstruction in arbitrary dimensions using witness complexes.Discrete & Computational Geometry, 42(1):37–70, 2009

    Jean-Daniel Boissonnat, Leonidas J Guibas, and Steve Y Oudot. Manifold reconstruction in arbitrary dimensions using witness complexes.Discrete & Computational Geometry, 42(1):37–70, 2009

    2009

  7. [7]

    Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees.Computational Geometry, 40(2):156–170, 2008

    Fr´ ed´ eric Chazal and Andr´ e Lieutier. Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees.Computational Geometry, 40(2):156–170, 2008

    2008

  8. [8]

    Estimation of Riemannian quantities from noisy data via density derivatives.arXiv preprint arXiv:2603.27171, 2026

    Junhao Chen, Ruowei Li, and Zhigang Yao. Estimation of Riemannian quantities from noisy data via density derivatives.arXiv preprint arXiv:2603.27171, 2026

    work page arXiv 2026

Show all 64 references
  1. [9]

    Asymptotic theory for density ridges.The Annals of Statistics, 43(5):1896–1928, 2015

    Yen-Chi Chen, Christopher R Genovese, and Larry Wasserman. Asymptotic theory for density ridges.The Annals of Statistics, 43(5):1896–1928, 2015

    1928

  2. [10]

    Manifold reconstruction from point samples

    Siu-Wing Cheng, Tamal K Dey, and Edgar A Ramos. Manifold reconstruction from point samples. InProceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1018–1027, 2005

    2005

  3. [11]

    Diffusion maps.Applied and computational harmonic analysis, 21(1): 5–30, 2006

    Ronald R Coifman and St´ ephane Lafon. Diffusion maps.Applied and computational harmonic analysis, 21(1): 5–30, 2006

    2006

  4. [12]

    Wind speed and direction estimation using manifold approximation

    Chinh Dang, Ammar Safaie, Mantha Phanikumar, and Hayder Radha. Wind speed and direction estimation using manifold approximation. InProceedings of the 14th International Conference on Information Processing in Sensor Networks, pages 328–329, 2015. 19

    2015

  5. [13]

    Manifold denoising based on spectral graph wavelets

    Shay Deutsch, Antonio Ortega, and Gerard Medioni. Manifold denoising based on spectral graph wavelets. In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 4673–4677. IEEE, 2016

    2016

  6. [14]

    Analysis of additive dependencies and concurvities using smallest additive principal components.The Annals of Statistics, 22(4):1635–1668, 1994

    Deborah J Donnell, Andreas Buja, and Werner Stuetzle. Analysis of additive dependencies and concurvities using smallest additive principal components.The Annals of Statistics, 22(4):1635–1668, 1994

    1994

  7. [15]

    Donoho and Carrie Grimes

    David L. Donoho and Carrie Grimes. Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data.Proceedings of the National Academy of Sciences, 100(10):5591–5596, 2003

    2003

  8. [16]

    Curvature measures.Transactions of the American Mathematical Society, 93(3):418–491, 1959

    Herbert Federer. Curvature measures.Transactions of the American Mathematical Society, 93(3):418–491, 1959

    1959

  9. [17]

    A sharp form of Whitney’s extension theorem.Annals of Mathematics, 161(1):509–577, 2005

    Charles Fefferman. A sharp form of Whitney’s extension theorem.Annals of Mathematics, 161(1):509–577, 2005

    2005

  10. [18]

    Whitney’s extension problem forc m.Annals of Mathematics, 164(1):313–359, 2006

    Charles Fefferman. Whitney’s extension problem forc m.Annals of Mathematics, 164(1):313–359, 2006

    2006

  11. [19]

    Testing the manifold hypothesis.Journal of the American Mathematical Society, 29(4):983–1049, 2016

    Charles Fefferman, Sanjoy Mitter, and Hariharan Narayanan. Testing the manifold hypothesis.Journal of the American Mathematical Society, 29(4):983–1049, 2016

    2016

  12. [20]

    Fitting a putative manifold to noisy data

    Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, and Hariharan Narayanan. Fitting a putative manifold to noisy data. InConference on Learning Theory, pages 688–720. PMLR, 2018

    2018

  13. [21]

    Reconstruction and interpolation of manifolds I: The geometric Whitney problem.Foundations of Computational Mathematics, 20(5):1035–1133, 2020

    Charles Fefferman, Sergei Ivanov, Yaroslav Kurylev, Matti Lassas, and Hariharan Narayanan. Reconstruction and interpolation of manifolds I: The geometric Whitney problem.Foundations of Computational Mathematics, 20(5):1035–1133, 2020

    2020

  14. [22]

    Reconstruction and interpolation of manifolds II: Inverse problems for Riemannian manifolds with partial distance data.arXiv preprint arXiv:2111.14528, 2021

    Charles Fefferman, Sergei Ivanov, Matti Lassas, Jinpeng Lu, and Hariharan Narayanan. Reconstruction and interpolation of manifolds II: Inverse problems for Riemannian manifolds with partial distance data.arXiv preprint arXiv:2111.14528, 2021

    2021

  15. [23]

    Fitting a manifold of large reach to noisy data.arXiv preprint arXiv:1910.05084, 2021

    Charles Fefferman, Sergei Ivanov, Matti Lassas, and Hariharan Narayanan. Fitting a manifold of large reach to noisy data.arXiv preprint arXiv:1910.05084, 2021

    1910

  16. [24]

    Manifold estimation and singular deconvolution under Hausdorff loss.The Annals of Statistics, 40(2):941–963, 2012

    Christopher R Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. Manifold estimation and singular deconvolution under Hausdorff loss.The Annals of Statistics, 40(2):941–963, 2012

    2012

  17. [25]

    Minimax manifold estimation.Journal of Machine Learning Research, 13(43):1263–1291, 2012

    Christopher R Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. Minimax manifold estimation.Journal of Machine Learning Research, 13(43):1263–1291, 2012

    2012

  18. [26]

    Nonparametric ridge estimation.The Annals of Statistics, 42(4):1511–1545, 2014

    Christopher R Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. Nonparametric ridge estimation.The Annals of Statistics, 42(4):1511–1545, 2014

    2014

  19. [27]

    Generative adversarial nets.Advances in Neural Information Processing Systems, 27, 2014

    Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. Generative adversarial nets.Advances in Neural Information Processing Systems, 27, 2014

    2014

  20. [28]

    Principal curves.Journal of the American Statistical Association, 84(406): 502–516, 1989

    Trevor Hastie and Werner Stuetzle. Principal curves.Journal of the American Statistical Association, 84(406): 502–516, 1989

    1989

  21. [29]

    Graph laplacians and their convergence on random neighborhood graphs.Journal of Machine Learning Research, 8(6), 2007

    Matthias Hein, Jean-Yves Audibert, and Ulrike von Luxburg. Graph laplacians and their convergence on random neighborhood graphs.Journal of Machine Learning Research, 8(6), 2007

    2007

  22. [30]

    Intrinsic shape analysis: Geodesic PCA for Riemannian manifolds modulo isometric Lie group actions.Statistica Sinica, pages 1–58, 2010

    Stephan Huckemann, Thomas Hotz, and Axel Munk. Intrinsic shape analysis: Geodesic PCA for Riemannian manifolds modulo isometric Lie group actions.Statistica Sinica, pages 1–58, 2010

    2010

  23. [31]

    Dryden, and J

    Sungkyu Jung, Ian L. Dryden, and J. S. Marron. Analysis of principal nested spheres.Biometrika, 99(3):551–568, 07 2012. ISSN 0006-3444. doi: 10.1093/biomet/ass022. URLhttps://doi.org/10.1093/biomet/ass022

    2012 doi

  24. [32]

    Nanophotonics for light detection and ranging technology

    Inki Kim, Renato Juliano Martins, Jaehyuck Jang, Trevon Badloe, Samira Khadir, Ho-Youl Jung, Hyeongdo Kim, Jongun Kim, Patrice Genevet, and Junsuk Rho. Nanophotonics for light detection and ranging technology. Nature Nanotechnology, 16(5):508–524, 2021

    2021

  25. [33]

    Two algorithms for constructing a Delaunay triangulation.International Journal of Computer & Information Sciences, 9(3):219–242, 1980

    Der-Tsai Lee and Bruce J Schachter. Two algorithms for constructing a Delaunay triangulation.International Journal of Computer & Information Sciences, 9(3):219–242, 1980

    1980

  26. [34]

    Approximate global parametrization of manifolds.Technical Report, 2026

    Bingjie Li and Zhigang Yao. Approximate global parametrization of manifolds.Technical Report, 2026. 20

    2026

  27. [35]

    CellScope: High-performance cell atlas workflow with tree-structured representation.Nature Communications, 2025

    Bingjie Li, Runyu Lin, Tianhao Ni, Guanao Yan, Mannix Burns, Jingyi Jessica Li, and Zhigang Yao. CellScope: High-performance cell atlas workflow with tree-structured representation.Nature Communications, 2025

    2025

  28. [36]

    Curvature-driven manifold fitting under unbounded isotropic noise.arXiv preprint arXiv:2601.10133, 2026

    Ruowei Li and Zhigang Yao. Curvature-driven manifold fitting under unbounded isotropic noise.arXiv preprint arXiv:2601.10133, 2026

    2026

  29. [37]

    Differentiable manifold reconstruction for point cloud denoising

    Shitong Luo and Wei Hu. Differentiable manifold reconstruction for point cloud denoising. InProceedings of the 28th ACM International Conference on Multimedia, pages 1330–1338, 2020

    2020

  30. [38]

    UMAP: Uniform manifold approximation and projection for dimension reduction.arXiv preprint arXiv:1802.03426, 2018

    Leland McInnes, John Healy, and James Melville. UMAP: Uniform manifold approximation and projection for dimension reduction.arXiv preprint arXiv:1802.03426, 2018

    2018 arXiv

  31. [39]

    Manifold learning: What, how, and why.Annual Review of Statistics and Its Application, 11(1):393–417, 2024

    Marina Meil˘ a and Hanyu Zhang. Manifold learning: What, how, and why.Annual Review of Statistics and Its Application, 11(1):393–417, 2024

    2024

  32. [40]

    Manifold learning using kernel density estimation and local principal components analysis.arXiv preprint arXiv:1709.03615, 2017

    Kitty Mohammed and Hariharan Narayanan. Manifold learning using kernel density estimation and local principal components analysis.arXiv preprint arXiv:1709.03615, 2017

    2017 arXiv

  33. [41]

    Diffusion maps, spectral clustering and reaction coordinates of dynamical systems.Applied and Computational Harmonic Analysis, 21(1):113–127, 2006

    Boaz Nadler, St´ ephane Lafon, Ronald R Coifman, and Ioannis G Kevrekidis. Diffusion maps, spectral clustering and reaction coordinates of dynamical systems.Applied and Computational Harmonic Analysis, 21(1):113–127, 2006

    2006

  34. [42]

    Finding the homology of submanifolds with high confidence from random samples.Discrete & Computational Geometry, 39(1):419–441, 2008

    Partha Niyogi, Stephen Smale, and Shmuel Weinberger. Finding the homology of submanifolds with high confidence from random samples.Discrete & Computational Geometry, 39(1):419–441, 2008

    2008

  35. [43]

    Locally defined principal curves and surfaces.The Journal of Machine Learning Research, 12:1249–1286, 2011

    Umut Ozertem and Deniz Erdogmus. Locally defined principal curves and surfaces.The Journal of Machine Learning Research, 12:1249–1286, 2011

    2011

  36. [44]

    Principal flows.Journal of the American Statistical Association, 109(505):424–436, 2014

    Victor M Panaretos, Tung Pham, and Zhigang Yao. Principal flows.Journal of the American Statistical Association, 109(505):424–436, 2014

    2014

  37. [45]

    Linear convergence of diffusion models under the manifold hypothesis

    Peter Potaptchik, Iskander Azangulov, and George Deligiannidis. Linear convergence of diffusion models under the manifold hypothesis. In Nika Haghtalab and Ankur Moitra, editors,Proceedings of Thirty Eighth Conference on Learning Theory, volume 291 ofProceedings of Machine Lea...

    2025

  38. [46]

    Nonlinear dimensionality reduction by locally linear embedding.Science, 290(5500):2323–2326, 2000

    Sam T Roweis and Lawrence K Saul. Nonlinear dimensionality reduction by locally linear embedding.Science, 290(5500):2323–2326, 2000

    2000

  39. [47]

    From graph to manifold laplacian: The convergence rate.Applied and Computational Harmonic Analysis, 21(1):128–134, 2006

    Amit Singer. From graph to manifold laplacian: The convergence rate.Applied and Computational Harmonic Analysis, 21(1):128–134, 2006

    2006

  40. [48]

    Manifold approximation by moving least-squares projection (MMLS).Constructive Approximation, 52(3):433–478, 2020

    Barak Sober and David Levin. Manifold approximation by moving least-squares projection (MMLS).Constructive Approximation, 52(3):433–478, 2020

    2020

  41. [49]

    Principal decomposition with nested submanifolds.arXiv preprint arXiv:2502.10010, 2025

    Jiaji Su and Zhigang Yao. Principal decomposition with nested submanifolds.arXiv preprint arXiv:2502.10010, 2025

    2025

  42. [50]

    A global geometric framework for nonlinear dimensionality reduction.Science, 290(5500):2319–2323, 2000

    Joshua B Tenenbaum, Vin de Silva, and John C Langford. A global geometric framework for nonlinear dimensionality reduction.Science, 290(5500):2319–2323, 2000

    2000

  43. [51]

    Manifold blurring mean shift algorithms for manifold denoising

    Weiran Wang and Miguel A Carreira-Perpin´ an. Manifold blurring mean shift algorithms for manifold denoising. In2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 1759–1766. IEEE, 2010

    2010

  44. [52]

    Analytic extensions of differentiable functions defined in closed sets.Transactions of the American Mathematical Society, 36(1):63–89, 1934

    Hassler Whitney. Analytic extensions of differentiable functions defined in closed sets.Transactions of the American Mathematical Society, 36(1):63–89, 1934

    1934

  45. [53]

    Differentially private manifold denoising.arXiv preprint arXiv:2604.00942, 2026

    Jiaqi Wu, Yiqing Sun, and Zhigang Yao. Differentially private manifold denoising.arXiv preprint arXiv:2604.00942, 2026

    2026

  46. [54]

    A principal submanifold-based approach for clustering and multiscale rna correction.arXiv preprint arXiv:2503.20513, 2026

    Menghao Wu and Zhigang Yao. A principal submanifold-based approach for clustering and multiscale rna correction.arXiv preprint arXiv:2503.20513, 2026

    2026

  47. [55]

    Manifold fitting algorithm of noisy manifold data based on variable-scale spectral graph.Soft Computing, 27(1):471–482, 2023

    Tao Yang and Jintao Meng. Manifold fitting algorithm of noisy manifold data based on variable-scale spectral graph.Soft Computing, 27(1):471–482, 2023. 21

    2023

  48. [56]

    Manifold fitting under unbounded noise.Journal of Machine Learning Research, 26(45):1–55, 2025

    Zhigang Yao and Yuqing Xia. Manifold fitting under unbounded noise.Journal of Machine Learning Research, 26(45):1–55, 2025

    2025

  49. [57]

    Principal boundary on Riemannian manifolds.Journal of the American Statistical Association, 115(531):1435–1448, 2020

    Zhigang Yao and Zhenyue Zhang. Principal boundary on Riemannian manifolds.Journal of the American Statistical Association, 115(531):1435–1448, 2020

    2020

  50. [58]

    Manifold fitting.arXiv preprint arXiv:2304.07680, 2023

    Zhigang Yao, Jiaji Su, Bingjie Li, and Shing-Tung Yau. Manifold fitting.arXiv preprint arXiv:2304.07680, 2023

    2023

  51. [59]

    Single-cell analysis via manifold fitting: A framework for RNA clustering and beyond.Proceedings of the National Academy of Sciences, 121(37):e2400002121, 2024

    Zhigang Yao, Bingjie Li, Yukun Lu, and Shing-Tung Yau. Single-cell analysis via manifold fitting: A framework for RNA clustering and beyond.Proceedings of the National Academy of Sciences, 121(37):e2400002121, 2024

    2024

  52. [60]

    Manifold fitting with CycleGAN.Proceedings of the National Academy of Sciences, 121(5):e2311436121, 2024

    Zhigang Yao, Jiaji Su, and Shing-Tung Yau. Manifold fitting with CycleGAN.Proceedings of the National Academy of Sciences, 121(5):e2311436121, 2024

    2024

  53. [61]

    Random fixed boundary flows.Journal of the American Statistical Association, 119(547):2356–2368, 2024

    Zhigang Yao, Yuqing Xia, and Zengyan Fan. Random fixed boundary flows.Journal of the American Statistical Association, 119(547):2356–2368, 2024

    2024

  54. [62]

    Principal sub-manifolds.Statistica Sinica, 36(3):1–41, 2026

    Zhigang Yao, Benjamin Eltzner, and Tung Pham. Principal sub-manifolds.Statistica Sinica, 36(3):1–41, 2026

    2026

  55. [63]

    Principal manifolds and nonlinear dimensionality reduction via tangent space alignment.SIAM Journal on Scientific Computing, 26(1):313–338, 2004

    Zhenyue Zhang and Hongyuan Zha. Principal manifolds and nonlinear dimensionality reduction via tangent space alignment.SIAM Journal on Scientific Computing, 26(1):313–338, 2004

    2004

  56. [64]

    Jun-Yan Zhu, Taesung Park, Phillip Isola, and Alexei A. Efros. Unpaired image-to-image translation using cycle-consistent adversarial networks. InProceedings of the IEEE International Conference on Computer Vision (ICCV), 2017. 22

    2017

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.