- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The authors present an autoencoder with a latent space structured as a vector bundle rather than the ordinary flat vector space used in traditional approaches. The architecture is inspired by two theorems. The authors claim that the proposed approach is the best parametric approach for clustering and topological preservation in image benchmarks and is competitive in interpolation. Moreover, the authors highlight several limitations, including that the proposed approach does not outperform bundle-specialized baselines on raw geodesic distortion; its decoded interpolations trade ambient smoothness for manifold fidelity; its connection is flat by construction; and its disentanglement evidence uses MNIST-derived factors alongside a dSprites factorization.
Critical strengths
The idea and its application look interesting, with potential contributions to the field. However, at this stage, the work is very difficult to understand, and there is some evidence of potential plagiarism.
Critical weaknesses
The presentation is bad; there is no structure, and the text does not smoothly explain the limitations of the literature, with duplicate information appearing in the introduction and related work. The authors present results in the introduction based on their proposed concepts without introducing the concepts first. All of this makes it difficult for the reader to follow. They use non-scientific terminology (“The honest summary is”, “destroys the base/fiber split.”). The authors do not properly reference tables in the appendix; for example, Table 4 is in the appendix. The presentation is not structured; it is chaotic and difficult to follow. Mathematical proofs and explanations need to be distinguished from the experimental approach.
Two theorems are presented by the authors. No reference citations for the foundations of the theorems are included. The way they are presented does not justify whether these are the authors' own theorems or whether they follow from the literature; this needs to be clarified. A literature reference for the starting point is needed if these are their own theorems, and if they are from the literature, appropriate references are required, as at this point it looks like plagiarism. For example, Theorem 3.1 has a basis in: [1] Ambrose, W., & Singer, I. M. (1953). A theorem on holonomy. Transactions of the American Mathematical Society, 75(3), 428–443, which establishes the classical relationship between curvature and holonomy. The authors did not mention anything related to this; [2] Kineider, C., Kydonakis, G., Rogozinnikov, E., Tatitscheff, V., & Thomas, A. (2026). Bundles and Connections. In Spectral Networks, Lecture Notes in Mathematics, Vol. 2386, pp. 45–61. Springer of, Theorem 4.29: Flat bundles, locally constant transition functions and fundamental-group representations, of Theorem 4.30: Riemann–Hilbert correspondence. (plagiarism) Similarly, the same concerns apply to the other theorem.
Regarding the results, the authors mention that UMAP and PaCMAP will be compared and benchmarked against the proposed methodology. However, later in the manuscript, they do not include the results of these techniques, with the explanation: “Non-parametric UMAP/PaCMAP reach higher silhouettes on FashionMNIST (Table 8), but provide no decoder and therefore cannot perform interpolation or semantic transfer.” This explanation is biased, as this metric is one of those the authors use in their validation protocol to define superiority. However, in Table 2, the authors present PCA, even though it is not decodable, and do not present UMAP and PaCMAP. This looks biased again. To that end, this appears to be an unjustified attempt to convince the reader of the superiority of their approach. The authors could have used a fixed decoder for all the interpolation approaches.
At the first level of evaluation, the proposed approach fails to outperform the baselines, and the authors state: “The connection therefore does not claim to improve geodesic preservation directly; its value appears on the interpolation and semantic-clustering tasks that the bundle geometry is designed for. Table 2 summarizes the image benchmarks.” I am not convinced that the technique outperforms the baselines. Their technique appears to achieve higher results on the two metrics that cannot be used by approaches without a decoder or transport mechanism; however, there does not appear to be a significant difference in either the standard deviation or the mean value. No statistical significance analysis is included elsewhere to verify these differences.
Questions for authors
Can the authors clarify whether the two presented theorems are their own original contributions? Could you please justify why you chose this specific validation protocol?
13 comments
continue
The main contribution of our work is the CvB (Conditioned Vector-Bundle Autoencoder) architecture, below we made a comparison table to show the novelty of CvB. The table is added in page 35 as Table 25.
| Capability | CvB (ours) | FibeRed | Chart-AE | AE / VAE | UMAP / PaCMAP |
|---|---|---|---|---|---|
| Decoder (reconstruction, decoded interpolation) | ✓ | ✗ | ✓ | ✓ | ✗ |
| Learned transport | ✓ | ✗ | ✗ | ✗ | ✗ |
| Base/fiber split with probes | ✓ | ✗ | ✗ | ✗ | ✗ |
| Identity-preserving fiber transfer + composition | ✓ | n/a | n/a | n/a | n/a |
| Ground-truth parallel-transport recovery (Appendix D) | ✓ / | n/a | n/a | n/a | n/a |
| MGDE, MNIST latents (lower better) | 0.370 | 0.205 | 0.887 | 0.323 (AE) | — |
| RTD, MNIST latents (lower better) | 26.8 | 50.3 | 103.6 | 141.4 (AE) | — |
| Clustering ARI, MNIST | 0.511 (best with decoder) | 0.389 | 0.348 | 0.422 (AE) | 0.667 (no decoder) |
| Reconstruction MSE, test | 0.0398 | n/a | 0.0151 | 0.0216 (AE) | n/a |
Our contributions are: (1) We propose CvB, an autoencoder whose latent space is a base chart for manifold location, a conditioned fiber for local variation, and a learned transport map that connects fibers (the connection). The contribution is the network, not the theory: the flatness equivalence and the identity-transport limit are existing classical results (Theorems 3.1 and 3.2, stated with references in Section 3); we use them as design criteria and inspiration, and we test the value of base-conditioning under an active connection directly. (2) An active connection. We show the learned transport is non-trivial and has a measurable effect: under identical architectures, removing the alignment objective reduces transport consistency (from to ) and removes the base/fiber separation. (3) A decodable bundle latent. Unlike non-parametric embeddings or geometry-specialized baselines, CvB provides a single parametric autoencoder for clustering, decoded interpolation, and a probed base/fiber split, at a constant $\sim$3$\times$ per-epoch overhead over a matched flat autoencoder. (4) Empirical evaluation. On the image benchmarks we test, CvB attains the highest clustering ARI among the parametric methods we compare and preserves the intrinsic topology of MNIST latents substantially better than matched flat autoencoders; on ambient interpolation it is competitive but not the best, and we report that tradeoff explicitly.
We have also included the following references, in addition to the references you mentioned, and appended them to Section 3 (Background), where they are related to the theorem.
Cogliati, A. (2016). Schouten, Levi-Civita and the notion of parallelism in Riemannian geometry. Historia Mathematica, 43(4), 427–443. do Carmo, M. P. (1993). Riemannian geometry (F. Flaherty, Trans.). Birkhäuser.
Husemöller, D. (1966). Fibre bundles (Vol. 5). Springer.
Joyce, D. D. (2007). Riemannian holonomy groups and calibrated geometry (Vol. 12). Oxford University Press.
Marle, C.-M. (2007). The works of Charles Ehresmann on connections: From Cartan connections to connections on fibre bundles. Banach Center Publications, 76, 65–86.
Petersen, P. (2016). Riemannian geometry (3rd ed., Vol. 171). Springer.
Steenrod, N. E. (1999). The topology of fibre bundles (Vol. 14). Princeton University Press.
Weatherburn, C. E. (1928). On Levi-Civita's theory of parallelism. Bulletin of the American Mathematical Society, 34(5), 585–590.
Please check. Paragraph in Section 3 (Background) with blue mark; pages 3-4. page 35 Table 25.
continue
Q2. Presentation, structure, and terminology (CW1)
Response. Thank you for your comment, we have restructured the manuscript, and revised the introduction to make the motivation and contribution clear.
-Added in main draft-(Section 1 Introduction; page 2; copied part): Paper organization: Section 2 positions CvB relative to flat, topological, non-parametric, and bundle-structured methods. Section 3 introduces the bundle objects and states the two classical facts used later. Section 4 describes the proposed architecture and objective. Section 5 reports the empirical evaluation; the geometric verification of the learned bundle is in Appendix \B. Mathematical statements and background are confined to Section 3 and Appendices H-I; the remaining appendices contain full experimental tables, figures, and diagnostics, which are cited as 'Appendix Table' or ``Appendix Figure'' in the main text.
-Revised paragraph -(Section 1 Introduction; page 1; copied part) Many tasks that use a learned representation---interpolating between inputs, transferring the style of one object onto the identity of another, and sampling new examples---require its latent space to encode two things: where an example lies among its neighbors, and how it can vary without leaving the data manifold. Autoencoders \cite{pinaya2020autoencoders} and variational autoencoders \cite{kingma2013vae} give smooth, decodable latents, but they treat the latent space as a single flat vector space. In this space every dimension is a global coordinate, so the model can neither separate where an example sits on the manifold from how it varies locally, nor describe how a local feature changes as it moves between regions. The cost is measurable: on image data, a matched flat autoencoder distorts the intrinsic topology of its own latents about 5$\times$ more than our model, and the interpolants it decodes cut straight through ambient space instead of staying on the manifold surface.
-Revised paragraph -(Section 1 Introduction; page 1; copied part) On manifold-structured data \cite{bronstein2017geometric}, this limitation is inherent: the quality of a representation depends on geometry, and a flat latent space cannot encode it. We need a representation with three properties: it must capture geometry, be decodable by a parametric decoder, and support learned transport between regions. Prior work offers at most two of the three. Non-parametric embeddings \cite{mcinnes2018umap,wang2020pacmap} capture geometry but have no encoder or decoder; chart atlases \cite{chen2022chart,schonsheck2022semi} give a parametric autoencoder but no transport between charts; and FibeRed \cite{scoccola2022fibered} provides bundle geometry but is non-parametric, with no decoder or learned transport. Section 2 compares these approaches in detail. CvB is designed to provide all three together.
In addition, the informal phrasing has been removed; we have revised the duplicated passages part, experiment reorganization;
Please check. Paper organization paragraph Sec. 1 page 2; Sec. 3 Background pages 3-4; Appendices H–I pages 31-32.
Response letter
We thank you for the review. The response follows your four comments on weaknesses and two questions in order. The updated table and page numbers refer to the revised draft.
Q1. Are Theorems 3.1 and 3.2 your own original contributions, and is the structure clear?
Response. We sincerely apologize for accidentally missing the references. Although this should not be considered an excuse, it was a strange and unintended oversight.
Theorems 3.1 and 3.2 in Section 3 ("Background: Data Manifolds as Vector Bundles") are not our contribution.** Our proposal/work starts in Section 4** ("The Conditioned Vector Bundle Network"). We use the theorems as the starting point and as the criteria that define and motivate the CvB (Conditioned Vector-Bundle Autoencoder) architecture. We sincerely hope you could reconsider our work, we listed our contribution as below. Thank you very much.
We revised Section 3 (Background section as below). In addition to the references you mentioned, we included further references for Theorems 3.1 and 3.2 within the theorem statements.
Added in main draft-(Section 3 Background; page 3-4; copied part) Both statements are classical and are included for completeness, not as novel theoretical contributions. Theorem 3.1 is the standard equivalence between flatness, path-independent parallel transport, vanishing holonomy, and local triviality of a vector bundle; it is the content of the Ambrose--Singer holonomy theorem \cite{ambrose1953theorem} together with the standard transition-function formulation of connections \cite{kobayashi1996foundations,lee2018introduction,Kineider2026} (see in particular Theorems 4.29--4.30 of \cite{Kineider2026} on flat bundles, locally constant transition functions, and the Riemann--Hilbert correspondence). Theorem3.2 is the elementary statement that a parallel section of a trivial bundle with the trivial connection is locally constant. We give short proofs in Appendices H and I because we use both statements as operational criteria; the paper's contribution is the architecture that instantiates them and the experiments that test it, not the theorems themselves. We refer the reader to the cited texts for the full theory and do not extend it here.
Added in main draft-(Section 3 Background; page 4; copied part) The following classical fact from the standard theory of connections and transition functions \cite{lee2018introduction, kobayashi1996foundations} underpins our diagnostics. For the transition-function and cocycle formulation see \cite{steenrod1999topology, husemoller1966fibre}; for the equivalent flatness, holonomy, and path-independence formulations see \cite{docarmo1992riemannian, petersen2016riemannian, joyce2007riemannian}.
Added in main draft-(Section 3 Background; page 4; copied part) The elementary fact that parallel sections of a trivial bundle with the trivial connection are locally constant is standard \cite{kobayashi1996foundations,lee2018introduction,docarmo1992riemannian,petersen2016riemannian,joyce2007riemannian}. We show that in this identity-transport limit such a representation cannot organize base-local information in the fiber through the alignment objective. We stress the scope of the statement up front: