Search: “unlearning”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

Forgetting Only What Matters: Layer-Selective Unlearning toward Robust LLMs

Researchers introduce FOM-UL, a layer-selective machine unlearning framework that improves forgetting-utility trade-offs and resists knowledge recovery after quantization.

FOM-UL selects transformer layers for unlearning using a forget-to-retain significance score, concentrating parameter updates on layers highly influential for the forget set while leaving most of the model unchanged. It reduces residual memorization versus GA, NPO, KLD, SURE, ReLearn, and LUNAR-based baselines on TOFU, KnowUnDo, and MUSE-style evaluations while preserving retain-set utility. Under 8-bit and 4-bit post-training quantization and adversarial prompts, it maintains stronger suppression of forgotten content, addressing brittleness of diffuse unlearning updates.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:50 UTC · 6d agoAI research1

36

Machine Unlearning as Private Retroactive Algorithms

A cs.CR paper defines private retroactive algorithms, showing machine unlearning is a data-maintenance problem and giving DP constructions for linear statistics, clustering, histograms.

The paper argues that machine unlearning's requirement to emulate retraining from scratch carries no meaningful privacy semantics against adversaries observing sequences of releases, recasting it as a data-maintenance question addressed by retroactive algorithms. It defines private retroactive algorithms, combining retroactivity with differential privacy under continual observation. Constructions achieve privacy and retroactivity at no asymptotic cost over privacy alone for linear statistics, clustering, and histograms, alongside impossibility results.

arXiv cs.CR·Sep 4, 16:32 UTC · 11d agoResearch

30

Forgetting Without Restarting: Execution-State Unlearning for Stateful LLM Agents

Researchers propose provenance-guided selective replay letting LLM agents forget revoked information without restarts, matching full reset behavior.

The paper formalizes execution-state unlearning for stateful LLM agents, requiring that agents behave as if a revoked memory record was never observed across transcripts, compressed memory, tool plans, and KV caches. It proves exact unlearning requires at least T-τ+1 recomputed transitions and that Provenance-Guided Selective Replay attains this bound via a provenance graph, KV cache cropping, and sanitized replay. In audits across three agent suites, nine baselines, and three model families, memory deletion left leakage unchanged, instruction-based forgetting collapsed under elicitation (Leak@probes = 1.00), and selective replay matched full resets at up to 9x fewer recomputed tokens.

arXiv cs.CR·Sep 4, 08:31 UTC · 12d agoAI safety & security1

42

Client-Side Probing of Deleted Ridge Statistics in Federated Unlearning

Researchers show malicious federated learning clients can probe broadcast classifiers to recover deleted samples, exposing exact label leakage on MNIST and CIFAR-10.

The paper shows that federated unlearning systems broadcasting updated linear classifiers leak compact additive training summaries to clients. A malicious client can submit known changes, identify server states from returned classifiers, and compare states around an isolated deletion to expose the deleted sample, class, or client summary, potentially enabling reinsertion. On MNIST and CIFAR-10, high-precision broadcasts allowed exact label recovery for every tested deletion, while lower precision sharply reduced fine-grained recovery.

arXiv cs.CR·Sep 3, 20:59 UTC · 12d agoResearch

45

Negative Self-Distillation: Learning to Reason by Avoiding Flaws

Researchers propose Negative Self-Distillation (NSD), a label-free LLM self-improvement method that diverges from self-generated flawed reasoning rather than imitating privileged solutions.

The authors show On-Policy Self-Distillation can degrade complex reasoning by forcing imitation of artificially confident traces built on privileged information, suppressing uncertainty and self-correction. NSD instead generates a question-specific negative condition — such as acting as a 'careless reasoner' — and pushes the model's distribution away from it without ground-truth labels. A dynamic gating mechanism isolates reasoning-critical tokens so gradient updates fix behavioral flaws without damaging foundational linguistic capabilities. NSD consistently outperforms OPSD and other label-free, self-bootstrapping reinforcement learning baselines.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research1

