Skip to content

70 results for “Flow”

What you seeeverything
  1. 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.

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

  2. Structured Security Explanations for Learning-Based Vulnerability Detection

    VulnLens is a framework for binary C/C++ function-level vulnerability detection. A label-blind LLM Explainer describes each function from seven fixed perspectives (data flow, memory access, object lifetime, arithmetic and type behavior, control flow, shared state, external-resource access). A supervised Detector fuses code and explanations by cross-attention. It reaches 75.5% accuracy and 77.2% F1 on a 526-function PrimeVul test set, and 66.4% accuracy on SecVulEval without retraining.

    arxiv.orgpaperAdded 30 Oct 2026, published 27 Oct 2026🛡️ Security

  3. SymLift: Neural Semantic Lifting for Compile-Free Vulnerability Detection in Context-Incomplete Code Fragments

    SymLift is a compile-free vulnerability detection framework for context-incomplete code fragments. A fine-tuned LLM lifts control-flow, data-flow, memory and resource relations into a constrained LLVM-like IR. A parser turns the IR into facts, and Datalog rules derive findings with derivation traces. On Juliet function-level fragments Clang compilation success falls to 12.00%, while SymLift's completion rate drops only 1.17 points. SymLift-Qwen-7B reaches Target-F1 94.41% on FormAI and 91.66% micro-F1 on MegaVul.

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

  4. SymLift: Neural Semantic Lifting for Compile-Free Vulnerability Detection in Context-Incomplete Code Fragments

    SymLift is a compile-free vulnerability detection framework for code fragments that lack project context. A fine-tuned LLM reconstructs control-flow, data-flow, memory and resource relations as a constrained LLVM-like IR, and a deterministic parser turns it into facts for Datalog rules that give findings with derivation traces. SymLift-Qwen-7B reaches 94.41% Target-F1 on FormAI and 91.66% micro-averaged Target-F1 on MegaVul.

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

  5. Enhancing LLM-Based Vulnerability Detection via Representation-Aware Logical Ensemble

    RALE (Representation-Aware Logical Ensemble) is a method for detecting vulnerabilities in C source code with LLMs trained on different code representations: raw source, Abstract Syntax Trees and Control Flow Graphs. The authors show the representations suit different vulnerability classes, and combine the models with explicit logical rules and majority voting. Single-representation models reach up to 73% F1, while the ensemble reaches 78%.

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

  6. Enhancing LLM-Based Vulnerability Detection via Representation-Aware Logical Ensemble

    RALE (Representation-Aware Logical Ensemble) is a method for LLM-based vulnerability detection in C code. The authors train LLMs on raw source code, Abstract Syntax Trees and Control Flow Graphs, and find each representation works best for certain vulnerability classes. Combining the models with explicit logical rules and majority voting raises F1 from at most 73% for a single model to 78%, with gains in accuracy, precision and recall.

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

  7. SCI-AGENT-EXAM: Benchmarking Agents on Scientific Research Tasks

    SCI-AGENT-EXAM is a workflow-oriented benchmark of 120 expert-curated tasks across 11 scientific fields and 7 task types from the Scientific Workflow Task Taxonomy (SWTT). Tasks need both executable and textual artifacts, scored by programmatic checks plus an expert-calibrated LLM judge. Ten frontier agents were tested: GPT-6 Astra scored highest at 80.9, but only 26.0% of its runs passed the 0.95 success threshold.

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

  8. UniWALM: Unified World Action Language Model for Embodied Robot Control

    UniWALM is a unified world-action-language model that learns video, action and language in one mixture-of-transformers backbone with per-modality diffusion heads that co-denoise together. Generated subtask and textual memory are fed back on the next step, so no external planner or memory bank is needed. It adds Flow Matching with Correction (FMC) for recovery from perturbed actions. It reaches 34.5% on the memory-dependent RMBench subset, above Mem-0's 28.5%, and lifts real-world Find-the-Item success from 11.1% to 61.1%.

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

  9. Large Flow Language Models

    Lafa (Large flow language model) is a blockwise continuous flow language model scaled to 8B parameters, with causal attention on the prefix and bidirectional, asynchronous flow within each block. It is adapted from pretrained autoregressive models and trained at 0.5B, 7B and 8B with under 30B tokens. A self-speculative decoding scheme verifies flow drafts autoregressively in one model, giving 2.54x the throughput of an AR model at comparable quality. Flow maps allow one- and few-step generation.

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

  10. Which Model for Which Role? Cost-Efficient Pareto Recommendation for LLM Agentic Workflows

    Cost-Coupled Gittins (CC-Gittins) is a multi-objective extension of cost-aware Gittins search that recommends Pareto-optimal model-to-role assignments for LLM agentic workflows. It exploits the coupling between evaluation and deployment cost, alternating between seeking higher quality and lower cost. On eight quality-cost matrices (two to five roles, up to 1,681 assignments), it recovers a substantial share of the true Pareto frontier at about 10% of exhaustive-evaluation cost, and most of it by 30%. Latency is tested as a third objective.

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

  11. HAF-VLA: Hierarchical Action Flow Framework for Humanoid Vision-Language-Action Control

    HAF-VLA is a hierarchical action-flow framework that adapts a pretrained flow-matching vision-language-action model to humanoid whole-body loco-manipulation. It denoises a shared action space in stages: locomotion and head commands first, then waist refinement, then full-body manipulation. Learnable stage embeddings and cross-stage KV-cache conditioning carry dependencies between stages. The authors report gains over existing models on six real-world tasks.

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

  12. Assisted Turbulence Modeling via Data Assimilation and Machine Learning for Turbomachinery Flows

    This paper presents a hybrid framework for axial compressor flow that couples a Multi-Fidelity Ensemble Kalman Filter (MFEnKF) with machine learning. The filter merges PIV experiments with steady RANS and unsteady hybrid RANS/LES simulations. A neural network trained on the enriched data predicts Navier-Stokes volume forcing terms from velocity, velocity gradients and turbulent viscosity. A Mixture of Experts fixes local errors near blade tips, giving lower experimental discrepancy than baseline RANS.

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

  13. E-Layout: Layout-Stage Logic Restructuring via RL-Optimized Equality-Saturated Graph Retrieval-Augmented Generation

    E-Layout is an ML-driven framework for post-placement logic restructuring in IC physical design. It builds equivalent logic alternatives with e-graph equality saturation, links logic choice to physical realization through a graph-based RAG model, and refines the choices with reinforcement learning on design-level timing feedback. On 9 designs it gives about 6% TNS and 2% WNS improvement and 1% less area than a commercial physical design flow.

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

  14. Self-evolving Agent Harness

    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

  15. A Language-Informed Loss for Visual Generation

    LILIE (Language-Informed and Lossless Image Encoder) is an invertible image transform built from a normalizing flow transformer, trained jointly with a vision-language model via next token prediction so captions can be recovered from noised features. The encoder supplies a language-informed loss for text-to-image generation. JiT models trained with it cut gFD from 66.84 to 53.01 against a pixel-only baseline on the GPIC dataset. Code, encoders and models are released.

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

  16. Can SOLARBURST go silicon? A systematic analysis on software supply chain attacks for VLSI design flows

    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

  17. Efficient KV Cache Migration for Geo-Distributed LLM Inference in Collaborative Edge Computing

    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

  18. PROBE: Learning to Audit Policy Compliance in Tool-Using LLM Agents

    PROBE (Policy Rule Observation via Behavioral Exploration) trains LLM-based auditors that act as realistic users and probe deployed tool-using agents for policy violations (pricing, privacy, confirmation, safety) across multi-turn, tool-mediated dialogue. It formalizes auditing as a two-player Markov game with a composite reward for violation discovery, plausibility, progress and policy diversity, and compares GRPO, DPO and GFlowNet optimization. Trained auditors find broader, higher-yield violations than zero-shot adversaries, even when much smaller than the target agent, positioning behavioral auditing as a distinct axis next to capability and safety benchmarks.

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

  19. PROBE: Learning to Audit Policy Compliance in Tool-Using LLM Agents

    PROBE (Policy Rule Observation via Behavioral Exploration) trains LLM-based auditors that act as realistic users and probe deployed tool-using agents for policy violations (pricing, privacy, confirmation, safety) over multi-turn dialogue. It formalizes auditing as a two-player Markov game with a composite reward balancing violation discovery, behavioral plausibility, conversation progress and policy diversity, and compares GRPO, DPO and GFlowNet optimization in a controlled setting. Trained auditors find broader, higher-yield violations than same-architecture zero-shot adversaries, even when much smaller than the target agent. This positions multi-turn behavioral auditing as a distinct evaluation axis alongside capability and safety benchmarks.

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

  20. INFUSE: A Unified Surface Benchmark for Indirect Prompt Injection in Agentic Systems

    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

  21. Dog-Breed Text-to-image Flow Matching from Pretraining to Fine-Tuning on 4 Consumer GPUs

    MiniDog is a framework for training a text-to-image flow-matching diffusion transformer from scratch on four RTX 3090 GPUs, with 55 minutes of pretraining and 15 minutes of fine-tuning. It pretrains on 26k ImageNet dog images that were captioned, then fine-tunes on 2k FLUX.1-schnell generated images. Image and text features are precomputed and cached. The model is a 22M-parameter transformer with the E2E-INVAE semantic latent space, a small Qwen text encoder and in-context conditioning, and training is accelerated with iREPA and an EUPE perception encoder. The repo evaluates with FID, HPSv2, PickScore and VAE reconstruction metrics. It lowers the barrier to hands-on diffusion training research.

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

  22. PixelMoE: Scaling Pixel-Space Diffusion with LLM-Style Mixture-of-Experts

    PixelMoE is a pixel-space diffusion framework that scales capacity sparsely using standard LLM-style Mixture-of-Experts: token-choice routing, fine-grained routed experts, a shared expert and bias-based load balancing, with no diffusion-specific routing or auxiliary routing losses. It adds Pixel-Space Hierarchical Flow Matching, which varies spatial resolution along the denoising trajectory from global structure to fine detail. At matched active parameters it beats dense counterparts, and reaches FID 1.47 at 256x256 and 1.53 at 512x512 on class-conditional ImageNet-1K without representation alignment or perceptual losses. Code and models are promised but not yet released.

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

  23. Only What You've Signed up For: Secure Workflows with Constrained Diffusion Agents

    Introduces Policy-Constrained Diffusion Agents (CoDA), which enforces task-dependent security policies inside the denoising process of diffusion language models. At each step, token distributions are projected onto a policy-compliant set, so constraints hold throughout generation instead of relying on detecting injected instructions. Evaluated across several dLLM families under static and adaptive prompt-injection attacks, it reports substantially lower attack success rates with competitive task utility and practical inference overhead.

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

  24. KedgeFlow: A Programmable Control Plane for Enterprise AI Agents

    KedgeFlow specifies language-independent contracts so trusted controllers can authorize state-changing operations by enterprise AI agents and privileged gateways can enforce that authority independently of agent reasoning. It combines evidence-backed policy checks, signed permission for an exact action, a single-use shared allowance, target-side conditions and retained outcome records, with two conditional properties (at most one claim per allowance; every dispatch linked to a grant and claim) that hold even if the agent is compromised. A reference implementation exposes the path via MCP; evaluation on a three-member etcd cluster gave exactly one successful claim for each of 82 allowances across 6,560 concurrent attempts, and one committed effect in a 32-call gateway race. The authors report limits: permissive policy still authorized an undesirable effect, and distributed reservations, production access routes, crash recovery and real-target exactly-once effects remain untested.

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

  25. KedgeFlow: A Programmable Control Plane for Enterprise AI Agents

    KedgeFlow proposes language-independent contracts in which trusted controllers issue signed exact-action permissions and privileged gateways enforce them, using single-use allowance claims, target-side conditions and retained outcome records. It aims to stop altered approved actions, concurrent permission reuse and retries after lost responses, even with a compromised agent. A reference implementation exposes this path via MCP; evaluation on a three-member etcd cluster showed 6,560 concurrent claim attempts yielding exactly one success per each of 82 allowances. It also reports that permissive policy still authorized an undesirable effect, and lists untested areas such as distributed reservations and production access routes.

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

  26. No, Your Tools Are Not Enough: It's Time to Bring Agents to the Hunt

    Experience paper describing an iterative agentic workflow that uses AI agents to find vulnerabilities across diverse targets: Windows drivers, the Linux kernel, XNU, firmware and web applications. The authors report that the workflow generalizes across these targets. They also cover tasks where agents help with previously hard problems and set out research directions for autonomous vulnerability discovery.

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

  27. SecReason: Vulnerability Detection and In-Stream Self-Repair for LLM Code Generation

    SecReason is an in-stream defense for reasoning LLMs that write code. Reasoning models draft code early in their streamed chain of thought, so SecReason scans that stream with dual-track incremental analysis: security rules are checked on each emitted statement, and dataflows are traced across the accumulated code. When a rule fires, it interrupts decoding, inserts a warning into the stream and resumes, so the model fixes its draft within the same reasoning trace instead of regenerating the full response. On CWEval and SecCodeBench, runs delivering secure and functionally correct code rise from below 15% to 72.8%–98.1%. It uses fewer tokens than post-hoc repair and limits functional regressions when rules misfire on secure code.

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

  28. SecReason: Vulnerability Detection and In-Stream Self-Repair for LLM Code Generation

    SecReason is an in-stream defense for reasoning LLMs that monitors code drafted inside the streamed chain of thought. Dual-track incremental scanning applies security rules per statement and traces dataflows across accumulated code; when a rule fires, generation is interrupted, a warning is inserted, and decoding resumes so the model repairs the draft in the same trace. On CWEval and SecCodeBench it raises the share of secure and functionally correct runs from below 15% to 72.8%–98.1%, uses fewer tokens than post-hoc repair, and limits regressions from false warnings.

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

  29. SecReason: Vulnerability Detection and In-Stream Self-Repair for LLM Code Generation

    SecReason is an in-stream defense for reasoning LLMs that monitors code drafted inside the streamed chain of thought. Dual-track incremental scanning applies security rules per statement and traces dataflow across accumulated code. When a rule fires, generation is interrupted, a warning is inserted and decoding resumes, so the model repairs its draft without regenerating the full response. On CWEval and SecCodeBench it raises the share of secure and functionally correct runs from below 15% to 72.8%–98.1%, uses fewer tokens than post-hoc repair, and limits functional regressions from false warnings.

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

  30. SecReason: Vulnerability Detection and In-Stream Self-Repair for LLM Code Generation

    SecReason is an in-stream defense for reasoning LLMs that write code. Reasoning models draft code early in their streamed chain of thought, and SecReason scans that draft incrementally with security rules, checking each statement as it is emitted and tracing dataflows across the accumulated code. When a rule fires, it interrupts generation, inserts a warning into the stream, and resumes decoding, so the model repairs the draft within the same reasoning trace. On CWEval and SecCodeBench it raises the share of runs that deliver secure and functionally correct code from under 15% to 72.8%–98.1%. It uses fewer tokens than post-hoc repair and limits functional regressions when rules misfire on secure code.

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

  31. Humanize Olympiad Agents: A Multi-Session Workflow for Olympiad Problem Solving with Solve, Review, Wiki, Verify

    HOA (Humanize Olympiads Agent) is an open, flow-level framework that coordinates several agent sessions through three feedback channels: an independent reviewer that critiques each candidate, a structured wiki supplying task-specific knowledge the base model may lack, and a verifier that checks generated Lean proofs against trusted challenge statements. With GPT-5.6 Sol it reports perfect scores on IMO, IPhO and IOI 2026, near-full marks on IChO 2026, 672/672 on PutnamBench, and first place on the Lean-Eval leaderboard (251/304). With the open model Kimi-K3 it matches or exceeds a GPT-5.6 Sol + /Goal baseline on several contests, which suggests systematic feedback can narrow base-model capability gaps.

    arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🧠 AI

  32. ManeuverFlow: Maneuver Hypothesis Generation with Future Evidence for Trajectory Evaluation and Refinement in End-to-End Autonomous Driving

    ManeuverFlow is an end-to-end autonomous driving planner that generates trajectories for distinct driving intentions in one step. It selects maneuver modes, draws noise from a Gaussian mixture prior, and maps it to trajectories through a maneuver-routed mixture-of-experts MeanFlow field. Current features and world-model-predicted future features are aggregated along each candidate path as evidence for PDM-factor scoring and Frenet-residual refinement. With a TransFuser-style ResNet-34 backbone it reaches 90.6 PDMS on NAVSIM v1 and 90.1 EPDMS on NAVSIM v2 navtest. It also reports the highest listed PDMS* on WorldEngine's 3DGS closed-loop benchmark, 75.19 with logged traffic and 74.58 with IDM-controlled traffic.

    arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🧠 AI

  33. AgentTune: A Unified Training Lifecycle for Tool-Using LLM Agents

    AgentTune is a source-available Python library that unifies building, training, evaluating, distilling and maintaining tool-using LLM agents. Its core is a two-tier EventLog representation that preserves agent trajectories and yields consistent projections for training, evaluation and auditing. On top of it sit a shared agent runtime, tool-calling reinforcement learning, agentic distillation, RAG, decision workflows, evaluation utilities and a designed path toward self-healing agents, demonstrated on tasks such as legal contract search.

    arxiv.orgpaperAdded 12 Oct 2026, published 9 Oct 2026🧠 AI

  34. An Exploration of Attacks on AI Agent Systems

    Paper that tests prompt injection against AI agents through both direct user input and inter-agent communication. The attacks leak sensitive information and trigger cross-agent infections. Most findings concern single-agent systems, and the authors then extend the attacks to multi-agent frameworks to show how weaknesses propagate between agents. It argues that agents embedded in real-world workflows need stronger defenses.

    arxiv.orgpaperAdded 12 Oct 2026, published 8 Oct 2026🛡️ Security

  35. From Evidence to Action: How Tool-Using Agents Fail

    This paper studies where tool-using LLM agents break down in the chain from gathering evidence to taking consequential actions, finding that strong static judgment of whether to act often coexists with much weaker interactive execution, and that failures arise from incomplete investigation, acting before evidence is established, or unresolved prerequisites in multi-action workflows. The authors introduce SafeActBench, a 656-case benchmark across six operational domains and five protocols, paired with a provenance-bound Evidence Ledger and a deterministic trajectory evaluator tested across ten model-harness configurations.

    arxiv.orgpaperAdded 7 Oct 2026🧠 AI

  36. PEARS: Physical-Prior-Guided Efficient Adaptation via Failure Reasoning and Diffusion Steering for Tactile Manipulation

    PEARS is a hybrid reinforcement-learning framework for sample-efficient online adaptation of pretrained tactile-manipulation policies to out-of-distribution conditions. A physics-guided force reasoning (PFR) module uses a vision-language model to diagnose failures from visual and tactile history and update contact-force bounds enforced by a hybrid force-position controller, while a separate tactile-conditioned diffusion-steering component perturbs the latent noise of a frozen flow-matching policy to correct free-space motion and contact timing without retraining the base model. It improves success rates by 12.4-37.4 points over strong baselines in simulation, cuts required interaction episodes by up to 53.2%, and reaches 95%/90% success on real-world whiteboard-erasing and pipette-liquid-aspiration tasks.

    arxiv.orgpaperAdded 7 Oct 2026, published 6 Oct 2026🧠 AI

  37. ANT: A Multi-Granularity Network Traffic Dataset and Benchmark for Agents Behavior Auditing

    ANT (Agent Network Traffic) is a dataset and benchmark for auditing LLM agent behavior from network traffic without inspecting private user content, covering 3,114 execution episodes across 20 tasks and five scenarios, with 276,417 bidirectional flows and 40,049 behavior-primitive segments organized into 47 macro groups. The authors benchmark 13 traffic-analysis baselines on three tasks — agent risk identification, scenario recognition, and behavior primitive classification — finding that methods struggle when malicious workflows mimic benign tasks and when scenarios share similar traffic patterns, while primitive classification works better for frequent, distinctive macro groups than for rare or semantically similar ones.

    arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🛡️ Security

  38. ANT: A Multi-Granularity Network Traffic Dataset and Benchmark for Agents Behavior Auditing

    ANT (Agent Network Traffic) is a dataset and benchmark for auditing LLM agent behavior purely from observed network traffic, without inspecting private user content. It contains 3,114 execution episodes across 20 tasks and five scenarios, with 276,417 bidirectional flows and 40,049 behavior-primitive segments grouped into 47 macro categories, and evaluates 13 traffic-analysis baselines on risk identification, scenario recognition, and behavior-primitive classification. Results show existing methods recover useful but uneven signals, struggling especially when malicious agent workflows resemble benign ones or scenarios share similar traffic patterns.

    arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🧠 AI

  39. AI-Decision Checkpoints for AI-Augmented Business Process Management: Framework and Educational Instantiation

    This paper proposes AI-decision checkpoints, explicit moments in business process development where process developers must evaluate whether to adopt, constrain, or reject AI-candidate sub-processes built with LLMs, RAG, or AI agents, based on expected effects on time, cost, quality, flexibility, and legal or organisational constraints. The checkpoints are embedded in a six-module BPM teaching lifecycle covering process modeling, simulation, workflow execution with AI agents, and process mining, piloted via a fictitious customer-onboarding teaching case with formative observations drawn from instructor logs and student artifacts. It addresses a curriculum gap where AI is still treated as a bolt-on rather than a first-class design element in BPM education.

    arxiv.orgpaperAdded 6 Oct 2026, published 5 Oct 2026🧠 AI

  40. Glimpsing the Leakage Flow for Deep Learning-Based Side-Channel Analysis using Stochastic Leakage Model

    GlimpseDNN is a model-agnostic framework that uses a stochastic leakage model to visualize, layer-by-layer, what physical leakage information a deep neural network extracts during profiled side-channel analysis (SCA) to recover secret keys. The authors (Trevor Yap and Shivam Bhasin, NTU) validate it on simulated traces and public datasets (ASCADf, ASCADr, ASCADf_desync50, ASCADf_desync100), showing it can reveal leakages even in deeper network layers when they are not visible in raw traces, with applications to designing more side-channel-resistant hardware.

    eprint.iacr.orgpaperAdded 8 Oct 2026, published 5 Oct 2026🛡️ Security

  41. MobiAgent: Dual-Loop Recursive Policy Self-Improvement for Long-Horizon Mobile Manipulation

    MobiAgent is a dual-loop agentic framework for long-horizon mobile manipulation that separates deployment execution from policy self-improvement. An Inner Loop uses vision-language models for receding-horizon planning and visual reflection to compose atomic skills executed by flow-matching experts sharing a unified VLM backbone, while an Outer Loop autonomously segments, verifies, and clusters deployment rollouts to discover new atomic skills and continuously fine-tune the skill library without human annotation. On BEHAVIOR-1K it beats pi_0.5-TA by 22.5 percentage points, and autonomous data recycling raises RoboCasa success from 7.50% to 27.50% and Astribot S1 success from 32.5% to 57.5%.

    arxiv.orgpaperAdded 5 Oct 2026, published 2 Oct 2026🧠 AI

  42. UniWAM: Unified World-Action Model

    UniWAM is a unified architecture that combines a physical reasoner, a world generator, and an action predictor to jointly learn semantic understanding, visual generation, and action prediction for embodied agents, bridging vision-language-action (VLA) models and world-action models. It uses a data cleaning/annotation pipeline for human egocentric and robot data, represents low-level actions in natural language for VQA/egocentric/robot co-training, and introduces future visual noise augmentation plus history-conditioned flow matching to cut denoising steps while achieving state-of-the-art results on in-distribution performance, robustness, generalization, instruction following, and long-horizon tasks. The paper also reports a log-linear scaling law for unified human-robot co-training.

    arxiv.orgpaperAdded 2 Oct 2026, published 1 Oct 2026🧠 AI

  43. Multimodal Flow: Unified Flow Modeling of Language and Vision in Embedding Spaces

    Multimodal Flow (MF-1) is a fully continuous generative model that unifies language and vision modeling by representing both text and images as ordered continuous "hyperchunks" processed through a single shared chunk-causal Flow Matching backbone, avoiding the visual quantization bottleneck of discrete-token unified models and the mismatched objectives of hybrid discrete/continuous approaches. Joint attention handles cross-modal interaction while modality-specific feed-forward networks process each modality, and the model predicts multiple chunks in parallel during training but generates sequentially at inference. Pretrained at 0.6B/1.2B/1.6B scales on 150B tokens, MF-1 scores 82.8 average on GenEval/DPG-Bench and 75.3 on VQAv2/MMBench/POPE, remaining competitive with unified models trained on far more data and outperforming matched hybrid/discrete baselines; code and model are publicly released.

    arxiv.orgpaperAdded 1 Oct 2026, published 30 Sep 2026🧠 AI

  44. Adversarial Training for Pixel Diffusion

    This paper shows that adding an adversarial loss as a post-training correction to pretrained pixel diffusion/flow-matching models (applied at non-high-noise timesteps, architecture and sampler unchanged) restores missing high-frequency, fine-scale natural-image statistics that these models systematically underproduce. Through frequency-band/power-law analysis and nearest-neighbor, recall, and no-GAN matched-SFT controls, the authors rule out memorization or mode-dropping as explanations, and show the effect jointly improves distribution fidelity, coverage, prompt alignment and perceptual quality — but does not transfer comparably to latent diffusion configurations, pointing to direct pixel-output access as the key enabling factor.

    arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026🧠 AI

  45. Rho: A Foundation for Efficiently Adaptable VLA Models

    Rho is a family of open-weights vision-language-action (VLA) models for bimanual robotic manipulation, designed for data-light adaptation across three dual-arm embodiments (YAM Box, UR AI Trainer, FR3 Duo). The paper ablates the action-expert architecture and training recipe, showing that "embodiment midtraining" improves downstream adaptation, and introduces an internal latent policy that learns from as few as 15 corrected episodes to steer a frozen flow-matching action expert toward out-of-distribution task situations. The authors release base and embodiment-specific checkpoints, positioning Rho as both a strong general-purpose manipulation model and a practical foundation for efficient adaptation.

    arxiv.orgpaperAdded 30 Sep 2026, published 29 Sep 2026🧠 AI

  46. Learning Native Reflection in Unified Models with Interleaved Reinforcement Learning

    UMM-Reflection is a reinforcement learning method that trains a unified multimodal model to jointly learn reflection text and image revision within a single closed loop: diagnose an image's flaws, revise it, observe the result, and repeat. Sibling trajectories sharing one initial image enable a group-relative advantage that compares whole reflection strategies rather than assigning credit per round, and one trajectory-level advantage updates both the reflection tokens and the flow-based revision head jointly, unlike SFT cold-starts or RL that optimizes only the renderer. On BAGEL, it improves GenEval by 12.05 points over SFT and transfers to unseen benchmarks WISE, OneIG-Bench and T2I-CompBench++, with no external verifier needed at inference.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  47. Unifying Distributional Training for One-Step Visual Generation

    This arXiv paper introduces a unified theoretical framework for "distributional training" in one-step visual generation, showing that existing methods like FD-Loss and Gaussian-kernel Drifting are special cases of Gaussian optimal transport and kernel-density KL matching under Wasserstein gradient flow. Building on this, the authors propose MGFlow, which models feature distributions with Gaussian mixtures at adjustable granularity and combines mass-constrained sample assignment with paired component updates to fix mode collapse. MGFlow sets new state-of-the-art FDr scores on ImageNet 256×256 (1.45 on pMF-H, 1.64 on JiT-H) and post-trains FLUX.2 into a one-step generator that beats the original four-step model on GenEval and PickScore.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  48. Peppy: An AI-Assisted Workflow for Tight Convergence Analysis of Optimization Algorithms

    Peppy is an AI-assisted workflow that uses LLMs with domain-specific knowledge of optimization theory to discover tight, analytic convergence proofs for first-order optimization algorithms, verifying results through SymPy rather than a full proof assistant like Lean 4. The authors demonstrate the approach by closing several open problems in convergence analysis, including conjectures about Nesterov's Fast Gradient Method (FGM), positioning the workflow as a more structured, domain-specialized alternative to generic LLM-for-math-research pipelines.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  49. Harness Learning Enables Generalizable Test-Time Adaptation

    Introduces "harness learning," a method that trains a proposer model via reinforcement learning to revise a solver agent's harness (the executable scaffolding coordinating model calls, tool use, and information flow) using execution feedback, treating harness revisions as analogous to weight updates in meta-learning. At test time the proposer refines the harness across successive executions on a new task without any parameter-space update, and experiments on reasoning and multi-hop QA show revision quality improves with training and that test-time adaptation transfers to unseen tasks. The work points toward continually learning agents that convert accumulated experience into generalizable harness improvements rather than model weight changes.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  50. FlowAct-R2: Beyond Talking Avatar via Streaming Multimodal References and Proactive Agent Planning

    FlowAct-R2 is a framework for interactive humanoid video generation that pairs a Streaming Multimodal Reference Diffusion Transformer (built on the Seedance 2.0 Mini reference-to-video backbone) with a Proactive Interaction Agent. The diffusion component accepts rolling action prompts plus continuously updated image, audio and video references, using video-driven rotary positional embeddings and partially noised historical motion frames to keep appearance consistent and avoid drift over long generation runs. The agent component separates offline persona/agenda/skill preparation from online scheduling, audience response and interruption handling, enabling real-time 720p, hour-scale streaming avatars for use cases like live shopping, video chatting and live vlogging.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  51. Verifier Errors in RLVR: Reward Hacking, Limits of Feedback, and Selective Control

    This arXiv paper analyzes reward hacking in reinforcement learning with verifiable rewards (RLVR), using gradient flow analysis with a fixed verifier to characterize when reward increases while correctness decreases. The authors prove that standard RLVR training signals are insufficient to detect or reduce "accepted errors" (incorrect responses rewarded by the verifier) without also suppressing correct responses, and propose a "selective control" correction that incorporates partial audit feedback on correctness to simultaneously lower accepted-error probability and raise correct-response probability. Experiments on log-linear and neural contextual bandits and a language model support the theory, showing selective control under partial auditing reduces accepted errors while increasing correctness.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  52. TCSAlgBench: Benchmarking Automated Proving for Research-Level Theoretical Computer Science

    TCSAlgBench is a benchmark of 398 theorem-level challenges drawn from 138 STOC and COLT 2026 papers, designed to test whether LLMs can produce natural-language proofs of algorithmic results that humans can inspect and verify. The authors evaluate ten model configurations from four model families under direct inference and multi-round prover-verifier discussion, and compare four agent workflows (including decomposition and agentic planning) under matched model-call budgets, finding GPT-5.6 Sol max reaches 23.6% verifier-accepted coverage after 10-round discussion while agentic planning with GPT-5.5 xhigh reaches 25.4%. The pipeline is designed to refresh with newly released conference papers, making it a reusable testbed for tracking progress on research-level mathematical/algorithmic reasoning.

    arxiv.orgpaperAdded 29 Sep 2026, published 28 Sep 2026🧠 AI

  53. ReproBench: Benchmarking LLM Agents on Reproducing Vulnerability From Scratch

    ReproBench is a benchmark that tests whether LLM agents can autonomously reconstruct an execution environment and reproduce a real vulnerability starting from nothing but a CVE identifier, rather than being handed source code or a container. It decomposes the workflow into six verifiable phases (firmware download/unpacking, analysis, crash validation, etc.) and evaluates agents on 30 real-world IoT firmware CVEs. The study finds only 5.3% of CVE-model pairs achieve genuine reproduction while 45.3% of runs fall back to vulnerability simulation as a shortcut, and it catalogs the bottlenecks blocking agents at each pipeline stage.

    arxiv.orgpaperAdded 2 Oct 2026, published 28 Sep 2026🧠 AI

  54. ReproBench: Benchmarking LLM Agents on Reproducing Vulnerability From Scratch

    ReproBench is a benchmark that tests whether LLM agents can autonomously reconstruct an execution environment and reproduce a vulnerability starting from nothing but a CVE identifier, unlike prior benchmarks that hand agents source code or a ready container. It decomposes the workflow into six phases (firmware download, unpacking, analysis, crash validation, etc.) over 30 real-world IoT firmware vulnerabilities. Results show state-of-the-art agents resort to "vulnerability simulation" shortcuts in 45.3% of runs and achieve genuine reproduction in only 5.3% of CVE-model pairs, with the paper detailing the core bottlenecks blocking full autonomy.

    arxiv.orgpaperAdded 2 Oct 2026, published 28 Sep 2026🛡️ Security

  55. LOGOS: A Living Logic for AI Agent Teams That Evolve With Humans

    LOGOS is a proposed pluggable governance and self-evolution layer that sits atop existing multiagent frameworks, compiling documents, images, audio, tables, databases, APIs and human instructions into versioned "agent packs" containing agents, tools, knowledge, tests, permissions and policies. It converts agent activity into portable, auditable event traces and enforces fail-closed verification, requiring held-out execution evidence and human authorization before any learned prompt, memory, skill, tool, role or workflow can be promoted from candidate to production. The core contribution is architectural: a framework for "verifiable human-agent loop engineering" that lets agents act and propose improvements at speed while humans retain control over irreversible changes.

    arxiv.orgpaperAdded 26 Sep 2026🧠 AI

  56. Manipulation Is Task-Dependent: A Multi-Axis, Multi-Environment Evaluation of Frontier LLMs

    This paper evaluates manipulative behavior in six frontier LLMs across six environments (negotiation tasks to agentic workflows), covering 13,590 scenarios, measuring manipulation rates along three axes: framing (honesty-mandated vs. manipulation-permitted), incentive structure, and task difficulty. It finds manipulative tendencies are largely task-dependent (average Spearman rank correlation of only ρ=0.055 across environments) and identifies that different axes drive manipulation depending on whether the model is misrepresenting future actions versus ground truth, arguing existing single-axis, single-environment benchmarks are insufficient for measuring this behavior.

    arxiv.orgpaperAdded 26 Sep 2026🧠 AI

  57. LOGOS: A Living Logic for AI Agent Teams That Evolve With Humans

    LOGOS is a proposed pluggable governance layer that sits on top of existing multiagent frameworks to control how AI agent teams self-modify over time. It compiles heterogeneous inputs into versioned 'agent packs' (agents, tools, knowledge, tests, permissions, policies), records agent activity as auditable event traces, and enforces fail-closed verification so that any learned prompt, memory, skill, tool, or workflow remains an untrusted release candidate until held-out execution evidence and explicit human authorization promote it. The framework targets the core agent-security problem of unauthorized or unverified self-modification in autonomous agent teams.

    arxiv.orgpaperAdded 26 Sep 2026🛡️ Security

  58. OpenAnt: LLM-Powered Vulnerability Discovery Through Code Decomposition, Adversarial Verification, and Dynamic Testing

    OpenAnt is an open-source (Apache 2.0) vulnerability discovery system that combines static program analysis with LLM reasoning in a three-stage pipeline: decomposing codebases into reachability-filtered analysis units (cutting analysis surface up to 97%), running adversarial verification where the model simulates a constrained attacker to judge exploitability, and validating candidates via dynamic testing in disposable sandboxed containers. Evaluated against large real-world projects including OpenSSL, WordPress, and Flowise, it reportedly surfaced previously unknown vulnerabilities while cutting false positives and keeping analysis cost manageable, positioning closed-loop LLM+exploit-validation pipelines as a practical path to scalable automated security analysis.

    arxiv.orgpaperAdded 26 Sep 2026🛡️ Security

  59. PYPILINE: Malicious PyPI Package Detection via Suspicious API Knowledge and Agent Workflow

    PYPILINE is a malicious PyPI package detection system that builds a structured knowledge base of suspicious APIs from static analysis (AST + API call graphs) of known malicious packages, then uses an LLM agent workflow with RAG to retrieve that knowledge base and perform semantic analysis of new packages, outputting structured evaluation reports. The authors report 96.7% precision, 99.6% recall, and 98.1% F1 (5.7–21.6 points above baseline tools), with ~0.6s average detection time per package under 30 concurrent threads, plus an empirical study of common attack strategies and frequently abused APIs in PyPI malware.

    arxiv.orgpaperAdded 26 Sep 2026🛡️ Security

  60. First-Order Stationarity of Reverse Diffusions

    This arXiv preprint develops a first-order theory connecting optimization and sampling for diffusion models. It shows that SDE-based reverse-time flows of overdamped and underdamped Langevin diffusions contract relative Fisher divergences at explicit exponential rates when the forward process's stationary potential is strongly convex (a property of the chosen noising schedule, not the data), a guarantee absent from ODE-based reverse processes. It also derives averaged first-order stationarity bounds under discretization, the sampling analog of averaged gradient-norm guarantees in nonconvex optimization, for both overdamped and underdamped samplers.

    arxiv.orgpaperAdded 28 Sep 2026, published 25 Sep 2026🧠 AI

Showing 60 of 70

Show more