What do these badges mean?
- 🚀ShippingCode exists. Multiple GitHub repos already reference this paper — people are building on it.
- 📈ClimbingCitation velocity is rising. Researchers are starting to pick it up.
- 💤QuietPublished but no notable signal yet. Most papers live here — could become anything later.
- 🎭HypeHeavy social buzz but no shipping signal. The counter-signal — defer until Twitter/X data is wired up.
- 💤Quiet2610.13923·Oct 9, 2026·~12 mincs.NIcs.LGeess.SY
Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
Sajjad Baghaeea, Aimin Lib, Shanmugarajan Balasubramanian, Elif Uysal
⭐ 0 stars / 0 repos📚 0 citesELI5A spacecraft relay station uses AI to decide which messages to send to Earth when it only has brief contact windows—like a mail sorter that must pick the most important packages based on how stale they are and which planet they came from.
Problem solvedDeep-space networks can't send everything due to contact time limits and storage constraints. Simple schedulers like FIFO ignore which data matters most to missions, wasting precious communication windows and delivering outdated information. This system prioritizes based on mission goals.
- 💤Quiet2610.13901·Oct 9, 2026·~13 minstat.MLcs.LG
Hitting-Time Bounds for Asynchronous Q-Learning
Yang Peng
⭐ 0 stars / 0 repos📚 0 citesELI5A team figured out how fast standard Q-learning (a way to teach AI to make decisions) learns when it watches real-world trajectories one at a time, without restarting or replaying past experiences. They proved it needs roughly a quartic number of steps relative to the planning horizon to get accurate results.
Problem solvedQ-learning theory was incomplete for practical asynchronous setups: we didn't have tight bounds on how many real-world transitions you need to observe from a single behavior stream to reach a target accuracy, especially when the world has cycles or imbalanced state visitation.
- 💤Quiet2610.12465·Oct 8, 2026·~14 mincs.ROcs.LG
A Balanced Data Diet: Addressing the Exploration Bottleneck in Mega-Scale RL for Robot Control
Octi Zhang, Mateo Guaman Castro, Patrick Yin, Ignacio Dagnino, +3
⭐ 0 stars / 0 repos📚 0 citesELI5A robot learns tasks faster by focusing training on challenges it's almost ready to solve, rather than wasting time on tasks it already knows or can't do yet. It's like a student spending study time on borderline topics instead of things they've mastered or material too advanced.
Problem solvedScaling RL training across millions of parallel robot simulations doesn't help much because most sampled tasks are either too easy or too hard—the robot wastes compute. This method refocuses training on the learning frontier, making massive parallelization actually work for complex robot control like assembly and rough-terrain movement.
- 💤Quiet2610.12403·Oct 8, 2026·~8 mincs.CVcs.CL
ViSkill: Reinforcing VLM Agents with Evolving Visual-Native Skills
Hongxing Li, Dingming Li, Yixin Li, Yong Du, +5
⭐ 0 stars / 0 repos📚 0 citesELI5A system that teaches AI agents to solve problems by learning visual skills from successful attempts. Instead of describing actions in words, it stores them as visual cards the agent can recognize and reuse, creating a self-improving loop where new successes teach the agent better strategies.
Problem solvedVLM agents struggle with spatial reasoning when skills are stored as text, losing geometric details. Existing approaches build and improve skills separately from the main learning process, missing opportunities to reinforce each other and accelerate learning.
- 💤Quiet2610.10536·Oct 7, 2026·~10 mincs.LGcs.AIcs.CL
Decoupling Exploration from Optimization in RLVR
Saif Punjwani, Micah Goldblum
⭐ 0 stars / 0 repos📚 0 citesELI5When teaching an AI to reason better, pushing it to find novel solutions can break what it already knows. This paper splits the process: first let the model explore wild new ideas freely, then filter the good ones and teach a clean student model from those ideas—repeat several times. It's like brainstorming separately from editing.
Problem solvedRLVR improves reasoning but adding novelty incentives degrades performance and is hard to fix. This paper lets you aggressively explore new strategies without hurting the base model, recovering diverse correct solutions instead of just optimizing narrowly.
- 💤Quiet2610.08789·Oct 6, 2026·~10 mincs.ROcs.LG
QF3: Fast Flow RL with Filtered Q-Gradients
Chung Min Kim, Brent Yi, David McAllister, Hongsuk Choi, +6
⭐ 0 stars / 0 repos📚 0 citesELI5A new way to train robot control policies using flow models (which generate smooth, realistic motions) combined with reinforcement learning. It's 10x faster than prior methods and can train robots from scratch or improve policies learned from demonstrations.
Problem solvedFlow-based robot policies are good at copying human demonstrations but weak at learning from trial-and-error. Prior RL methods for flow policies were slow and mostly worked only with pre-trained models; QF3 trains them 10x faster from scratch and gets them working on real hardware.
- 💤Quiet2610.08778·Oct 6, 2026·~10 mincs.AIcs.CL
Sherpa: Teaching LLMs to Teach Adaptively
Weixian Xu, Yanzhe Zhang, Zora Zhiruo Wang, Changyu Chen, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A framework that trains AI tutors to teach better by practicing with simulated students who learn differently, then rewarding the tutor when those students actually improve—like a teacher getting feedback on whether their lessons work.
Problem solvedLLMs can answer questions but struggle to teach effectively because existing training uses generic feedback rather than measuring whether actual students learn. This creates tutors misaligned with real pedagogical outcomes.
- 💤Quiet2610.08743·Oct 6, 2026·~9 mincs.LGcs.AI
Reinforcement Learning with Conformal Action Sets: An Application to Sequential Recommendation
Wenwen Si, Honghao Wei
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of always showing the same number of recommendations, this system learns to show fewer options when they're all bad and more when there are good choices. It uses feedback to adjust a cutoff score that decides which recommendations to keep.
Problem solvedRecommender systems waste space showing uninteresting items and dilute good recommendations in bloated lists. This fixes it by dynamically shrinking the recommendation slate based on quality, improving diversity and user experience without bigger sets.
- 💤Quiet2610.06829·Oct 5, 2026·~14 mincs.CLcs.AIcs.LG
CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling
Yifan Zhang, Yutong Dai, Viraj Prabhu, Zhiyuan Hu, +2
⭐ 0 stars / 0 repos📚 0 citesELI5A web agent learns to complete browser tasks by asking itself verification questions about its own actions, then uses a statistical method to keep only the trustworthy signals. At test time, it can retry tasks and pick the best one without needing an expensive external judge.
Problem solvedTraining web agents with reinforcement learning is expensive because task success signals are sparse and calling a language-model judge at every step costs too much. This method creates a reusable verification system that works at training and test time without constant external judge calls.
- 💤Quiet2610.03642·Oct 2, 2026·~6 mincs.LGmath.OC
On the Convergence of Success Conditioning for Policy Optimization
Matthew Brun, Xu Andy Sun
⭐ 0 stars / 0 repos📚 0 citesELI5Success conditioning is a technique that improves decision-making by repeatedly increasing the probability of actions that worked well. This paper proves mathematically that this approach actually finds optimal solutions and measures how fast it converges.
Problem solvedReinforcement learning systems use success conditioning in practice, but nobody had proven it actually works or how quickly it improves. This analysis gives theoretical guarantees so practitioners know when and why to trust this approach.
- 💤Quiet2610.02198·Oct 1, 2026·~11 mincs.LGcs.AIcs.RO
FERPO: Forward Entropy-Regularized Policy Optimization
Sebastian Sanokowski, Alireza Sarmadi, Majid Khadiv
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of using a critic to compute gradients for policy updates (which can be unreliable), FERPO computes an ideal target action distribution and trains the actor to match it using importance sampling. This avoids differentiating through an imperfect critic and encourages exploring multiple good strategies.
Problem solvedCurrent RL methods train critics to predict returns, but the gradients from these critics are noisy and don't reliably improve policies. FERPO fixes this by deriving optimal target actions directly from a policy objective, leading to more stable and sample-efficient learning.
- 💤Quiet2610.02189·Oct 1, 2026·~12 mincs.LG
Generative modeling of intrinsically disordered protein regions by reinforcing sparse autoencoder features
Jason X. Liu, Sebastian Ibarraran, Frank Hu, Soojung Yang, +6
⭐ 0 stars / 0 repos📚 0 citesELI5A tool that designs disordered protein regions (the floppy, flexible bits of proteins) by learning patterns from millions of natural examples, then using reinforcement learning to steer designs toward specific functional features—like composing music by specifying which notes to emphasize.
Problem solvedScientists couldn't design disordered protein regions because existing design methods assume rigid structures and language models trained on full proteins are biased toward folded domains. Now they can generate functional IDRs with precise control over biological properties like cellular localization.
- 💤Quiet2610.02179·Oct 1, 2026·~9 mincs.LG
From Gradients to Capabilities: Understanding Multi-Teacher On-Policy Distillation
Siqi Zhu, Suozhi Huang, Kaixuan Zhang, Yuheng Yang, +3
⭐ 0 stars / 0 repos📚 0 citesELI5When training a single AI model using knowledge from multiple specialized teachers, the researchers discovered that small details like how you average their feedback, which numerical precision you use, and how the optimizer processes gradients dramatically change what the student actually learns.
Problem solvedTeams building multi-teacher systems don't understand why their distillation setups produce inconsistent results—this work reveals hidden mechanisms (response length bias, optimizer smoothing, numerical precision loss) that explain performance gaps and help engineers design better training pipelines.
- 💤Quiet2610.02159·Oct 1, 2026·~7 mincs.LG
When Do Intrinsic Rewards Lead to Exploration?
Scott W. Viteri, Laura Gomezjurado Gonzalez, Clark Barrett
⭐ 0 stars / 0 repos📚 0 citesELI5Most exploration bonuses in AI reward agents for being surprised or learning fast, but this can make them explore useless things. This paper shows when these bonuses actually work and proposes a better way to measure whether an agent is exploring smartly—by checking if its experience would help it understand other strategies.
Problem solvedIntrinsic reward systems often guide RL agents toward irrelevant exploration that doesn't improve decision-making. Teams need to know which exploration bonuses are actually useful and how to design ones that guarantee agents learn what matters for solving tasks.
- 💤Quiet2610.02140·Oct 1, 2026·~12 mincs.LGcs.AIcs.CL
Finetuning with Sampling: SFT Learns Better Than You Think
Aayush Karan, Sitan Chen, Yilun Du
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of changing how a model learns, this paper changes the training data itself—using a smart sampling technique to convert stored expert demonstrations into data that looks like it came from the model's own exploration. This lets supervised learning match or beat reinforcement learning's ability to learn new skills without forgetting old ones.
Problem solvedTraining models on new tasks usually means choosing between supervised learning (which forgets old knowledge) or reinforcement learning (which is sample-inefficient). This work solves that by making supervised learning work as well as RL for new capabilities while still learning from recorded expert data.
- 💤Quiet2610.02074·Oct 1, 2026·~14 mincs.AIcs.CR
Homomorphic Advantage Operator: Stabilizing Reinforcement Learning Under Fully Homomorphic Encryption Constraints
Abid Mohamed Nadhir, Ahmad Al Hanbali, Beggas Mounir
⭐ 0 stars / 0 repos📚 0 citesELI5When AI models run on encrypted data in the cloud, they can't use normal math—only polynomial approximations. This breaks reinforcement learning because errors stack up recursively. This paper adds a simple centering trick that keeps the math stable and prevents explosive errors.
Problem solvedCompanies want to train RL agents on sensitive data in the cloud without exposing it. Fully homomorphic encryption enables this, but polynomial approximations cause catastrophic drift in RL's feedback loop. This framework makes encrypted RL actually work without expensive computational workarounds.
- 💤Quiet2610.02039·Oct 1, 2026·~11 mincs.LGcs.AIcs.CL
CARM: Cancellation-Aware Response Masking for LLM Reinforcement Learning
Yafei Zhang, Songshuo Lu, Sicong Liao, Zhi Chen, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI models with reinforcement learning, sometimes responses shouldn't count toward learning because the model has changed since generating them. This paper fixes a flaw in how we decide which responses to ignore: the old method lets opposite probability changes cancel out and hide real drift, so the new method takes absolute values to catch all the drift and reject bad responses more accurately.
Problem solvedIn real LLM training systems, the model keeps changing during learning, making old responses 'stale' or off-policy. Current masking methods fail to detect when a response has drifted significantly because increases and decreases in token probabilities cancel each other out, leading to incorrect training updates and wasted computational resources.
- 💤Quiet2610.02019·Oct 1, 2026·~9 mincs.CLcs.CV
Controllable Multi-label Video Safety Detection via Adaptive Tversky Policy Optimization
Guangyu Yang, Jingbiao Mei, Mingsheng Sun, Jinghong Chen, +4
⭐ 0 stars / 0 repos📚 0 citesELI5A system that automatically detects multiple types of harmful content in videos by learning to adjust how strict it should be (finding more bad stuff vs. avoiding false alarms) depending on what matters most for each situation.
Problem solvedVideo platforms struggle to flag unsafe content accurately when videos contain multiple types of harm simultaneously, and they can't easily adjust their detection sensitivity for different moderation policies or content categories without retraining.
- 💤Quiet2609.40360·Sep 30, 2026·~12 mincs.LGcs.AIcs.CL
Semifactual Credit-Augmented Policy Optimization
Junshu Pan, Zhizhang Fu, Shulin Huang, Yiran Ding, +4
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI models to solve math problems, some tokens (words) matter more than others for getting the right answer. This method figures out which tokens are actually important by tweaking the problem in small ways that don't change the answer—then trains the model to rely less on the flaky tokens and more on the stable ones.
Problem solvedCurrent RL training treats all tokens equally when assigning credit, even though some tokens might be responding to meaningless prompt variations rather than actual reasoning. This causes models to latch onto spurious patterns. This method fixes that by identifying and downweighting unstable tokens during training.
- 💤Quiet2609.35767·Sep 28, 2026·~11 mincs.CVcs.AI
Learning Native Reflection in Unified Models with Interleaved Reinforcement Learning
Yijia Fan, Ziqi Huang, Zhongang Cai, Yan Li, +4
⭐ 0 stars / 0 repos📚 0 citesELI5A single AI model learns to look at images it generates, write critiques of what's wrong, fix the image, and repeat—all while improving both the critique-writing and image-fixing parts together through a learning process that rewards successful repairs.
Problem solvedImage generation models couldn't improve their own outputs without external tools. Now a unified model can self-correct by seeing its mistakes and fixing them, eliminating the need for separate critic models and making the feedback loop faster and more efficient.
- 💤Quiet2609.35750·Sep 28, 2026·~10 mincs.LGcs.AI
KV-streams for Efficient Compaction in Agentic Reinforcement Learning
Emiliano Penaloza, Dane Malenfant, Dheeraj Vattikonda, Roger Creus Castanyer, +14
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI agents that need to remember long histories of actions and observations, the memory gets huge. This paper proposes streaming the LLM's cached key-value pairs forward instead of recalculating them, making training 2.6–5x faster while keeping performance intact.
Problem solvedTraining agents with long context windows is slow because compressing the memory trace requires reprocessing the LLM repeatedly. KV-streams lets you reuse cached computation across compressions, fixing the throughput bottleneck without sacrificing learning.
- 💤Quiet2609.35715·Sep 28, 2026·~10 mincs.LGcs.AIcs.RO
X-Reset: Scaling Object-Centric Reinforcement Learning via Cross-Embodiment Resets
Prithwish Dan, Chenyang Ma, Wei Zhan
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of teaching a robot to manipulate objects from scratch (which is really hard), the system uses videos of human hands manipulating objects to seed the robot's training with useful starting positions. This jumpstarts learning and lets the robot discover how to grasp and move diverse objects on its own.
Problem solvedTraining robot manipulation policies from scratch requires either human demonstrations to imitate, hand-crafted rewards for each task, or heavily constrained behaviors. X-Reset solves this by using human hand videos as a source of exploration-helpful starting states, enabling one policy to work across different robot bodies and many objects without per-task tuning.
- 💤Quiet2609.35706·Sep 28, 2026·~12 mincs.AIcs.CL
Reinforcing Agentic Creativity in Scientific Ideation with Night Science
Priyanka Kargupta, Silviu Cucerzan, Shweti Mahajan, Allen Herring, +3
⭐ 0 stars / 0 repos📚 0 citesELI5A system that teaches AI to be more creative at brainstorming scientific ideas by learning when to take risks and explore unusual paths, rather than always defaulting to safe, predictable suggestions.
Problem solvedLLMs tend to generate repetitive, conventional ideas for scientific research because they're optimized for being correct rather than creative. Researchers need tools that help them discover novel directions they wouldn't naturally think of.
- 💤Quiet2609.35699·Sep 28, 2026·~10 mincs.LGcs.AIcs.CR
Distillation Defenses Easily Break After Reinforcement Learning
Shidan Javaheri, Alexander Panfilov, Oliver Britton, Yarin Gal, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When companies try to protect their AI models from being copied, they assume attackers will stop after stealing the model once. This paper shows attackers can keep training the stolen model with reinforcement learning, breaking most existing protections and making theft easier than previously thought.
Problem solvedCompanies releasing AI APIs face a real threat: competitors can steal their models cheaply by collecting outputs and retraining on them. Current defenses look good in tests but fail when attackers continue optimizing—creating false security and underestimating actual risk.
- 💤Quiet2609.30258·Sep 24, 2026·~10 mincs.LG
Temporal Gradient Inversion for Private Trajectory Reconstruction in Embodied Reinforcement Learning
Sudip Bhujel, Shanghao Shi, Ruiquan Huang, Ning Zhang, +1
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers show how to steal a robot's private camera feeds and actions by intercepting the tiny mathematical updates it sends to a server during learning. They exploit patterns across consecutive frames to reconstruct full video sequences and movements from these gradient messages.
Problem solvedDistributed RL agents thought sending only gradients (not raw sensor data) kept observations private. This work proves attackers can reverse-engineer complete video trajectories and action sequences from those gradients, breaking the privacy assumption of on-device learning systems.
- 💤Quiet2609.30226·Sep 24, 2026·~13 mincs.LGcs.AIcs.CL
PoEM: Predicting RL Outcomes from Existing Policies
Kimia Hamidieh, Giannis Daras, Antonio Torralba
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of retraining a model with RL every time you change the reward function, this method predicts what the new trained model would look like by mixing together models you've already trained on different rewards — like blending paint colors to get a new shade without buying new paint.
Problem solvedRL post-training is expensive, slow, and unstable. Teams waste compute retraining from scratch whenever they tweak rewards or want to combine multiple objectives. This lets you predict outcomes for new reward functions using existing trained models, saving huge amounts of compute.
- 💤Quiet2609.30177·Sep 24, 2026·~9 mincs.AI
Search-Aware Reinforcement Learning for Multi-Component Query Understanding in Roblox Game Search
Nayoung Choi, Shengjian Chen, Xiaokai Wei, Wenzheng Zhang, +5
⭐ 0 stars / 0 repos📚 0 citesELI5When someone searches in Roblox, the system needs to understand what they want (their intent, keywords, etc.). This paper trains an AI to break down queries into multiple parts and optimize each part separately using feedback from the actual search engine, rather than just guessing from examples.
Problem solvedSearch systems struggle to tune query understanding because static training data doesn't capture how different components (intent, expansion, etc.) actually affect search results. This approach gets real feedback from the live search engine to tune each part optimally.
- 💤Quiet2609.30157·Sep 24, 2026·~15 minquant-phcs.LG
Learning and interpreting policies for simultaneous entanglement requests in quantum networks
Leon Rode, Sumeet Khatri, Supartha Podder
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers used AI to learn how to efficiently schedule requests for entangled particles in quantum networks—like a smart traffic controller that decides which quantum connections to set up first to handle multiple simultaneous tasks with fewer resources.
Problem solvedQuantum networks need to handle many simultaneous tasks requiring entanglement, but generating entangled particles is expensive and slow. Current rule-based approaches waste resources; this AI learns better scheduling policies that reduce resource needs by up to 71% while maintaining success rates.
- 💤Quiet2609.30104·Sep 24, 2026·~9 minquant-phcs.DCcs.LG
MQSS-Selector: RL-Guided Pass Selection for an MLIR Compilation Pipeline
Andre Youssefi, Ercüment Kaya, Minh Chung, Jorge Echavarria, +2
⭐ 0 stars / 0 repos📚 0 citesELI5A smart system that uses AI to decide which optimization steps to apply when compiling quantum programs, learning to pick the best sequence that reduces errors and keeps programs fast.
Problem solvedQuantum computers today are error-prone and slow to compile. Engineers waste time manually tuning which optimizations to apply—this automates that choice by learning what works best for different quantum circuits and hardware.
- 💤Quiet2609.28385·Sep 23, 2026·~11 mincs.LGcs.AI
When and Where to Trust the Teacher: Unifying On-Policy Distillation and GRPO through Entropy-Calibrated Credit Assignment
Jie Zhang, Jingxiao Yang, Zhehao Huang, Yuhang Liu, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A system that teaches AI to solve math problems by combining two types of feedback: whether the final answer is right (from a verifier) and how well the student follows a teacher's reasoning (from distillation). It figures out which feedback to trust at each step and fairly distributes credit across the tokens the model generates.
Problem solvedTraining math-reasoning models is tricky because final-answer feedback doesn't help guide individual steps, but teacher feedback can be wrong. This unifies both signals intelligently—letting verifier rewards set the bar while teacher guidance reshapes the learning path, without losing or double-counting credit.
- 💤Quiet2609.28378·Sep 23, 2026·~10 mincs.ROcs.CRcs.LG
ForgetMimic: Motion Unlearning for Reinforcement Learning Humanoid Control
Xukun Luan, Zhongxiang Lei, Chen Gong, Shaowei Li, +2
⭐ 0 stars / 0 repos📚 0 citesELI5A technique that surgically removes specific learned movements from robot policies (like deleting a dance move or fighting stance) while keeping all other behaviors intact—useful for removing unsafe, stolen, or unwanted motions from humanoid robots.
Problem solvedOnce a humanoid robot learns many behaviors from human demonstrations, there's no way to remove specific motions later if they're unsafe, copyrighted, or malicious. This matters for safety, privacy rights (GDPR), and preventing misuse of trained policies.
- 💤Quiet2609.28364·Sep 23, 2026·~10 mincs.ROcs.LGmath.OC
LEAP-CBF: A Safety Filter for Uncertain Systems with Least-Effort Adversarial Potentials
Oswin So, Eric Yu, Chuchu Fan
⭐ 0 stars / 0 repos📚 0 citesELI5This paper creates a safety filter for robots that measures how much 'effort' a disturbance would need to push the system into danger. Instead of being overly cautious about worst-case scenarios, it learns realistic robustness bounds and keeps robots safe while staying agile—like knowing how hard a gust of wind would need to blow to knock over your drone.
Problem solvedExisting safety filters for uncertain robot systems are either hard to build or too conservative, limiting what robots can do. This approach uses machine learning to automatically find safety boundaries that account for real disturbances without unnecessary restriction.
- 💤Quiet2609.26707·Sep 22, 2026·~13 minstat.MEcs.LGstat.ML
Optimal Sequential Annotations for Off-Policy Evaluation
Woojin Chae, Ezinne Nwankwo, Haitong Qin, Angela Zhou
⭐ 0 stars / 0 repos📚 0 citesELI5When you have lots of data but can only afford to manually label a fraction of it, this paper shows which examples are most valuable to label to get accurate estimates of whether a policy (like a treatment or AI system) actually works well.
Problem solvedOrganizations using historical data to evaluate decisions face a choice: use cheap but potentially biased automatic labels, or pay experts to label everything (prohibitively expensive). This method tells you exactly which examples an expert should label first to get the most accurate evaluation for your budget.
- 💤Quiet2609.26704·Sep 22, 2026·~11 mincs.CLcs.AI
Beyond Repeated Sampling: Learning Search Policies for LLM Reasoning
Ismail Labiad, Matthieu Kowalski, Marc Schoenauer, Rémi Munos, +1
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of just asking an LLM the same question many times and hoping one answer is right, this method trains a small model to suggest useful hints or strategies first, then uses those to guide a bigger model toward better answers—like a coach whispering tips before each attempt.
Problem solvedLLMs waste test-time compute by repeatedly generating similar wrong answers. This trains a small search policy that intelligently steers exploration toward diverse solution approaches, making expensive LLM inference much more efficient on hard reasoning tasks.
- 💤Quiet2609.24985·Sep 21, 2026·~10 mincs.LGcs.CL
Critical-State RL: Diagnosing Trainable States for Multi-Turn Tool Use
Zixiang Chen, Wenting Zhao, Zhepeng Cen, Akshara Prabhakar, +8
⭐ 0 stars / 0 repos📚 0 citesELI5When an AI agent fails at multi-step tool-use tasks, it's hard to know which step to fix through training because later randomness hides which decision actually caused the problem. This method diagnoses which exact step in a multi-turn sequence is worth training on by filtering out noise from later steps.
Problem solvedTraining AI agents on tool-use tasks wastes effort when you optimize the wrong step—a failure might stem from step 3, but training step 1 won't help because its reward signal is drowned out by randomness downstream. You need to know which step actually controls success before you train.
- 💤Quiet2609.24906·Sep 21, 2026·~12 mincs.ROcs.AI
Visuomotor Robotic Pruning in Planar Orchards Using Hybrid Reinforcement Learning
Abhinav Jain, Cindy Grimm, Stefan Lee
⭐ 0 stars / 0 repos📚 0 citesELI5A robot learns to prune apple and cherry trees by watching itself practice in a computer simulation, then goes straight to real orchards without any additional training. It uses a camera on its wrist and learns which branches to cut by combining offline demonstrations with learning-by-doing in simulation.
Problem solvedTree pruning is one of the most labor-intensive tasks in modern orchards, but it's essential for productivity. Current approaches require manual labor or heavy engineering—this work automates the task end-to-end with a robot that transfers directly from simulation to real orchards without retraining.
- 💤Quiet2609.22068·Sep 18, 2026·~12 mincs.AI
CodeMidas: Scaling Agentic Coding RL Environments from Code Itself
Bowen Ye, Lei Li, Shicheng Li, Zihao Yue, +15
⭐ 0 stars / 0 repos📚 0 citesELI5A system that automatically extracts thousands of coding tasks from open-source projects and turns them into training exercises for AI agents. Instead of manually finding bugs to fix, the pipeline reads actual code, figures out what it does, writes tests, and creates environments where an AI can practice solving similar problems.
Problem solvedTraining coding agents requires thousands of diverse, verified tasks—but finding and validating them manually is slow and limited. This automates task extraction from existing codebases, scaling from hundreds to thousands of training scenarios without hand-crafted issue or commit data.
- 💤Quiet2609.22041·Sep 18, 2026·~15 mincs.LG
$λ$-Controlled GRPO: Turning Flow-Matching Ratio Instability into a Budgeted Resource
Yufeng Wang, Parivesh Priye, Meeshawn Marathe, Ramit Pahwa
⭐ 0 stars / 0 repos📚 0 citesELI5When training image generators with rewards, the training gets increasingly unstable as you denoise the image step-by-step. This paper figures out why (a single mathematical quantity that changes per step), measures it directly, and uses that to budget where to spend optimization effort—like knowing your energy budget before climbing stairs instead of falling and fixing bruises afterward.
Problem solvedFlow-matching image generators trained with reinforcement learning become unstable mid-training, with importance ratios breaking down and fewer usable samples as you go deeper into the denoising process. This method predicts instability from the math of the model itself rather than fighting it with multiple hand-tuned fixes, making training more reliable and efficient.
- 💤Quiet2609.20807·Sep 17, 2026·~8 mincs.LG
Score Centering Stabilizes Off-policy Reinforcement Learning
Martin Marek, Max Ryabinin
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI models with reinforcement learning, the training and inference setups often differ slightly, causing training to become unstable. This paper adds a simple correction term that cancels out the accumulated bias from these differences, making training much more stable without slowing down.
Problem solvedRL training for large language models breaks down when there's any mismatch between how you train and how you run the model in production. This paper fixes the instability without requiring expensive changes to rollout infrastructure.
- 💤Quiet2609.20784·Sep 17, 2026·~9 mincs.CLcs.AI
RetireOPD: Self-Retiring On-Policy Distillation for Agentic Reinforcement Learning
Yan Yu, Zhengxi Lu, Yizhou Liu, Yichen Pan, +7
⭐ 0 stars / 0 repos📚 0 citesELI5A student AI agent learns to complete tasks by watching a specialized teacher, but the student figures out when it's ready to go solo—automatically stopping the teacher help once it's caught up enough and improving further on its own.
Problem solvedRL agents struggle with sparse rewards in multi-step tasks. Fixed teacher schedules either help too long (wasting computation) or stop too early (leaving performance on the table). This automates when to drop the teacher based on actual learning progress.
- 💤Quiet2609.20756·Sep 17, 2026·~10 mincs.ROcs.CVcs.LG
OPTED: On-Policy Fine-Tuning for End-to-End Driving using a Render-Free Teacher
Damiano Da Col, Maximilian Igl, Peter Karkus, Kashyap Chitta, +4
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of teaching a self-driving car directly through trial-and-error in simulation, train a simpler AI referee that knows the ground truth (map and object positions), then have it coach the camera-only driving model to improve — like having a perfect co-pilot whisper directions to a human driver learning the route.
Problem solvedEnd-to-end driving models trained on human videos fail when they make small mistakes that compound in real driving. Fixing this with standard reinforcement learning requires prohibitively expensive simulation. OPTED cuts simulation costs by 1000x while achieving the same improvement.
- 💤Quiet2609.20747·Sep 17, 2026·~11 mincs.ROcs.LG
MILER: Semantic Mid-Level Representation for Sim-to-Real Reinforcement Learning in Unstructured Autonomous Driving
Thomas Steinecker, Denis Trescher, Alexander Bienemann, Thorsten Luettel, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A system that trains autonomous driving in simulation using a bird's-eye-view map of the scene, then transfers that learned behavior directly to real vehicles without any retraining—working in messy, unstructured environments like off-road terrain.
Problem solvedSim-to-real transfer for autonomous driving typically fails in unstructured environments because the gap between simulation and reality is huge. This paper solves that by using a semantic middle-ground representation that both the simulator and real sensors (camera + LiDAR) can produce, letting one trained policy work on both.
- 💤Quiet2609.20715·Sep 17, 2026·~12 mincs.LGcs.AIcs.CL
Don't Mask the Environment: Observation Supervision Changes How Agents Explore Under RL
Juzheng Zhang, Disha Makhija, Manoj Ghuhan Arivazhagan, Vinayshekhar Bannihatti Kumar, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI agents to take actions, researchers usually only teach them to predict what to do next—but this paper shows that also training them to predict what happens in the environment (even though agents never generate that) makes them explore better and solve more tasks during reinforcement learning.
Problem solvedFine-tuned agent policies often plateau or explore poorly during RL training. By also supervising environment observations during initial training, policies maintain better understanding of action consequences, leading to more diverse exploration and higher success rates on unseen tasks without extra compute or data.
- 💤Quiet2609.20575·Sep 17, 2026·~10 mincs.ROcs.AIcs.LG
Accelerating Visual Policy Learning with Sampling-Based Model Predictive Control
Yilang Liu, Haoxiang You, Qian Wang, Daniel Rakita, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A new training method that combines sampling-based planning with neural network policy learning to teach robots visual skills like walking and pushing objects. It's faster and more memory-efficient than traditional approaches, and the learned policies work on real robots without retraining.
Problem solvedTraining visual robot policies is expensive in computation and memory, and simple gradient-based methods can get stuck in bad solutions. This approach makes training faster on a single GPU while producing policies robust enough to work on real hardware without modification.
- 💤Quiet2609.20548·Sep 17, 2026·~10 mincs.LGcs.AI
Mitigating Retaliatory Algorithmic Collusion in Repeated Games
Karthik Sivachandran, Rohan Paleja
⭐ 0 stars / 0 repos📚 0 citesELI5When AI agents play the same game repeatedly against each other, they naturally learn to collude (like rival companies secretly fixing prices). This paper detects when agents are doing this by watching for suspicious patterns in their decisions, then tweaks their reward signals to break up the collusion.
Problem solvedRL agents in competitive settings (pricing, bidding, negotiations) converge to collusive agreements without explicit communication, harming consumers and market efficiency. Current fixes only work for specific markets; this provides a general-purpose intervention.
- 💤Quiet2609.19074·Sep 16, 2026·~8 mincs.LGcs.AI
RLLBC-Lib: An Educational Code Library for Reinforcement Learning and Learning-Based Control
Bernd Frauenknecht, Emma Cramer, Artur Eisele, Paul Kruse, +8
⭐ 0 stars / 0 repos📚 0 citesELI5A teaching library that makes reinforcement learning easier to learn by providing clean, simple code examples—starting with basic RL algorithms and building up to complex ones—so students can see exactly how the pieces work together.
Problem solvedRL is hard to learn because the theory involves many interconnected parts that are tough to grasp from papers alone. This library lets students see working code that matches the theory, making it actually possible to understand what's happening under the hood.
- 💤Quiet2609.17429·Sep 15, 2026·~13 mincs.LGcs.AI
Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging
Liang-Ching Tao, Pi-Chung Wang
⭐ 0 stars / 0 repos📚 0 citesELI5A system that combines learned predictions with smart search to decide where to send mobile chargers to dying sensors. Instead of picking an action directly, it uses a learned model to suggest promising candidates, then simulates a few steps ahead to pick the best one.
Problem solvedRobots or vehicles with many possible actions (here, 1,000+ charging locations) can't use simple neural networks that predict one action per state. This approach handles dynamic action spaces that change as the environment evolves, making real-world routing and resource allocation problems solvable.
- 💤Quiet2609.11807·Sep 10, 2026·~9 minstat.MLcs.LG
Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead
Corentin Pla, Hugo Richard, Marc Abeille, Vianney Perchet
⭐ 0 stars / 0 repos📚 0 citesELI5When an AI agent can peek ahead to see where it would go if it tried different action sequences, planning becomes computationally hard — but we show you can still find near-optimal strategies quickly using randomization and smart approximation tricks.
Problem solvedRL agents with lookahead (like game-playing systems that can simulate moves ahead) face a planning bottleneck: exact optimal planning is provably hard even with reasonable discount factors. Operators need algorithms that are both computationally practical and still find good strategies.
- 💤Quiet2609.11733·Sep 10, 2026·~7 mincs.ROcs.GRcs.LG
Reflex-Informed Neuromuscular Reinforcement Learning for Muscle-Driven Locomotion
Jian Zhou, Xingyu Zhang, Rui Ma, Yu Cao, +2
⭐ 0 stars / 0 repos📚 0 citesELI5A system that teaches a computer-controlled body to walk like a human by combining pre-built reflex patterns with AI learning. The AI learns to adjust just a few key knob settings (reflex gains) rather than controlling every muscle directly, making the walking look more natural and realistic.
Problem solvedCreating realistic human movement in simulations is hard—you need both natural-looking biomechanics and adaptability when muscles weaken or external forces push you around. This approach lets you get physiologically accurate walking that stays robust without retraining every time conditions change.
- 💤Quiet2609.11615·Sep 10, 2026·~6 mincs.AIcs.LGeess.SY
Distributed Optimization of Modular Production Systems using Model-based Reinforcement Learning with Inverse Models
Andreas Schwung, Steve Yuwono, Sofiene Lassoued, Dorothea Schwung
⭐ 0 stars / 0 repos📚 0 citesELI5A factory with swappable production modules learns how to control itself using AI that predicts what action each machine needs to take to reach a goal, then uses that prediction to train faster. Think of it like teaching a robot arm by first teaching it the inverse—"to get here, move this way"—before teaching it the full task.
Problem solvedManufacturing plants with modular, reconfigurable equipment struggle to adapt and optimize on the fly because traditional control is rigid and hard-coded. This lets factories automatically learn better control strategies as modules change, cutting training time and improving efficiency without manual reprogramming.