234 results for “Go”

The paper treats a benchmark as an empirical measure over item difficulty and formalizes two failure modes: measure mismatch (benchmark difficulty distribution differs from the intended one) and coverage gaps (uncovered difficulty regions that hide localized training progress). It proposes two diagnostic metrics with theoretical guarantees and analyzes 25 popular benchmarks across 7 domains using estimated item difficulties. It also introduces BenchFill, a difficulty-targeted item rewriting algorithm that reduces local coverage gaps.

huggingface.copaperAdded 31 Oct 2026🧠 AI

On-policy state training is a method for training chain embedding retrievers for multi-hop RAG on the states the encoder itself reaches, including those built on its own wrong retrievals. Each state is labeled with the earliest missing gold passage, other missing gold passages are masked, and updates are contrastive and mixed with teacher-forced states. It retrieves complete evidence more often than teacher-forced training and graph-based systems, and transfers to harder long-chain HotpotQA and 2WikiMultiHopQA variants the authors built.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

CORAL (Cognitive Resource Self-Allocation) is an agent-callable working-memory toolset that lets an LLM agent checkpoint task progress and verified facts, then reset its cluttered context and resume from a clean state. A Multi-episode Agentic Reinforced Policy Optimization algorithm trains the checkpointing. With an 8B model it reaches 42.8% average accuracy on GAIA, uses 6-7x fewer input tokens than a ReAct agent, and adds 8.0 points to a proprietary agent on BrowseComp.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

Decompose, Estimate, Select is a coverage-aware retrieval pipeline for long-form RAG. It splits a query into subquestions, ranks candidates with a coverage-trained bi-encoder, predicts a document-by-subquestion coverage matrix with a cross-encoder, and picks documents by greedy maximum-marginal coverage. On TREC RAG 2024, α-nDCG@10 rises from 0.625 to 0.702 (gold-nugget bound 0.718). A grounded self-feedback loop raises V_strict by 0.086 over two passes.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

Kolesnikov and Novoselov give block basis reduction (BKZ) algorithms for linear codes that need polynomial or quasi-polynomial numbers of calls to a minimum weight codeword oracle at fixed block size. The earlier Ghentiyala and Stephens-Davidowitz bounds are exponential. The paper adds a truncated BKZ and a DeepBKZ variant, with an implementation for block sizes 2 to 24 and approximation-factor estimates on random codes.

eprint.iacr.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🛡️ Security

DICE is a blockchain-powered federated learning (BCFL) algorithm for customizing large pretrained models among untrusted Web3 participants. It combines dynamic progressive learning and model slice verification, so hardware-limited participants can train part of the model, with a tree-structured committee consensus protocol and an efficiency-driven incentive scheme to scale to more data holders. Experiments cover vision and language models.

arxiv.orgpaperAdded 31 Oct 2026, published 29 Oct 2026🧠 AI

Gold vs. Translation is an October 2026 arXiv study of whether DeepL-translated MMLU measures the same thing as native benchmarks. It compares seven pairings against six native benchmarks in five Nordic and Baltic languages, using 29 models. Translated MMLU adds predictive value for curriculum-overlap benchmarks such as Skolprov (ΔR²=.128) but not for Sweden-specific SwedishFacts (p=.242).

arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

AskStream is a multi-turn benchmark for streaming video understanding that adds a third proactive action, ask, alongside wait and answer, for cases where video or user information is incomplete. It has 438 videos, 2,714 manually annotated frame-level time windows (wait, ask, answer), four task categories and eight subtasks. The strongest model reaches only 52.18% on the proposed Ask-F1 metric, in both multiple-choice and open-ended settings.

arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

Shor's algorithm compiled on cat qubits is an IACR ePrint (2026/2665) giving an end-to-end resource estimate on superconducting cat qubits, using repetition and LDPC cat codes. Factoring RSA-2048 needs about 23,000 cat qubits and 3.14 days, assuming phase-flip noise p_Z = 5e-4 and no bit-flips. secp256k1 ECDLP needs at most 30,000 qubits and 1 hour. A space-for-time trade runs RSA-2048 in 1.25 hours on about 611,000 qubits.

eprint.iacr.orgpaperPublished and added 28 Oct 2026🛡️ Security

CALM is a conflict-aware lifecycle memory governance framework for long-horizon language agents. It turns records into evidence-grounded memory cells, updates their validity and lifecycle states from support, conflict and dependency signals, and admits evidence at query time through training-free or learned gating based on temporal applicability. It beats baselines on LongMemEval-S and LoCoMo with Qwen and GPT backbones, and keeping superseded records helps earlier-state reasoning.

arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

The paper studies detection and temporal localization of fraudulent inducements (prompts to follow, join chat groups, click links) in internet finance short videos. It compares OCR+LLM, OCR+MLLM and a zero-shot MLLM, and builds a dataset of 2,419 videos (66.49 hours, 3,194 events, four categories). OCR+MLLM reaches mIoU 26.52 versus 14.49 for keyframe OCR+LLM, with 67.0 percent macro recall, using a recall-weighted F2 localization reward.

arxiv.orgpaperAdded 30 Oct 2026, published 28 Oct 2026🧠 AI

This paper treats LLM reasoning effort as a credence good and measures the counterfactual effect of effort levels on proprietary and open-weight models across four benchmarks, including long-horizon agentic tasks. Higher effort often fails on tasks lower effort solved, and on easy tasks the top level costs up to 42x the lowest. Starting at the lowest effort and escalating only after a verified failure matches or beats fixed top effort, usually at lower cost for proprietary models.

huggingface.copaperAdded 28 Oct 2026🧠 AI

This paper presents an annotated egocentric tennis dataset (egocentric video synced with five allocentric views, global positions, contact times, stroke types) and evaluates image encoders, video encoders and vision-language models on seven prediction tasks. Best models reach 0.14 m player and 0.54 m ball localization error and 0.14 s contact-time error. Depth input helps 3D ball localization, and longer histories do not help forecasting. A conditional diffusion model generates whole-body tennis motion in real time.

arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

NEXUS is a hierarchical reinforcement learning framework that pairs neural skills with symbolic meta-policies, so transparent reasoning sits at the level of high-level skills rather than atomic actions. It uses object-centric observations and LLM interaction to design reward functions and meta-policies. Agents learn disentangled skills, align better with goals in the game manual, resist reward hacking more, and cope better with game simplifications than deep RL. The paper also compares neural, symbolic and neuro-symbolic meta-policy architectures.

arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

Radical isogenies on every model is an IACR ePrint paper by Thomas Decru (October 2026). It gives radical isogeny steps of every odd degree N directly on short Weierstrass, Montgomery, twisted Edwards, Huff, Jacobi quartic, twisted Hessian, Legendre and Jacobi intersection curves, plus Kummer lines. In Tate normal form a step drops from 12.5N to 10N multiplications. Montgomery and twisted Edwards curves cost 10.5N+O(1) per step and 2N to push a point. All algorithms are inversion-free, with exact operation counts.

eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

LiveSearch is a live benchmark for financial search agents that stores each question as executable verifier code: a typed program of calls to a professional financial data service plus a declarative extractor. Gold answers are recomputed daily with no human or LLM in the loop, so memorized answers go stale. Six tool-calling models score 70.9% to 76.7% under web search, and 70% of questions change gold value over three days.

arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

OpenGray is a benchmark that adds tasks with known correct decisions to the OpenKBP-Opt head-and-neck dataset, including two overlap contradictions with provably incompatible dose goals and a feasible control. Four planning systems, from a rule-based script to a full LLM agent, were tested on 30 patients with Terra and Ministral 3 8B. Decision accuracy reached 95.4% and 92.1%, yet only 50% and 25% of overlap contradictions were escalated. SAGE logs of 39 radiosurgery runs showed an agent that lacked an action for stopping.

arxiv.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🧠 AI

AlgOssa is a decentralized secure aggregation protocol built on Ossa, a generic committee-aided, single-server construction for one-shot clients (following OPA and Willow, CRYPTO 2025). Ossa realizes secure aggregation with non-selective abort against a malicious server. AlgOssa adds Algorand-style sortition to rotate leaders and committees, bounds the chance of an honest server, and gives eventual delivery. Classical and post-quantum routes are evaluated.

eprint.iacr.orgpaperAdded 28 Oct 2026, published 27 Oct 2026🛡️ Security

TraceTrial-Bench is a benchmark that scores agent task performance and agent harness reliability separately. It has 95 mechanism-oriented tasks across seven components: context, execution, governance, lifecycle, observability, tools and verification. Across 4 harnesses, 9 models and 3,420 runs, macro-averaged harness scores range from 59.8% to 72.0%, and 31.1% of runs succeed despite failing at least one harness criterion.

huggingface.copaperAdded 27 Oct 2026🧠 AI

Your Wish Is My Commit is a controlled study of over-compliant refactoring in Codex and Claude Code, run across five models, 50 algorithmic tasks and 10 object-oriented tasks. Over 3,000 turns of repeated "refactor further" prompts, no model stopped on its own: each rewrote up to 31x the original codebase before first stopping and resumed edits after declaring the task complete. The paper defines six behavioral signals for detecting over-compliance.

arxiv.orgpaperAdded 28 Oct 2026, published 26 Oct 2026🧠 AI

Cryptology ePrint 2026/2642 presents a plaintext-recovery attack on the DBDH and CBDH variants of the Datta, Komargodski and Waters multi-authority ABE for NC1 (Journal of Cryptology, 2023). It needs one corrupt authority and two users, and succeeds with probability one in the static model. The flaw is an invalid extension of the Rouselakis-Waters LSSS matrix-normalization lemma. The paper also attacks two Datta-Pal (PKC 2023) attribute-based inner-product schemes and proves repaired versions secure in the random oracle model.

eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security

Subexponential Algorithms for LWE via Rejection Sampling on Superlattices is an ePrint paper by Ligeng Fan, Changpeng Shao, Hongbo Li and Dingkang Wang. It extends the Ducas, Engelberts and Loyer superlattice framework to give a provable classical search-LWE algorithm for prime q in [n^2, 2n^2], using m=4n samples and time and space exp(O(n/ln ln n)). A second variant runs in 2^((1/2+o(1))n/ln R) for general parameters. It resolves a gap left by Kirchner and Fouque.

eprint.iacr.orgpaperPublished and added 26 Oct 2026🛡️ Security

Philippe Gaborit proves that maximum-likelihood decoding of Gabidulin codes is NP-hard even for dimension one: deciding rank distance at most n-2 from the code {λg} is NP-complete. The reduction is deterministic, so Rank Syndrome Decoding and Rank Minimum Distance for F_{q^m}-linear codes are NP-complete under deterministic reductions, where the earlier reduction was randomized. It goes through a new pivot problem, Twisted Square Membership.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 25 Oct 2026🛡️ Security

The Policies of Programming Language Ecosystems is an October 2026 arXiv paper (cs.SE) that compares the policies of eight programming language ecosystems, including CRAN for R, across 38 policy categories. Three authors coded the policies with moderate agreement. Malware, intellectual property and content removal are covered everywhere, while package size limits, metric manipulation, typosquatting and binary uploads diverge.

arxiv.orgpaperAdded 28 Oct 2026, published 25 Oct 2026🛡️ Security

InteractiveWorld is an environment for closed-loop interaction between an AI assistant and a simulated human agent who sees the scene, follows instructions and acts independently. InteractiveBench, built on it, has 120 multi-turn tasks in six categories scored by verifiable, state-based rewards. Across 12 frontier MLLMs, the best model, Claude Fable 5.1, reaches at most 20% on long-horizon Guidance and 25% on Planning tasks.

arxiv.orgpaperAdded 27 Oct 2026, published 25 Oct 2026🧠 AI

