Search: “Repeat-After-Me”

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

Repeat-After-Me: Black-Box Adaptive Visual Prompt Injection

Researchers unveil Repeat-After-Me, a black-box visual prompt injection achieving over 80% success on Qwen3.6-27B and 47% on GPT-5.5.

Researchers present Repeat-After-Me, a black-box adaptive visual prompt injection that induces frontier VLMs to reveal PII or make malicious tool calls via injected images. It exceeds 80% attack success rate on Qwen3.6-27B and 47% on GPT-5.5 even when the benign user prompt is unrelated and does not authorize the injected task. In a real-world OpenClaw Discord deployment, a minimally injected image can overwrite TOOLS.md, enabling later remote code execution and secret exfiltration.

arXiv cs.CR·Sep 3, 22:44 UTC · 12d agoAI safety & security

55

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

Domain-Incremental Learning for Multi-Channel Replay Speech Detection

First continual learning benchmark for multi-channel replay speech detection shows task-specific beamforming cuts catastrophic forgetting across 24 acoustic environments.

Researchers frame replay-attack detection for voice-controlled systems as domain-incremental learning over acoustic environments, evaluating a beamformer-based detector across all 24 environment orderings of the ReMASC corpus with five seeds. Naive sequential fine-tuning raises error rates on previously learned environments by 18.8 points, while elastic weight consolidation halves forgetting but loses plasticity and gradient projection memory is statistically indistinguishable from naive fine-tuning. A task-specific beamformer keeping one spatial front-end per environment significantly improves final and incremental accuracy, and the last environment in a sequence dominates final performance.

arXiv cs.CR·Sep 10, 08:03 UTC · 6d agoResearch1

22

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 · 6d agoAI research1

28

Fortunate Recall: Ontology-Driven Memory Lifecycle Management for Persistent Coherence in LLMs

Fortunate Recall introduces ontology-based lifecycle policies for LLM memory, cutting confabulation roughly in half (e.g., 45.1% to 22.4%) versus Mem0.

Fortunate Recall (FR) is a composable policy layer that classifies personal facts into a 10+1 behavioral ontology and applies category-specific lifecycle rules including differential temporal decay, slot-key supersession, event-time validity, and retrieval routing. FR-Bank scores 76.9% on the new 516-question LifecycleBench, ahead of Mem0, A-MEM, Memory-R1, and MemoryOS (61%-70.5%), and 75.2% on LongMemEval-S. End-to-end, confabulation drops from Mem0's 45.1% to 22.4% over answered queries, with the ranking replicating on open-weight Kimi K2.5 and transferring to the independent BEAM benchmark (46.8% vs 32.9%).

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

30

I'm going back to coding by hand

A developer abandoned six months of Claude-assisted work on a popular app, resuming hand coding after losing track of what AI-generated changes did.

In a Hacker News post, a developer of an app with a solid user base describes abandoning a six-month Claude-assisted rewrite because they no longer understood what the AI-generated code changed or broke. The author notes their workplace already writes code exclusively with LLMs and says returning to hand coding restored understanding and motivation. The post advises others feeling detached from their craft to stop using AI coding assistants for a few days.

Hacker News · security·Sep 9, 07:22 UTC · 7d agoAI tools & infraHN 21↑ · 16 comments1

10

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

Continue, Adapt, or Yield: In-Turn Adaptation to Overlapping Speech in Full-Duplex Agents

Duplex Cue evaluation shows PersonaPlex full-duplex agents adapt in-turn to listener contributions in only 34.8% of collaborative cases versus 68.2% for humans.

The paper introduces Duplex Cue, an evaluation of in-turn adaptation in full-duplex voice agents that separates listener intent (backchannel, collaboration, interruption) from speaker behavior (continue, adapt, yield). Using 208 scorable pairs from 300 human-confirmed cues in unscripted English conversations, it compares recorded human responses with PersonaPlex continuations generated while replaying listener audio. Humans adapt within the turn in 68.2% of collaborative pairs versus 34.8% for PersonaPlex, which otherwise continues unchanged (42.4%) or yields (22.7%).

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 17:46 UTC · 5d agoAI research

