Neural Cellular Automata (NCAs) generate complex spatial patterns in vision by repeatedly applying a shared local rule to persistent cell states, combining local perception, weight-shared iteration, and gated in-place updates. We test this principle in language modelling with TextNCA, a 1D causal model in which token positions act as cells, windowed attention provides local perception, and a GRU-style gate updates their states. Its hierarchical variant cascades increasingly wide attention windows w ∈ 8,32,128 and reuses each stage’s parameters for T_s iterations. We train roughly 30M-parameter models on SlimPajama for 60k steps and evaluate on WikiText-103. TextNCA trails a similarly sized Transformer-6L (60.3 versus 52.8 best-run PPL), so we study it as an analytical probe rather than a performance alternative. Reordering or flattening the windows raises PPL by 16.7–70.8, whereas a non-iterating sliding-window Transformer preserving the staged order performs comparably across three seeds. These results identify the narrow-to-wide schedule as the dominant factor and provide no reliable evidence that iterated weight sharing improves perplexity at this scale. Intermediate-state analyses support a prepare-then-decode account in which early stages reorganise representations and the final wide stage performs most next-token loss reduction.

Ensembling neural machine translation (NMT) models to produce higher-quality translations than the L individual models has been extensively studied. Recent methods typically employ a candidate selection block (CSB) and an encoder-decoder fusion block (FB), requiring inference across all candidate models, leading to significant computational overhead, generally 𝛺(L). This paper introduces SmartGen, a reinforcement learning (RL)-based strategy that improves the CSB by selecting a small, fixed number of candidates and identifying optimal groups to pass to the fusion block for each input sentence. Furthermore, previously, the CSB and FB were trained independently, leading to suboptimal NMT performance. Our DQN-based SmartGen addresses this by using feedback from the FB block as a reward during training. We also resolve a key issue in earlier methods, where candidates were passed to the FB without modification, by introducing a Competitive Correction Block (CCB). Finally, we validate our approach with extensive experiments on English-Hindi translation tasks in both directions as well as English to Chinese and English to German.

Translating multi-word expressions (MWEs) and idioms requires a deep understanding of the cultural nuances of both the source and target languages. This challenge is further amplified by the one-to-many nature of idiomatic translations, where a single source idiom can have multiple target-language equivalents depending on cultural references and contextual variations. Traditional static knowledge graphs (KGs) and prompt-based approaches struggle to capture these complex relationships, often leading to suboptimal translations. To address this, we propose an IdiomCE, an adaptive graph neural network (GNN) based methodology that learns intricate mappings between idiomatic expressions, effectively generalizing to both seen and unseen nodes during training. Our proposed method enhances translation quality even in resource-constrained settings, facilitating improved idiomatic translation in smaller models. We evaluate our approach on multiple idiomatic translation datasets using reference-less metrics, demonstrating significant improvements in translating idioms from English to various Indian languages

Neural Machine Translation (NMT) systems face significant challenges when working with low-resource languages, particularly in domain adaptation tasks. These difficulties arise due to limited training data and suboptimal model generalization, As a result, selecting an optimal model for translation is crucial for achieving strong performance on in-domain data, particularly in scenarios where fine-tuning is not feasible or practical. In this paper, we investigate strategies for selecting the most suitable NMT model for a given domain using bandit-based algorithms, including Upper Confidence Bound, Linear UCB, Neural Linear Bandit, and Thompson Sampling. Our method effectively addresses the resource constraints by facilitating optimal model selection with high confidence. We evaluate the approach across three African languages and domains, demonstrating its robustness and effectiveness in both scenarios where target data is available and where it is absent.