Publications

REARANK: Reasoning Re-ranking Agent via Reinforcement Learning
Le Zhang
Bo Wang
Xipeng Qiu
Siva Reddy
Aishwarya Agrawal
We present REARANK, a large language model (LLM)-based listwise reasoning reranking agent. REARANK explicitly reasons before reranking, sign… (voir plus)ificantly improving both performance and interpretability. Leveraging reinforcement learning and data augmentation, REARANK achieves substantial improvements over baseline models across popular information retrieval benchmarks, notably requiring only 179 annotated samples. Built on top of Qwen2.5-7B, our REARANK-7B demonstrates performance comparable to GPT-4 on both in-domain and out-of-domain benchmarks and even surpasses GPT-4 on reasoning-intensive BRIGHT benchmarks. These results underscore the effectiveness of our approach and highlight how reinforcement learning can enhance LLM reasoning capabilities in reranking.
2025-10-31
Conference on Empirical Methods in Natural Language Processing (publié)
doi.org
arxiv.org
Reassessing Speech Translation for Low-Resource Languages: Do LLMs Redefine the State-of-the-Art Against Cascaded Models?
Jonah Dauvet
Min Ma
Jessica Ojo
David Ifeoluwa Adelani
2025-10-31
MRL @ International Conference on Learning Representations (publié)
doi.org
Simulate intelligently: Causal incremental reinforcement learning for streamlined industrial chemical process design optimization
Eslam G. Al-Sakkari
Ahmed Ragab
Mohamed Ali
Hanane Dagdougui
Daria C. Boffito
2025-10-31
Journal of Environmental Chemical Engineering (publié)
doi.org
The role of Large Language Models in IoT security: A systematic review of advances, challenges, and opportunities
Saeid Jamshidi
Negar Shahabi
Amin Nikanjam
Kawser Wazed Nafi
Foutse Khomh
Carol Fung
2025-10-31
Internet of Things (publié)
doi.org
Training of LLM-Based List-Wise Multilingual Reranker
Hao Yu
David Ifeoluwa Adelani
2025-10-31
Proceedings of the 5th Workshop on Multilingual Representation Learning (MRL 2025) (publié)
doi.org
WebMMU: A Benchmark for Multimodal Multilingual Website Understanding and Code Generation
Rabiul Awal
Mahsa Massoud
Aarash Feizi
Zichao Li
Suyuchen Wang
Christopher Pal
Aishwarya Agrawal
David Vázquez
Siva Reddy
Juan A. Rodriguez
Perouz Taslakian
Spandana Gella
Sai Rajeswar
We present WebMMU, a multilingual benchmark that evaluates three core web tasks: (1) website visual question answering, (2) code editing inv… (voir plus)olving HTML/CSS/JavaScript, and (3) mockup-to-code generation. Unlike prior benchmarks that treat these tasks separately, WebMMU unifies them using expert-annotated, real-world web data to assess models'abilities in complex multi-step reasoning, precise element grounding, and functional UI comprehension and coding. Our evaluation shows that while multimodal large language models (MLLMs) perform well on basic information extraction, they struggle with reasoning and grounding, editing code to preserve functionality, and generating design-to-code that maintains hierarchy and supports multilingual content. These findings reveal key limitations in current MLLMs and underscore the need for improved multimodal and cross-lingual reasoning to build future web agents capable of automating diverse web development tasks.
2025-10-31
Conference on Empirical Methods in Natural Language Processing (publié)
doi.org
openreview.net
Curly Flow Matching for Learning Non-gradient Field Dynamics
Katarina Petrovi'c
Lazar Atanackovic
Viggo Moro
Kacper Kapu'sniak
.Ismail .Ilkan Ceylan
Michael M. Bronstein
Avishek Bose
Alexander Tong
Modeling the transport dynamics of natural processes from population-level observations is a ubiquitous problem in the natural sciences. Suc… (voir plus)h models rely on key assumptions about the underlying process in order to enable faithful learning of governing dynamics that mimic the actual system behavior. The de facto assumption in current approaches relies on the principle of least action that results in gradient field dynamics and leads to trajectories minimizing an energy functional between two probability measures. However, many real-world systems, such as cell cycles in single-cell RNA, are known to exhibit non-gradient, periodic behavior, which fundamentally cannot be captured by current state-of-the-art methods such as flow and bridge matching. In this paper, we introduce Curly Flow Matching (Curly-FM), a novel approach that is capable of learning non-gradient field dynamics by designing and solving a Schr\"odinger bridge problem with a non-zero drift reference process -- in stark contrast to typical zero-drift reference processes -- which is constructed using inferred velocities in addition to population snapshot data. We showcase Curly-FM by solving the trajectory inference problems for single cells, computational fluid dynamics, and ocean currents with approximate velocities. We demonstrate that Curly-FM can learn trajectories that better match both the reference process and population marginals. Curly-FM expands flow matching models beyond the modeling of populations and towards the modeling of known periodic behavior in physical systems. Our code repository is accessible at: https://github.com/kpetrovicc/curly-flow-matching.git
2025-10-29
ArXiv (prépublication)
doi.org
arxiv.org
Gistify! Codebase-Level Understanding via Runtime Execution
Hyunji Lee
Minseon Kim
Chinmay Singh
Matheus Pereira
Atharv Sonwane
Isadora White
Elias Stengel-Eskin
Mohit Bansal
Zhengyan Shi
Alessandro Sordoni
Marc-Alexandre Côté
Xingdi Yuan
Lucas Caccia
As coding agents are increasingly deployed in large codebases, the need to automatically design challenging, codebase-level evaluation is ce… (voir plus)ntral. We propose Gistify, a task where a coding LLM must create a single, minimal, self-contained file that can reproduce a specific functionality of a codebase. The coding LLM is given full access to a codebase along with a specific entrypoint (e.g., a python command), and the generated file must replicate the output of the same command ran under the full codebase, while containing only the essential components necessary to execute the provided command. Success on Gistify requires both structural understanding of the codebase, accurate modeling of its execution flow as well as the ability to produce potentially large code patches. Our findings show that current state-of-the-art models struggle to reliably solve Gistify tasks, especially ones with long executions traces.
2025-10-29
ArXiv (prépublication)
doi.org
arxiv.org
Neural signatures of associational cortex emerge in a goal-directed model of visual search
Motahareh Pourrahimi
Pouya Bashivan
2025-10-29
bioRxiv (prépublication)
doi.org
Multi-Representation Attention Framework for Underwater Bioacoustic Denoising and Recognition
Amine RAZIG
Youssef Soulaymani
Loubna Benabbou
Pierre Cauchy
2025-10-28
ArXiv (prépublication)
doi.org
arxiv.org
Scaling Latent Reasoning via Looped Language Models
Ruiming Zhu
Zixuan Wang
Kai Hua
Tianyu Zhang
Ziniu Li
Haoran Que
Boyi Wei
Zixin Wen
Fan Yin
He Xing
Li Li
Jiajun Shi
Kaijing Ma
Shanda Li
Taylor Kergan
Andrew C. Smith
Xin Qu
Mude Hui
Bohong Wu
Qiyang Min … (voir 13 de plus)
Hongzhi Huang
Xun Zhou
Wei Ye
Jiaheng Liu
Jian Yang 0030
Yunfeng Shi
Chenghua Lin
Enduo Zhao
Tianle Cai
Ge Zhang
Wenhao Huang
Yoshua Bengio
Jason K. Eshraghian
Modern LLMs are trained to"think"primarily via explicit text generation, such as chain-of-thought (CoT), which defers reasoning to post-trai… (voir plus)ning and under-leverages pre-training data. We present and open-source Ouro, named after the recursive Ouroboros, a family of pre-trained Looped Language Models (LoopLM) that instead build reasoning into the pre-training phase through (i) iterative computation in latent space, (ii) an entropy-regularized objective for learned depth allocation, and (iii) scaling to 7.7T tokens. Ouro 1.4B and 2.6B models enjoy superior performance that match the results of up to 12B SOTA LLMs across a wide range of benchmarks. Through controlled experiments, we show this advantage stems not from increased knowledge capacity, but from superior knowledge manipulation capabilities. We also show that LoopLM yields reasoning traces more aligned with final outputs than explicit CoT. We hope our results show the potential of LoopLM as a novel scaling direction in the reasoning era. Our model is available here: http://ouro-llm.github.io.
2025-10-28
ArXiv (prépublication)
doi.org
arxiv.org
Assessing Programming Task Difficulty for Efficient Evaluation of Large Language Models
Florian Tambon
Amin Nikanjam
Cyrine Zid
Foutse Khomh
Giuliano Antoniol
2025-10-27
ACM Transactions on Software Engineering and Methodology (publié)
doi.org
arxiv.org