activity
20242026
collaborators

10 papers

cs.LG2026

Entropy-Gated Latent Recursion

Soham Bhattacharjee, Dushyant Singh Chauhan, Salem Lahlou +2

Inference-time scaling has become the dominant lever for improving language-model reasoning, but existing methods derive rollout diversity from a single source: stochastic token-le…

cs.LG2026

Zero-Shot Off-Policy Learning

Arip Asadulaev, Maksim Bobrin, Salem Lahlou +3

Off-policy learning methods seek to derive an optimal policy directly from a fixed dataset of prior interactions. This objective presents significant challenges, primarily due to t…

cs.CL2026

Latent Reasoning in TRMs is Secretly a Policy Improvement Operator

Arip Asadulaev, Rayan Banerjee, Fakhri Karray +1

Recently, small models with latent recursion have obtained promising results on complex reasoning tasks. These results are typically explained by the theory that such recursion inc…

cs.LG2026

Convex Compositional Reasoning Models

Meir Roketlishvili, Semyon Semenov, Maksim Bobrin +7

Compositional energy-based models can generalize to larger combinatorial reasoning problems by reusing a learned factor energy across many local constraints. In our paper, we show…

cs.LG2026

WaveSSM: Multiscale State-Space Models for Non-stationary Signal Attention

Ruben Solozabal, Velibor Bojkovic, Hilal Alquabeh +3

State-space models (SSMs) have emerged as a powerful foundation for long-range sequence modeling, with the HiPPO framework showing that continuous-time projection operators can be…

cs.LG2026

Y-Shaped Generative Flows

Arip Asadulaev, Semyon Semenov, Abduragim Shtanchaev +3

Modern continuous-time generative models typically induce \emph{V-shaped} flows: each sample travels independently along a nearly straight trajectory from the prior to the data. Al…