30

Inoculation Midtraining with Learned Neologisms

Inoculation Midtraining confines unsafe LLM behavior to a neologism-marked context, reducing misalignment after unsafe post-training but leaking under nearby contextual cues.

The paper introduces Inoculation Midtraining, which teaches a base model during midtraining that unsafe behavior belongs to a context marked by a learned neologism token, then post-trains on unsafe data within that context. Across supervised fine-tuning and RL post-training regimes, the technique reduces misalignment while preserving transfer of benign properties like German or Shakespearean prose. However, it does not outperform standard Inoculation Prompting, is sensitive to training configuration, and produces a leaky boundary that nearby contextual cues can reactivate. The authors conclude it is not yet a load-bearing component of a developer safety framework.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 17:12 UTC · 1d agoAI safety & security

42

Learning to Coach for Experiential Learning

Learning to Coach trains a dedicated LLM coach to extract transferable experiential knowledge from a frozen actor's trajectories, beating self-refinement.

Learning to Coach (L2C) trains an LLM-as-a-Coach to extract actionable experiential knowledge from a frozen actor model's previous solution trajectories, optimizing rewards based on the actor's guided response correctness. It studies same-instance and cross-instance rewards, where cross-instance elicits knowledge that transfers to other problems. Across mathematical reasoning and interactive text-games, L2C outperforms self-refinement and untrained coaches, scales better with extra inference iterations than larger decoding budgets, and transfers to out-of-distribution tasks.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 16:47 UTC · 1d agoAI research1

20

Privacy Failure in Split-LLM Training, The Returned Gradient Nullifies the Decoys

Researchers show split-LLM training leaks privacy via zero-valued gradients on decoy rows, exposing which activations are real despite passing forward-channel checks.

A systems-security case study of a two-node split-LLM training setup found that the returned output gradient from an Untrusted Cloud Node is exactly zero for decoy rows, revealing which rows are real. Across nine seeds, zero patterns identified real rows in 4,096 of 4,096 frames per run, and an attack on frame contents recovered 0.65 to 1.50 percentage points of extra tokens over a baseline. Both datasets passed forward-channel privacy and quality checks but failed once the returned gradient was included. Row-wise gradient clipping and noise closed the leak for roughly 0.01 nats of held-out cross-entropy, though five unmeasured attack classes remain.

Hugging Face daily papers·Sep 2, 20:00 UTC · 13d agoAI safety & security

58

Continual Learning Mechanisms Compose for Long-Horizon Memorization

Composing data, function, and weight anchors with merged LoRA raises 100-task long-horizon retention from 1.2% to 34.9% in continual fine-tuning.

The paper introduces long-horizon memorization: a model learns 100 query-answer tasks through continual supervised fine-tuning without retaining earlier examples or receiving task identifiers at inference. No single continual learning mechanism maintains strong retention at this horizon, so the authors compose complementary mechanisms along data/function/weight anchors and low-rank allocation rules. The best method combining all three anchors with merged LoRA ranks among the top 3 methods on all three datasets and raises average final retention from 1.2% to 34.9%, a 28-fold improvement.

Hugging Face daily papers·Sep 6, 20:00 UTC · 9d agoAI research

42

From Reweighting to Rewriting: Unlocking the Intervention Effects of Influential Samples in Training Data Attribution

Study shows rewriting responses of influence-selected training examples shifts LLM behavior more strongly than reweighting the same samples.

The paper examines training data attribution, arguing that influence functions identify high-leverage examples whose value goes unrealized under conventional weight-based reweighting interventions. It introduces influence-guided response rewriting, which replaces the responses of influence-selected examples with behavior-aligned or behavior-opposed supervision while keeping instructions fixed, tested across four open-weight LLMs using epistemic abstention as the primary testbed. Rewriting produces stronger, more persistent, and bidirectional behavioral shifts, including on safety refusal, while reweighting the same examples yields weak, inconsistent effects. The results motivate intervention-aware evaluation of TDA methods.