HerHealthGPT is a conversational AI system for women's reproductive health that combines retrieval-augmented generation, context-aware clarification and source validation in a web interface. Evidence retrieval raises concern-category accuracy from 54.1% to 59.3% over fine-tuning alone on 540 messages from 90 cases. The clarification router reaches 85.6% recall and 86.2% specificity. In a 30-adult study, 83.3% preferred the retrieval-enabled version. The authors say clinical validation is still needed.

arxiv.orgpaperAdded 27 Oct 2026, published 24 Oct 2026🧠 AI

Gao and Hu's IACR ePrint 2026/2622 shows that if the matrix multiplication exponent satisfies ω ≤ 9/4 − η, heuristic lattice sieving runs in (3/2 − δ)^(n/2+o(n)) time under the spherical heuristic from the BDGL analysis. It builds on OpenAI's recent result that ω ≤ 9/4. With known matrix multiplication algorithms, the method already gives subquadratic search inside BDGL buckets. Only the abstract is available, so concrete parameters are not shown.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

The paper formalizes elliptic-curve semiprimality certificates by adapting the Goldwasser-Kilian primality criterion. For certificates built with complex multiplication, a norm-lattice reconstruction factors N from (N, S, D) alone in expected polynomial time. The author uses it, plus public-point and quadratic-twist attacks, to factor Reble's 1084-digit and Broadhurst's 5061-digit moduli, and shows that hidden-cofactor, withheld-CM-map and private-isogeny repairs also fail.

eprint.iacr.orgpaperAdded 26 Oct 2026, published 24 Oct 2026🛡️ Security

The paper builds two corpora, EventTyp and the human-validated EventTypGold, to study how people infer typicality and atypicality of events from what is said. Large-scale human and LLM experiments show that three CUES predict these inferences in humans: Commonsense Knowledge, Utterance Emphasis and Snark. In most settings LLMs lack the commonsense knowledge to judge an event's general typicality, so they struggle to follow the CUES.

arxiv.orgpaperAdded 27 Oct 2026, published 23 Oct 2026🧠 AI

GordieHowe is a language, certifying compiler and zero-knowledge proof system for building anonymous credentials on standardized signatures (ECDSA, RSA, ML-DSA). It proves an ECDSA-signed mobile driving license presentation in 64.8 ms with a 276 KiB proof, 10.1x faster than Google's Longfellow, and an ML-DSA-44 signature in 87.3 ms with at least 116 bits of quantum security. Compiler output and security theorems are checked in Lean. It introduces series-parallel IOPs and extends the BCS transformation in the QROM.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 23 Oct 2026🛡️ Security

Rentaro Shiba and Tetsu Iwata prove a tight multi-key security bound for the FX construction (the DESX generalization) in the quantum ideal cipher model. Security holds up to about 2^((n+κ)/3) total classical and quantum oracle queries against fully adaptive adversaries, for any number of keyed instances μ≥1. This improves their ToSC 2026 bound and matches the offline Simon's algorithm attack in the exponent.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 23 Oct 2026🛡️ Security

SOMA (Sharpness-aware Orthogonalized Momentum Algorithm) combines sharpness-aware minimization (SAM) with the Muon optimizer for LLM training. It avoids SAM's extra gradient computation by using stale, purely stochastic gradient noise as the adversarial perturbation. The authors prove sample complexity does not depend on perturbation direction, study robustness to heavy-tailed gradient noise, and test SOMA against post-training quantization degradation and catastrophic forgetting during fine-tuning.

arxiv.orgpaperAdded 26 Oct 2026, published 23 Oct 2026🧠 AI

This paper presents an offline evaluation harness for a production merchant-facing conversational agent. It stays reproducible when live backend data changes and can be regenerated when it goes stale. Used as the fitness function for GEPA prompt optimization under a correctness gate against reward hacking, it shrinks the full prompt surface by 3.5-7.6% without losing held-out correctness, across three subject-model families.

arxiv.orgpaperAdded 26 Oct 2026, published 22 Oct 2026🧠 AI

F2G-Pose is a direct, single-pass framework that predicts category-level object pose, metric size and camera-frame completed shape from one RGB-D image. It lifts frozen RADIO foundation features onto partial point clouds, tokenizes local geometry with DGCNN, and fuses it with a Mixture-of-Experts Transformer. It trains only on synthetic SOPE data, leads on SOPE and ROPE at 28 FPS, and is tested on HouseCat6D, HANDAL and real manipulation.

arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🧠 AI

CellTrack-Bench is a benchmark that tests vision-language models on microscopic cell tracking and compares them with specialised trackers. It has 1,537 problems covering 9,041 cell-linking decisions, drawn from 15 cell-tracking datasets across four imaging modalities, with a hard subset built from failures shared by distinct algorithmic trackers. The authors compare environment harnesses, benchmark 9 closed-source and 13 open-weight models, and analyse failure modes.

arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🧠 AI

DuoCook is an Overcooked-inspired benchmark in which one vision-language model controls two cooks from top-down views in Unreal Engine environments built with coding agents. It has 20 maps in five categories covering equipment contention, changing terrain and handoff dependencies. Four VLMs were compared; the best, gpt-6-astra, reached 26.2% mean order completion. A notebook memory ablation had mixed effects: positive for Claude and Qwen, negative for GPT and Gemini.

arxiv.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🧠 AI

Linear cryptanalysis of FRAST, a TFHE-friendly stream cipher, in the average key setting. It fixes the false-positive problem left open in the earlier attack by Bak et al., showing key differences fall into five indistinguishable classes per round. The Contract algorithm recovers the master key for 10 rounds and, on weak keys of density 2^-11.8 to 2^-5.4, reaches full FRAST within the claimed security.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

