Amr Mohamed
Author directory2026
CARVE: Verified Expansion for Variable-Length Generation in Diffusion Language Models
Wail Bouhedja | Amr Mohamed | Guokan Shang
Findings of the Association for Computational Linguistics: EMNLP 2026
Wail Bouhedja | Amr Mohamed | Guokan Shang
Findings of the Association for Computational Linguistics: EMNLP 2026
Masked diffusion language models offer bidirectional conditioning and parallel token refinement, but they inherit a rigid inference interface: the response canvas length is fixed before decoding begins. Choosing this length is difficult. A short canvas can truncate reasoning or code, while a long canvas wastes computation and can perturb denoising. We introduce CARVE (Counterfactual-Aware Reveal with Verified Expansion), a training-free variable-length algorithm for masked diffusion LMs. Instead of blindly expanding the canvas, CARVE branches into a candidate expanded canvas and asks a counterfactual question: would the model make the same predictions for the unresolved tokens if it had more room? The expansion is accepted only when the inserted masks induce low Jensen–Shannon divergence on aligned unresolved positions. This makes length growth a verified stability decision rather than a pure confidence heuristic. CARVE applies without retraining to both full-canvas and blockwise diffusion decoders. Across code generation and mathematical reasoning benchmarks, CARVE achieves the best or tied-best average performance across the evaluated model families, typically winning on three of four tasks per model, while often reducing inference cost and reaching roughly half the FLOPs of fixed-length decoding in some settings.
Markovian Generation Chains in Large Language Models
Mingmeng Geng | Amr Mohamed | Guokan Shang | Michalis Vazirgiannis | Thierry Poibeau
Findings of the Association for Computational Linguistics: EMNLP 2026
Mingmeng Geng | Amr Mohamed | Guokan Shang | Michalis Vazirgiannis | Thierry Poibeau
Findings of the Association for Computational Linguistics: EMNLP 2026
The widespread use of large language models (LLMs) raises an important question: how do texts evolve when they are repeatedly processed by LLMs? In this paper, we define this iterative inference process as Markovian generation chains, where each step takes a specific prompt template and the previous output as input, without including any prior data. In iterative rephrasing and round-trip translation experiments, the output either converges to a small recurrent set or continues to produce novel sentences within a finite horizon. Through sentence-level Markov chain modeling and analysis of simulated data, we show that iterative process can either increase or reduce the diversity depending on factors such as the temperature parameter and the initial input sentence. These results offer valuable insights into the dynamics of iterative LLM inference and their implications for multi-agent LLM systems.
Fast-Decoding Diffusion Language Models via Progress-Aware Confidence Schedules
Amr Mohamed | Yang Zhang | Michalis Vazirgiannis | Guokan Shang
Findings of the Association for Computational Linguistics: ACL 2026
Amr Mohamed | Yang Zhang | Michalis Vazirgiannis | Guokan Shang
Findings of the Association for Computational Linguistics: ACL 2026
Diffusion large language models (dLLMs) offer a promising alternative to autoregressive models, but their practical utility is severely hampered by slow, iterative sampling. We present SchED, a training-free, model-agnostic early-exit algorithm that terminates diffusion decoding using a progress-aware confidence threshold. We evaluate SchED across multiple diffusion model families and a diverse set of benchmarks spanning multiple-choice, math, long-form QA, and translation. SchED delivers substantial acceleration: on instruction-tuned models, it achieves approximately 4× speedups while retaining baseline performance on average. On base models, SchED yields consistent speedup gains with 99.1–100% performance retention, with up to 2.34× under more aggressive settings. Under a conservative quality–penalized speed metric, SchED consistently outperforms prior confidence-based early-exit methods, including on long-form generation where existing approaches tend to break down. An entropy analysis of the model’s token predictions reveals that instruction tuning speeds up the decay of predictive entropy. By leveraging inherent confidence stabilization as a signal for computational efficiency, SchED provides a robust framework for efficient dLLM inference.
Jais 2: A Family of Arabic-Centric Open Large Language Models
Mohamed Anwar | Abed Alhakim Freihat | George Ibrahim | Mostafa Awad | Abdelrahman Sadallah | Gurpreet Gosal | Gokulakrishnan Ramakrishnan | Sarath Chandran | Biswajit Mishra | Rituraj Joshi | Ahmed Frikha | Etienne Goffinet | Abhishek Maiti | Ali El Filali | Sarah AlBarri | Samujjwal Ghosh | Rahul Pal | Parvez Mullah | Awantika Shukla | Sajid Siddiki | Samta Kamboj | Onkar Pandit | Sunil Kumar Sahu | AbdelRahman Elbadawy | Amr Mohamed | Ahmad Chamma | Evan Dufraisse | Abdelaziz Bounhar | Dani Bouch | Hadi Abdine | Guokan Shang | Fajri Koto | Yuxia Wang | Zhuohan Xie | Ali Mekky | Rania Elbadry | Sarfraz Ahmad | Momina Ahsan | Omar El Herraoui | Daniil Orel | Hasan Iqbal | Kareem Elzeky | Mervat Abassy | Kareem Elozeiri | Saadeldine Eletter | Farah Atif | Nurdaulet Mukhituly | Haonan Li | Xudong Han | Aaryamonvikram Singh | Zainul Abedien Ahmed Quraishi | Neha Sengupta | Larry Murray | Avraham Sheinin | Joel Hestness | Natalia Vassilieva | Hector Xuguang Ren | Zhengzhong Liu | Michalis Vazirgiannis | Preslav Nakov
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Mohamed Anwar | Abed Alhakim Freihat | George Ibrahim | Mostafa Awad | Abdelrahman Sadallah | Gurpreet Gosal | Gokulakrishnan Ramakrishnan | Sarath Chandran | Biswajit Mishra | Rituraj Joshi | Ahmed Frikha | Etienne Goffinet | Abhishek Maiti | Ali El Filali | Sarah AlBarri | Samujjwal Ghosh | Rahul Pal | Parvez Mullah | Awantika Shukla | Sajid Siddiki | Samta Kamboj | Onkar Pandit | Sunil Kumar Sahu | AbdelRahman Elbadawy | Amr Mohamed | Ahmad Chamma | Evan Dufraisse | Abdelaziz Bounhar | Dani Bouch | Hadi Abdine | Guokan Shang | Fajri Koto | Yuxia Wang | Zhuohan Xie | Ali Mekky | Rania Elbadry | Sarfraz Ahmad | Momina Ahsan | Omar El Herraoui | Daniil Orel | Hasan Iqbal | Kareem Elzeky | Mervat Abassy | Kareem Elozeiri | Saadeldine Eletter | Farah Atif | Nurdaulet Mukhituly | Haonan Li | Xudong Han | Aaryamonvikram Singh | Zainul Abedien Ahmed Quraishi | Neha Sengupta | Larry Murray | Avraham Sheinin | Joel Hestness | Natalia Vassilieva | Hector Xuguang Ren | Zhengzhong Liu | Michalis Vazirgiannis | Preslav Nakov
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Jais 2 is a family of open-weight, Arabic-centric large language models designed for strong Arabic performance and broad cultural coverage. The family includes, to our knowledge, the largest open Arabic-centric LLM trained from scratch, with 70B parameters, alongside an efficient 8B model. A custom Arabic-centric vocabulary supports efficient training and inference, while an optimized architecture and training recipe improve compute efficiency. Jais 2 achieves the highest scores on the Open Arabic LLM Leaderboard v2 (OALL2) and AraGen v1 among the evaluated open models, while remaining competitive on English benchmarks. It also obtains strong results in Arabic poetry, dream interpretation, translation, and summarization. On the IslamicQA domain, Jais 2-70B achieves the second-highest overall average among the evaluated large open models, while attaining the highest scores on PalmX and the held-out in-house IslamicQA benchmark. We release both model sizes as open-weights on Hugging Face under a commercially permissive license. Jais 2-70B is also available as a chat application on the Web, iOS, and Android, reaching inference speeds of up to 2,000 tokens per second on Cerebras hardware.
The Analyst in the Prompt: Role, Retrieval, and Memory Biases in LLM Financial Analysis
Ahmed Asaad | Amr Mohamed | Yang Zhang | Omneya Abdelsalam
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Ahmed Asaad | Amr Mohamed | Yang Zhang | Omneya Abdelsalam
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large Language Models (LLMs) use persistent user context such as memory, profiles, and role prompts. This enables personalization, but can destabilize evidence-based judgment: the same evidence may yield different conclusions under different user contexts. Finance offers a high-stakes long-document setting where evidence reading is central. We test this on 3,575 SEC filings across twelve models. By comparing persona-conditioned retrieval, neutral retrieval, and memory-framed context, we find that bias comes from how models interpret identical evidence under role-style context, not from which evidence they retrieve. As mitigation, user-memory framing of the same mindset and dual-output scoring reduce the effect, with model-specific effectiveness across models.
The Masked Advantage: Uncovering Local-Language Access to Cultural Knowledge in LLMs
Yang Zhang | Xiao Fei | Amr Mohamed | Sarah Almeida Carneiro | Mersin Konomi | Mingmeng Geng | Ahmed Asaad | Guokan Shang | Michalis Vazirgiannis
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yang Zhang | Xiao Fei | Amr Mohamed | Sarah Almeida Carneiro | Mersin Konomi | Mingmeng Geng | Ahmed Asaad | Guokan Shang | Michalis Vazirgiannis
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large language models are increasingly used to answer culturally grounded questions across languages, yet it remains unclear whether local cultural knowledge is better accessed through English or the local language. Existing evaluations face two key limitations: many rely on parallel template-based questions that may not reflect how cultural knowledge naturally appears, and raw accuracy conflates general language proficiency with language-conditioned knowledge access. We address these issues with a controlled framework built on real-world cultural questions collected from regional benchmarks and local sources. By crossing question type, culture-agnostic versus culture-specific, with query language, English versus local language, and estimating ability using a shared 1PL item response theory model, we separate proficiency from localized knowledge access. Across 13 locales and roughly 80 models, we find a consistent English advantage on culture-agnostic questions, indicating stronger English proficiency. However, after accounting for this proficiency gap, local languages show a positive knowledge-access advantage in nearly all locale–model settings. This advantage is often masked in raw accuracy but becomes more visible for frontier, regionally aligned, or language-adapted models. Our results suggest that weaker local-language performance does not necessarily imply weaker cultural knowledge; rather, local cultural knowledge may be more accessible through the local language but hidden by limited language proficiency.
Beyond Random Sampling: Efficient Language Model Pretraining via Curriculum Learning
Yang Zhang | Amr Mohamed | Hadi Abdine | Guokan Shang | Michalis Vazirgiannis
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Yang Zhang | Amr Mohamed | Hadi Abdine | Guokan Shang | Michalis Vazirgiannis
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers)
Curriculum learning—organizing training data from easy to hard—has improved efficiency across machine learning domains, yet remains underexplored for language model pretraining. We present the first systematic investigation of curriculum learning in LLM pretraining, with over 200 models trained on up to 100B tokens across three strategies: vanilla curriculum learning, pacing-based sampling, and interleaved curricula, guided by six difficulty metrics spanning linguistic and information-theoretic properties. We evaluate performance on eight benchmarks under three realistic scenarios: limited data, unlimited data, and continual training. Our experiments show that curriculum learning consistently accelerates convergence in early and mid-training phases, reducing training steps by 18-45% to reach baseline performance. When applied as a warmup strategy before standard random sampling, curriculum learning yields sustained improvements up to 3.5%. We identify compression ratio, lexical diversity (MTLD), and readability (Flesch Reading Ease) as the most effective difficulty signals. Our findings demonstrate that data ordering—orthogonal to existing data selection methods—provides a practical mechanism for more efficient LLM pretraining.
Lost in the Mix: Evaluating LLM Understanding of Code-Switched Text
Amr Mohamed | Yang Zhang | Michalis Vazirgiannis | Guokan Shang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Amr Mohamed | Yang Zhang | Michalis Vazirgiannis | Guokan Shang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Code-switching (CSW) is the act of alternating between two or more languages within a single discourse. This phenomenon is widespread in multilingual communities and increasingly prevalent online, exposing large language models (LLMs) to mixed-language inputs. We present a systematic evaluation of LLM comprehension under code-switching by generating linguistically grounded CSW variants of established benchmarks (Belebele, MMLU, XNLI) across five typologically diverse languages. Our contributions are: (i) a controlled pipeline for producing CSW test sets that respect linguistic constraints on code-switching; (ii) a multi-model, multi-language analysis showing that inserting non-English tokens into English consistently reduces accuracy on comprehension and reasoning benchmarks, whereas embedding English into non-English contexts often improves it; and (iii) a mitigation study contrasting in-context learning (ICL) with fine-tuning. Across model families, ICL cues yield inconsistent, and sometimes negative, effects, while fine-tuning on CSW data provides modest but reliable gains, partially recovering accuracy under CSW.
2025
Atlas-Chat: Adapting Large Language Models for Low-Resource Moroccan Arabic Dialect
Guokan Shang | Hadi Abdine | Yousef Khoubrane | Amr Mohamed | Yassine Abbahaddou | Sofiane Ennadir | Imane Momayiz | Xuguang Ren | Eric Moulines | Preslav Nakov | Michalis Vazirgiannis | Eric Xing
Proceedings of the First Workshop on Language Models for Low-Resource Languages
Guokan Shang | Hadi Abdine | Yousef Khoubrane | Amr Mohamed | Yassine Abbahaddou | Sofiane Ennadir | Imane Momayiz | Xuguang Ren | Eric Moulines | Preslav Nakov | Michalis Vazirgiannis | Eric Xing
Proceedings of the First Workshop on Language Models for Low-Resource Languages
We introduce Atlas-Chat, the first-ever collection of LLMs specifically developed for dialectal Arabic. Focusing on Moroccan Arabic, also known as Darija, we construct our instruction dataset by consolidating existing Darija language resources, creating novel datasets both manually and synthetically, and translating English instructions with stringent quality control. Atlas-Chat-2B, 9B, and 27B models, fine-tuned on the dataset, exhibit superior ability in following Darija instructions and performing standard NLP tasks. Notably, our models outperform both state-of-the-art and Arabic-specialized LLMs like LLaMa, Jais, and AceGPT, e.g., our 9B model gains a 13% performance boost over a larger 13B model on DarijaMMLU, in our newly introduced evaluation suite for Darija covering both discriminative and generative tasks. Furthermore, we perform an experimental analysis of various fine-tuning strategies and base model choices to determine optimal configurations. All our resources are publicly accessible, and we believe our work offers comprehensive design methodologies of instruction-tuning for low-resource languages, which are often neglected in favor of data-rich languages by contemporary LLMs.
Nile-Chat: Egyptian Language Models for Arabic and Latin Scripts
Guokan Shang | Hadi Abdine | Ahmad Chamma | Amr Mohamed | Mohamed Anwar | Abdelaziz Bounhar | Omar El Herraoui | Preslav Nakov | Michalis Vazirgiannis | Eric P. Xing
Proceedings of The Third Arabic Natural Language Processing Conference
Guokan Shang | Hadi Abdine | Ahmad Chamma | Amr Mohamed | Mohamed Anwar | Abdelaziz Bounhar | Omar El Herraoui | Preslav Nakov | Michalis Vazirgiannis | Eric P. Xing
Proceedings of The Third Arabic Natural Language Processing Conference
We introduce Nile-Chat-4B, 3x4B-A6B, and 12B, a collection of LLMs for Egyptian dialect, uniquely designed to understand and generate texts written in both Arabic and Latin scripts. Specifically, with Nile-Chat-3x4B-A6B, we introduce a novel language adaptation approach by leveraging the Branch-Train-MiX strategy to merge script-specialized experts, into a single MoE model. Our Nile-Chat models significantly outperform leading multilingual and Arabic LLMs, such as LLaMa, Jais, and ALLaM, on our newly introduced Egyptian evaluation benchmarks, which span both understanding and generative tasks. Notably, our 12B model delivers a 14.4% performance gain over Qwen2.5-14B-Instruct on Latin-script benchmarks. All our resources are publicly available. We believe this work presents a comprehensive methodology for adapting LLMs to a single language with dual-script usage, addressing an often overlooked aspect in contemporary LLM development.
LLM as a Broken Telephone: Iterative Generation Distorts Information
Amr Mohamed | Mingmeng Geng | Michalis Vazirgiannis | Guokan Shang
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Amr Mohamed | Mingmeng Geng | Michalis Vazirgiannis | Guokan Shang
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
As large language models are increasingly responsible for online content, concerns arise about the impact of repeatedly processing their own outputs.Inspired by the “broken telephone” effect in chained human communication, this study investigates whether LLMs similarly distort information through iterative generation.Through translation-based experiments, we find that distortion accumulates over time, influenced by language choice and chain complexity. While degradation is inevitable, it can be mitigated through strategic prompting techniques. These findings contribute to discussions on the long-term effects of AI-mediated information propagation, raising important questions about the reliability of LLM-generated content in iterative workflows.
Search
Fix author
Co-authors
- Guokan Shang 10
- Michalis Vazirgiannis 9
- Yang Zhang 5
- Hadi Abdine 4
- Mingmeng Geng 3
- Preslav Nakov 3
- Mohamed Anwar 2
- Ahmed Asaad 2
- Abdelaziz Bounhar 2
- Ahmad Chamma 2
- Omar El Herraoui 2
- Eric Xing 2
- Mervat Abassy 1
- Yassine Abbahaddou 1
- Omneya Abdelsalam 1
- Sarfraz Ahmad 1
- Momina Ahsan 1
- Sarah AlBarri 1
- Farah Atif 1
- Mostafa Awad 1
- Dani Bouch 1
- Wail Bouhedja 1
- Sarah Almeida Carneiro 1
- Sarath Chandran 1
- Evan Dufraisse 1
- Ali El Filali 1
- AbdelRahman Elbadawy 1
- Rania Elbadry 1
- Saadeldine Eletter 1
- Kareem Elozeiri 1
- Kareem Elzeky 1
- Sofiane Ennadir 1
- Xiao Fei 1
- Abed Alhakim Freihat 1
- Ahmed Frikha 1
- Samujjwal Ghosh 1
- Etienne Goffinet 1
- Gurpreet Gosal 1
- Xudong Han 1
- Joel Hestness 1
- George Ibrahim 1
- Hasan Iqbal 1
- Rituraj Joshi 1
- Samta Kamboj 1
- Yousef Khoubrane 1
- Mersin Konomi 1
- Fajri Koto 1
- Haonan Li 1
- Zhengzhong Liu 1
- Abhishek Maiti 1
- Ali Mekky 1
- Biswajit Mishra 1
- Imane Momayiz 1
- Eric Moulines 1
- Nurdaulet Mukhituly 1
- Parvez Mullah 1
- Larry Murray 1
- Daniil Orel 1
- Rahul Pal 1
- Onkar Arun Pandit 1
- Thierry Poibeau 1
- Zainul Abedien Ahmed Quraishi 1
- Gokulakrishnan Ramakrishnan 1
- Hector Xuguang Ren 1
- Xuguang Ren 1
- Abdelrahman Sadallah 1
- Sunil Kumar Sahu 1
- Neha Sengupta 1
- Avraham Sheinin 1
- Awantika Shukla 1
- Sajid Siddiki 1
- Aaryamonvikram Singh 1
- Natalia Vassilieva 1
- Yuxia Wang 1
- Zhuohan Xie 1