15

MeClear: Cooperative Game-Theoretic Attribution and Risk-Aware Memory Clearance for Long-Horizon LLM Agents

MeClear uses cooperative Shapley attribution to clear harmful memories from long-horizon LLM agents, boosting task recovery by 25.5 points over baselines.

The paper introduces MeClear, a task-conditioned memory clearance framework for long-horizon LLM agents that identifies and selectively suppresses memories with negative downstream utility without permanently altering the persistent memory bank. It combines Leave-One-Out screening with sampled cooperative Shapley attribution to distribute utility across interacting evidence, resolving redundant conflict masking that single-removal evaluations miss. Across ten long dialogue memory pools it achieves 85.9% target recall and 82.3% overall task recovery, a 25.5 percentage-point improvement over LOO baselines.

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

32

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

Quantifying the Engagement Trap: Impact of Short-form Video Recommender Systems on Users with ADHD

A 302-participant study finds engagement-optimized short-form video recommenders cause disproportionate time blindness and distress for users with ADHD.

Researchers ran a stratified Prolific study with 302 participants comparing short-form video recommendation experiences with and without ADHD. Participants with ADHD reported significantly higher time blindness, post-usage regret, and emotional distress despite perceiving recommendations as similarly relevant. The paper proposes neurodiversity-aware, human-centered design interventions to mitigate these algorithmic harms.

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

18

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

Claude's new system prompt really doesn't want to reproduce song lyrics

Anthropic published updated Claude consumer system prompts, including changes steering the model away from reproducing song lyrics, likely over copyright concerns.

Anthropic publishes system prompts for Claude.ai and Claude mobile apps, including historic revisions, and has reorganized them into an index with per-model pages such as the Haiku 4.5 page showing the original October 15, 2025 prompt and an updated January 18, 2026 version. The latest consumer prompt strongly discourages reproducing song lyrics, a behavioral constraint likely tied to copyright considerations. Prompts for Claude Cowork and Claude Code are not included in the published set.

Simon Willison·Sep 2, 14:16 UTC · 14d agoAI safety & security

32

How Does mHC Use Its Residual Streams? Selective Routing and Near-Identity Mixing

Analysis of DeepSeek-V4-Flash shows four-stream mHC residual blocks use only about two streams effectively, with late-layer mixing providing little benefit.

The study examines the four-stream residual pathway of DeepSeek-V4-Flash, finding typical attention or FFN sites effectively use about two streams and that residual mixing is modest, occurring primarily in early layers. Replacing late mixers with identity increases C4 perplexity by only 1.9% while replacing early mixers raises it by 41%. Retaining the three largest routing weights per token increases perplexity by at most 2.7%, showing the model uses only part of the flexibility afforded by the four-stream design.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 16:02 UTC · 12d agoAI research

42

I-have-ADHD: A skill to stop your coding agent from burying the answer

Developer releases I-have-ADHD, an open-source skill that stops coding agents from burying direct answers under verbose output.

A GitHub project titled I-have-ADHD packages a 'skill' intended to make AI coding agents answer directly instead of hiding the answer inside lengthy output. It gained traction on Hacker News with 45 points and 42 comments. It targets prompt/agent configuration rather than introducing a new model or infrastructure component.

Hacker News · AI·Sep 8, 14:13 UTC · 8d agoAI tools & infraHN 45↑ · 42 comments1

28

Root-Cause Attribution Is a Search Problem: Continual Search for Long-Horizon Agent Failures

Continual Search framework iteratively prompts LLM judges to keep searching agent execution logs, boosting long-horizon failure root-cause attribution accuracy.

