Publications

CulturalRiddles: A Multicultural Benchmark of Riddles
EMNLP 2026 MRL;  Tianyi Hu, Henry Gagnier, Vinod Anbalagan, including Christian Hoang
paperpaper & launch blogdatasetquizhuman-interest blogvisual assetsX postLinkedIn post
CulturalRiddles figure showing riddle construction, human-in-the-loop evaluation, and model accuracy differences across cultures
As LLMs become more multilingual, benchmarks still need to capture the diversity of cultures around the globe. We introduce a benchmark of culturally grounded riddles spanning 61 cultures and 51 languages, created through a participatory community effort. Solving them requires factual, linguistic, and social knowledge, along with abductive reasoning. We evaluate 28 LLM configurations, from 0.8B to 1.6T parameters, on 170,520 model answers using exact-match rules, native-speaker review, and an LLM jury. The best model reaches 79% overall, yet no more than 22% in some communities; models hallucinate on 24% of answers while responding “I don’t know” on 0.8%. The benchmark is now live. Interested in contributing or researching? Start with the dataset and quiz, and use #culturalriddles when sharing related posts.
One Head Away from Language Confusion: Single Attention Heads Across Model Families
Ongoing;  Jiwon Jeong, Anjelo Jann Laroza, Chaewoon Yoon, Arjun Pillai, Pranav Kokati, Christian Hoang, Seunghyeok Hong
papercode & results
Workflow for testing language confusion: compare intact and target-head-ablated prompts, screen attention heads, then evaluate and analyze language behavior
Large language models sometimes reply in an unexpected language, a failure known as language confusion. We ablate individual attention heads in 12 model checkpoints spanning seven model series, using FLORES-200 continuations in five languages and Language Confusion Benchmark (LCB) chat replies. In ten models, zeroing one head causes substantially more departures from the expected language than zeroing any other head in its layer; its LCB pass-rate drop persists, though reduced, under mean ablation. Seven heads move 8.0 to 51.5 percent of all FLORES continuations out of the prompt's language, versus at most 1.4 percent for other same-layer heads; the other three mainly affect explicitly requested languages. These seven heads matter less in base models given plain text. In two models, replacing the values a head reads at the requested-language name with another language's mean makes replies fail and shifts some into that language, unlike a random change of equal size. Replacing a head's output with another language's mean redirects 84 to 99 percent of scored non-English monolingual LCB replies into that language in five models. Yet the requested language's mean improves crosslingual replies beyond every control head only in the two Gemma models, whose baselines are low. Code and results are available in the public repository.
FTB Graph: Determining and Validating First-token Broadcasters and Language-Identity Head Circuits in Multilingual Language Models
Ongoing;  Arjun Pillai, Christian Hoang, Anjelo Laroza
paper
FTB Graph pipeline for discovering and validating first-token broadcasting circuits
Large language models must choose a response language early, but the causal circuitry behind this decision is poorly understood. We map first-token language-broadcasting circuits across six GPT-2, BLOOM, Pythia, and Qwen2.5 models using Edge Attribution Patching followed by exact activation-patching verification. The resulting graphs reveal deep-layer broadcasting hubs, greater topological sparsity as Pythia scales from 1B to 2.8B, and 84.7% structural overlap between Qwen base and instruct models, suggesting that routing circuits are largely established during pre-training. Weak agreement between attribution scores and exact causal effects further shows why exact patching is essential for reliable circuit discovery.
Fallacy Benchmarks Measure Scheme Recognition, Not Fallacy Detection
Ongoing;  Navyansh Singh, Animesh Pathak, Aarav Singh, Christian Hoang
paper
Fallacy-detection benchmarks pair fallacy classes with a single “valid” or “none” class that takes everything data collection did not label as a fallacy. A detector has two jobs, deciding whether an argument is fallacious and naming which fallacy it commits, and the false-positive rate is meant to measure the first. We show that what these benchmarks actually score is scheme recognition, the ability behind the second job. Their own test sets already show it: when a classifier misses a fallacy, the error lands on “none” rather than on another fallacy type, so detection is failing while classification holds. The reason is what the valid class lacks. The negatives that separate the two jobs are correct arguments using the same argumentation scheme as a fallacy, and they are scarce: nearly absent from the four benchmarks we examined, and rare even under deliberate search. A detector is therefore never tested where recognizing a scheme and judging its use come apart, and can pass on recognition alone. We construct the missing arguments, together with a control condition from the same pipeline that differs only in scheme, so whatever generation contributes, it contributes to both. The classifier labels the scheme-matched negatives as the source fallacy, and labels the wrong-scheme negatives as the scheme they actually use 85.9% of the time and as the source type 0.4%. The classifier has learned which scheme an argument uses, not whether it uses it correctly. The over-flagging follows: a model that scores 16.6% on CoCoLoFa’s own valid class flags 58.9% of the constructed arguments. The same dissociation appears in three zero-shot LLM detectors that never saw these benchmarks. We release the items as Scheme Foils. A reported false-positive rate should not be trusted as a measure of detection until the valid class has been audited for scheme-matched coverage.
Meddies-PII: A Multilingual Framework for Personally Identifiable Information Extraction in Clinical De-identification
Ongoing;  Le Linh Uyen, Christian Hoang, Ha Huy Hoang
paperdemodatasetmodel
Meddies-PII generation and verification pipeline
Clinical de-identification depends on accurately identifying personally identifiable information (PII). However, manually annotated datasets are costly to build, and existing synthetic alternatives often provide limited generation details or use relatively simple synthesis strategies. We introduce Meddies-PII-Dataset, which contains one million synthetic clinical documents across seventeen languages and nine PII labels. Attribute-conditioned prompts generate the documents, and thirteen deterministic gates check their structural and annotation validity. To assess the dataset’s utility, we train Meddies-PII-Model, a BIOES token classifier. We compare it with existing PII extraction systems using exact-match entity-level F1. Meddies-PII-Model achieves the highest score among the evaluated systems on all reported benchmarks, with a mean F1 of 0.827 across fifteen external benchmarks compared with 0.658 for the strongest baseline. Upon acceptance, we will publicly release the dataset, benchmark, model, generation framework, and evaluation code to support research on multilingual clinical de-identification.
Last Translation Benchmark
Ongoing;  Vilém Zouhar, Niyati Bafna, Mukund Choudhary, including Christian Hoang
paperdatasetleaderboardwebsitecodeemail
Last Translation Benchmark project visual
For scientific progress, we need benchmarks that test the limits of state-of-the-art models, and evaluation methods that inform us about failure cases. As models get stronger, standard benchmarks for machine translation are approaching saturation. Further, automatic translation metrics are unreliable, vulnerable to reward-hacking and provide unactionable assessments. Even gold human evaluation is not problem-free, because it often lacks reproducibility, objectivity, and scalability. Overall, this prevents us from tracking objective progress in the field and identifying pathways for improvement. We introduce the Last Translation Benchmark, a collection of human-authored and peer-reviewed examples (texts, images, audio, videos) that break leading machine translation models. We also present a new evaluation approach: each example comes with handcrafted verification rules describing concrete failure cases on that example, therefore allowing reliable and actionable future evaluation. The Last Translation Benchmark is a live dataset that accepts ongoing contributions. The latest version is LTBv1, containing accepted contributions prior to September 1st 2026, with future releases planned as new data is continuously collected.
How Perturbations Propagate: A Multi-Level Analysis of Robustness in Large Language Models
NeurIPS 2026 Workshop InterpScience;  Dun Li Chan, Emily Liu, Niyathi Allu, Christian Hoang
papercode
Heatmaps showing perturbation propagation across layers
Language models encounter typos, corrupted text, altered words, and disrupted token order, yet robustness is usually evaluated only through output behavior. We study how six naturalistic and synthetic input perturbations propagate through decoder-only language models at three levels: output behavior, hidden-state geometry, and attention-head function. We evaluate behavioral effects across four GPT-2 and two Qwen2.5 checkpoints by analyzing layerwise geometry using centered kernel alignment and intrinsic dimension, and examine attention-head responses in GPT-2. Perturbation types produce distinguishable metric profiles that are not fully captured by output measures and are only partly consistent across the tested checkpoints. Copying scores are especially associated with activation-patching recovery under token substitution and shuffling. Gradient-guided HotFlip perturbations also cause stronger behavioral and representational disruption than rate-matched random token substitutions in GPT-2; their behavioral effects are consistent across all six tested checkpoints. Our results show that robustness claims based on a single behavioral or representational metric can be misleading, and motivate multi-level evaluation of how perturbations alter language-model computation.