Latent Space Translation via Semantic Alignment

While different neural models often exhibit latent spaces that are alike when exposed to semantically related data, this intrinsic similarity is not always immediately discernible. Towards a better understanding of this phenomenon, our work shows how representations learned from these neural modules can be translated between different pre-trained networks via simpler transformations than previously thought. An advantage of this approach is the ability to estimate these transformations using standard, well-understood algebraic procedures that have closed-form solutions. Our method directly estimates a transformation between two given latent spaces, thereby enabling effective stitching of encoders and decoders without additional training. We extensively validate the adaptability of this translation procedure in different experimental settings: across various trainings, domains, architectures (e.g., ResNet, CNN, ViT), and in multiple downstream tasks (classification, reconstruction). Notably, we show how it is possible to zero-shot stitch text encoders and vision decoders, or vice-versa, yielding surprisingly good classification performance in this multimodal setting.

Paper

Similar papers

Peer review

Reviewer zvRG8/10 · confidence 3/52023-06-12

Summary

This work proposed a method to translate learned representations between two pre-trained networks, using surprisingly simple transformations. The method is demonstrated on models with different architectures, trained on different modalities and across different tasks.

Strengths

1. The paper is well written and easy to follow. 2. To my understanding, the discussed setting where models are ad-hoc zero-shot stitched, as opposed to being trained to have compatible representations is original. This distinction is important as it makes the approach applicable for the myriad of pre-trained models that already exist. 3. The method is surprisingly simple and yet produces very convincing results as demonstrated through sufficient evaluation.

Weaknesses

1. The exact setting leading to Figure 2 is not clear. Caption mentions results being produced on “CIFAR-100”. However, I was not able to find the entire setting. What two models were used? Are both trained on CIFAR-100? What are the architectures used? Are reported results averaged across multiple settings? 2. Also regarding Figure 2 - the two trends not being monotone is surprising to me. Especially the very clear outliers. I suppose this behavior might occur if each point represents a single experiment and some randomness might affect performance. In that case, it would probably be better to average these results across several experiments as done in other tables in the paper. Can the authors explain this behavior? Minor comments: 1. Typo line 49 - mphasizing -> emphasizing. 2. Notation line 139 - $\mu$ is used in equation 3 but $\bar{x}$ in text. 3. Clarity line 167 - I suggest the “naive absolute baseline” should be concisely explained.

Questions

See questions mentioned in the Weaknesses section.

Rating

8: Strong Accept: Technically strong paper, with novel ideas, excellent impact on at least one area, or high-to-excellent impact on multiple areas, with excellent evaluation, resources, and reproducibility, and no unaddressed ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

4 excellent

Contribution

4 excellent

Limitations

Yes.

Reviewer rL3F6/10 · confidence 4/52023-07-05

Summary

In this paper the authors propose to translate latent space using an effectively angle-preserving affine transformation learned using pairs as anchors. Experiments are conducted on a wide range of tasks showing the okay performance by the swap-in latent space of embeddings/features.

Strengths

**Strengths** The authors have taken an extensive suite of experiments encompassing a diverse set of tasks, including cross-training, cross-architectures, and several downstream tasks. The experimental design demonstrates a comprehensive approach in assessing the proposed method *per se*. Furthremore, this work shows that aligning two latent spaces with zero-shot stitching is poissible without any retraining. This is an important observation and the proposed method could benefit a wide range of downstream tasks.

Weaknesses