The paper frames automated root-cause attribution (RCA) for long-horizon AI agent failures as a search problem, since relevant evidence is sparse and distributed across massive execution traces. The authors propose Continual Search, an iterative framework that nudges an LLM judge across successive turns to keep hunting unresolved diagnostic evidence instead of settling on an early plausible diagnosis. They introduce MegaRCA-Mix, a benchmark of 50 human-annotated failure trials on long-horizon, execution-heavy tasks. On MegaRCA-Mix, Continual Search improves GPT-5.5's F1 from 0.349 to 0.498 (over 40% gain), and lower-tier models can surpass higher-tier counterparts when search is effective.

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

42

Can We Stop The Ads? Taxonomy and Characterization of Smartphone Splash Ads and Existing Countermeasures

Study of 108 ad-defense implementations finds only one tool blocked splash-ad navigation across ten popular apps, and it required Accessibility permission.

The paper taxonomizes smartphone splash ads — full-screen ads at app launch that trick users into trigger mechanisms such as moving the phone — and analyzes 108 documented advertising defenses for deployment barriers. Many defenses require device rooting, jailbreaking, runtime code injection, or application modification; others need extra permissions, rule maintenance, compilation, or payment. In evaluating 13 configurations of 11 tools across 10 popular apps, only one prevented ad-triggered navigation across all ten apps, requiring Accessibility permission and leaving ads visible roughly one second before dismissal. Documented harms include delayed emergency response, driver distraction, and degraded accessibility for vision-impaired users.

arXiv cs.CR·Sep 15, 15:24 UTC · 1d agoResearch

32

You Can't Prefer Emotions You Don't Sample: Intensity Undershoot in DPO-Tuned LLMs

Study quantifies DPO-tuned LLMs undershooting requested emotional intensity, tracing the gap to candidate-pool extremity rather than conditioning format.

Conditioning an instruction-tuned LLM on continuous valence-arousal targets yields gain of only 0.26 for valence and 0.13 for arousal on Llama-3.1-8B, far below faithful control of 1.0. The authors attribute undershoot to neutral-heavy preference corpora like EmoBank and candidate pools lacking extreme affect, leaving DPO without extreme exemplars. Uniform target coverage with a hotter candidate pool raises valence gain to 0.40 on Llama-3.1-8B and 0.44 on Qwen3-8B, with modest in-distribution cost; arousal gains remain unstable across seeds.

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

31

A Princeton Researcher Proposes Recurrent Looped Transformer (RLT) that Carries Decoder State across Every Token, Fixing 96 Blocks per Token with Unbounded Temporal Depth

Princeton researcher Yifan Zhang proposes Recurrent Looped Transformer, carrying full decoder state across every token for unbounded temporal depth.

Yifan Zhang's technical report defines the Recurrent Looped Transformer (RLT), pairing a causal encoder with a recurrent decoder whose final output and layerwise sliding-window attention cache carry into every subsequent token with no prompt-response boundary reset. The reference configuration ties 48 encoder and 48 decoder layers, executing 96 logical blocks per token while the state path grows to 48t blocks after t tokens at fixed per-token compute. The report details RL replay contracts that rebuild all states under current parameters and exact prefix snapshots for multi-turn serving, but explicitly reports no measured efficiency, reasoning quality, or scaling results.

MarkTechPost·Sep 13, 17:02 UTC · 3d agoAI research1

40

Opaque recurrence, and other AI terms that you should probably know

TechCrunch updates its plain-English glossary defining common AI terms from AGI and agents to chain-of-thought reasoning.

TechCrunch maintains a regularly updated glossary of AI terminology, defining terms such as AGI, AI agents, API endpoints, chain of thought, coding agents, compute, deep learning, and diffusion. It highlights 'opaque recurrence', the reasoning technique in OpenAI's new Astra model that has drawn attention from AI safety researchers. The piece is an educational living document rather than new research or a product announcement.

TechCrunch · AI·Sep 7, 19:24 UTC · 8d agoAI industry1

18

Claude is a Contrarian

Opinion piece argues Claude habitually contradicts explicit user instructions, injecting contrarian content despite CLAUDE.md rules and user objections.

A developer recounts repeated instruction-following failures with Claude, claiming it contradicts explicit requests, adds unnecessary work, and ignores AGENTS.md and CLAUDE.md directives. The author contrasts this with OpenAI, DeepSeek, and Qwen models, which he says more readily apologize and undo mistakes. He theorizes Claude's training makes it assume the human is wrong and needs correcting. The post is personal commentary with no benchmarks or systematic evaluation.

Hacker News · AI·Sep 14, 16:14 UTC · 2d agoAI industryHN 54↑ · 48 comments

12

Learning Length-Extrapolatable Recurrent Models

Researchers propose Credit Stabilization through Time, a training method letting recurrent models extrapolate up to 128x their training length.

The paper argues that length extrapolation failure in BPTT-trained recurrent models is better explained through state credit, the signal through which future losses reach earlier recurrent states. It introduces Credit Stabilization through Time (CST), which locally rescales the state-credit signal during backpropagation without rotating the corrected component or changing forward computation. Controlled experiments show improved performance beyond the training horizon, with gains at up to 128x the training length.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:59 UTC · 8d agoAI research1

25

How Fragile Is Safety Alignment at Frontier Scale? A Single-Direction Attack on a 320B MoE

Researchers show directional ablation breaks refusal in GLM-5.3-Flash, a 320B-parameter MoE, cutting refusal by 41–89 points across seven benchmarks.

The study extends directional ablation, a white-box attack that removes an aligned LLM's refusal behavior, from dense models up to ~70B parameters to GLM-5.3-Flash, a 320B-parameter mixture-of-experts model with 288 routed experts, four-wide hyper-connection residual, and block-FP8 quantization. Editing attention, dense, and routed-expert writers jointly removes 0.776 of refusal, with 74% of the effect existing only under the joint intervention; the conventional module-name-based recipe reaches only 0.066 and fails silently on MoE architectures. The attack yields 41–89 percentage-point reductions in refusal across seven harmful benchmarks with no detected capability change, and a category-concentrated refusal residue survives all edits at ranks 1 to 12.

arXiv cs.CR·Sep 9, 06:48 UTC · 7d agoAI safety & security

45

Omni-Streaming Thinking

Omni-Streaming Thinking fixes premature cross-modal commitment in streaming omni-modal models via pending claims verified against modality-specific evidence, beating baselines by over 10%.

The paper identifies 'premature cross-modal commitment', where streaming models keep relaying early visual interpretations even after audio contradicts them. OST generates evidence-linked pending claims with future verification intervals, stores audio and visual evidence separately, and refutes claims when contradictory evidence appears. Built on a frozen Qwen3-Omni-30B-A3B-Instruct backbone with lightweight adaptation, it outperforms open baselines by more than 10% relative on five streaming and audio-visual benchmarks. On the new OST-DiagBench it reaches d-prime 2.95 versus at most 1.38 for open baselines, while reducing vision-induced auditory hallucinations.

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

45

When Should LLMs Abstain? Chain-of-Self-Questioning for Selective Risk Control

Chain-of-Self-Questioning prompting cuts LLM wrong-answer commitments 32% relative while raising answered accuracy, holding across eleven model families.

The paper introduces Chain-of-Self-Questioning (CoSQ), a prompt-only framework that makes LLM answer commitment conditional on an explicit assessment of the information required to answer. On an 817-item TruthfulQA multiple-choice set, Grounded-CoSQ at τ=0.90 reduced mean unconditional wrong-commitment rate from 13.1% under chain-of-thought to 8.9% (a 32.1% relative reduction), while raising answered accuracy from 86.9% to 89.7% at 87.6% coverage. Improvements held across eleven open-weight and hosted model families and at every evaluated threshold, with convergent evidence from a Natural Questions short-answer evaluation.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:52 UTC · 1d agoAI research