This IACR ePrint paper (2026/2597) systematically compares ring-oscillator-based additive noise generators, a hiding countermeasure against side-channel attacks. Experiments show many existing designs ignore output amplification and the risk of the noise being filtered out, so they lower signal-to-noise ratio too little. The authors give a guideline on inverter chain length, output amplification and frequency randomization, and build a tailored generator for an AES implementation that outperforms prior designs.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 22 Oct 2026🛡️ Security

TRIAD is a benchmark for omni-modal ambiguity resolution. It has 327 hand-written text-image-audio queries in 86 scene groups across 18 ambiguity categories, and removing any one modality makes the answer non-unique. Across 14 omni-modal systems, the best model trails humans by over 20 points in group accuracy. Without answer options, model group accuracy falls to single digits, and leave-one-out tests show audio cues are often underused.

arxiv.orgpaperAdded 23 Oct 2026, published 22 Oct 2026🧠 AI

IFC-MCQ is a method that automatically generates multiple-choice benchmarks from Industry Foundation Classes (IFC) building-model files, so answers can be graded by exact option-set match instead of human or LLM review. Its taxonomy has 15 categories and 36 subtypes in four groups, with answer keys from the file and distractors from file values or rules. Two agentic setups, tool-based and code-based retrieval, showed category-specific failures and variation by IFC model and interface.

arxiv.orgpaperAdded 23 Oct 2026, published 21 Oct 2026🧠 AI

MPIDetector is a detection framework for multi-modal prompt injection that uses few-shot in-context learning so an LLM can reason about the semantic intent of text and image inputs, without fine-tuning. The authors built a benchmark of eight textual and seven visual attack categories plus benign sets. They report up to 90.91% accuracy on text, 99.28% on images, and up to 99.80% detection on 500 obfuscated WebInject web-agent injections, beating baselines.

arxiv.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

Paper (arXiv, 21 October 2026) on structural false negatives in LLM vulnerability discovery harnesses. Starting from Knostic's OpenAnt and raptor, then 10 more open-source harnesses, the authors map 13 points where code selection, filtering, and finding storage or merging drop vulnerabilities. One file was dropped by six harnesses before the model saw it, five without notice. It covers attacker evasion, content-steered verdicts, prompt injection, and design principles and tests.

arxiv.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

SoK on design-level backdoors in block ciphers. It places four published designs (Rijmen and Preneel, Paterson, Bannier and Filiol, Peyrin and Wang) in one taxonomy and gives a sound algorithm that recovers a partition trapdoor from S-box tables. It attacks KG-DES, BEA-1 and LowMC-M: KG-DES key recovery takes minutes, and the LowMC-M MALICIOUS backdoor yields the key from 35 to 409 queries. Trapdoors hidden in linear layers leave no trace, so the authors recommend deriving constants verifiably from a public seed.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

RDK-CKKS is a framework for rigorous probabilistic error analysis of CKKS homomorphic encryption. It injects randomization keys (encryptions of zero) at key-switching and rescaling so each operation's error has provable tail bounds, which noise flooding needs for IND-CPA^D and threshold settings. It gives a full rigorous analysis of binary bootstrapping, at about 3% extra modulus and 27% extra key communication over bootstrapping keys.

eprint.iacr.orgpaperAdded 24 Oct 2026, published 21 Oct 2026🛡️ Security

Paper on memory injection, where prompt injection persists across sessions through the long-term memory of LLM-as-a-service platforms. It presents a general threat model and shows all NIST attack goals are achievable on ChatGPT Instant 5.3, Claude Sonnet 4.6 and Gemini 3 Flash. Vectors include personal memories, projects, skills, organization instructions and MCP resources. On Claude, shared memory lets an attacker compromise multiple users in an organization and exfiltrate prompts. Nearly half of the derived mitigations are unimplemented.

arxiv.orgpaperAdded 24 Oct 2026, published 20 Oct 2026🛡️ Security

Code2Video-Compass is a benchmark of 2,104 tasks for code-based video generation, where multimodal LLMs write executable programs that produce complete videos from text (T2V), image (I2V) or video (V2V) inputs. Tasks span 10 categories and 24 subtypes. Scoring uses 12 objective metrics and five MLLM-judge metrics. Across 15 proprietary and open-weight models from nine families, performance falls as construction, dynamic animation and state-dependency complexity rise.

arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026🧠 AI

DIVE is a benchmark for full-duplex interaction with visual engagement in continuous audio/video streams. It has 525 human-annotated samples across six tasks in three scenarios: proactive intervention, continuous engagement and interaction coordination. Evaluated real-time models reach sub-second average latency, but window response rates stay at or below 53.77%, and adapting ongoing responses to new information is hardest.

arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026🧠 AI

KNOX is a regulatory sandbox for generative models built by running AI agent workloads inside TEEs. It derives an attested policy manifest (applicable regulations, expected tool calls, permitted system calls) from the user prompt, and an attested reference monitor allows an action only if it matches. Actions and verdicts go into an attested execution graph that regulators can verify. The paper reports detection of prompt-injection deviations and under 1% overhead.

arxiv.orgpaperAdded 22 Oct 2026, published 20 Oct 2026🛡️ Security

BrainLoRA is a parameter-efficient fine-tuning method that adapts multimodal backbones of up to 104B parameters to predict neural responses. It predicts multiple timepoints in one causal pass instead of sliding windows, and a multi-LoRA kernel trains many adapters on a shared backbone. Across nine backbones it improves encoding, and a 200+ model ensemble ranks first on the Algonauts post-challenge leaderboard.

arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026🧠 AI

The paper analyses DeepDistinguisher, a transformer-like model that tells Goppa codes apart from random linear codes. Saliency maps and attention visualisation reveal a low-weight-row artifact in the random training instances that the model partly relies on. A pairwise-XOR rule inspired by minimum distance correlates strongly with the model's predictions, and the model loses most of its power on random matrices meeting both constraints. This suggests it exploits general combinatorial properties, not hidden algebraic structure.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🧠 AI

