Deploying high-dimensional Vision-Language Model (VLM) embeddings is computationally prohibitive. While Matryoshka Representation Learning (MRL) allows elastic truncation, standard MRL optimizes dimensional hierarchies semi-independently. This lack of cross-scale structural constraints creates a severe topological disconnect causing representational collapse at lower dimensions and introduces optimization trade-offs that compromise high-dimensional capacity. To solve this, we propose **M-VLM2Vec**, a framework that shifts MRL from a compromised hierarchy to a synergistic geometric structure. Without additional supervision, we integrate two novel constraints into the multimodal contrastive objective: (1) Laplacian spectral alignment to preserve the global manifold topology across scales, and (2) Stiefel-constrained orthogonal projection to bidirectionally align local contrastive landscapes. By allowing nested spaces to mutually regularize, M-VLM2Vec eliminates competing gradients, preventing ultra-low-dimensional collapse while yielding striking, consistent performance gains across all embedding scales on the Multimodal Embedding Benchmark (MMEB).

Neural topic models are widely used to uncover latent thematic structure in text corpora, but often produce topics with limited semantic coherence and weak alignment between topics and documents. Recent refinement approaches based on large language models (LLMs) have shown promising improvements, yet typically rely on repeated generative inference, resulting in high computational cost and practical issues such as sensitivity to prompting, stochastic variability, and the introduction of out-of-vocabulary content. We propose BERT-NTM, an encoder-based semantic refinement framework for neural topic modeling that avoids generative inference altogether. Instead of generating or rewriting topic words, BERT-NTM leverages a pretrained BERT encoder to provide discriminative semantic signals during a refinement phase: topic–word distributions are refined by scoring candidate words within a topic using masked language modeling, and document–topic representations are improved by aligning document embeddings with mixtures of topic embeddings via a Maximum Mean Discrepancy (MMD) objective. Both refinement components are fully parallelizable, stable, and operate strictly within the model vocabulary. Experiments on standard topic modeling benchmarks demonstrate that BERT-NTM consistently improves topic coherence and document–topic alignment while substantially reducing runtime and GPU memory usage compared to LLM-based refinement methods.

Weight-only post-training quantization (PTQ) for large language models (LLMs) typically ends with the projection of floating-point weights onto a uniform integer lattice, introducing structured output error due to non-zero activation means. Existing bias correction methods compensate for this shift by adding bias terms, which is incompatible with modern bias-less architectures such as LLaMA and Mistral and only addresses the error indirectly. We propose **Complementary Lattice Correction (CLC)**, a lightweight post-quantization method that corrects projection error directly on the integer lattice without modifying the model architecture. CLC performs a budget-constrained greedy descent that selectively flips quantized weights to adjacent lattice levels. We further show that CLC provably reduces the first-moment error and admits a worst-case bound on the layer-wise mean-squared error change, which certifies non-increase under a verifiable budget condition. Experiments across multiple models, quantizers, and bit widths show that CLC consistently improves perplexity and downstream accuracy with negligible overhead.

The integration of large language models (LLMs) into topic modeling has shown promise for improving topic interpretability and coherence, particularly by exploiting the generative capabilities of LLMs through instruction-based prompting. However, existing methods often incur substantial computational cost and inference complexity. To address these limitations, we propose **LLMFeed**, a novel framework that leverages **feed**back from an **LLM** to improve topic model optimization. Specifically, the LLM is used to **evaluate** topic quality, **identify** semantic meaning, and **recommend** representative topic words. These signals are then incorporated to (i) refine topic representations via Direct Preference Optimization (DPO), and (ii) guide contrastive learning for improved document-topic assignments. Extensive experiments show that **LLMFeed** achieves a 7.6% gain in topic coherence and over 10% improvement in doc-topic distributions on 20 Newsgroups dataset, while requiring only minutes to run, compared with hours for recent LLM-integrated topic modeling methods.