30

Retrofitting Code Using LLMs to Support Exceptional Behavior

EXCODER combines static/dynamic analysis with LLMs to retrofit exception-handling code, achieving 85.92% pass@1 with Qwen 2.5 Coder 32B on Java benchmarks.

The paper introduces the task of retrofitting existing code with Exception Related Code (throw statements, guarding conditions, try/catch blocks) so that given Exceptional Behavior Tests pass. EXCODER performs context engineering by integrating static and dynamic program analysis output with LLMs; it was evaluated on a benchmark built from 304 methods across 75 GitHub Java projects. Combined with Qwen 2.5 Coder 32B, EXCODER achieves pass@1, 5, and 10 rates of 85.92%, 86.18%, and 86.51%, roughly 13 percentage points over baseline, and manual inspection reveals remaining limitations.

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

25

Def Con Attendees Targeted by Persistent Phishing Campaign

Huntress reports a persistent and elaborate phishing campaign targeting attendees following the Def Con security conference.

A Huntress researcher documented being targeted by an elaborate and persistent phishing scam after attending Def Con. The campaign specifically went after conference attendees, suggesting deliberate targeting of the security community. Details of the social engineering approach and persistence were shared.

Infosecurity Magazine·Aug 20, 09:30 UTC · 27d agoPhishing & fraud

40

Watch out: Apple timepiece can grab snippets of conversation without both speakers' consent

Apple's Watch Series 12 Live Rewind and Siri Recap transcribe nearby conversations without bystander consent, drawing EFF criticism over all-party-consent laws.

Apple Watch Series 12's Audio Intelligence features on the S11 chip include Live Rewind, which transcribes the last 15 seconds of a conversation after a Digital Crown double-press, processing audio in a Secure Exclave and routing it to a nearby iPhone. Siri Recap generates AI summaries of daily conversations without retaining raw audio or attributing speakers. Apple says an audible chime and visual cue alert bystanders, but privacy advocates including the EFF note that 11 US states require all-party consent for recording and that bystanders have no practical way to opt in or decline.

The Register · Security·Sep 10, 19:50 UTC · 5d agoAI safety & security 7 sources

30

Engineered Persuasion: Evaluating Personalized Pretexts in LLM-Generated Spear Phishing

A study of 180 US workers found each LLM phishing personalization level raised click-intention odds by 28%, but credibility depends on context fit.

The arXiv paper evaluates how personalized pretexts in LLM-generated spear phishing affect perceived credibility, using 180 US working adults across 1,436 evaluations of emails with four cumulative personalization levels, from workplace context to shared-project details. Convincingness rose 2.40 points per level in sensitivity analysis and click-intention odds increased 28% per level, while non-clickers shifted toward deleting rather than reporting. Qualitative coding showed details matching the recipient's role and routines supported credibility, whereas incorrect, vague, or channel-inappropriate details raised suspicion. The authors argue personalization effectiveness depends on pretext fit, with implications for workplace security training.

arXiv cs.CR·Sep 3, 19:21 UTC · 12d agoResearch

35

Learning to Solve Hard Problems in RL for LLMs by Never Giving Up

Paper introduces Never Give Up adaptive sampling, fixing RL's 'Matthew Effect' where compute is wasted on easy problems and hard problems see little improvement.

Researchers identify a 'Matthew Effect' in reinforcement learning for LLMs, where RL yields large gains on easy problems but minimal improvement on hard ones because compute is misallocated. They propose Never Give Up (NGU), an adaptive sampling method that keeps generating samples for a problem until one is correct, using asynchronous RL to filter easy problems cheaply and concentrate compute on hard ones. NGU improves performance per compute on the Deepscaler math benchmark and iteratively solves the Manufactoria coding task where standard GRPO with per-test reward fails.

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

45