Analysis of DeepDistinguisher, a transformer model that tells Goppa codes from random linear codes. Using saliency maps and attention visualization, the authors find a low-weight-row artifact in the random training instances that the model partly uses. They propose a pairwise-XOR rule on generator matrix rows that correlates strongly with the model's predictions. On random matrices meeting the minimum distance and XOR constraints, the model loses most of its accuracy, so it exploits general combinatorial properties rather than hidden algebraic structure.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

Tandem is a runtime for serving hybrid linear-attention GUI agents on mobile NPUs. It saves recurrent state where consecutive prompts diverge, keeps most prefill on the matrix unit, uses a verification kernel that reads each weight block once, and releases NPU power votes between bursts. On a Snapdragon 8 Elite it cuts per-step latency 30% for text screen descriptions and 16% for screenshots, cuts energy per text step by 33%, and lowers loaded-model standby power from 0.76 to 0.22 W.

arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026🧠 AI

Fake News, Real Crashes is an October 2026 arXiv paper presenting a benchmark for information injection attacks on LLM financial trading agents. It spans five injection vectors, seven event categories and about 10,000 decisions on 15 U.S. stocks. Fabricated news reached 62% attack success versus 14% for prompt injection, and two 30-word templates hit 100%. Only hierarchical aggregation reduced success among the defenses tested.

arxiv.orgpaperAdded 21 Oct 2026, published 19 Oct 2026🛡️ Security

Provable Lattice Reduction in Nearly the Time of QR Factorization (IACR ePrint 2026/2541, October 2026) presents a deterministic lattice-reduction algorithm with running time Õ(n^ω(1+log κ_col(B))), free of heuristic assumptions. Its implementation used fewer instructions than flatter (CRYPTO 2023) in all 153 runs on q-ary, NTRU-like, scaled q-ary and Coppersmith inputs. Median flatter-to-new instruction ratios are 1.55 for q-ary and 1.86 for NTRU-like inputs.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

The paper presents the first efficient, compact implementation of high-order masked Raccoon (lattice-based signature, CRYPTO 2024) on ARM Cortex-M4, up to 32 masking orders. It uses 3+3+3 layer-merged 32-bit NTT/INTT with lazy reduction, a negative double Montgomery reduction, and one-shot SHAKE256 sampling (at least 1.80x faster). It beats the reference by 1.85x-2.25x and masked Dilithium3 at orders 2, 4 and 8. Second-order leakage tests show DPA resistance once micro-architectural transitional leakage is mitigated.

eprint.iacr.orgpaperAdded 20 Oct 2026, published 19 Oct 2026🛡️ Security

Self-evolving Agent Harness is a 66-page survey and theory paper on revising an agent's scaffolding (prompts, memory, workflows, tools, code, plugins) while model weights stay fixed. It frames search as evolutionary optimization and uses continual PAC-learning to derive a generalization bound, a retention bound and a high-probability admission rule with fresh validation data. It separates selection, activation, attribution and improvement as evaluation claims, and covers applications and governance. Code is at github.com/zgcagi/Harness-RSI.

huggingface.copaperAdded 19 Oct 2026🧠 AI

Computing endomorphisms of superspecial principally polarized abelian surfaces is a cryptanalysis preprint by Marc Houben and Lam L. Pham, posted to IACR ePrint in October 2026. It gives an algorithm that, under a standard heuristic, finds a non-scalar polarized endomorphism in expected time and memory p^(4/5+o(1)). The abstract is the only text available, so the method and its effect on specific schemes are not described.

eprint.iacr.orgpaperAdded 19 Oct 2026, published 18 Oct 2026🛡️ Security

Presents a fixed-point C implementation of the Mitaka signing algorithm, a simpler, parallelizable Falcon (FN-DSA) variant. It replaces MitakaZ's wide integral Gram root decomposition with a fixed-point square Cholesky decomposition, which cuts the cost of integer Gaussian sampling, and proves bounds on intermediate values and representation errors without empirical assumptions. Signing averages 361 kcycles (Mitaka-512) and 707 kcycles (Mitaka-1024) on AVX2, and 4.0 and 7.8 Mcycles on an STM32F411 Cortex-M4F. This makes floating-point-free lattice signatures practical on constrained devices.

eprint.iacr.orgpaperPublished and added 17 Oct 2026🛡️ Security

FuTransformer is a CUDA implementation of a Llama-style Transformer block for NVIDIA Hopper GPUs. It uses FP8 prefill with fused GEMM epilogues and INT4 weights plus an INT4 KV-cache copy for decode, with a block-diagonal Hadamard transform to cut cache quantization error. On one H100, prefill is up to 1.48x faster than compiled PyTorch FP8, and INT4 decode is 1.3-2.4x faster than the faster PyTorch baseline. Llama-3.1-8B decode takes 2.8 ms per step at batch one, versus 8.1 ms for compiled transformers. WikiText-2 perplexity rises from 6.24 to 7.23 with round-to-nearest INT4 weights, or 6.99 with GPTQ.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

GLOBE is an agentic framework that optimizes e-commerce product listings for generative search by storing strategies in an evolving handbook of explicit, field-scoped behaviors. An Editor applies behaviors and gets rank-based feedback, a Reflector turns it into updates, a Moderator removes redundant proposals, and a Curator commits changes. Harmful behaviors are deactivated. Structured behaviors beat monolithic prompt optimization and transfer to unseen product categories.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

MobileInject is a benchmark for testing MLLM-based smartphone agents against indirect multimodal injection. It has an interactive evaluation framework with 11 scenarios, 9 security-risk categories and 108 executable risk instances. It adds Cross-Modal Consistency Injection, Multi-Role Collaborative Deception, Reasoning-Camouflage Injection and a Reasoning Security Diagnosis Framework. Experiments find broad vulnerability, with many failures from early reasoning hijacking.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🛡️ Security

ePrint paper identifying five side-channel vulnerabilities in the signing procedure of Round-3 SQIsign, the isogeny-based signature scheme in NIST's additional post-quantum signature process. It gives polynomial-time algebraic algorithms that recover the secret key from leaked quaternion/ideal intermediate values, including cases where only partial bits leak. It also demonstrates power analysis on the SQIsign source code to extract the needed leakage, which earlier work on Round-1 or toy parameters did not do.