Hugging Face daily papers·Sep 1, 20:00 UTC · 14d agoAI research

30

What Breaks Under Pruning in Smart Homes, and When? Evaluating LLM Degradation Across Architectures and Task Complexity

Pruning study across four LLM architectures finds dense models degrade sharply on smart-home tool calling while MoE models tolerate far more.

Researchers systematically study pruning-induced degradation in smart-home tool calling across four LLMs spanning dense Transformer, dense hybrid, and mixture-of-experts architectures, combining depth, width, hybrid, and expert pruning methods, and evaluate over 19,500 instances from three datasets after post-pruning supervised fine-tuning. Dense models show narrow safe pruning regions followed by sharp degradation, while MoE models tolerate substantially more pruning. Pruning degrades grounded specificity (operation, device, argument, value) before schema-level intent, and aggressive dense pruning can induce systematic over-refusal.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:51 UTC · 16h agoAI research

20

Not All Prompts Are Equal: Exploration-Guided Prompt Scaffolding for Multimodal Reinforcement Post-Training

Exploration-guided prompt scaffolding rewrites training prompts by Exploration Potential Score, boosting multimodal RL post-training accuracy up to 11.5%.

The paper proposes dynamically adapting the training prompt distribution during online RL post-training of multimodal LLMs using the Exploration Potential Score (EPS), a lightweight rollout-based proxy for prompt utility computed from on-policy statistics with no additional overhead. Rather than discarding low-utility prompts, a teacher model generates scaffolded rewrites that preserve task intent while making training more informative. Integrated with GRPO on Geo3K and MMK12, the method achieves up to 9.7% relative in-domain improvement plus 11.5% on MathVision and 11.1% on MMMU-Pro.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research

35

Recognition-Refusal Misalignment in LLMs: Why Models Answer Structurally Unanswerable Questions

A linear hidden-state direction encodes question impossibility in 1.7B-70B LLMs, but misalignment with the safety-refusal pathway explains why models answer unanswerable questions.

The study examines why instruction-tuned LLMs from 1.7B to 70B parameters answer structurally unanswerable math and code questions instead of abstaining. A single linear direction in the hidden state separates answerable from impossible prompts, showing models represent impossibility before generation, but this direction is nearly orthogonal to the canonical safety-refusal direction. Generation-time steering along the recognition direction changes invalidity-aware behavior dose-responsively, and the geometry is present even at the pretraining endpoint, indicating a routing failure rather than an encoding failure.

Hugging Face daily papers·Aug 28, 20:00 UTC · 18d agoAI safety & security

30

RetroThinker: Enabling Retrospective Thinking in Speech LLMs

RetroThinker is a post-training framework letting the Moshi speech LLM self-correct reasoning mid-stream, adding 11% GSM8K accuracy at similar latency.

Researchers introduce RetroThinker, a multi-stage post-training framework that equips the Moshi speech LLM to verify and forward-correct chain-of-thought steps during streaming inference. It combines supervised fine-tuning on curated retrospective thinking data with length-based direct preference optimization (DPO). On GSM8K it achieves an 11% absolute accuracy gain over non-retrospective baselines at comparable latency.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:41 UTC · 5d agoAI research1

28

Understanding the Impact of Model Pruning on Long-Tail Forgetting and Explanation Reliability in Medical Imaging

Systematic study finds model pruning causes frequency-dependent long-tail forgetting in medical imaging and that gradient-informed methods best preserve explanations.

Across two long-tailed medical imaging datasets, two CNN architectures, four pruning methods, and sparsity up to 95%, the study measures predictive performance, explanation stability, and faithfulness. Rare classes degrade earlier and more severely than frequent ones, while explanation reliability depends mainly on the pruning strategy, with gradient-informed methods degrading least. Mechanistic analysis ties explanation collapse to loss of class-discriminative gradients rather than vanishing feature activations, recommending class- and explanation-aware evaluation of compression.

arXiv cs.AI / cs.LG / cs.CL·Sep 7, 17:44 UTC · 8d agoAI research

27

Eliciting Weak-to-Strong Generalization with On-Policy Reverse Distillation

OPRD distillation enables weak-to-strong generalization by amplifying verifier-supported policy updates, outperforming existing RL and distillation methods with fewer student updates.

On-Policy Reverse Distillation (OPRD) evaluates a weak teacher's policy shift relative to its reference policy on student rollouts and amplifies the verifier-supported component of the student's policy gradient. This rescaling preserves the stationary points of policy optimization while letting the student learn beyond the teacher's capacity ceiling. In successive model transfer and multi-teacher distillation, OPRD achieves higher performance with fewer student updates than existing RL and distillation approaches, and response-style analysis shows students remain closer to verifier-RL-trained models than to their weak teachers.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research

33

What Did I Just Say? Self-Listening for Full-Duplex Speech Models

Researchers propose Self-Listening, a full-duplex speech approach feeding realized model speech back as input to improve interruption recovery.

Full-duplex spoken language models can listen and speak simultaneously, but asynchronous text generation, speech synthesis, and playback cause mismatches between what a model believes it said and what the user heard. The paper defines the resulting recovery problem as anchor interruption and proposes Self-Listening, which interleaves user speech, model text, and played speech as input streams. The authors also release AnchorSpeech, a benchmark with homogeneous training and test splits tracking which ordered response items were actually spoken. Experiments show self-listening models achieve better anchoring performance than full-duplex baselines.

Hugging Face daily papers·Sep 3, 20:00 UTC · 12d agoAI research

22

Revisiting Complete Reasoning Traces for Post-Training

Researchers show full reasoning traces provide limited benefit in LLM post-training, with heavily truncated or endpoint-only trajectories performing comparably.

A pilot study plus attention-based analyses and controlled token-removal studies show intermediate tokens in reasoning trajectories contribute minimally to final reasoning quality. Partial trajectories remain effective even under heavy truncation, and training on endpoints alone leads to consistent changes in reasoning behavior. The finding also benefits reinforcement-learning and on-policy distillation post-training; code is released at github.com/naver-ai/revisiting-trace.

Hugging Face daily papers·Sep 6, 20:00 UTC · 9d agoAI research

32

I accidentally turned LLM memory into program analysis

A pwning.systems write-up describes how LLM memory functionality was unexpectedly repurposed into a program analysis technique.

A security research post on pwning.systems describes the author's discovery that LLM memory behavior effectively functioned as program analysis. The write-up is hosted on a security-focused blog and surfaced via a security-tagged link aggregator. Detailed technical content is not included in this feed, limiting verifiable specifics.

Lobsters · security·Aug 29, 03:16 UTC · 18d agoResearch1

30

Train Smarter, Not Harder: Switching Signal-Guided Training in Active Learning

HybridAL is an active-learning training schedule that switches from retraining to fine-tuning on stabilization signals, saving up to 49% time.

Researchers find that choosing between retraining from scratch and fine-tuning is an exploitable decision variable in active learning: retraining helps in early rounds while fine-tuning is safer once the model trajectory stabilizes. HybridAL monitors an online stabilization signal using spectral exponent change and accuracy change, switching from retraining to fine-tuning after sustained stabilization. Across three encoder backbones and six text-classification tasks with five seeds each, HybridAL keeps endpoint macro-F1 non-inferior within a 0.010 margin, saves up to 49% of retraining time, and improves the time-calibration trade-off measured by negative log-likelihood.

Hugging Face daily papers·Sep 5, 20:00 UTC · 10d agoAI research

20

The Router Within: Eliciting Native Skill Routing from a Frozen LLM

Gavel reads native skill-routing signals from a frozen LLM's forward passes with two linear maps, beating retrieve-and-rerank pipelines by up to 21.9 points on Qwen3-32B.

Gavel (Glance And Verdict from a frozen LLM) elicits skill routing from a frozen agent LLM using two trained linear maps that read mid-layer states, keeping all skill text out of context. A glance step scores the full library against compact per-skill banks built in one forward pass at installation; a verdict step resumes shortlisted skills' forward passes and fuses likelihood and yes/no judgments as a product of experts. It transfers zero-shot to three public benchmarks plus SkillTraj, a new benchmark of 372 simulated agent trajectories. On Qwen3-32B it beats progressive disclosure and retrieve-and-rerank pipelines adding 1.2B–16B external parameters by up to 13.4 points on written tasks and 21.9 when skills are needed mid-rollout.

Hugging Face daily papers·updated Sep 14, 17:58 UTC · 1d ago·first Sep 13, 20:00 UTC · 2d agoAI research 2 sources

40

MInTRL: Off-policy Intervention can boost On-policy RL

MInTRL injects sparse judge corrections into on-policy RL rollouts, expanding exploration beyond on-policy sampling while preserving learnability on math and code benchmarks.

Minimal Intervention Reinforcement Learning periodically has a judge-intervention policy replace erroneous suffixes of the current policy's output with short corrections, then returns control, keeping trajectories largely on-policy. Training uses a sequence-level advantage-regression objective that removes the need for importance sampling. Across math and code benchmarks it consistently beats standard on-policy and off-policy baselines, remains effective with self-intervention, and performs best at moderate intervention intensity.

Hugging Face daily papers·Sep 10, 20:00 UTC · 5d agoAI research

40

Thought without systematicity? Evaluating reasoning models on rule induction tasks

Study finds reasoning models often fail on structurally equivalent variants of tasks they solve, suggesting their reasoning lacks systematicity.

The paper extends rule induction tasks from cognitive science using task isomorphisms such as recombination and substitution to test systematicity in reasoning models. Despite solving tasks correctly, models frequently fail on structurally equivalent variants of the same task. The authors conclude many model behaviors lack systematicity, making it difficult to establish cognitive abilities beyond the specific evaluation contexts.

Hugging Face daily papers·Sep 11, 20:00 UTC · 4d agoAI research

35

Competence-Gated Pooling of Language Models and Priors for Event Forecasting

Paper proposes a competence gate pooling language model forecasts with external priors, improving Brier score from 0.0771 to 0.0732 across 2,357 binary questions.

The paper defines a language model's relative competence as its marginal value beyond an available external forecast, and derives conditions under Brier loss where model disagreement improves that forecast. A competence gate estimates domain-level source weights from resolved outcomes, shrinks uncertain estimates toward a global weight, and recalibrates the pooled forecast. Across 2,357 resolved binary questions and five language models, it improves the external baseline from 0.0771 to 0.0732 Brier and beats global forecast combinations, though it defers to the market on ForecastBench. Across four Qwen models, verbal confidence failed to identify when the model outperformed the external forecast, while outcome-estimated competence supported better abstention.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research

38

NeoHorse-1: Towards Recursive Self-Improvement via Agentic Post-Training with Routing Harness

NeoHorse-1 introduces agentic post-training with intelligent routing that lifts agent benchmark scores at 4B and 9B scales, prototyping recursive self-improvement.

NeoHorse-1 is a family of agent-native models trained through agentic post-training: routing-harness logs (predicted capability demand, service tier, interaction) become structurally validated training data organized into a three-stage SFT curriculum plus routing-guided on-policy distillation. Capability-guided allocation converts evaluation feedback into the next training mixture, closing an evaluation-selection-update loop. Post-training raises the macro-average from 58.94 to 64.87 at 4B and from 65.60 to 69.04 at 9B across eleven agent, tool-use, coding, and instruction-following benchmarks. The authors position it as a prototype of harness-mediated recursive self-improvement.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research

42

AuK Technical Report: An Open-Source Foundational Model for Speech Generation and Editing

