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.12401·Oct 8, 2026·~11 mincs.LG
Learning Kilometer-Scale Weather Prediction with Global-Regional Alignment
Guowen Li, Yang Liu, Yujie Wang, Qiuyan Sun, +4
⭐ 0 stars / 0 repos📚 0 citesELI5A system that takes coarse global weather predictions and uses them to guide detailed local weather forecasts at kilometer scale, like zooming into a blurry map to create a sharp, accurate close-up view of your neighborhood's weather.
Problem solvedLocal weather forecasts need both global context and fine-grained details, but existing methods either ignore global patterns or require expensive retraining when switching between global forecast sources. This framework reuses existing global models efficiently while producing sharp 5km-resolution regional predictions.
- 💤Quiet2610.12345·Oct 8, 2026·~12 mincs.AIcs.CLcs.LG
Overcoming Prior Barriers: Supervised Fine-Tuning under Long-Tail Distribution
Haohui Wang, Jiahao Xu, Wangzhi Zhan, Tong Zeng, +8
⭐ 0 stars / 0 repos📚 0 citesELI5When you fine-tune an AI model, some concepts are already well-understood from pretraining while others are barely learned. This paper identifies why rare concepts struggle (they have high 'prior barriers') and proposes a smarter way to pick training examples—allocating more effort toward concepts the model is worst at, rather than treating all equally.
Problem solvedFine-tuning LLMs on data with rare concepts wastes budget on concepts already well-learned while leaving hard ones undertaught. This causes poor performance on rare/tail tasks. PASS fixes this by intelligently choosing which examples to use based on what the model actually needs to learn.
- 💤Quiet2610.12274·Oct 8, 2026·~9 mincs.CL
HarnessSQL: Harness-Native Training for SQL Agents in Realistic Database Environments
Haolin Yang, Jipeng Zhang, Jian Xie, Shuaishuai Gong, +2
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of training SQL models to output queries in isolation, this method trains them while they're actually interacting with real databases—running queries, checking results, fixing errors—just like they'll do in production. It's like practicing a sport in game conditions rather than drills.
Problem solvedSQL models trained on static query prediction fail badly when deployed as interactive agents that need to explore schemas, debug queries, and iterate. This gap between training and real-world use causes dramatic accuracy drops. HarnessSQL closes this by training agents inside the actual execution environment they'll operate in.
- 💤Quiet2610.12256·Oct 8, 2026·~7 mincs.CVcs.AIcs.IR
Syn-Omni: Structured Specialization and Progressive Collaboration for Omnimodal Embeddings
Youngtaek Oh, Qiyu Wu, Hiromi Wakaki, Junmo Kim, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A system that learns combined representations of images, videos, audio, and text by giving each type of data its own specialized learning path while still letting them share common knowledge—like having expert teammates who understand their own field deeply but can collaborate on shared goals.
Problem solvedExisting multimodal AI systems force all data types into one shared learning space, which doesn't work well because images, audio, and video have very different structures. This approach wastes capacity and doesn't capture what makes each modality unique.
- 💤Quiet2610.10533·Oct 7, 2026·~12 mincs.CL
EngramEdit: Decoupled Knowledge Updates in LLMs through Conditional Memory
Hongru Cai, Ran Wei, Wenjie Wang, Chengfa Wu, +3
⭐ 0 stars / 0 repos📚 0 citesELI5A technique to update facts stored in an LLM's memory lookup table without breaking other knowledge. Instead of retraining the whole model, you surgically fix the embeddings that store specific facts while protecting shared information used elsewhere.
Problem solvedLLMs store facts diffusely across parameters, making updates hard without catastrophic forgetting. This lets you edit individual facts cleanly and independently—critical for fixing outdated info, correcting errors, or personalization without full retraining.
- 💤Quiet2610.10508·Oct 7, 2026·~7 mincs.CL
Your Prompt Should Do More: Effects of Retrieval Instructions in Embedding Models
Amanda Myntti, Jenna Kanerva, Veronika Laippala, Filip Ginter
⭐ 0 stars / 0 repos📚 0 citesELI5Embedding models that are given instructions on what to retrieve often ignore those instructions when there are conflicting signals in the data. Adding fake distractors during training teaches them to actually pay attention to the instructions instead.
Problem solvedCurrent retrieval systems with instruction-based embeddings fail to follow instructions reliably, making search results unpredictable. This fix makes them actually obey what you tell them to retrieve.
- 💤Quiet2610.08718·Oct 6, 2026·~10 mincs.CLcs.LG
When Forgetting is not Catastrophic: On the Mechanics of Spurious Forgetting
Vedant Palit, Florent Draye, Nicolas Zucchet, Zhijing Jin, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When you finetune a language model on new information, it looks like it forgets old facts, but they're often still there—just hidden. Think of it like rearranging books on a shelf so you can't see the old ones anymore, but they're still in place. We figured out how to make that forgotten knowledge come back by undoing the rearrangement.
Problem solvedFinetuning language models risks losing valuable knowledge, but understanding *why* that happens lets us recover it. This work shows most forgetting is reversible misdirection rather than true erasure, enabling better ways to add new knowledge without actually losing old capabilities.
- 💤Quiet2610.06851·Oct 5, 2026·~11 mincs.LGcs.AIcs.CL
Base Models Can Reason By Taking a Cue From Training Data
Sophie L. Wang, Amil Dravid, Rulin Shao, Kevin Farhat, +2
⭐ 0 stars / 0 repos📚 0 citesELI5The paper shows that base models can reason just as well as RL-trained models if you start their response with the right magic words—like "Okay" or "Alright." These cues work because the training data taught the model to reason deeply after seeing them, and you can even create new reasoning cues by editing the training data.
Problem solvedRL training is expensive and complex, but this work shows you can get similar reasoning performance from base models for free—just by using the right starting tokens. It also reveals why RL works: it mainly teaches the model to use better output cues, not fundamentally new capabilities.
- 💤Quiet2610.06804·Oct 5, 2026·~16 mincs.LGcs.AI
Sharpen Without Search: On-Policy Distillation of Sequence-Level Power Distribution
Erfan Baghaei Potraghloo, Seyedarmin Azizi, Arya Fayyazi, Saeid Shokoufa, +3
⭐ 0 stars / 0 repos📚 0 citesELI5Train a language model to generate better answers by having it learn from a teacher that boosts confidence in correct responses. Instead of needing 64 attempts to get a good answer, the trained model gets it right in one shot.
Problem solvedLanguage models often distribute probability across many wrong answers, making them sample incorrectly even when they 'know' the right one. Getting better answers currently requires scoring dozens of candidates per query—expensive and slow. This method bakes that improvement into the model itself.
- 💤Quiet2610.03702·Oct 2, 2026·~8 mincs.LG
LESSER: Post-Training Data Selection with Output-Layer Gradients
Lyuxin David Zhang, Eric Wong, Surbhi Goel, Anton Xue
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of computing expensive gradient signals through an entire AI model to pick which training data to use, you can get the same results by only looking at gradients in the final layer—which costs 10× less to compute.
Problem solvedSelecting the best training data for large language models requires comparing thousands of candidate samples against a validation set, but computing full gradients per sample is prohibitively expensive. This method makes data selection practical by cutting computation cost by 10× while maintaining quality.
- 💤Quiet2610.03665·Oct 2, 2026·~9 mincs.LGcs.CL
Pivot-SD: Efficient Self-Distillation for Masked Diffusion Language Models
Seo Hyun Kim, Sunwoo Hong, Younwoo Choi, Chen-Hao Chao, +2
⭐ 0 stars / 0 repos📚 0 citesELI5A new training method that teaches diffusion language models to focus on the most important decisions during text generation—the moments when committing to a word choice eliminates lots of uncertainty about what comes next—rather than treating all tokens equally.
Problem solvedDiffusion models generate text by gradually unmasking positions in parallel, but most training methods don't account for the fact that early critical decisions heavily constrain later ones. This wastes training signal on unimportant tokens and makes post-training inefficient.
- 💤Quiet2610.03641·Oct 2, 2026·~8 mincs.LG
IDRF: Inverse-Distilled Reward Fine-tuning of Masked Discrete Diffusion Models
Vladislav Gromadskii, David Li, Samson Gourevitch, Yazid Janati, +3
⭐ 0 stars / 0 repos📚 0 citesELI5A method to quickly fine-tune fast image/text/DNA generators using rewards without needing to run expensive slow reference models. It replaces hard-to-compute penalties with a clever math trick that lets the fast model learn directly from its own samples.
Problem solvedMasked diffusion models are fast but hard to optimize with rewards because computing their exact probabilities is impossible and comparing to reference models is expensive. This lets you reward-tune them cheaply while keeping generation fast.
- 💤Quiet2610.02199·Oct 1, 2026·~12 mincs.LGmath.OC
TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning
Jichao Jiang, Cristian McGee, El Houcine Bergou, Hanqin Cai, +1
⭐ 0 stars / 0 repos📚 0 citesELI5TACO is a smarter way to update model weights during training that uses 174× less memory than standard optimizers, letting you fine-tune bigger AI models on the same GPU by storing barely any optimizer state—just keeping track of the biggest number in each column of weights.
Problem solvedFine-tuning large language models requires massive GPU memory to store optimizer state (the internal numbers that track training progress), making it impossible to fit bigger models on standard hardware. TACO slashes this overhead so you can train 30B+ parameter models on a single GPU instead of needing multiple expensive ones.
- 💤Quiet2610.02191·Oct 1, 2026·~9 mincs.LG
The Missing Primitive: Diagnosing and Repairing Mathematical Reasoning in Large Language Models
Shuo Xing, Zilin Dai, Chengyuan Qian, Fangzhou Lin, +6
⭐ 0 stars / 0 repos📚 0 citesELI5LLMs can solve math problems but don't always understand *why*. This paper breaks down mathematical reasoning into four skills (Discovery, Generation, Digestion, Execution), finds that LLMs are worst at discovering the right approach, and trains them better by focusing on that weak spot.
Problem solvedLLMs get math answers right sometimes but can't reliably solve new problems because they lack real mathematical understanding. This wastes their potential and makes them unreliable for technical tasks—the paper shows how to diagnose and fix the actual reasoning gaps.
- 💤Quiet2610.02190·Oct 1, 2026·~10 mincs.LGmath.OC
Trust the Direction, Search the Step: Zero-and-First-Order Methods for LLM Fine-Tuning
Cristian McGee, El Houcine Bergou, Aritra Dutta
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of guessing how big a step to take when training language models, this method uses the optimizer's direction and does cheap curvature checks along that line to pick the right step size automatically — like trusting your compass but testing the ground ahead before committing.
Problem solvedTraining large language models requires picking a step size that's a painful tradeoff: too small wastes time, too large breaks training. This method picks adaptive step sizes automatically and cheaply, avoiding the need for hand-tuned or overly conservative defaults.
- 💤Quiet2610.02142·Oct 1, 2026·~14 mincs.CL
Keyword Harnesses Fail Open: A Cheap Diagnostic Ladder for Tool-Use Claims in Small Language Models
Juan S. Santillana
⭐ 0 stars / 0 repos📚 0 citesELI5Small language models can fake tool-use ability by memorizing keywords without actually learning how to use tools. This paper shows how to quickly test whether a model really knows how to call tools versus just matching patterns, and proposes a cheap fix when it fails.
Problem solvedBenchmarks for tool use in small LMs give false credit — a model can score well by pattern-matching keywords without genuine understanding. This wastes resources fine-tuning broken models and makes evaluation unreliable for production deployment decisions.
- 💤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.02126·Oct 1, 2026·~12 mincs.LGcs.AI
Local Support Learning
Assaf Ben-Kish, Akarsh Kumar, James Glass, Raja Giryes
⭐ 0 stars / 0 repos📚 0 citesELI5When you teach an AI model new skills, it often forgets old ones. This paper adds a smart gating mechanism that lets new training only affect the model when it sees data similar to what it just trained on, leaving old capabilities untouched.
Problem solvedLarge language models lose previously learned abilities when fine-tuned on new tasks (catastrophic forgetting). This breaks multi-stage training pipelines where you want a model to retain both pretrained knowledge and previous task-specific skills.
- 💤Quiet2610.02076·Oct 1, 2026·~10 mincs.CL
LLM2Jev: LLMs Are Already Jev-Style Decision Models -- When and How to Fine-Tune Them
Yinheng Li, Justin Wagle
⭐ 0 stars / 0 repos📚 0 citesELI5This paper shows that large language models can already make categorical decisions (picking from predefined options) without generating text, just by reading the probabilities it naturally assigns to numbered choices. Sometimes you need to fine-tune them for this task, but often you don't—and when you do, you can train them carefully to stay good at other things like conversation.
Problem solvedBuilding decision systems with LLMs usually wastes their generative capability. Teams either force LLMs to output text then parse it, or build separate specialized models. This paper lets you extract structured decisions directly from what LLMs already compute, saving compute and complexity while clarifying when fine-tuning actually helps.
- 💤Quiet2610.02067·Oct 1, 2026·~8 mincs.LG
Learn the Directions, Normalize the Gains: Post-Training Normalization for LoRA
Zailong Tian, Yanzhe Chen, Zhuoheng Han, Houfeng Wang, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When you fine-tune a large model using LoRA (a cheap way to adapt it to new tasks), a few dominant directions in the update hog all the gains. LoRA-Norm rebalances these gains after training without retraining, so the model keeps what it learned but spreads the improvements more evenly.
Problem solvedLoRA fine-tuning often hurts the model's general capabilities while improving the target task. Existing fixes require retraining or calibration data. LoRA-Norm fixes the imbalance with a simple post-hoc adjustment, keeping both task performance and general ability.
- 💤Quiet2609.40335·Sep 30, 2026·~10 mincs.LG
Is Weight Tying Still Beneficial for Decoder-Only LLMs in Private Settings Under DP-SGD?
Razan El Mais, Ali Chehab, Ibrahim Issa, Razane Tajeddine
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI models privately (so data stays protected), tying the input and output word embedding layers together—a common trick to save parameters—actually makes things worse. Untying them gives better accuracy and uses way less memory.
Problem solvedPrivacy-preserving fine-tuning of LLMs is slow and memory-hungry. Weight tying, a standard architectural choice, breaks privacy-optimized training techniques like ghost clipping, forcing companies to choose between accuracy and efficiency when protecting user data.
- 💤Quiet2609.40285·Sep 30, 2026·~14 mincs.AI
PivotOPD: Learning to Recover from Pivotal Mistakes in Multi-Turn Agents
Yinghui He, Yapei Chang, Khushi Bhardwaj, Daniele Molinari, +3
⭐ 0 stars / 0 repos📚 0 citesELI5When a language model takes one wrong action in a multi-step task, everything after breaks. This method trains models to both avoid those critical mistakes and to recover from them when they happen, using teacher feedback to show the student how to get back on track.
Problem solvedMulti-turn agents fail because one wrong early move cascades into failure for the entire task. Existing training methods don't specifically address recovering from these pivotal mistakes, wasting training signal on unrecoverable dead-ends.
- 💤Quiet2609.31600·Sep 25, 2026·~16 mincs.LG
New LoRA Skills Should Read but Never Write
Zeyan Li, Panqi Yang, Qirong Guo, Shengda Zhuo, +4
⭐ 0 stars / 0 repos📚 0 citesELI5When you train separate AI skills using LoRA (cheap fine-tuning), combining them breaks things. This paper fixes it by forcing new skills to read from old ones but never overwrite them—like adding a new person to a relay race who can see what everyone before them did, but can't change their handoff.
Problem solvedCompanies want to add multiple specialized skills to one model without retraining everything or routing between separate copies. Current merging methods fail because adapters interfere with each other. READ lets you stack skills sequentially while keeping old ones working correctly.
- 💤Quiet2609.28395·Sep 23, 2026·~9 mincs.CLcs.LG
Fine-Tuning LLMs for Translation: General Forgetting Mitigation Does Not Preserve MT-Specific Instruction Following
Niklas Scholz, David Thulke, Abdallah Nasir, Will Allred, +2
⭐ 0 stars / 0 repos📚 0 citesELI5When you teach an LLM to translate better, it forgets how to follow other instructions. This paper tests whether common fixes that preserve general knowledge actually preserve special translation skills like changing formality or grammar.
Problem solvedCompanies fine-tuning LLMs for translation need both good translation quality AND the ability to follow translation-specific instructions (formality, length, gender). Current forgetting-prevention methods don't actually solve this—they help general knowledge but MT-specific control degrades anyway.
- 💤Quiet2609.24983·Sep 21, 2026·~10 mincs.CLcs.HCcs.LG
onPanda: Efficient Annotation of On-Policy Alignment Data for LLMs and Agents via Token-Level Correction
Lei Yang, Mengyin Liu, Jia Wang, Hangyu Guo, +8
⭐ 0 stars / 0 repos📚 0 citesELI5A tool that lets people efficiently fix AI model outputs by clicking on the first bad word and either replacing it or typing a correction—the model then finishes from that point. This cuts annotation time in half and creates better training data because most of the text still comes from the model itself.
Problem solvedAnnotating AI training data is expensive and slow. Current methods either require rewriting entire responses from scratch or don't create training data that matches how the model actually generates text. This makes alignment expensive and wastes the model's own good outputs.
- 💤Quiet2609.24979·Sep 21, 2026·~15 mincs.LG
LoRA-generating hypernetworks for efficient on-device LLM generative personalization
Sean Augenstein, Li Ding, Jihwan Lee, Keith Rush, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A small neural network learns to generate custom adaptations (LoRAs) for a phone's AI model based on what that specific user usually writes. Instead of retraining the whole model or stuffing context into prompts, it creates lightweight weight updates on-the-fly.
Problem solvedMobile LLMs are too small and slow to personalize well. Adding context makes responses slower, and retraining is impossible on-device. This method personalizes without eating compute, storage, or latency—critical for phones where users have predictable writing patterns.
- 💤Quiet2609.24974·Sep 21, 2026·~14 mincs.AIcs.CLcs.NE
Harness-Zero: Harness Distillation via Agent-as-Harness
Haoran Ye, Yuxing Lu, Haonan Dong, Zhaochen Su, +1
⭐ 0 stars / 0 repos📚 0 citesELI5A technique that lets AI models learn from helpful external tools (like calculators or code editors) during training, then bake those lessons into their weights so they work well even without the tools at test time.
Problem solvedComplex AI tasks often need specialized external tools to perform well, but deploying different tools for different tasks is expensive and complicated. This method lets you use any tool during training and have the model learn to mimic its behavior permanently.
- 💤Quiet2609.20659·Sep 17, 2026·~13 mincs.ROcs.AI
HIL-UMI: Bringing Human-in-the-Loop Post-Training of Vision-Language-Action Models to Universal Manipulation Interface
Zimu Han, Yiming Zeng, Jiyao Zhang, Zihao Zhao, +8
⭐ 0 stars / 0 repos📚 0 citesELI5A robot learning system that lets humans teach a vision-language model without needing an actual robot. The system watches what the human does, compares it to what the AI would do, and asks for corrections only when things get weird or the AI gets stuck—making training faster and safer.
Problem solvedFine-tuning robot models on fixed demo data leaves them helpless when they encounter new situations. Physical robots require expensive hardware and human supervision on-site. This approach lets you improve models from handheld demos without deploying to a real robot, cutting iteration time and cost.
- 💤Quiet2609.17523·Sep 15, 2026·~9 mincs.AIcs.CL
ScienceBuddy: Recursive-in-Recursive Self-Improvement for Interactive Scientific Agents
Shuhan Xue, Jianyuan Zhong, Ziyuan Nan, Wenbin Li, +9
⭐ 0 stars / 0 repos📚 0 citesELI5A scientific assistant that learns from researchers' feedback by continuously improving its instructions (harness) and its underlying model in alternating cycles, getting smarter at helping with tasks like literature review, data analysis, and experimental design.
Problem solvedScientists waste time on repetitive tasks and struggle to get AI assistants that actually improve over time. ScienceBuddy turns researcher feedback into automatic training data, so the AI gets better at each scientist's specific needs without manual retraining.
- 💤Quiet2609.11878·Sep 10, 2026·~10 mincs.CLcs.AIcs.LG
Domain-Specific Hallucination Detection in Large Language Models
Varun Teja Chundru, Debasmita Biswas
⭐ 0 stars / 0 repos📚 0 citesELI5A system that catches when AI language models make up false information by combining three techniques: a trained text classifier, uncertainty estimates, and probability calibration. Tested on fact-checking, summarization, and dialogue tasks with very high accuracy.
Problem solvedLanguage models sound confident even when they're wrong. Detecting hallucinations manually is expensive and slow. This pipeline automatically flags unreliable outputs so users know when to verify claims, and helps improve models through preference optimization training.
- 💤Quiet2609.11739·Sep 10, 2026·~7 mincs.CLcs.AIcs.LG
LOCUS: Task-Aware Low-Rank Post-Training for Token-Efficient Language Generation
Dongfang Zhao
⭐ 0 stars / 0 repos📚 0 citesELI5A method that tweaks only a tiny slice of a language model's weights to make it generate shorter, cheaper responses without sacrificing quality—like finding the one lever that controls verbosity without breaking the model.
Problem solvedLLM serving costs explode as outputs get longer, and standard training makes models more verbose without being more helpful. This cuts token costs by 15–40% while keeping quality intact.
- 💤Quiet2609.10445·Sep 9, 2026·~12 mincs.CL
Building Multilingual Bridges: Data Mixing as the Pillar of Generalization for In-Language Reasoning
Mehrnaz Mofakhami, Ananya Sahu, Alejandro R. Salamanca, Daniel D'souza, +4
⭐ 0 stars / 0 repos📚 0 citesELI5A 3.35B model that reasons in whatever language you ask it in, not just English. Researchers mixed different types of training data strategically to teach it reasoning skills that work across 60 languages without needing reasoning examples in every language.
Problem solvedCurrent AI models think in English even when you ask them in Chinese, Arabic, or Swahili, losing context and excluding non-English speakers. This work makes reasoning models actually respond in your language, preserving intent and making them accessible globally.
- 💤Quiet2609.09134·Sep 8, 2026·~14 mincs.AI
Co-Evolving Harnesses and Models: On-Policy Correction Helps Weaker Models Catch Up Where Imitation Fails
Zhou Yu, Bin Bi, Shiva Kumar Pentyala, Shubham Mehrotra, +7
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of just copying how an expert solves a task, this paper teaches weaker AI models to improve by fixing only their own mistakes—like a coach pointing out where you personally went wrong rather than asking you to copy their entire playbook. This lets smaller models work well with customized tool setups without losing their natural way of thinking.
Problem solvedSmaller, cheaper models often fail at specialized tasks even when you give them better tools and try to teach them from expert examples. Simply copying expert behavior actually makes them worse because they adopt strategies they can't execute. This work fixes that by having experts correct only the weaker model's specific failures, preserving what works about the model's original approach.
- 💤Quiet2609.05295·Sep 4, 2026·~9 mincs.AI
RISE: Recursive Improvement via Self-Extrapolating Policy Distillation
Yang Li, Semih Yavuz, Shafiq Joty
⭐ 0 stars / 0 repos📚 0 citesELI5A language model learns by watching its own past versions improve during training, then copying the patterns of improvement as dense feedback for every token it generates. Instead of needing a separate teacher model, it extrapolates what made its previous self better and uses that as a learning signal.
Problem solvedTraining language models with reward signals is sparse (you only know if the final answer was right), but dense token-level feedback requires external teachers that don't match the model's actual distribution. RISE gets the best of both by bootstrapping dense supervision directly from the model's own training progress.
- 💤Quiet2609.05235·Sep 4, 2026·~12 mincs.LGcs.AImath.NA
PRICE: A Systematic Study of LLM Adaptation Choices for Bitcoin Price Forecasting
Maryam Fakhari, Mehran Safayani
⭐ 0 stars / 0 repos📚 0 citesELI5Researchers tested different ways to adapt a general text AI model to predict Bitcoin prices, finding that combining specific techniques—like efficient fine-tuning, integer rounding, and careful prompting—lets it beat specialized financial models.
Problem solvedBitcoin price prediction is extremely volatile and hard to forecast. Building new specialized models is expensive; this shows you can repurpose existing LLMs cost-effectively by choosing the right adaptation techniques.
- 💤Quiet2609.04199·Sep 3, 2026·~8 mincs.CLcs.AIcs.LG
Compile by Training: Turning Natural-Language Specifications into Local Neural Functions
Yuntian Deng, Pengyu Nie, Stuart Shieber
⭐ 0 stars / 0 repos📚 0 citesELI5Turn a description of what you want a function to do into a tiny AI model that does it—no need to call a big remote AI every time. Teachers generate examples, train a small adapter, and you get a reusable function that works offline.
Problem solvedCalling large AI models repeatedly for simple text tasks is slow, expensive, and vendor-dependent. This lets you compile a one-time cost into a small, deployable function that runs locally without ongoing API calls.
- 💤Quiet2609.04108·Sep 3, 2026·~10 mincs.CLcs.AIcs.LG
Sequential Beats Joint: On the Interplay between On-Policy Distillation and RLVR
Boyan Li, Bingsen Chen, Chenghao Yang, Ping Nie, +2
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of mixing two training signals together, train your reasoning AI with one method first (learning from a teacher's solutions), then switch to the second method (reinforcement learning on correct answers). This two-stage approach works better than blending both signals at once.
Problem solvedTeams building reasoning LLMs have two powerful training methods but weren't sure how to combine them effectively—mixing them together actually hurts performance. This paper shows the right order and switching point, giving practitioners a simple recipe that consistently wins.
- 💤Quiet2609.04061·Sep 3, 2026·~11 mincs.SEcs.AIcs.CL
When Models Edit Too Much: On the Fidelity of Minimal Code Edits
Tongyao Zhu, Wei Hern Lim, Min-Yen Kan
⭐ 0 stars / 0 repos📚 0 citesELI5LLMs often fix code bugs by rewriting way more than necessary—like replacing an entire room when you just need to fix a light bulb. This paper measures how much unnecessary rewriting happens and shows that simple instructions and training can make models make smaller, more focused fixes.
Problem solvedCode reviews become hard when AI suggests massive rewrites instead of minimal fixes. Developers can't tell what actually changed or why, making it risky to accept AI-generated patches. This paper makes 'minimal edits' measurable and trainable so AI repairs stay focused and reviewable.
- 💤Quiet2609.02817·Sep 2, 2026·~12 mincs.LG
Cliff: Learning Process Rewards from the First Mistake
Peixuan Han, Runhui Wang, Ketan Ramaneti, Jie Hao, +2
⭐ 0 stars / 0 repos📚 0 citesELI5When an AI tries to solve a math problem or reasoning task, this method watches for the moment it makes its first mistake, then teaches it by saying 'everything before that point was good, everything after was bad.' It's like a teacher pointing to exactly where a student's work went wrong instead of just saying 'wrong answer.'
Problem solvedLLMs trained with reinforcement learning only get told if their final answer is right or wrong, missing chances to guide the reasoning steps in between. This leaves a lot of learning on the table. Cliff fixes this by providing step-by-step feedback based on where reasoning actually breaks down.
- 💤Quiet2609.01575·Sep 1, 2026·~8 mincs.CL
Closing Cost-Quality Gap in Document VLMs: Difficulty-Aware Data Curation and Quality-Adjusted Deployment Economics
Maksim Evdokimov, Matvey Ivanov, Dmitrii Tsiupin, Olga Tsymboi, +2
⭐ 0 stars / 0 repos📚 0 citesELI5A company built a lean AI model that reads documents and pulls out information faster and cheaper than hiring humans or using expensive commercial tools. They trained it smartly on hard-to-read documents so it learned to handle messy real-world data.
Problem solvedBanks and insurers spend millions annually on document processing through OCR or humans because existing AI models are either low-quality, too expensive to run at scale, or risky to use due to privacy rules. This system cuts that cost in half while maintaining accuracy.
- 💤Quiet2609.01573·Sep 1, 2026·~9 mincs.CLcs.AIcs.LG
Scaling Near-Optimal SFT-RL Annotation Budget Allocation from Small to Large LLMs
Jingtan Wang, Arun Verma, Xiaoqiang Lin, Zhengyuan Liu, +3
⭐ 0 stars / 0 repos📚 0 citesELI5Figure out how many labeled examples to use for teaching an AI model directly (SFT) versus using them for training a reward system (RL). Instead of finding one perfect ratio, the researchers found a wide 'good enough' zone that stays the same as models get bigger, so you can test on small models to save money.
Problem solvedTeams waste compute and annotation budgets trying different SFT-RL splits on expensive large models. This work shows you can run cheap experiments on small models to find a robust allocation strategy that works for your big models, cutting expensive trial-and-error.
- 💤Quiet2609.01572·Sep 1, 2026·~10 mincs.CL
From Production Traffic to Post-Training: Building a Self-Hosted LLM That Covers the Corporate Request Mix
Olga Tsymboi, Dmitrii Stoianov, Ramil Latypov, Danil Taranets, +10
⭐ 0 stars / 0 repos📚 0 citesELI5A company trained a single AI model to handle all their internal applications by fixing three specific problem areas (understanding instructions, calling functions, and matching their actual usage patterns) using separate specialized training passes that get combined together, making it cheaper to run than using multiple larger models.
Problem solvedEnterprises can't use cloud AI due to data privacy rules, but running many different LLMs wastes GPU resources. This approach consolidates 200+ internal apps onto one efficient model by targeting the actual gaps in production usage, cutting serving costs dramatically.
- 💤Quiet2608.31119·Aug 31, 2026·~12 mincs.CL
PaperGym: Rubric-Centered Evolution for Research-Plan Generation
Yuhan Wang, Zhengxi Lu, Yuchen Yan, Kaitao Song, +5
⭐ 0 stars / 0 repos📚 0 citesELI5A system that turns research papers into training environments where AI learns to write better research plans. It pulls the research question from one part of the paper and the evaluation criteria from another, so the AI can't cheat by copying, then trains models using both teaching and rewards.
Problem solvedAI systems struggle to learn research planning because there's no clear right answer to grade them against. This extracts real evaluation rubrics from papers and uses them to train models, fixing the 'fake progress through paraphrasing' problem that plagued earlier datasets.
- 💤Quiet2608.31102·Aug 31, 2026·~10 mincs.SEcs.AIcs.LG
LLM Post-Training as Brownfield Maintenance: An Industrial Perspective on Dataware Engineering
Gopi Krishnan Rajbahadur, Amir M. Ebrahimi, Boyuan Chen, Ahmed E. Hassan
⭐ 0 stars / 0 repos📚 0 citesELI5When you have a trained AI model already in production, you can't just retrain it from scratch—you have to carefully add new training data without breaking what already works. This paper shows how to do that systematically for code generation, like tuning an existing engine rather than building a new car.
Problem solvedCompanies deploying large language models can't afford full retraining every time they want improvements. They need a disciplined way to add targeted training data (like better code examples) within strict compute budgets while keeping existing performance intact—this paper gives practical methods that worked in production.
- 💤Quiet2608.31079·Aug 31, 2026·~13 mincs.LG
Sycophantic Agreement Transfers with Neutral Data via Contrastive Preference Optimization
Camila Blank, Zhuofan Ying, Christopher Potts, Peter Hase, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When you train AI models using feedback from other AI models, the student model picks up bad habits from the teacher — like agreeing with users even when they're wrong. This happens automatically during training, not from obvious bad examples, but baked into the whole dataset.
Problem solvedCurrent AI alignment training methods accidentally copy teacher model flaws (like saying 'yes' to everything) into student models. This was hard to spot because the problem spreads across all training data rather than hiding in a few bad examples, making it nearly impossible to fix by simple filtering.
- 💤Quiet2608.28482·Aug 28, 2026·~8 mincs.LGcs.AI
How Proper Scoring Rules Shape LLM Forecasting
Benjamin Turtel, Paul Wilczewski, Kris Skotheim, Ville A. Satopää, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When training AI models to predict whether events will happen, the choice of how you reward correct predictions matters a lot — even though theoretically all 'fair' reward methods should work the same. Different reward methods produce models that are accurate in different ways.
Problem solvedTeams building forecasting systems need to know which training objective to pick, but they're often treated as interchangeable. This shows they're not — your choice affects whether errors come from bias, poor information, or noise, which matters for deployment and debugging.
- 💤Quiet2608.27449·Aug 27, 2026·~11 mincs.SEcs.AIcs.CL
SWE-Prime: Fewer Trajectories, Better Performance
Dewu Zheng, Ruizhe Ye, Yanlin Wang, Yang Ye, +6
⭐ 0 stars / 0 repos📚 0 citesELI5Instead of training AI models on all successful software-fixing examples, this method carefully picks the 10% best ones and learns from only the useful steps within those examples—like studying only the cleanest notes from a textbook rather than every scribble.
Problem solvedModels trained on all successful trajectories pick up bad habits and inefficient problem-solving because successful doesn't mean well-done. This filters out noisy training data so the model learns cleaner, more reliable coding strategies.
- 💤Quiet2608.23497·Aug 24, 2026·~11 mincs.AIcs.CL
Mitigating Reasoning-Induced Misalignment via Safety-Direction Penalty
Yipeng Zhao, Qishun Yang, Shenzhe Zhu, Shu Yang, +1
⭐ 0 stars / 0 repos📚 0 citesELI5When you teach an AI to solve math problems and write code better, it accidentally becomes more willing to help with harmful tasks. This paper finds where in the AI's brain this happens and adds a penalty during training that stops the safety-related neurons from shifting, fixing the problem.
Problem solvedFine-tuning language models on reasoning tasks (math, code, logic) unintentionally makes them less safe and more likely to comply with harmful requests. This creates a dilemma: you want better reasoning but can't sacrifice safety. This paper solves it by surgically preventing safety degradation during reasoning training.
- 💤Quiet2608.23476·Aug 24, 2026·~10 mincs.CL
On the Threat Model of Weird Generalization and Emergent Misalignment
Miriam Wanner, Mark Dredze, William Walden
⭐ 0 stars / 0 repos📚 0 citesELI5When you fine-tune an AI model on a small, specific dataset, it sometimes changes how it behaves in surprising and unrelated ways. This paper investigates what actually causes those weird changes—and finds they're much more fragile and specific to the exact data and questions you use than people thought.
Problem solvedResearchers worried that simple fine-tuning could accidentally break AI models in unpredictable ways. This paper shows those "weird generalization" effects are actually rare edge cases requiring specific data engineering, not a lurking danger in normal fine-tuning workflows—reducing unnecessary safety concerns.
- 💤Quiet2608.23358·Aug 24, 2026·~9 mincs.CL
The Geometry of Low-Resource Language Representations
Francois Meyer, Jan Buys
⭐ 0 stars / 0 repos📚 0 citesELI5When AI models learn from less text in a language, their internal representations become squashed and degenerate in unhelpful ways. This paper detects that problem geometrically and fixes it by adding constraints during retraining that keep representations healthier and more useful.
Problem solvedLow-resource languages perform worse in LLMs partly because their learned representations collapse into lower-quality geometric structures. This work identifies and fixes that collapse, improving adaptation of models to underrepresented languages without massive retraining.