eprint.iacr.orgpaperAdded 17 Oct 2026, published 16 Oct 2026🛡️ Security

Beacon is a safety alignment framework for large reasoning models that fixes two GRPO failure modes: advantage collapse, where homogeneous rollout groups give vanishing advantages, and unsafe diversification, where unsafe behaviors persist and spread. It combines Safety Signal Recovery (advantage-guided trajectory filtering plus safe reference supervision) with Safety-Utility Decoupled Alignment (category-aware rewards, benign-only KL anchoring). Tested on four Qwen3 and DeepSeek-R1-Distill variants across eight benchmarks, it cuts average safety error by up to 32.83 percentage points with low over-refusal.

arxiv.orgpaperAdded 20 Oct 2026, published 16 Oct 2026🧠 AI

This paper analyses software supply chain (SWSC) attacks against VLSI design tools. It empirically studies the software composition, security features and tool interactions of VLSI suites, then builds a taxonomy linking SWSC attacks to VLSI attacks, design-flow stages and security outcomes. The taxonomy yields 717 possible new attacks, 60 of them high feasibility, with a threat model, a defense assessment and case studies on an open-source VLSI flow.

arxiv.orgpaperAdded 20 Oct 2026, published 15 Oct 2026🛡️ Security

P^3-WAM is a unified world action model for egocentric dexterous manipulation with three modes: Perceive (reconstruct articulated hand motion and camera trajectories from video), Predict (generate visual futures under prescribed actions) and Plan (jointly generate action trajectories and their anticipated visual outcomes from an initial image, a language instruction and an optional visual goal). It adds a compact structured 3D action representation to a pretrained video diffusion transformer through a mixture-of-transformers design with shared base weights, modality-specific adaptation and bidirectional visual-action attention. Randomized modality visibility lets video and 3D actions act as either context or target. Unified training beats single-mode training and outperforms specialized baselines on 3D hand reconstruction and action-conditioned video prediction across four datasets, and gives better instruction adherence than video-generation baselines.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

The paper identifies an "exploration dilemma" in modern Mixture-of-Experts models. Shared experts reduce the variability of token representations, which makes routing less exploratory. Fine-grained expert segmentation enlarges the combinatorial routing space and so needs more exploration, which means its extra expressiveness may go unrealized. It proposes MirrorMoE, which shrinks the exploration space by suppressing unnecessary experts per token, and reports consistent gains across model scales.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Presents MLExpert, a 35B Mixture-of-Experts agentic model trained for autonomous long-horizon machine learning engineering. Training uses a Kaggle-MLE Factory to build executable tasks and an interaction harness, hierarchical agentic SFT with outcome-guided supervision, and Windowed Interaction RL (WIRL). WIRL treats the multi-turn decisions between successive experiment results as one execution window with a shared outcome reward, and uses asynchronous collection and policy correction. On MLE-Bench Lite the average medal rate rises from 37.9% to 72.7%, comparable to larger frontier models such as Kimi-K3 and GLM-5.3. It also improves on NatureBench Lite, agent scaffold optimization and algorithm optimization.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Proposes a steering agent that supervises LLM agents and multi-agent systems during execution and corrects goal drift, where long-horizon tool use and inter-agent collaboration slowly diverge from the overall objective. A low-cost fast path decides when to intervene, and a high-cost slow path generates how to intervene. Both paths are trained jointly with reinforcement learning, combining a pairwise ranking objective with GRPO. On information-seeking search tasks it improves performance and efficiency for single-agent and multi-agent systems, generalizes out of domain, transfers to unseen executors, and allows intervention frequency to be adjusted without retraining.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

The paper separates "active" facts (which support generalization beyond recall) from "inert" ones. It builds new relations by relabeling answers of existing ones (Paris -> Europe becomes Paris -> crab), fine-tunes on a subset of subjects, and tests held-out subjects that share an answer (Munich -> crab). Across eleven language models and 70 relations, linear readability of the original relation in pretrained representations correlates with this generalization at Pearson r = 0.87 to 0.92 within each model. The result holds after controlling for fine-tuning set size, original-relation accuracy and subject frequency in pretraining text, and it survives re-randomized labels, seeds and thirteen other label categories. Mapping wrong labels back to the original answers shows the fine-tuned model's errors follow the linear probe's top answers.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Proposes EdgeFlow, a hybrid KV cache migration scheme for distributed LLM inference across heterogeneous edge servers in Collaborative Edge Computing. It combines direct KV cache transmission with activation-based recomputation, overlapping computation and communication to cut migration time when servers disconnect or overload. The authors formulate a multi-node KV migration optimization problem and give a 2-approximation algorithm built on improved LP relaxation and bipartite graph techniques. Experiments on a real distributed LLM inference platform show up to 45% lower migration time.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Describes a general-purpose LLM-based AI tutor for computing courses that accepts questions in Mandarin and replies bilingually, also generating glossaries of technical terms. It uses a specialized multi-source RAG pipeline with a novel question extraction mechanism to draw on diverse course materials. Evaluated on 91 Piazza posts: 83.52% answered correctly and helpfully, 76.92% of questions got high-quality translations, and 64.47% got glossaries.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Presents a modular, fully onboard UAV navigation pipeline that closes the "human-aware safety gap" of geometry-only planners. A shared BLIP encoder drives captioning and text-conditioned segmentation, which is fused with depth for 3D obstacle localization. Qwen-2.5-0.5B, stabilized with RAG and grammar-constrained JSON decoding, infers per-category risk once per class and caches the verdict. Perception runs at 10 Hz on a Jetson Orin NX, and fallback LLM queries take about 0.8 s off the control path. In Gazebo it gives roughly 3x fewer collisions than a geometric planner and raises semantics-aware landing success from 34% to 96%. The 224-pixel encoder input limits small-object perception at range.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

GACC-Bench is a benchmark for Goal-Adaptive Context Compression, testing how well LLMs retain goal-relevant information when compressing a source context under a length budget before downstream questions are known. It has 500 goals and 2,571 human-reviewed questions over 281 document and agent-trace contexts from seven collections; a fixed reader answers the withheld questions from the compressed context. Ten LLM compressors show large gaps to full-context performance, especially in answering every question tied to a goal. Target-goal conditioning improves accuracy over goal-agnostic compression, while mismatched goals hurt it.

arxiv.orgpaperAdded 17 Oct 2026, published 15 Oct 2026🧠 AI

Shows a protocol-level reaction attack on CKKS homomorphic-encryption deployments that publish coefficient-to-slot (C2S) evaluation keys and let the client return a 1-bit validity response. A malicious evaluator shifts a public encryption key, uses the public C2S layer to repack it into a ciphertext whose validity depends on one secret coefficient, and recovers a ternary secret key with O(H) queries, within a factor 2/log2(3) of the entropy lower bound. Each query is re-randomized with a fresh encryption of zero to evade trivial detection. The authors implemented it end to end in Lattigo v6.2.0 and recovered full keys across four standard CKKS parameter sets. It does not break RLWE or CKKS IND-CPA security.

eprint.iacr.orgpaperPublished and added 15 Oct 2026🛡️ Security

Presents ChainGraph, a pattern that externalizes exploit-chain reasoning for LLM pentest agents (Claude Code, Codex) into a Neo4j property graph exposed via the Model Context Protocol. Findings, attack steps, credentials, assets and tamper-evident evidence receipts are typed nodes with pre/post-condition edges, queried with Cypher and Graph Data Science for next-step inference, entry-to-crown-jewel pathing, chain-severity promotion, provenance and chokepoints. On a synthetic GOAD-style multi-forest Active Directory engagement, three Medium findings become Critical once chained, betweenness centrality identifies break-points, and reasoning payload drops ~98% (token proxy); results are single-run and illustrative.

arxiv.orgpaperAdded 17 Oct 2026, published 14 Oct 2026🛡️ Security

ChainGraph is a pattern that moves exploit-chain reasoning out of the flat context window and into a Neo4j property graph. Findings, attack steps, credentials, assets and tamper-evident evidence receipts are typed nodes with pre/post-condition edges. The graph is wired to Claude Code or Codex through MCP with no custom harness. Five operator questions (next-step inference, entry-to-crown-jewel pathing, combined-severity promotion, evidence provenance, chokepoint identification) become reusable Cypher and Graph Data Science queries, plus a chain-severity score. On a synthetic multi-forest Active Directory lab modeled on GOAD, three findings rated Medium in isolation become Critical once their path to the forest root is materialized. Scoping each decision to a graph result cut the reasoning payload by about 98% on a token proxy. The authors say the results are illustrative single-run measurements, not a benchmark.

arxiv.orgpaperAdded 17 Oct 2026, published 14 Oct 2026🧠 AI

INFUSE is an end-to-end benchmark for indirect prompt injection (IPI) across long-horizon agent workflows (shell commands, code changes, dependency installs, remote services). It has 40 realistic tasks and a taxonomy of 56 attack scenarios in five threat categories, with attacks injected via interaction surfaces encountered mid-task. Across 19 LLMs (GPT, Claude, Gemini, Llama, Gemma, Qwen) and 41,824 adversarial trajectories, mean attack success was 19.6% (LLM-judged) and 15.4% (heuristic), per-model 3.2–41.9%; guard models gave limited protection, while prompt-level hardening cut mean ASR from 58.2% to 14.3%.

arxiv.orgpaperAdded 17 Oct 2026, published 14 Oct 2026🛡️ Security

ePrint paper evaluating ASCA (SAT-based) and SASCA (belief propagation) side-channel attacks on the AES-based MILENAGE authentication algorithm in USIM cards, using neural-network leakage predictions to recover subscriber key K and operator secret OPc from a single trace. SASCA alone succeeds in 87.7% of attacks but converges to a wrong OPc in 6.1%; ASCA succeeds in only 34% within a 1-hour timeout. The hybrid, where BP refines the predictions before they go to the SAT solver, reaches 93.8% with lower average runtime. It also proposes a countermeasure that masks each AES round key with an independent per-device secret, and the authors report it defeated the hybrid attack in all evaluated cases.

eprint.iacr.orgpaperAdded 15 Oct 2026, published 14 Oct 2026🛡️ Security

Proposes a cost model and metric for an adversary who collects side-channel traces classically and finishes the key search on a quantum computer. Shows any quantum algorithm needs Omega(sqrt(r)) cipher evaluations for key rank r, and that the quadratic advantage holds only up to a rank bound set by the NIST MAXDEPTH budget (about 2^58.6 for AES-128 at D=2^40). Defines a quantum-aware key rank computable from existing rank estimators, with simulated-leakage experiments showing a depth-limited quantum adversary is worth about 22 traces at SNR 0.125.

arxiv.orgpaperAdded 16 Oct 2026, published 14 Oct 2026🛡️ Security

Draft ERC from Quantova Inc that has Ethereum bridges accept cross-chain message batches only when a committee signs the Merkle root with RFC 8554 LMS hash-based signatures. The guard contract requires a strict majority of distinct unfrozen keys, records used leaves, freezes any key that signs a leaf twice, binds digests to domain tag, chain ID, guard address and epoch, and enforces a 60-second delay. It reports gas benchmarks (about 205k per LMS W4 height-10 verify, 12.44M worst-case rotation under EIP-7825), a hybrid LMS+ECDSA migration mode, and a NioLabs assessment with no critical or high findings. It argues that Shor's algorithm makes secp256k1 and BLS committee keys a quantum theft target.

ethereum-magicians.orgpaperPublished and added 14 Oct 2026🛡️ Security

