12 papers
Inverse Entropic Optimal Transport Solves Semi-supervised Learning via Data Likelihood Maximization
Mikhail Persiianov, Arip Asadulaev, Nikita Andreev +5
Learning conditional distributions is a central problem in machine learning, which is typically approached via supervised methods with paired data …
Dual Advantage Fields
Alexey Zemtsov, Maxim Bobrin, Alexander Nikulin +5
Offline goal-conditioned reinforcement learning requires both long-horizon reachability estimates and local action comparisons. Dual goal representations provide value fields that…
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…
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…
Sparse Scheduled Diffusion Guidance for Inverse Problems
Abduragim Shtanchaev, Albina Ilina, Yazid Janati +3
Pretrained diffusion models are effective priors for Bayesian inverse problems, but posterior sampling with these priors is often costly because data-consistency guidance is applie…
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…