Nikolaos Xiros
Author directory2026
More Capable, Less Faithful: A Multilingual Analysis of Mathematical (Un)Solvability Detection in LLMs
Maria-Eleni Zoumpoulidi | Nikolaos Xiros | Georgios Paraskevopoulos
Proceedings of the 6th Workshop on Multilingual Representation Learning (MRL 2026)
Maria-Eleni Zoumpoulidi | Nikolaos Xiros | Georgios Paraskevopoulos
Proceedings of the 6th Workshop on Multilingual Representation Learning (MRL 2026)
Solvability detection is one of the most challenging aspects of mathematical reasoning for Large Language Models (LLMs). While prior work has studied this capability extensively, these analyses have been limited to English. Consequently, it remains unclear whether multilingual failures arise from differences in internal Solvability Belief or from language-dependent failures to express it. To address this gap, we introduce the first multilingual benchmark of paired solvable and unsolvable mathematical problems, extending ReliableMath to French and Greek. Using this, we train multilingual probes predicting Solvability Belief and analyze the solvability detection capabilities of state-of-the-art LLMs behaviorally, representationally, and in terms of faithfulness. We find that Solvability Belief is encoded as a largely universal, language-agnostic feature, and that higher-resource languages such as English, despite achieving stronger mathematical reasoning performance, exhibit lower solvability-detection faithfulness.
Beyond Magnitude: Contrastive Routing for Modular Mixture-of-Experts
Nikolaos Xiros | Dimitrios Damianos | Maria-Eleni Zoumpoulidi | Leon Voukoutis | Vassilis Katsouros | Georgios Paraskevopoulos
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Nikolaos Xiros | Dimitrios Damianos | Maria-Eleni Zoumpoulidi | Leon Voukoutis | Vassilis Katsouros | Georgios Paraskevopoulos
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
In current Mixture-of-Experts architectures, routing is performed based on representations dominated by structure shared across all tokens, limiting expert specialization. We show that contrasting each token against an Exponential Moving Average of the layer’s hidden states, rather than routing on absolute magnitude, concentrates the routing signal onto a low-dimensional, highly separable subspace. Building on this, we propose the Contrastive Routing Mechanism (CoRM), which scores each expert by the gap between its affinity for the incoming token and its affinity for this shared reference state, interpreted through a distinct per-expert projection. The resulting experts have routing boundaries that align with linguistic structure significantly more than the Top-k baseline. Our experiments show that CoRM improves average zero-shot accuracy by +0.67 to +1.69 points (Top-1) and +1.38 to +1.77 points (Top-2) over standard Top-k MoE baselines on nine zero-shot reasoning benchmarks, at the minimal cost of 2.9% added parameters and 2.6% added FLOPs per token.