Presents a modular device-binding protocol for post-quantum anonymous credentials. The phone Secure Element signs a verifier challenge with an unmodified FIPS 204 ML-DSA interface, and the user proves knowledge of that signature in zero knowledge at each presentation. Using ML-DSA's structure avoids the cost of generic NIZK systems such as Longfellow. The most efficient variants assume weak-MLWR for unlinkability, and that assumption can be dropped at some efficiency cost. The protocol works with different anonymous credential schemes, and a proof-of-concept implementation is included. This matters for planned EU age-verification and Google Wallet/mDL rollouts, which need protection against credential sharing.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

Furue and Aikawa build and analyze algebraic attacks on the Regular Syndrome Decoding Problem (RSDP), which underlies code-based post-quantum schemes. They extend the Wang et al. hybrid algorithm to allow an arbitrary XL solving degree d, and add two variants: an XFL-based one (partial Gaussian elimination plus variable guessing) and a WXL-based one that exploits Macaulay matrix sparsity. Complexity analysis shows the WXL variant with d>2 wins for small block size β, while the original hybrid wins as β grows. This matters for setting RSDP-based scheme parameters.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

Preprint that speeds up Pollard rho on GPUs by rebuilding field arithmetic: packed normal-basis representation, the CUDA 13.3 PTX carry-less multiply (clmad), and three-input logic instructions. On one RTX PRO 6000 Blackwell it goes from 0.85 to 14.64 billion iterations/s (17.2x) on the Certicom ECC2K-130 challenge, which puts the whole challenge under five GPU-years. The same levers give 1.52x on P-256 and 2.61x on P-384, which leaves P-256 about 6e21 card-years away. It also reports twelve GPUs from Turing to Blackwell, an FPGA engine on AWS F2 and a campaign that covered 5.4% of the expected work, with code and a Dockerfile on GitHub (rho-blackwell). It claims no improvement on the generic-group bound.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🛡️ Security

DPF-SGD is a federated SGD algorithm that stays robust to Byzantine agents while satisfying ϵ-differential privacy. It combines private step sizes with a DP noise-decay schedule and adds a privacy-preserving comparative elimination (PPCE) filter that suppresses Byzantine updates during aggregation. The authors prove almost-sure convergence to the global optimum despite persistent noise and adversaries. On synthetic and MNIST data, final optimization error is one to two orders of magnitude lower than DP baselines.

eprint.iacr.orgpaperPublished and added 14 Oct 2026🧠 AI

Introduces TerminalHorizon, a fully automated data synthesis engine for long-horizon terminal agents. It uses independent execution to find key work omitted during environment construction and rebuilds the environment from that evidence. It then progressively expands tasks under the same goal with new requirements that build on earlier results. The authors build 1.5K task environments and run supervised fine-tuning of Qwen3.5-27B to get TerminalHorizon-27B, which improves on all 12 benchmarks covering coding-agent tasks, real-world production agentic tasks and general reasoning. Multiple RSI case studies with a 12-hour research budget show the model continuing to experiment past an initial solution and keeping effective improvements in its final deliverables.

huggingface.copaperAdded 13 Oct 2026🧠 AI

ePrint entry for an ACM CCS 2026 paper in the "Attacks and cryptanalysis" category. By its title and keywords, it shows that snapshots of encrypted databases built on trusted execution environments leak plaintext frequency histograms, using a technique called "dendrochronology". The abstract and full text are embargoed until the end of October 2026, so the attack mechanics are not available yet. It matters to anyone assessing the real leakage of TEE-backed encrypted databases against snapshot adversaries.

eprint.iacr.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🛡️ Security

Plan-Bench is a benchmark of 699 curated samples across 16 subclasses and three dimensions. It tests whether vision-language models can reason over spatial and temporal information and produce multi-step plans under constraints for embodied tasks, with action execution isolated out. Across 28 VLMs the best model reaches only 75.0% accuracy. Scaling generally helps, and larger models look more promising as high-level planners. Code and benchmark are released.

arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI

Proposes a task where a model judges and diagnoses a candidate program from only the problem statement and source code, backing its verdict with generated counterexamples that can be checked by execution. The authors build USACO-JUDGE from USACO 2026 contests (human and LLM-written accepted and unaccepted programs) and train ARBITER, a 35B MoE agentic verifier, with reinforcement learning in a generic execution sandbox. Training lifts counterexample success on incorrect programs from 40.61% to 62.67% and mean binary verdict accuracy from 71.41% to 87.41%. ARBITER also improves code selection and refinement, and in an IOI 2026 case study its guided refinement lifts GPT-OSS-120B's expected score above the gold-medal threshold under the official submission limit.

arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI

SP$^2$ec (Single-Peak SPeculative decoding) is a training-free bandit algorithm that adapts the draft configuration of self-speculative decoding per prompt for vision-language models. It relies on the single-peak throughput pattern seen in SWIFT, KnapSpec, SpecVLM and the authors' cosSim method. It minimizes a new wall-time regret measure and has theoretical guarantees of near-optimal configuration with negligible exploration cost. On Qwen2.5-VL-7B-Instruct and LLaVA-NeXT-Mistral-7B it improves over the original self-speculative methods by up to 11% on visual and textual tasks.

arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI

ProAS (Progress-Aware Advantage Shaping) is a plug-and-play framework for multi-turn agentic RL that fixes the uniform credit assignment problem in critic-free algorithms like GRPO, where trajectory-level advantages are broadcast to every action. It uses a dynamically evolving Agentic Reference Graph with Masking Unreasonable Incentives and Asymmetric Penalty Redistribution to give finer-grained credit without a critic. On Qwen2.5-1.5B/7B-Instruct it reports success rates up to 91.9%/94.3% on ALFWorld and 66.7%/70.8% on WebShop, with up to 2.44x faster training convergence and robustness to imperfect or distilled ARGs.

arxiv.orgpaperAdded 14 Oct 2026, published 13 Oct 2026🧠 AI