Open-source speech foundation model AuK unifies generation and editing, trained on 1.95 million hours, with distilled AuK-Flash achieving 4.5x speedup.

AuK is an open-source foundational model that unifies speech generation and editing through natural-language instructions and audio context, trained on approximately 3.03 billion instruction-audio instances and 1.95 million hours of supervision across five task families including generation, content editing, and acoustic editing. It combines a multimodal LLM for semantic conditioning, a VAE jointly trained on speech, general audio, and music, and a hybrid rectified-flow Transformer using dual-stream MMDiT blocks followed by unified single-stream DiT blocks. Post-training applies human-feedback preference optimization for editing and reward-based reinforcement learning for generation, and the distilled AuK-Flash performs 4-step inference without classifier-free guidance at a 4.5x wall-clock speedup. Source code and model weights are released.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoModel release1

42

Do speech foundation models really learn words?

Researchers show via residualization that later layers of HuBERT and wav2vec 2.0 encode word identity and semantics independently of phonetic content.

The study argues that discriminative ability on words does not imply specialized word representations, since good word discrimination can be explained by phoneme encoding alone. By partialling out phoneme information using residualization, the authors show that later layers of HuBERT and wav2vec 2.0 encode words with reasonable fidelity independently of local phonetic content. Applying this disentanglement approach enhances higher-order linguistic information in word discovery tasks, informing analysis of speech foundation models used for recognition and speech tokens.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:47 UTC · 6d agoAI research

28

Encoded Early, Used Late: Where Transformers Begin to Act on an Inferred Partner's Expertise

Probing finds transformers represent an inferred dialogue partner's expertise in early layers long before it causally influences output.

Using ExpertCollab, a corpus of multi-turn research-planning dialogues between model-played personas at four expertise levels, researchers show that a partner's inferred expertise is most decodable in early transformer layers and decays to near chance before the network's midpoint. Counterfactual patching reveals that injecting the expertise difference at peak decodability barely changes a fixed late-layer readout, while injection past the midpoint propagates almost completely. The result bounds where readout or steering of partner-conditioned behavior must intervene, demonstrated on a single model with a synthetic corpus.

Hugging Face daily papers·Sep 6, 20:00 UTC · 9d agoAI research

30

One Symptom, Three Levers: A Critical Review of On-Policy Self-Distillation

A review paper frames on-policy self-distillation collapse as governed by three levers: token weighting, privileged information, and guidance decay.

The paper critically reviews On-Policy Self-Distillation (OPSD), where a language model trains on its own generations scored token-by-token by a teacher conditioned on privileged information such as reference solutions or environment feedback. It identifies collapse, the progressive narrowing of producible reasoning paths, as the dominant failure mode and analyzes it through three levers: signal weighting, the nature of privileged information, and teacher dynamics. The review is restricted to mathematical reasoning, reports no new experiments, and offers a shared vocabulary separating settled findings from disputed ones.

Hugging Face daily papers·Aug 25, 20:00 UTC · 21d agoAI research

45

When Models Edit Too Much: On the Fidelity of Minimal Code Edits

A 400-task BigCodeBench evaluation shows frontier LLMs widely over-edit code; a preservation instruction cuts excess edits and raises Pass@1 by 2.3 points.

Researchers built an evaluation framework from 400 BigCodeBench problems with injected AST-level corruptions, each with a known minimal patch, to measure over-editing in LLM code repair. Even strong models like GPT-5.5 produce unnecessarily large edits despite high Pass@1. Adding a preservation instruction reduced average excess Levenshtein distance from 0.195 to 0.131, cut added cognitive complexity by 26.6%, and raised Pass@1 by 2.3 points. Reinforcement learning post-training gave the best out-of-domain edit-fidelity trade-off, while supervised fine-tuning overfit to seen corruption patterns.

Hugging Face daily papers·Sep 2, 20:00 UTC · 13d agoAI research1

30