**Weaknesses** The following concerns regarding the design of the transformation and its intrinsic limitation warrant consideration. - **Assumption of Linearity and Lack of Analysis in Generative Model**: The proposed method is effectively an angle-preserving affine transformation, which fundamentally assumes linearity of mapping between two latent spaces (of embeddings and/or features). While "linearity of the transformation between seemingly different latent spaces has a theoretical foundation in research on identifiability in neural models," as the author pointed out in the rebuttal, in the context of generative model, the efficacy is still likely contingent on the extent to which two latent spaces exhibit linear mapping, because a good generative model may fill the slight mismatch with its own capacity. In detail, it is likely that an affine transformation may yield only a coarse mapping between two latent spaces, and may not capture fine-grained relations (consider style transfer in generative models). Thus, the good performance in classification tasks may thus be attributed to the capacities of the downstream models rather than the transformation itself. This is a critical assumption that necessitates further scrutiny, but the submission does not provide an in-depth analysis of this assumption. In the current form of the manuscript, for this regard only an autoencoding on MNIST/Fashion MINIST/CIFAR is shown. It does not have a qualitative comparison with the reconstruction from VAE itself, nor quantitative/qualitative results with other stitching and zero-shot methods. The lack of such comparison can unfortunately weaken the justification of the proposed method. Adding such comparison is thus suggested. Optionally, conducting such comparisons on common image datasets of higher resolution, like CelebA, ImageNet, (with more powerful VAE models) may provide more insight in this regard, since it may potentially highlight the capacity of VAE models and the quality of latent space alignment. (**After author response**: See the discussion below) - **Ambiguity in Technical Contribution**: The technical novelty and significance of the proposed method remain unclear. The method effectively is an angle-preserving affine transformation. While this per se is not necessarily an issue, the missing studies mentioned above make it hard to assess the impact and implications of the proposed method. (**After author response**: This is not a major issue anymore, see the discussion below) - ** Position of Works within the Broad Field**: Latent space matching has been the subject of extensive research, albeit in varying contexts such as text, image processing, and generative models. A few (it's even not an attempt to cover the overall picture of this widely studied topic) works below in References that share technical similarity with the proposed method are cited in the References. However, the submission does not include a substantive comparison or discussion with a wide body of works in this field, mkaing it challenging to ascertain the relative standing and uniqueness of the proposed method. (**After author response**: This is not a major issue anymore, see the discussion below) **References**: - Set Prediction in the Latent Space https://proceedings.neurips.cc/paper/2021/hash/d61e9e58ae1058322bc169943b39f1d8-Abstract.html - Formality Style Transfer with Shared Latent Space https://aclanthology.org/2020.coling-main.203.pdf - Homomorphic Latent Space Interpolation for Unpaired Image-To-Image Translation https://openaccess.thecvf.com/content_CVPR_2019/html/Chen_Homomorphic_Latent_Space_Interpolation_for_Unpaired_Image-To-Image_Translation_CVPR_2019_paper.html **Updates** - The previous version of this review mistakenly refer to the page limit. As the authors and the AC pointed out, this is NOT the case and has been corrected. - In Weakness, update the Assumption of Linearity to focus on the generative model. - Added reference to discussion below. - The rating has been increased.

Questions

N/A

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.

Soundness

3 good

Presentation

3 good

Contribution

3 good

Limitations

Yes

Reviewer NjdJ5/10 · confidence 3/52023-07-06

Summary

This article proposes a method of latent space translation through semantic alignment, using the similarity of latent spaces learned by different neural models on semantically similar data. The method allows for direct conversion of learned representations between different pre-trained networks, and achieve zero-shot stitching of encoders and decoders without additional training. The method is widely validated in various experimental settings, tasks (classification and generation), and modalities, demonstrating the ability to zero-shot stitch neural models under different architecture and modality changes.

Strengths

1. The paper proposes a method for the zero-shot stitching between encoders and decoders on various tasks, enabling seamless integration without the need for additional training. 2. Compared to previous methods, this article expands to different latent space dimensions, architectures, and modalities. 3. Extensive set of experiments have been done to show the possibility to zero-shot together neural models across different architectural and modalities.

Weaknesses

1. In the experiment, only the most basic abs method is compared, but no comparison is made with other methods. 2. In the generation task, zero-shot stitching is performed under the same model framework and training data. Whether it is more practical to migrate between different model frameworks and training data?

Questions

1. How much performance difference is there between the proposed zero-shot stitch method and concatenation followed by finetuning? 2. How is the selection of anchor points determined, and how much impact does different selection have on performance? 3. In experiments, zero-shot stitch is performed between different frameworks on the same dataset. So, can this method be effectively used for neural frameworks trained on different domain datasets?

Rating

5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

2 fair

Contribution

2 fair

Limitations

Yes

Reviewer ivQN6/10 · confidence 3/52023-07-06

Summary

This paper show the latent space of different pretrained models can be translated between each other with simple transformations by using anchors. By using this method, a variety of encoders architectures are able to be cross-stiched to different classifier heads or within autoencoding models.

Strengths

This paper tackles an interesting problem for how to semantically align different trained latent spaces. The paper is a natural extension to Moschella et. al 2023, going from just relative encoding to full latent space transformations. The results are clear in showing zero-shot stitching is possible without retraining the decoders

Weaknesses

It wasn't clear on my first read of the paper that this work is a direct follow up to Moschella et al. 2023. Without that context, the paper was very difficult to read the first time. After reading Moschella et al., I was better able to follow this proposed work. Multiple details are missing, such as the construction of the anchor set, which are glossed over in this work and caused confusion on the zero-shot nature of this work. Another major missing key detail is that prior work's decoders must work on the relative embedding, this crucial detail was not clear until after multiple read throughs. This improvement should be front and center. I find it surprising that tables 1 and 2 do not report Moschella's results. I realize that the decoders must be trained with the relative embeddings, but the lack of comparison feel likes an obfuscation rather than a highlight of the difference between methods. Overall, I find the clarity of the paper to be a major hinderance.

Questions

None

Rating

6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.

Confidence

3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.

Soundness

3 good

Presentation

1 poor

Contribution

3 good

Limitations

Yes

Reviewer zvRG2023-08-13

Thanks for the rebuttal! It addresses the comments I've raised in my review.

Reviewer rL3F2023-08-15

I would like to first thank the authors and the AC for pointing out the page-limit. I Also appriciate the authors' clarification on linearity and zero-shot stitching, and agree with that. Both have been reflected in the revised review. My concern on assumption of linearity and lack of analysis is on generative models. While it's clear, as the authors pointed out, that for calcification tasks linearity of representation has been identified with theoretical foundation, I'm still not fully convinced of the degree of such a case for generative models. Please see the revised review for details on this regard.

Authorsrebuttal2023-08-18

We thank the Reviewer for taking the time to reconsider their evaluation and adjust their review, particularly concerning page limit, linearity, and zero-shot stitching. We respectfully reiterate our answer to the *concern of Insufficient Comparison with Works within the Broad Field*. We will be happy to discuss the references provided by the Reviewer in the related work section. However, we still consider them out-of-scope for an experimental comparison: **the referenced methods require the enforcement of additional constraints during training.** In contrast, **our post-hoc method can be applied directly to pre-trained models**. Regarding the *assumption of linearity in generative models*: There is a large collection of results in the literature on the identifiability of generative models with auxiliary information [b, c, d, e, f, g, h, i]. When this side information is not available, it is not possible to have strict theoretical guarantees, as shown in [a] and [m]. However, a recent line of work demonstrated that it is possible to have the same characterization in unsupervised generative models, either by providing experimental evidence  [Moschella et al 2022, p], via measuring high identifiability scores for unsupervised generative models [n] or by providing theoretical evidence with a weaker notion of identifiability [p,o], but no auxiliary information. Our experimental assumptions are supported by these findings, suggesting that **in most cases** it is possible to connect latent spaces of generative models via simple transformations. We believe that our method's simplicity is a strength, not a weakness, of our work. The novel insights and practical applicability of our findings contribute to advancing the field, and we are committed to sharing this knowledge with the community. Once again, we thank the Reviewer for their valuable feedback and remain available to address any additional queries. **[a]** Francesco Locatello, Stefan Bauer, Mario Lucic, Gunnar Rätsch, Sylvain Gelly, Bernhard Schölkopf, Olivier Bachem. Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations. ICML 2019 **[b]** A. Hyvärinen, H. Sasaki, and R. E. Turner. Nonlinear ICA Using Auxiliary Variables and Generalized. PMLR 2019 [**c**] P. Sorrenson, C. Rother, and U. Köthe. Disentanglement by Nonlinear ICA with General Incompressible-flow Networks (Gin). ICLR 2020 [**d**] Khemakhem, R. P. Monti, D. P. Kingma, and A. Hyvärinen. ICE-BeeM: Identifiable Conditional Energy-Based Deep Models Based on Nonlinear ICA. NeurIPS 2020 [**e**] A. Hyvärinen and H. Morioka. Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICA. NeurIPS 2016 [**f**] Locatello, Francesco, et al. "Weakly-supervised disentanglement without compromises." International Conference on Machine Learning. PMLR, 2020. [**g**] Locatello, Francesco, et al. "Disentangling Factors of Variation Using Few Labels”. ICLR 2020 [**h**] Khemakhem, Ilyes, et al. "Variational autoencoders and nonlinear ICA: A unifying framework." International Conference on Artificial Intelligence and Statistics. PMLR, 2020. [**i**] Von Kügelgen, Julius, et al. "Self-supervised learning with data augmentations provably isolates content from style.". NeurIPS 2021 [**l**] Zimmermann, Roland S., et al. "Contrastive learning inverts the data generating process." International Conference on Machine Learning. PMLR, 2021. [**m]** Hyvärinen, et al. "Nonlinear independent component analysis: Existence and uniqueness results." *Neural networks* 12.3 (1999): [**n]** Willetts, Matthew, and Brooks Paige. "I Don't Need u: Identifiable Non-Linear ICA Without Side Information." ArXiv [**o**] Barin-Pacela, Vitória, et al. "Identifiability of Discretized Latent Coordinate Systems via Density Landmarks Detection.". ICML Workshop on Structured Probabilistic Inference & Generative Modeling, 2023. [**p]** Asperti, et al. "Comparing the latent space of generative models." *Neural Computing and Applications* 35.4 (2023) [**q]** Kivva, Bohdan, et al. "Identifiability of deep generative models without auxiliary information." NeurIPS 2022

Reviewer ivQN2023-08-21

Thanks authors.

The extra context is great. The clarity issues seem to be due to my unfamiliarity, I will increase my score to weak accept. I still am a little concerned with the final framing, but that's not a content issue.

Program Chairsdecision2023-09-21

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC