1029 results for “X”

List Grid

What you seeeverything

Recent Oldest Added A–Z

All types4452 Articles1452 Papers1029 Write-ups714 Repos531 Threads287

More types6

Advisories250 Tools90 Talks42 Other25 Courses17 Videos15

📑 Papers “X”Clear all

huggingface.copaper🧠 AI

WorkFactory: Turning Professional Intents into Executable Work for Scalable Agent Training

WorkFactory is a framework that builds coherent, executable professional tasks for training working agents. It plans an information support graph from professional intents, then uses probe executions to find and repair missing or inconsistent task information. The authors built 112,686 tasks across 612 occupations and fine-tuned Qwen models at 4B, 27B and 35B-A3B (WorkPilot). WorkPilot-35B-A3B rose from 879 to 1565 Elo on GDPval-AA v2.1.

QwenHugging Face

WorkFactoryWorkPilotGDPval-AA v2.1

training, agents, research· Added 30 Oct 2026

arxiv.orgpaper🧠 AI

world2vec: Mechanistic world models through latent dynamics learning

world2vec is a method for learning mechanistic world models from observations and actions alone, without reward information. Its latent dynamics reproduce the true system over long prediction horizons using at least one order of magnitude fewer parameters than DreamerV3, TD-MPC2 and LeWM. The authors report state-of-the-art control of continuous environments from pixels and accurate system identification across a benchmark of 71 attractors.

world modellatent dynamics learning

world2vecDreamerV3TD-MPC2+2

research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🛡️ Security

TextSeal2: Distortion-Free LLM Watermarking with Copula Mixing and Memoryless Races

TextSeal2 is a distortion-free LLM text watermark that merges two or more keys into one virtual key and couples it to fresh noise through AutoMark's Gaussian copula. Under speculative decoding it verifies keyed drafts with an extra exponential race, so output matches the target model and acceptance rate is unchanged. On three LLMs at a 10^-3 false-positive rate, it detects 8 to 22 points more 100-token answers than TextSeal.

TextSeal2TextSealAutoMark+2

Gumbel-max schemespeculative decodingGaussian copula+1

AI Security· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

TextSeal2: Distortion-Free LLM Watermarking with Copula Mixing and Memoryless Races

TextSeal2 is a distortion-free watermark for LLM output that keeps its signal under speculative decoding. It merges two or more keys into one virtual key coupled to fresh noise through AutoMark's Gaussian copula, and verifies drafts with an extra exponential race. On three LLMs it detects 8 to 22 points more 100-token answers than TextSeal at a 10^-3 false-positive rate.

LLMspeculative decodingGumbel-max watermarking+1

TextSeal2TextSealAutoMark+2

research, inference· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

RADIOlogy: A Single-Pass Approach to Training-Free Zero-Shot Anomaly Detection

RADIOlogy is a training-free, single-pass zero-shot anomaly detection method that uses multi-head attention pooling in vision-language models. It scores anomalies by contrasting average similarity between vision features and sets of normal and abnormal prompts, with no windowed execution. RADIO agglomerative features drive a dense refinement pipeline for pixel-level segmentation, and the method is applied to medical images.

CLIPRADIOvision-language model

RADIOlogyarXiv

research, multimodal· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

VeriCUA: Verification as Agentic Exploration for Computer-Using Agents

VeriCUA is a platform-agnostic framework that verifies task completion by computer-using agents through agentic exploration. The verifier inspects context to build a task rubric, then picks GUI or code checks for unresolved requirements and combines findings under explicit evidence rules. It works online and offline across desktop, mobile and web, and agrees better with reference labels than the baselines, with the largest offline gains on hard cases.

vision-language modelVeriCUA

arXiv

agents, evals, research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Multi-View MoE: Letting Every Router Shape Expert Computation

Multi-View MoE is a sparse mixture-of-experts design that uses several independently initialized routers to select experts, then reuses their relative scores to mix learned latent views into each selected expert's input. Each expert still runs one forward pass, so active-expert count, FLOPs and all-to-all volume are unchanged. On a 24-layer 10B-A1B model trained on 708B tokens, it gains 1.18 points on a nine-task mean; Multi-Router alone gains 0.6.

Mixture of ExpertsTransformerMulti-View MoE+1

arXiv

research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

On the Fundamental Limits of Prefill-Based Decoding Length Prediction

This paper derives bounds on predicting an LLM's decode length from prefill-phase hidden states, a primitive for inference scheduling. It models decoding as a stopped stochastic process, giving per-prompt normality and an affine variance law σ=αμ+b. Predictors (MLP, EGTP, FiLM, soft-label, Mixture-of-Experts) converge near the bound, so system error dominates model error. It proposes fixing model, data and sampling in benchmarks and reporting relative-error metrics.

LLMMixture of ExpertsMLP+2

arXiv

research, inference, evals· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Efficient Scalable Oversight via Rewinding

Rewindable interactive proofs (RIPs) are a new model of relativizing interactive proofs for scalable oversight, in which a weak verifier can rewind an AI prover to an earlier saved state. The paper builds an RIP for computations robust to changes in a small fraction of oracle answers. The honest prover runs in linear time, the verifier runs in nearly linear time in the input length after one-time preprocessing, and no cryptography is used. A preliminary MNIST experiment shows an RIP can be faster than a deployed proof system.

rewindable interactive proofsdebaterelativizing interactive proofs

arXivMNIST

research, ai-safety· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Glance: The Generator Is Its Own Reranker

Glance is a RAG method in which the generator also reranks. It adds a lightweight decision adapter and pointer head that score candidate passages from one shared prefill, so a single resident 9B backbone does generation and reranking. After 39 minutes of MS MARCO fine-tuning it reaches nDCG@10 of 0.741 on SciFact and 0.345 on NFCorpus, against 0.721 and 0.326 for bge-reranker-v2-m3. On 300 HotpotQA questions it improves answer F1 by 0.045 over cross-encoder-selected context. Evaluation covers two retrieval datasets, one QA dataset and one backbone family.

RAGLLMbge-reranker-v2-m3

MS MARCOSciFactNFCorpus+1

llm-apps, research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Retrieving from Your Own Mistakes: On-Policy Training of Embedding Models for Multi-Hop Retrieval-Augmented Generation

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.

RAGon-policy state trainingcontrastive learning+1

HotpotQA2WikiMultiHopQAarXiv

research, llm-apps, training· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🛡️ Security

Understanding and Mitigating Role Spoofing in LLMs

Understanding and Mitigating Role Spoofing in LLMs is an arXiv paper (October 2026) on role spoofing, a prompt injection where malicious tool output impersonates the user. It shows models track "who said what" using both content cues (semantics, style) and structure cues (control tokens, formatting). Attacks combining fake structure and content succeed often, adversarial training stops only content-based attacks, and linear probes trained to predict conversation roles detect spoofing across settings.

LLM

role spoofingrole confusionprompt injection+1

AI Security· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

The Athlete as a Scientist of One: Agentic Bayesian Experimental Design for Individualized Physiology from Consumer Wearables

EpiCoach is an agentic system that treats one cross-country mountain biker as an N-of-1 experiment. Claims live in an evidence-gated hypothesis registry, and each must make a probabilistic prediction before a session. Predictions come from a digital twin fitted to heart rate, GPS and altitude. In a replay over eighteen months the twin beat standard forecasters on heart rate but not segment time, and the agent loop matched a static model. In the first three live weeks, the ledger sealed 20 predictions and scored 14, and a safety officer vetoed the agent twice. The registry, benchmark and protocol are released.

LLMBayesian experimental designdigital twin+1

EpiCoacharXiv

agents, research, evals· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Don't Lose the Thread: Empowering Long-Horizon LLM Agents with Cognitive Resource Self-Allocation

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.

LLMReActCORAL

Multi-episode Agentic Reinforced Policy OptimizationGAIABrowseComp

agents, research, training· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

A Unified Hessian-Guided Framework for Post-Training Quantization

This preprint proposes a unified post-training quantization framework for large language models. It derives a Hessian-guided approximation of the output change caused by joint weight and activation quantization, using a tractable Fisher approximation. Quantization ranges, linear transformations and weight rounding are optimized together under one output-sensitivity objective. The authors report gains over state-of-the-art transformation and rounding methods in channel-wise and block-wise settings.

LLMpost-training quantizationHessian-guided approximation+1

arXiv

research, inference· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Decompose, Estimate, Select: Coverage-Aware Context Construction for Long-Form RAG

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.

RAGbi-encodercross-encoder+1

TREC RAG 2024α-nDCG@10V_strict

llm-apps, research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

MAServeBench: Benchmarking Multi-Agent LLM Serving Systems with Hierarchical Collaboration Workloads

MAServeBench is a benchmark that treats multi-agent collaboration as a configurable dimension of LLM serving workloads. Its composable stages model how agents coordinate and exchange context in documented multi-agent workflows, and Hierarchical Semantic Traces record operations and dependencies for reproducible comparisons. Task-linked measurements tie workloads to GPU/NPU behavior, showing serving efficiency does not always mean timely task completion. Code is released.

LLM

MAServeBencharXiv

evals, inference, agents· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Quasi-polynomial time algorithms for block basis reduction of linear codes

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.

BKZDeepBKZminimum weight codeword problem+4

other· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

A Quantitative Evaluation of Constant-Time Analysis Tools

AutoBench-CT is a modular benchmark for constant-time analysis tools, with manually verified per-violation ground truth across 64 cryptographic tasks. It scores seven tools on operational performance, detection quality and usability. The authors explain why CT-grind (2010) is still the most used tool, list recurring limitations across tools, and propose a composite pipeline for stronger constant-time guarantees. Accepted at ACSAC 2026.

AutoBench-CTCT-grind

ACSAC

Hardware & RF, AppSec· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Turing LLM Post-Training: Calibrated Distillation and Efficient Dynamic-MoE Execution

Turing LLM post-training combines calibrated multi-teacher on-policy distillation (C-MOPD) with an execution path for dynamically routed mixture-of-experts models. C-MOPD matches each teacher on a local Top-K support with teacher-wise loss normalization and clipping. On Turing-20B-A2B it scores 0.9988 on four-domain integration, beats Qwen3-8B on math and code (85.92 vs 80.33 mean), and cuts consolidation step time from 398.7 to 139.3 seconds in a PPU profile.

Mixture of ExpertsC-MOPDon-policy distillation+1

Turing-20B-A2BarXiv

training, research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

M-PFT: Angular Margin for Calibrated Prompt-Tuning of Fine-Tuned Vision-Language Models

M-PFT is an angular-margin method for prompt tuning of vision-language models that fixes base-to-novel dual miscalibration (underconfidence on base classes, overconfidence on novel classes). It adds two losses: minimizing the maximum cosine similarity between tunable class embeddings, and minimizing angular distance to each zero-shot embedding. Tests on 9 prompt-tuning methods and 15 datasets show lower novel-class calibration error at comparable accuracy and negligible overhead.

vision-language modelprompt tuning

arXiv

research, multimodal, training· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Aligning Medical Vision Language Models at the Capability Boundary with Entropy Adaptive Rubric Grounding

MedCBR is a two-stage alignment framework for medical vision language models. Difficulty Weighted Boundary Preference Optimization (DBPO) trains on counterfactual preference pairs at the model's capability frontier. Entropy Gated Grounded Policy Optimization (EGPO) then applies distilled clinical rubrics according to prediction entropy. It reaches 61.2% average accuracy on six medical benchmarks, with the largest gains on differential diagnosis, and the two stages combine super-additively.

vision-language modelpreference optimizationreinforcement learning

MedCBRDifficulty Weighted Boundary Preference OptimizationEntropy Gated Grounded Policy Optimization+1

research, training, multimodal· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🛡️ Security

SEAL: Sealed Queries for Local Sanitization against Indirect Prompt Injection

SEAL is a defense against indirect prompt injection for local LLM agents. It learns a soft prompt and scoring readout offline, then uses a frozen task model to score and delete injected tokens from tool outputs, with queries built from trusted initial context. On AgentDojo, attack success falls from 34.6% to 0.1% and Joint rises from 51.4% to 77.5%, using about 127x fewer defense tokens than PISanitizer.