Adapting large vision–language models for embedding tasks (VLM2Vec) is standard practice, but distilling them into compact architectures remains challenging due to capacity mismatches in tokenization, dimensionality, and multimodal representations. To address this, we propose a robust distillation framework based on two complementary mechanisms: Principal Geometry Alignment (PGA) to stabilize training by aligning principal geometric components, and a Mutual Information Maximization objective to enforce global semantic consistency across intra- and inter-modal pairs. By jointly constraining geometric structure and semantic dependency, our method effectively mitigates model capacity discrepancies. Experimental results on the Massive Multimodal Embedding Benchmark (MMEB) across all four meta-tasks—under both In-Distribution and Out-of-Distribution settings—demonstrate that our approach consistently outperforms state-of-the-art distillation methods. Our source code is available at https://github.com/theanh-ktmt/PGA-KD.

Uncovering hidden topics from short texts is challenging for traditional and neural models due to data sparsity, which limits word co-occurrence patterns, and label sparsity, stemming from incomplete reconstruction targets. Although data aggregation offers a potential solution, existing neural topic models often overlook it due to time complexity, poor aggregation quality, and difficulty in inferring topic proportions for individual documents. In this paper, we propose a novel model, GloCOM (Global Clustering COntexts for Topic Models), which addresses these challenges by constructing aggregated global clustering contexts for short documents, leveraging text embeddings from pre-trained language models. GloCOM can infer both global topic distributions for clustering contexts and local distributions for individual short texts. Additionally, the model incorporates these global contexts to augment the reconstruction loss, effectively handling the label sparsity issue. Extensive experiments on short text datasets show that our approach outperforms other state-of-the-art models in both topic quality and document representations.

Recent advanced frameworks in topic models have significantly enhanced the performance compared to conventional probabilistic approaches. Such models, mostly constructed from neural network architecture together with other advanced techniques such as contextual embedding, optimal transport distance and pre-trained language model, etc. have effectively improved the topic quality and document topic distribution. Despite the improvements, these methods lack considerations of effective optimization for complex objective functions that contain log-likelihood and additional regularization terms. In this study, we propose to apply an efficient optimization method to improve the generalization and performance of topic models. Our approach explicitly considers the sharpness of the loss landscape during optimization, which forces the optimizer to choose directions in the parameter space that lead to flatter minima, in which the models are typically more stable and robust to small perturbations in the data. Additionally, we propose an effective strategy to select the flatness region for parameter optimization by leveraging the optimal transport distance between doc-topic distributions and doc-cluster proportions, which can effectively enhance document representation. Experimental results on popular benchmark datasets demonstrate that our method effectively improves the performance of baseline topic models.

Cross-lingual topic modeling aims to uncover shared semantic themes across languages. Several methods have been proposed to address this problem, leveraging both traditional and neural approaches. While previous methods have achieved some improvements in topic diversity, they often struggle to ensure high topic coherence and consistent alignment across languages. We propose XTRA (Cross-Lingual Topic Modeling with Topic and Representation Alignments), a novel framework that unifies Bag-of-Words modeling with multilingual embeddings. XTRA introduces two core components: (1) representation alignment, aligning document-topic distributions via contrastive learning in a shared semantic space; and (2) topic alignment, projecting topic-word distributions into the same space to enforce cross-lingual consistency. This dual mechanism enables XTRA to learn topics that are interpretable (coherent and diverse) and well-aligned across languages. Experiments on multilingual corpora confirm that XTRA significantly outperforms strong baselines in topic coherence, diversity, and alignment quality.

Recent advances in neural topic models have concentrated on two primary directions: the integration of the inference network (encoder) with a pre-trained language model (PLM) and the modeling of the relationship between words and topics in the generative model (decoder). However, the use of large PLMs significantly increases inference costs, making them less practical for situations requiring low inference times. Furthermore, it is crucial to simultaneously model the relationships between topics and words as well as the interrelationships among topics themselves. In this work, we propose a novel framework called NeuroMax (Neural Topic Model with Maximizing Mutual Information with Pretrained Language Model and Group Topic Regularization) to address these challenges. NeuroMax maximizes the mutual information between the topic representation obtained from the encoder in neural topic models and the representation derived from the PLM. Additionally, NeuroMax employs optimal transport to learn the relationships between topics by analyzing how information is transported among them. Experimental results indicate that NeuroMax reduces inference time, generates more coherent topics and topic groups, and produces more representative document embeddings, thereby enhancing performance on downstream tasks.