LLMAgentDojoAgentDyn+1

indirect prompt injection

AI Security· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Smoothness of Shortest Isogenies to Frobenius Conjugatess

Paper by Yi Ouyang, Wei Wei and Zheng Xu on the minimum degree of an isogeny from a supersingular elliptic curve E to its Frobenius conjugate E^(p). It bounds the probability that this degree is smooth, which makes Wesolowski's p^(1/3+o(1)) attack on the supersingular endomorphism ring problem unconditional. It also gives a uniform asymptotic formula, with Dirichlet L-values in the main term, for the probability that a connection isogeny of degree n exists.

supersingular endomorphism ring problemWesolowskiYi Ouyang+2

other· Added 31 Oct 2026, published 29 Oct 2026

eprint.iacr.orgpaper🛡️ Security

Optimality and Efficiency of Higher-Order Rank-Based Side-Channel Attacks against Inner Product Masking Schemes

HO-ASPA (Higher-Order Adjusted Spearman Coefficient Analysis) is a rank-based, non-profiling side-channel distinguisher. The paper derives its optimal form against two-share Boolean masking and inner product masking under Hamming weight and LSB leakage. It finds no significant gap between higher and lower orders for HO-ASPA, unlike HO-CPA, and reports that it beats Kruskal-Wallis-based attacks in simulated and real-world experiments.

HO-ASPAHO-CPAKruskal-Wallis+2

Hardware & RF· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

RetroChessBench: A Benchmark for Reconstructing and Proving Chess Histories

RetroChessBench is a 12-task benchmark for retrograde chess: reconstructing legal game histories, exact-length constructions, unique endings and exhaustive answer sets, with references, rubrics and a terminal-reward RL environment. GPT 6 Astra High fails to give the required final answer in 22 of 24 attempts without tools and 18 of 24 with code execution. Mean terminal RL rewards are 14.75% and 27.19%. The authors link the failures to scarce worked derivations in web training data.

GPT-6 AstraLLM

RetroChessBench

evals, research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

Sparse Autoencoders as Implicit Diversification Regularisers for Cross-Sectional Cryptocurrency Returns

This arXiv preprint (October 2026) tests a sparse autoencoder as a factor model for daily cryptocurrency returns, with equities as a secondary test. SAE portfolios show consistently lower volatility than common benchmarks, linked to lower correlations among selected assets. They do not beat a simple contrarian strategy on risk-adjusted return, and factor identities change between training runs.

sparse autoencoder

arXiv

research· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🛡️ Security

REALM: Identifying Minimal Task Assets for LLM Agents

REALM (Required Execution Assets Linked to a Mission) is an approach to applying least privilege to LLM agents by identifying the assets a task needs, including ones discovered at runtime. It models assets as Dependency Graph nodes, separates discovering an asset from authorizing it, and exposes resource-bound Partial APIs inside a Task Container. On AgentDyn with qwen3.5-flash, attack success rate falls from 16.6% to 0.2%, with 40.0% task completion on clean tasks and 36.4% on injected cases.

QwenLLMAgentDyn

prompt injectionleast privilegeREALM

AI Security· Added 31 Oct 2026, published 29 Oct 2026

arxiv.orgpaper🧠 AI

DICE: Decentralized Incentive-driven Federated Learning for Efficient & Scalable Customization of Pretrained Models in Web3

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.

federated learningblockchain-powered federated learningprogressive learning+1

arXiv

research, training· Added 31 Oct 2026, published 29 Oct 2026

x.compaper🛡️ Security

Cryptography and Security Papers (@FSFG) on X

PrivacyEvalClaw is a tool-augmented deliberative agent that audits privacy leakage in LLM jailbreak responses. The paper is by Krishna Kanth Nakka and co-authors, and it was accepted to AACL-IJCNLP 2026 (arXiv 2610.36711, cs.CR). The tweet gives only the title, authors and venue, so the method and results are not described.

LLM

PrivacyEvalClaw

AI Security· Added 30 Oct 2026, published 29 Oct 2026

Showing 30 of 1029