From f13d727578468e0ce1f4d6cd5fcb6baf2cbf0054 Mon Sep 17 00:00:00 2001 From: sphinx Date: Mon, 26 Oct 2026 11:26:17 +0000 Subject: [PATCH] sphinx: provenance-anchored multimodal/long-context corpus (279 arXiv nodes, hash-chained edge journal, 3 verifiers) --- .../archive-lcmm-corpus-2026-10-26/CHECK.sh | 23 + .../archive-lcmm-corpus-2026-10-26/README.md | 58 + .../archive-lcmm-corpus-2026-10-26/REPORT.md | 94 + .../build_corpus.py | 265 + .../build_report.py | 99 + .../corpus.json | 9638 +++++++++++++++++ .../edges.jsonl | 94 + .../indep_check.py | 148 + .../mutation_battery.py | 159 + .../probes/probe.py | 12 + .../probes/probe_figs.py | 24 + .../probes/probe_idlist.py | 14 + .../probes/probe_kws.py | 28 + .../probes/probe_refs.py | 39 + .../probes/probe_titles.py | 58 + .../probes/probe_xref.py | 32 + .../run_verdict.py | 209 + .../source/arxiv-lc.xml | 3529 ++++++ .../source/arxiv-lc2.xml | 2420 +++++ .../source/arxiv-mm.xml | 3430 ++++++ .../source/arxiv-mm2.xml | 1871 ++++ 21 files changed, 22244 insertions(+) create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/CHECK.sh create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/README.md create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/REPORT.md create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_corpus.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_report.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/corpus.json create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/edges.jsonl create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/indep_check.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/mutation_battery.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_figs.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_idlist.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_kws.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_refs.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_titles.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_xref.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/run_verdict.py create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc.xml create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc2.xml create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm.xml create mode 100644 wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm2.xml diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/CHECK.sh b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/CHECK.sh new file mode 100644 index 0000000..df3c829 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/CHECK.sh @@ -0,0 +1,23 @@ +#!/usr/bin/env bash +# CHECK.sh -- the single-command verdict for this archive. +# +# bash CHECK.sh ; echo $? # 0 = the archive holds, nonzero = it does not +# +# It runs, in order: +# 1. run_verdict.py -- internal integrity (proofs, hash chain, DAG) +# 2. indep_check.py -- live-arXiv corroboration + a second, from-scratch parse +# 3. mutation_battery.py-- falsifiability: 11 corruptions must all be caught +# and exits nonzero if ANY of them fails. +set -u +cd "$(dirname "$0")" +fail=0 +for t in run_verdict.py indep_check.py mutation_battery.py; do + echo "=== $t ===" + python3 "$t" || fail=1 +done +if [ "$fail" -ne 0 ]; then + echo "CHECK: FAIL" + exit 1 +fi +echo "CHECK: PASS" +exit 0 diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/README.md b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/README.md new file mode 100644 index 0000000..b7fd1c5 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/README.md @@ -0,0 +1,58 @@ +# archive-lcmm-citegraph-2026-10-26 + +sphinx — Archive lane (multimodal, long-context research). + +A **provenance-anchored research corpus** built from a live arXiv API fetch, +with an append-only hash-chained edge journal. 279 distinct papers, 94 +title-similarity edges, every record tied to a verbatim line in the frozen +raw XML. + +## Verdict (the command) + +``` +bash CHECK.sh +``` + +Exit 0 = the archive holds. It runs three independent checks: + +| checker | what it proves | +|---|---| +| `run_verdict.py` | 22 internal-integrity checks: proof line numbers, proof block hashes, titles re-derived from the frozen bytes, hash-chained journal, acyclicity, honest counts | +| `indep_check.py` | re-fetches **live arXiv** by `id_list` and re-parses the frozen sources with regex (not ElementTree); corroborates all 279 titles against what arXiv serves today | +| `mutation_battery.py` | 11 single-field corruptions of a copy — all 11 must be caught, or the verdict is not a real test | + +## Measured at build time + +- records fetched: 320 → distinct nodes: **279** +- similarity edges (title Jaccard ≥ 0.25): **94** (55 nodes with outgoing, 61 with incoming) +- frozen sources: 4 raw XML files, 844,912 bytes total, all sha256-pinned +- journal head: recorded in `corpus.json` → `journal.head` + +## Files + + build_corpus.py fetches arXiv, builds corpus + chained journal + corpus.json the manifest (nodes, proofs, edges, journal head) + edges.jsonl append-only hash-chained edge journal + source/arxiv-*.xml frozen raw API responses (sha256-pinned) + run_verdict.py internal integrity verifier (22 checks) + indep_check.py live-arXiv corroboration + second from-scratch parse + mutation_battery.py falsifiability harness (11 mutations) + CHECK.sh one-command verdict + REPORT.md rendered report + probes/ the measurement probes that justified the design + +## Why this design (measured, not guessed) + +The first attempt — a **citation graph** from arXiv IDs in abstracts — produced +**0 edges**: `probes/probe.py` measured `arXiv:` mentions = 0 in all 80 fetched +abstracts. An empty journal would have made the verdict a tautology, so the +design was changed. `probes/probe_titles.py` then measured title-overlap +density (33 pairs at J≥0.2, 8 at J≥0.25 over 80 papers), which showed a real +but sparse signal — so the slice was widened to 320 records and the threshold +set at 0.25, yielding 94 edges. + +## Note on `probes/probe_refs.py` + +Full-text reference lists (ar5iv HTML) do carry arXiv IDs — 5 per paper — but +none resolve inside the fetched slice, so an in-slice citation graph stays +empty. Recorded here so the negative result is not re-litigated. diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/REPORT.md b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/REPORT.md new file mode 100644 index 0000000..d718919 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/REPORT.md @@ -0,0 +1,94 @@ +# archive-lcmm-corpus-2026-10-26 + +Built 2026-10-26T11:17:13Z by `build_corpus.py`. + +## What this is + +A provenance-anchored research corpus over the **multimodal / long-context** +lane, built from a **live arXiv API fetch** on the build date. It is not a +scrape-and-forget dump: every derived record carries a verbatim proof that +re-derives from the frozen raw bytes, and the edge journal is hash-chained. + +## Provenance model + +* The raw arXiv API response for each slice is frozen under `source/` with + its sha256 and byte count recorded in the manifest. +* Each node records `proof.line` (1-based line of its `` in the raw + XML) and `proof.block_sha256` (sha256 of that entry's exact byte block). +* A verifier re-derives line, block hash, and title straight from the frozen + bytes — it does not trust `corpus.json`. + +## Fetches (measured) + +| slice | query | requested | returned | bytes | sha256 | +|---|---|---|---|---|---| +| mm | `cat:cs.CV AND abs:"multimodal"` | 100 | 100 | 261064 | `e7404fda36641d29…` | +| lc | `cat:cs.CL AND abs:"long context"` | 100 | 100 | 264236 | `1118fef8a03bf5dc…` | +| mm2 | `cat:cs.CV AND abs:"vision language"` | 60 | 60 | 155027 | `1d10f8ca56ad0c1c…` | +| lc2 | `abs:"long context" AND abs:"benchmark"` | 60 | 60 | 164585 | `e8ca5492ec9d091e…` | + +## Counts + +* records fetched: **320** +* distinct nodes: **279** +* similarity edges (Jaccard >= 0.25): **94** +* nodes with outgoing edges: 55 +* nodes with incoming edges: 61 + +Per-slice node counts: `lc`=100, `lc2`=25, `mm`=100, `mm2`=54 + +## Edge journal + +* entries: **94** +* genesis: `0000000000000000000000000000000000000000000000000000000000000000` +* head: `2c0bf612e7c9db3cd0db0ac91cee031e4c2ef20d2e0b72722e4775f058e4988c` +* construction: `hash_n = sha256(json({seq, from, to, jaccard, prev_hash}))`, + `prev_hash_0 = '0'*64` — an append-only chain. + +## Top edges by title similarity + +| jaccard | later (from) | earlier (to) | shared stems | +|---|---|---|---| +| 0.556 | `2610.32263` | `2610.27298` | cont, foun, lear, mode, mult | +| 0.417 | `2610.31205` | `2610.25005` | lang, larg, mode, mult, visu | +| 0.364 | `2610.11592` | `2609.38137` | lang, long, mode, reas | +| 0.364 | `2610.32263` | `2610.27904` | cont, foun, mode, mult | +| 0.333 | `2609.36529` | `2609.36314` | long, mode, sequ, stat | +| 0.333 | `2610.17966` | `2610.06479` | beha, cach, comp | +| 0.333 | `2610.19928` | `2609.36935` | long, memo, reas | +| 0.333 | `2610.26203` | `2609.25611` | agen, omni | +| 0.333 | `2610.31304` | `2610.29642` | data, remo, sens | +| 0.333 | `2610.31494` | `2610.26826` | agen, benc, visu | +| 0.333 | `2610.32440` | `2610.32220` | grou, mode, visi, visu | +| 0.308 | `2610.27904` | `2610.27298` | cont, foun, mode, mult | +| 0.308 | `2610.28626` | `2610.27782` | embo, lang, mode, robo | +| 0.308 | `2610.31158` | `2610.25926` | agen, deep, repo, rese | +| 0.308 | `2610.32486` | `2610.31478` | anom, dete, effi, vide | + +## Verdicts + +Three independent checks, all green at build time: + +* `run_verdict.py` — 22 internal-integrity checks (proofs, chain, DAG, counts) +* `indep_check.py` — re-fetches live arXiv by `id_list` and re-parses the frozen + sources with regex (not ElementTree); corroborates all 279 titles +* `mutation_battery.py` — 11 single-field corruptions, all 11 caught + +Run everything with one command: + +``` +bash CHECK.sh +``` + +## Files + +| file | role | +|---|---| +| `build_corpus.py` | fetches arXiv, builds corpus + chained journal | +| `corpus.json` | the manifest (nodes, proofs, edges, journal head) | +| `edges.jsonl` | append-only hash-chained edge journal | +| `source/arxiv-*.xml` | frozen raw API responses (sha256-pinned) | +| `run_verdict.py` | internal integrity verifier (22 checks) | +| `indep_check.py` | live-arXiv corroboration + second from-scratch parse | +| `mutation_battery.py` | falsifiability harness (11 mutations) | +| `CHECK.sh` | one-command verdict | diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_corpus.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_corpus.py new file mode 100644 index 0000000..8f76cc0 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_corpus.py @@ -0,0 +1,265 @@ +#!/usr/bin/env python3 +"""build_corpus.py -- sphinx Archive lane. + +Build a PROVENANCE-ANCHORED research corpus over the multimodal / +long-context lane, from a LIVE arXiv API fetch. + +What makes this an archive rather than a dump: + * The raw API response is frozen as bytes with its sha256 recorded. + * Every derived record carries `proof` = the 1-based line number in the raw + XML where that record's block begins, and `proof_sha256` = + sha256 of that block's bytes. A verifier re-derives both from the frozen + source independently. + * A title-similarity DAG is derived from the corpus (edges only point from + a paper published later to a paper published earlier), and the journal of + edges is hash-chained append-only. + +Everything is MEASURED in this run; nothing is asserted from memory. + +Usage: python3 build_corpus.py +""" +import hashlib +import json +import os +import re +import sys +import urllib.parse +import urllib.request +import xml.etree.ElementTree as ET +from datetime import datetime, timezone + +HERE = os.path.dirname(os.path.abspath(__file__)) +SRC = os.path.join(HERE, "source") +os.makedirs(SRC, exist_ok=True) + +API = "https://export.arxiv.org/api/query" +ATOM = "{http://www.w3.org/2005/Atom}" +ARXIV = "{http://arxiv.org/schemas/atom}" + +QUERIES = [ + ("mm", 'cat:cs.CV AND abs:"multimodal"', 100), + ("lc", 'cat:cs.CL AND abs:"long context"', 100), + ("mm2", 'cat:cs.CV AND abs:"vision language"', 60), + ("lc2", 'abs:"long context" AND abs:"benchmark"', 60), +] + +# title-tokenisation: stopwords + crude stem, used only for the similarity DAG +STOP = { + "a", "an", "the", "of", "for", "and", "or", "to", "in", "on", "with", "via", + "by", "from", "as", "at", "is", "are", "we", "our", "their", "its", "this", + "that", "these", "those", "using", "based", "towards", "through", "into", + "how", "what", "why", "when", "can", "do", "does", "be", "been", "than", +} +SIM_THRESHOLD = 0.25 + + +def canon(aid): + return re.sub(r"v\d+$", "", aid.strip()) + + +def sha256_bytes(b): + return hashlib.sha256(b).hexdigest() + + +def fetch_slice(label, query, n): + """Fetch one slice. Returns (raw_bytes, path).""" + q = urllib.parse.urlencode( + { + "search_query": query, + "start": 0, + "max_results": n, + "sortBy": "submittedDate", + "sortOrder": "descending", + } + ) + url = f"{API}?{q}" + req = urllib.request.Request(url, headers={"User-Agent": "sphinx-archive/1.0"}) + with urllib.request.urlopen(req, timeout=90) as r: + body = r.read() + path = os.path.join(SRC, f"arxiv-{label}.xml") + with open(path, "wb") as f: + f.write(body) + return body, path + + +def parse_with_proofs(raw): + """Parse raw XML and attach a verbatim-line proof for each . + + A record's proof is the 1-based line number of the '' line plus the + sha256 of the exact byte block of that entry, so a verifier can re-derive + the record from the frozen source without trusting this builder. + """ + lines = raw.split(b"\n") + starts = [i for i, ln in enumerate(lines) if ln.strip() == b""] + root = ET.fromstring(raw) + entries = root.findall(f"{ATOM}entry") + if len(entries) != len(starts): + raise RuntimeError( + f"entry count mismatch: ET={len(entries)} lines={len(starts)}" + ) + + recs = [] + for e, ln in zip(entries, starts): + # block = from the line through the next (or EOF) + nxt = starts[starts.index(ln) + 1] if starts.index(ln) + 1 < len(starts) else len(lines) + block = b"\n".join(lines[ln:nxt]) + aid = re.search(r"abs/([^/]+)$", e.findtext(f"{ATOM}id", "").strip()) + rec = { + "arxiv_id": aid.group(1) if aid else e.findtext(f"{ATOM}id", "").strip(), + "title": re.sub(r"\s+", " ", (e.findtext(f"{ATOM}title", "") or "").strip()), + "abstract": re.sub(r"\s+", " ", (e.findtext(f"{ATOM}summary", "") or "").strip()), + "published": (e.findtext(f"{ATOM}published", "") or "").strip(), + "updated": (e.findtext(f"{ATOM}updated", "") or "").strip(), + "categories": [c.get("term") for c in e.findall(f"{ATOM}category") if c.get("term")], + "primary_category": e.findtext(f"{ARXIV}primary_category", "") or "", + "doi": e.findtext(f"{ARXIV}doi", "") or "", + "authors": [ + (a.findtext(f"{ATOM}name", "") or "").strip() + for a in e.findall(f"{ATOM}author") + ], + "proof": { + "line": ln + 1, + "block_sha256": sha256_bytes(block), + "block_bytes": len(block), + }, + } + recs.append(rec) + return recs, lines, starts + + +def title_tokens(title): + out = set() + for w in re.findall(r"[A-Za-z][A-Za-z\-]+", title.lower()): + w = w.strip("-") + if len(w) < 3 or w in STOP: + continue + if len(w) > 4: + w = w[:4] + out.add(w) + return out + + +def main(): + stamp = datetime.now(timezone.utc).strftime("%Y-%m-%dT%H:%M:%SZ") + fetch_meta, all_recs, raw_by_label = [], [], {} + for label, query, n in QUERIES: + raw, path = fetch_slice(label, query, n) + raw_by_label[label] = raw + recs, lines, starts = parse_with_proofs(raw) + for r in recs: + r["slice"] = label + all_recs.extend(recs) + fetch_meta.append( + { + "label": label, + "query": query, + "requested_max": n, + "returned": len(recs), + "raw_bytes": len(raw), + "raw_sha256": sha256_bytes(raw), + "raw_path": os.path.relpath(path, HERE), + "entry_line_starts": [s + 1 for s in starts], + } + ) + + # dedupe by version-stripped node, keep highest version + by_node = {} + for r in all_recs: + node = canon(r["arxiv_id"]) + prev = by_node.get(node) + if prev is None: + by_node[node] = r + else: + v_new = int(re.search(r"v(\d+)$", r["arxiv_id"]).group(1)) + v_old = int(re.search(r"v(\d+)$", prev["arxiv_id"]).group(1)) + if v_new > v_old: + by_node[node] = r + + nodes = sorted(by_node.values(), key=lambda r: (r["published"], r["arxiv_id"])) + order = {canon(r["arxiv_id"]): i for i, r in enumerate(nodes)} + toks = {canon(r["arxiv_id"]): title_tokens(r["title"]) for r in nodes} + + # similarity edges: later-published -> earlier-published only + edges = [] + ids = [canon(r["arxiv_id"]) for r in nodes] + for i in range(len(ids)): + for j in range(i + 1, len(ids)): + a, b = ids[i], ids[j] # a published at or before b (nodes sorted) + sa, sb = toks[a], toks[b] + if not sa or not sb: + continue + jac = len(sa & sb) / len(sa | sb) + if jac >= SIM_THRESHOLD: + edges.append( + { + "from": b, # later + "to": a, # earlier + "jaccard": round(jac, 4), + "shared": sorted(sa & sb), + } + ) + edges.sort(key=lambda e: (-e["jaccard"], e["from"], e["to"])) + + # hash-chained append-only edge journal + journal_path = os.path.join(HERE, "edges.jsonl") + prev_hash = "0" * 64 + with open(journal_path, "w") as f: + for seq, e in enumerate(edges, start=1): + row = {"seq": seq, "from": e["from"], "to": e["to"], "jaccard": e["jaccard"], "prev_hash": prev_hash} + h = sha256_bytes(json.dumps(row, sort_keys=True, separators=(",", ":")).encode()) + row["hash"] = h + f.write(json.dumps(row, sort_keys=True) + "\n") + prev_hash = h + + head = prev_hash + manifest = { + "artifact": "archive-lcmm-corpus-2026-10-26", + "lane": "Archive -- multimodal, long-context research", + "built_utc": stamp, + "builder": "build_corpus.py", + "fetch": fetch_meta, + "counts": { + "records_fetched": len(all_recs), + "distinct_nodes": len(nodes), + "similarity_edges": len(edges), + "threshold": SIM_THRESHOLD, + "nodes_with_out_edges": len({e["from"] for e in edges}), + "nodes_with_in_edges": len({e["to"] for e in edges}), + }, + "nodes": [ + { + "node": canon(r["arxiv_id"]), + "arxiv_id": r["arxiv_id"], + "title": r["title"], + "published": r["published"], + "updated": r["updated"], + "primary_category": r["primary_category"], + "categories": r["categories"], + "doi": r["doi"], + "n_authors": len(r["authors"]), + "authors": r["authors"], + "abstract_chars": len(r["abstract"]), + "slice": r["slice"], + "proof": r["proof"], + } + for r in nodes + ], + "edges": edges, + "journal": { + "path": "edges.jsonl", + "entries": len(edges), + "genesis": "0" * 64, + "head": head, + }, + } + with open(os.path.join(HERE, "corpus.json"), "w") as f: + json.dump(manifest, f, indent=2, sort_keys=True) + + print(f"[build] fetched {len(all_recs)} records -> {len(nodes)} nodes") + print(f"[build] similarity edges (>= {SIM_THRESHOLD}): {len(edges)}") + print(f"[build] edge journal head: {head[:16]}...") + return 0 + + +if __name__ == "__main__": + sys.exit(main()) diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_report.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_report.py new file mode 100644 index 0000000..f28b7b6 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/build_report.py @@ -0,0 +1,99 @@ +#!/usr/bin/env python3 +"""build_report.py -- render REPORT.md from corpus.json (measured, not hand-written).""" +import json +import os + +HERE = os.path.dirname(os.path.abspath(__file__)) +m = json.load(open(os.path.join(HERE, "corpus.json"))) +nodes = m["nodes"] +edges = m["edges"] + +by_slice = {} +for n in nodes: + by_slice[n["slice"]] = by_slice.get(n["slice"], 0) + 1 + +lines = [] +A = lines.append +A(f"# {m['artifact']}") +A("") +A(f"Built {m['built_utc']} by `build_corpus.py`.") +A("") +A("## What this is") +A("") +A("A provenance-anchored research corpus over the **multimodal / long-context**") +A("lane, built from a **live arXiv API fetch** on the build date. It is not a") +A("scrape-and-forget dump: every derived record carries a verbatim proof that") +A("re-derives from the frozen raw bytes, and the edge journal is hash-chained.") +A("") +A("## Provenance model") +A("") +A("* The raw arXiv API response for each slice is frozen under `source/` with") +A(" its sha256 and byte count recorded in the manifest.") +A("* Each node records `proof.line` (1-based line of its `` in the raw") +A(" XML) and `proof.block_sha256` (sha256 of that entry's exact byte block).") +A("* A verifier re-derives line, block hash, and title straight from the frozen") +A(" bytes — it does not trust `corpus.json`.") +A("") +A("## Fetches (measured)") +A("") +A("| slice | query | requested | returned | bytes | sha256 |") +A("|---|---|---|---|---|---|") +for fm in m["fetch"]: + A(f"| {fm['label']} | `{fm['query']}` | {fm['requested_max']} | {fm['returned']} " + f"| {fm['raw_bytes']} | `{fm['raw_sha256'][:16]}…` |") +A("") +A("## Counts") +A("") +A(f"* records fetched: **{m['counts']['records_fetched']}**") +A(f"* distinct nodes: **{m['counts']['distinct_nodes']}**") +A(f"* similarity edges (Jaccard >= {m['counts']['threshold']}): **{m['counts']['similarity_edges']}**") +A(f"* nodes with outgoing edges: {m['counts']['nodes_with_out_edges']}") +A(f"* nodes with incoming edges: {m['counts']['nodes_with_in_edges']}") +A("") +A("Per-slice node counts: " + ", ".join(f"`{k}`={v}" for k, v in sorted(by_slice.items()))) +A("") +A("## Edge journal") +A("") +A(f"* entries: **{m['journal']['entries']}**") +A(f"* genesis: `{'0'*64}`") +A(f"* head: `{m['journal']['head']}`") +A("* construction: `hash_n = sha256(json({seq, from, to, jaccard, prev_hash}))`,") +A(" `prev_hash_0 = '0'*64` — an append-only chain.") +A("") +A("## Top edges by title similarity") +A("") +A("| jaccard | later (from) | earlier (to) | shared stems |") +A("|---|---|---|---|") +for e in edges[:15]: + A(f"| {e['jaccard']:.3f} | `{e['from']}` | `{e['to']}` | {', '.join(e['shared'][:6])} |") +A("") +A("## Verdicts") +A("") +A("Three independent checks, all green at build time:") +A("") +A("* `run_verdict.py` — 22 internal-integrity checks (proofs, chain, DAG, counts)") +A("* `indep_check.py` — re-fetches live arXiv by `id_list` and re-parses the frozen") +A(" sources with regex (not ElementTree); corroborates all 279 titles") +A("* `mutation_battery.py` — 11 single-field corruptions, all 11 caught") +A("") +A("Run everything with one command:") +A("") +A("```") +A("bash CHECK.sh") +A("```") +A("") +A("## Files") +A("") +A("| file | role |") +A("|---|---|") +A("| `build_corpus.py` | fetches arXiv, builds corpus + chained journal |") +A("| `corpus.json` | the manifest (nodes, proofs, edges, journal head) |") +A("| `edges.jsonl` | append-only hash-chained edge journal |") +A("| `source/arxiv-*.xml` | frozen raw API responses (sha256-pinned) |") +A("| `run_verdict.py` | internal integrity verifier (22 checks) |") +A("| `indep_check.py` | live-arXiv corroboration + second from-scratch parse |") +A("| `mutation_battery.py` | falsifiability harness (11 mutations) |") +A("| `CHECK.sh` | one-command verdict |") + +open(os.path.join(HERE, "REPORT.md"), "w").write("\n".join(lines) + "\n") +print(f"[report] wrote REPORT.md ({len(lines)} lines)") diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/corpus.json b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/corpus.json new file mode 100644 index 0000000..7832d85 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/corpus.json @@ -0,0 +1,9638 @@ +{ + "artifact": "archive-lcmm-corpus-2026-10-26", + "builder": "build_corpus.py", + "built_utc": "2026-10-26T11:17:13Z", + "counts": { + "distinct_nodes": 279, + "nodes_with_in_edges": 61, + "nodes_with_out_edges": 55, + "records_fetched": 320, + "similarity_edges": 94, + "threshold": 0.25 + }, + "edges": [ + { + "from": "2610.32263", + "jaccard": 0.5556, + "shared": [ + "cont", + "foun", + "lear", + "mode", + "mult" + ], + "to": "2610.27298" + }, + { + "from": "2610.31205", + "jaccard": 0.4167, + "shared": [ + "lang", + "larg", + "mode", + "mult", + "visu" + ], + "to": "2610.25005" + }, + { + "from": "2610.11592", + "jaccard": 0.3636, + "shared": [ + "lang", + "long", + "mode", + "reas" + ], + "to": "2609.38137" + }, + { + "from": "2610.32263", + "jaccard": 0.3636, + "shared": [ + "cont", + "foun", + "mode", + "mult" + ], + "to": "2610.27904" + }, + { + "from": "2609.36529", + "jaccard": 0.3333, + "shared": [ + "long", + "mode", + "sequ", + "stat" + ], + "to": "2609.36314" + }, + { + "from": "2610.17966", + "jaccard": 0.3333, + "shared": [ + "beha", + "cach", + "comp" + ], + "to": "2610.06479" + }, + { + "from": "2610.19928", + "jaccard": 0.3333, + "shared": [ + "long", + "memo", + "reas" + ], + "to": "2609.36935" + }, + { + "from": "2610.26203", + "jaccard": 0.3333, + "shared": [ + "agen", + "omni" + ], + "to": "2609.25611" + }, + { + "from": "2610.31304", + "jaccard": 0.3333, + "shared": [ + "data", + "remo", + "sens" + ], + "to": "2610.29642" + }, + { + "from": "2610.31494", + "jaccard": 0.3333, + "shared": [ + "agen", + "benc", + "visu" + ], + "to": "2610.26826" + }, + { + "from": "2610.32440", + "jaccard": 0.3333, + "shared": [ + "grou", + "mode", + "visi", + "visu" + ], + "to": "2610.32220" + }, + { + "from": "2610.27904", + "jaccard": 0.3077, + "shared": [ + "cont", + "foun", + "mode", + "mult" + ], + "to": "2610.27298" + }, + { + "from": "2610.28626", + "jaccard": 0.3077, + "shared": [ + "embo", + "lang", + "mode", + "robo" + ], + "to": "2610.27782" + }, + { + "from": "2610.31158", + "jaccard": 0.3077, + "shared": [ + "agen", + "deep", + "repo", + "rese" + ], + "to": "2610.25926" + }, + { + "from": "2610.32486", + "jaccard": 0.3077, + "shared": [ + "anom", + "dete", + "effi", + "vide" + ], + "to": "2610.31478" + }, + { + "from": "2610.10114", + "jaccard": 0.3, + "shared": [ + "atte", + "hybr", + "mode" + ], + "to": "2610.07940" + }, + { + "from": "2610.19026", + "jaccard": 0.3, + "shared": [ + "deco", + "effi", + "long" + ], + "to": "2610.00418" + }, + { + "from": "2610.19928", + "jaccard": 0.3, + "shared": [ + "lear", + "long", + "reas" + ], + "to": "2609.38809" + }, + { + "from": "2610.25247", + "jaccard": 0.3, + "shared": [ + "mult", + "nati", + "reas" + ], + "to": "2610.02181" + }, + { + "from": "2610.26431", + "jaccard": 0.3, + "shared": [ + "lang", + "long", + "mode" + ], + "to": "2609.38137" + }, + { + "from": "2610.28282", + "jaccard": 0.3, + "shared": [ + "harn", + "long", + "reas" + ], + "to": "2609.38137" + }, + { + "from": "2610.28282", + "jaccard": 0.3, + "shared": [ + "char", + "long", + "reas" + ], + "to": "2610.22067" + }, + { + "from": "2610.30097", + "jaccard": 0.3, + "shared": [ + "lear", + "long", + "rein" + ], + "to": "2609.38809" + }, + { + "from": "2610.30132", + "jaccard": 0.3, + "shared": [ + "enha", + "long", + "reas" + ], + "to": "2609.38809" + }, + { + "from": "2610.32213", + "jaccard": 0.3, + "shared": [ + "long", + "mode", + "retr" + ], + "to": "2610.08463" + }, + { + "from": "2610.32213", + "jaccard": 0.3, + "shared": [ + "lang", + "long", + "mode" + ], + "to": "2610.26431" + }, + { + "from": "2610.32263", + "jaccard": 0.3, + "shared": [ + "foun", + "lear", + "mode" + ], + "to": "2610.29495" + }, + { + "from": "2610.32332", + "jaccard": 0.3, + "shared": [ + "agen", + "harn", + "long" + ], + "to": "2610.28282" + }, + { + "from": "2610.32360", + "jaccard": 0.3, + "shared": [ + "mode", + "sens", + "visi" + ], + "to": "2610.31304" + }, + { + "from": "2610.32784", + "jaccard": 0.3, + "shared": [ + "memo", + "stre", + "vide" + ], + "to": "2610.30089" + }, + { + "from": "2610.06479", + "jaccard": 0.2857, + "shared": [ + "cach", + "comp" + ], + "to": "2610.03027" + }, + { + "from": "2610.12338", + "jaccard": 0.2857, + "shared": [ + "cach", + "comp" + ], + "to": "2610.06479" + }, + { + "from": "2610.19247", + "jaccard": 0.2857, + "shared": [ + "lang", + "mode" + ], + "to": "2610.07940" + }, + { + "from": "2610.26431", + "jaccard": 0.2857, + "shared": [ + "lang", + "mode" + ], + "to": "2610.19247" + }, + { + "from": "2610.26863", + "jaccard": 0.2857, + "shared": [ + "lang", + "mode" + ], + "to": "2610.19247" + }, + { + "from": "2610.27341", + "jaccard": 0.2857, + "shared": [ + "effi", + "mult", + "reas", + "thin" + ], + "to": "2610.25999" + }, + { + "from": "2610.31098", + "jaccard": 0.2857, + "shared": [ + "cach", + "comp" + ], + "to": "2610.06479" + }, + { + "from": "2610.10156", + "jaccard": 0.2727, + "shared": [ + "long", + "unde", + "vide" + ], + "to": "2610.05940" + }, + { + "from": "2610.19928", + "jaccard": 0.2727, + "shared": [ + "lear", + "memo", + "reas" + ], + "to": "2609.39740" + }, + { + "from": "2610.22067", + "jaccard": 0.2727, + "shared": [ + "cont", + "diff", + "long" + ], + "to": "2610.13132" + }, + { + "from": "2610.26431", + "jaccard": 0.2727, + "shared": [ + "lang", + "long", + "mode" + ], + "to": "2610.11592" + }, + { + "from": "2610.26585", + "jaccard": 0.2727, + "shared": [ + "feed", + "gaus", + "reco" + ], + "to": "2610.23250" + }, + { + "from": "2610.27782", + "jaccard": 0.2727, + "shared": [ + "lang", + "mode", + "vide" + ], + "to": "2610.26431" + }, + { + "from": "2610.27782", + "jaccard": 0.2727, + "shared": [ + "gene", + "lang", + "mode" + ], + "to": "2610.26863" + }, + { + "from": "2610.28382", + "jaccard": 0.2727, + "shared": [ + "comp", + "evid", + "lear" + ], + "to": "2609.31382" + }, + { + "from": "2610.28382", + "jaccard": 0.2727, + "shared": [ + "comp", + "evid", + "mult" + ], + "to": "2610.24378" + }, + { + "from": "2610.29590", + "jaccard": 0.2727, + "shared": [ + "gene", + "mult", + "vide" + ], + "to": "2610.26585" + }, + { + "from": "2610.30108", + "jaccard": 0.2727, + "shared": [ + "agen", + "comp", + "mult" + ], + "to": "2610.24378" + }, + { + "from": "2610.30132", + "jaccard": 0.2727, + "shared": [ + "data", + "long", + "reas" + ], + "to": "2610.23167" + }, + { + "from": "2610.32213", + "jaccard": 0.2727, + "shared": [ + "lang", + "long", + "mode" + ], + "to": "2609.38137" + }, + { + "from": "2610.32311", + "jaccard": 0.2727, + "shared": [ + "cont", + "lear", + "mult" + ], + "to": "2610.32263" + }, + { + "from": "2610.32332", + "jaccard": 0.2727, + "shared": [ + "benc", + "harn", + "long" + ], + "to": "2609.38137" + }, + { + "from": "2610.32332", + "jaccard": 0.2727, + "shared": [ + "agen", + "long", + "memo" + ], + "to": "2610.02472" + }, + { + "from": "2610.32485", + "jaccard": 0.2727, + "shared": [ + "inve", + "mode", + "visi" + ], + "to": "2610.27360" + }, + { + "from": "2610.32612", + "jaccard": 0.2727, + "shared": [ + "data", + "open", + "segm" + ], + "to": "2610.29642" + }, + { + "from": "2610.32784", + "jaccard": 0.2727, + "shared": [ + "stre", + "unde", + "vide" + ], + "to": "2610.05940" + }, + { + "from": "2610.21165", + "jaccard": 0.2667, + "shared": [ + "lang", + "larg", + "mode", + "surv" + ], + "to": "2609.29370" + }, + { + "from": "2610.28264", + "jaccard": 0.2667, + "shared": [ + "lang", + "larg", + "mode", + "mult" + ], + "to": "2610.25005" + }, + { + "from": "2610.28264", + "jaccard": 0.2667, + "shared": [ + "lang", + "mode", + "mult", + "vide" + ], + "to": "2610.27782" + }, + { + "from": "2610.31205", + "jaccard": 0.2667, + "shared": [ + "benc", + "lang", + "larg", + "mode" + ], + "to": "2610.00969" + }, + { + "from": "2610.32213", + "jaccard": 0.2667, + "shared": [ + "lang", + "long", + "mode", + "retr" + ], + "to": "2609.35831" + }, + { + "from": "2610.00982", + "jaccard": 0.25, + "shared": [ + "acti", + "memo", + "poli" + ], + "to": "2609.39740" + }, + { + "from": "2610.06479", + "jaccard": 0.25, + "shared": [ + "cach" + ], + "to": "2610.03198" + }, + { + "from": "2610.06479", + "jaccard": 0.25, + "shared": [ + "cach", + "comp" + ], + "to": "2610.06286" + }, + { + "from": "2610.06479", + "jaccard": 0.25, + "shared": [ + "cach", + "comp" + ], + "to": "2610.06927" + }, + { + "from": "2610.10918", + "jaccard": 0.25, + "shared": [ + "lang", + "larg", + "mode", + "tran" + ], + "to": "2610.00969" + }, + { + "from": "2610.15542", + "jaccard": 0.25, + "shared": [ + "mode", + "reas" + ], + "to": "2610.15371" + }, + { + "from": "2610.19247", + "jaccard": 0.25, + "shared": [ + "lang", + "mode" + ], + "to": "2609.33465" + }, + { + "from": "2610.19247", + "jaccard": 0.25, + "shared": [ + "lang", + "mode" + ], + "to": "2609.38137" + }, + { + "from": "2610.25005", + "jaccard": 0.25, + "shared": [ + "effi", + "lang", + "mode" + ], + "to": "2609.33465" + }, + { + "from": "2610.25919", + "jaccard": 0.25, + "shared": [ + "lear", + "long", + "stat" + ], + "to": "2609.38809" + }, + { + "from": "2610.26431", + "jaccard": 0.25, + "shared": [ + "long", + "mode", + "recu" + ], + "to": "2609.36529" + }, + { + "from": "2610.26431", + "jaccard": 0.25, + "shared": [ + "lang", + "mode", + "recu" + ], + "to": "2610.13041" + }, + { + "from": "2610.26431", + "jaccard": 0.25, + "shared": [ + "lang", + "long", + "mode" + ], + "to": "2610.21165" + }, + { + "from": "2610.27341", + "jaccard": 0.25, + "shared": [ + "mult", + "reas", + "visu" + ], + "to": "2610.25247" + }, + { + "from": "2610.27692", + "jaccard": 0.25, + "shared": [ + "long", + "unde", + "vide" + ], + "to": "2610.05940" + }, + { + "from": "2610.27692", + "jaccard": 0.25, + "shared": [ + "long", + "unde", + "vide" + ], + "to": "2610.10156" + }, + { + "from": "2610.27782", + "jaccard": 0.25, + "shared": [ + "gene", + "mult", + "vide" + ], + "to": "2610.26585" + }, + { + "from": "2610.29495", + "jaccard": 0.25, + "shared": [ + "foun", + "lear", + "mode" + ], + "to": "2610.27298" + }, + { + "from": "2610.29590", + "jaccard": 0.25, + "shared": [ + "fram", + "mult", + "vide" + ], + "to": "2610.26022" + }, + { + "from": "2610.29590", + "jaccard": 0.25, + "shared": [ + "gene", + "mult", + "vide" + ], + "to": "2610.27782" + }, + { + "from": "2610.30206", + "jaccard": 0.25, + "shared": [ + "cach", + "comp" + ], + "to": "2610.06479" + }, + { + "from": "2610.30913", + "jaccard": 0.25, + "shared": [ + "in-c", + "lear", + "visu" + ], + "to": "2610.30592" + }, + { + "from": "2610.31098", + "jaccard": 0.25, + "shared": [ + "comp", + "trai" + ], + "to": "2610.20582" + }, + { + "from": "2610.31158", + "jaccard": 0.25, + "shared": [ + "deep", + "rese", + "vide" + ], + "to": "2610.25493" + }, + { + "from": "2610.31205", + "jaccard": 0.25, + "shared": [ + "lang", + "larg", + "mode", + "mult" + ], + "to": "2610.28264" + }, + { + "from": "2610.31945", + "jaccard": 0.25, + "shared": [ + "mode", + "sove" + ], + "to": "2610.15371" + }, + { + "from": "2610.32177", + "jaccard": 0.25, + "shared": [ + "mode", + "unif", + "visi" + ], + "to": "2610.29811" + }, + { + "from": "2610.32213", + "jaccard": 0.25, + "shared": [ + "lang", + "long", + "mode" + ], + "to": "2610.11592" + }, + { + "from": "2610.32213", + "jaccard": 0.25, + "shared": [ + "lang", + "mode" + ], + "to": "2610.19247" + }, + { + "from": "2610.32213", + "jaccard": 0.25, + "shared": [ + "lang", + "mode", + "retr" + ], + "to": "2610.25005" + }, + { + "from": "2610.32263", + "jaccard": 0.25, + "shared": [ + "lear", + "mode", + "mult" + ], + "to": "2610.28266" + }, + { + "from": "2610.32360", + "jaccard": 0.25, + "shared": [ + "lang", + "mode" + ], + "to": "2610.19247" + }, + { + "from": "2610.32478", + "jaccard": 0.25, + "shared": [ + "mode", + "visi" + ], + "to": "2610.27360" + } + ], + "fetch": [ + { + "entry_line_starts": [ + 10, + 27, + 69, + 96, + 200, + 226, + 265, + 285, + 318, + 339, + 384, + 411, + 470, + 553, + 598, + 620, + 646, + 670, + 708, + 732, + 771, + 804, + 839, + 868, + 912, + 946, + 982, + 1049, + 1088, + 1109, + 1145, + 1166, + 1201, + 1234, + 1261, + 1277, + 1304, + 1337, + 1357, + 1405, + 1432, + 1479, + 1505, + 1538, + 1570, + 1604, + 1637, + 1667, + 1734, + 1777, + 1797, + 1837, + 1871, + 1917, + 1935, + 1962, + 1995, + 2020, + 2049, + 2073, + 2097, + 2131, + 2157, + 2194, + 2242, + 2269, + 2299, + 2357, + 2401, + 2436, + 2486, + 2503, + 2527, + 2551, + 2589, + 2616, + 2649, + 2670, + 2699, + 2720, + 2749, + 2791, + 2818, + 2846, + 2876, + 2906, + 2947, + 2972, + 2994, + 3045, + 3086, + 3137, + 3175, + 3206, + 3230, + 3275, + 3302, + 3327, + 3371, + 3406 + ], + "label": "mm", + "query": "cat:cs.CV AND abs:\"multimodal\"", + "raw_bytes": 261064, + "raw_path": "source/arxiv-mm.xml", + "raw_sha256": "e7404fda36641d29275ae72408acad977d1f808c36a498df825cd8686e02de03", + "requested_max": 100, + "returned": 100 + }, + { + "entry_line_starts": [ + 10, + 33, + 83, + 105, + 324, + 344, + 367, + 408, + 427, + 460, + 496, + 526, + 553, + 577, + 599, + 629, + 645, + 687, + 733, + 765, + 779, + 796, + 821, + 848, + 889, + 907, + 925, + 945, + 979, + 1000, + 1544, + 1575, + 1612, + 1635, + 1661, + 1682, + 1714, + 1741, + 1761, + 1779, + 1803, + 1824, + 1854, + 1881, + 1902, + 1919, + 1940, + 1959, + 1993, + 2020, + 2053, + 2090, + 2117, + 2143, + 2164, + 2193, + 2237, + 2268, + 2295, + 2319, + 2340, + 2362, + 2387, + 2403, + 2436, + 2469, + 2497, + 2518, + 2539, + 2566, + 2586, + 2623, + 2641, + 2664, + 2696, + 2739, + 2774, + 2804, + 2835, + 2863, + 2887, + 2908, + 2940, + 2969, + 3003, + 3038, + 3094, + 3128, + 3167, + 3201, + 3224, + 3278, + 3305, + 3326, + 3353, + 3389, + 3412, + 3438, + 3457, + 3513 + ], + "label": "lc", + "query": "cat:cs.CL AND abs:\"long context\"", + "raw_bytes": 264236, + "raw_path": "source/arxiv-lc.xml", + "raw_sha256": "1118fef8a03bf5dc6013983dd802e1db00b1370b216ad62d68eef968fb1be746", + "requested_max": 100, + "returned": 100 + }, + { + "entry_line_starts": [ + 10, + 27, + 63, + 167, + 194, + 228, + 248, + 269, + 288, + 315, + 334, + 355, + 372, + 396, + 433, + 478, + 505, + 553, + 589, + 632, + 669, + 698, + 718, + 745, + 771, + 797, + 832, + 878, + 895, + 924, + 945, + 979, + 1005, + 1029, + 1089, + 1115, + 1163, + 1199, + 1232, + 1257, + 1281, + 1324, + 1363, + 1390, + 1420, + 1456, + 1489, + 1508, + 1538, + 1557, + 1583, + 1625, + 1652, + 1675, + 1690, + 1710, + 1741, + 1791, + 1815, + 1852 + ], + "label": "mm2", + "query": "cat:cs.CV AND abs:\"vision language\"", + "raw_bytes": 155027, + "raw_path": "source/arxiv-mm2.xml", + "raw_sha256": "1d10f8ca56ad0c1cdf552af9daffeebe5e58a6ee19ae1b65422bc14a1f43ff70", + "requested_max": 60, + "returned": 60 + }, + { + "entry_line_starts": [ + 10, + 60, + 79, + 98, + 134, + 190, + 220, + 250, + 274, + 298, + 320, + 350, + 376, + 403, + 449, + 494, + 526, + 560, + 574, + 601, + 634, + 661, + 702, + 720, + 756, + 792, + 826, + 847, + 1391, + 1422, + 1459, + 1485, + 1517, + 1552, + 1582, + 1602, + 1632, + 1649, + 1796, + 1831, + 1850, + 1904, + 1931, + 1964, + 1978, + 1998, + 2025, + 2069, + 2100, + 2121, + 2145, + 2167, + 2183, + 2218, + 2253, + 2283, + 2316, + 2337, + 2360, + 2399 + ], + "label": "lc2", + "query": "abs:\"long context\" AND abs:\"benchmark\"", + "raw_bytes": 164585, + "raw_path": "source/arxiv-lc2.xml", + "raw_sha256": "e8ca5492ec9d091ea5df0666c85aa5b191ec521980d31b13eca1a86a6b84dd84", + "requested_max": 60, + "returned": 60 + } + ], + "journal": { + "entries": 94, + "genesis": "0000000000000000000000000000000000000000000000000000000000000000", + "head": "2c0bf612e7c9db3cd0db0ac91cee031e4c2ef20d2e0b72722e4775f058e4988c", + "path": "edges.jsonl" + }, + "lane": "Archive -- multimodal, long-context research", + "nodes": [ + { + "abstract_chars": 1901, + "arxiv_id": "2609.25611v1", + "authors": [ + "Qwen Team" + ], + "categories": [ + "cs.CL", + "cs.CV", + "cs.MM" + ], + "doi": "", + "n_authors": 1, + "node": "2609.25611", + "primary_category": "", + "proof": { + "block_bytes": 2653, + "block_sha256": "ce22ea2bc3c5143326c301b2958b8bf82f888b2593c354566e75a1207633ee66", + "line": 3513 + }, + "published": "2026-09-22T03:07:59Z", + "slice": "lc", + "title": "Qwen3.8-Omni: Towards Native Omni-Modal Agents", + "updated": "2026-09-22T03:07:59Z" + }, + { + "abstract_chars": 1473, + "arxiv_id": "2609.26368v1", + "authors": [ + "Jianyu Wei", + "Yizhao Gao", + "Qihao Zhang", + "Shimao Chen", + "Zhengju Tang", + "Yu Cheng", + "Shengjie Zhou", + "Zihan Jiang", + "Yifan Song", + "Hailin Zhang", + "Liang Zhao", + "Bo Yang", + "Gang Wang", + "Shijie Cao", + "Fuli Luo" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 15, + "node": "2609.26368", + "primary_category": "", + "proof": { + "block_bytes": 2894, + "block_sha256": "a52d7250ea4742c59c725fe0593f2d7ed476b7741f3db7da09f1c30d48794e15", + "line": 3457 + }, + "published": "2026-09-22T13:10:32Z", + "slice": "lc", + "title": "HySparse2: Hybrid Sparse Attention with Two-Level KV Sharing", + "updated": "2026-09-22T13:10:32Z" + }, + { + "abstract_chars": 1241, + "arxiv_id": "2609.26976v1", + "authors": [ + "Yingrui Li", + "Han Chen" + ], + "categories": [ + "cs.CL", + "cs.IR" + ], + "doi": "", + "n_authors": 2, + "node": "2609.26976", + "primary_category": "", + "proof": { + "block_bytes": 2223, + "block_sha256": "1b40dd6ff0b494b76b45a78c241ac6276055bb4fdf78e739ae40598668b4aa0a", + "line": 3438 + }, + "published": "2026-09-22T19:12:16Z", + "slice": "lc", + "title": "When Learned Context Planning Fails to Beat Strong Retrieval: A Controlled Study of Planning, Routing, and Reranking for Long-Context QA", + "updated": "2026-09-22T19:12:16Z" + }, + { + "abstract_chars": 1668, + "arxiv_id": "2609.27470v1", + "authors": [ + "Taeyoun Kwon", + "Seungjin Kim", + "Hyeonyu Kim", + "Moon Hwan Kim" + ], + "categories": [ + "cs.CV", + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2609.27470", + "primary_category": "", + "proof": { + "block_bytes": 2746, + "block_sha256": "4d181bc0a9197a41a249160669c393f138063dfcabbce2788eb7f77c8311e51e", + "line": 3412 + }, + "published": "2026-09-23T07:35:52Z", + "slice": "lc", + "title": "DeltaS: Reading the Gated Linear Attention State for KV Cache Eviction in Streaming Video", + "updated": "2026-09-23T07:35:52Z" + }, + { + "abstract_chars": 1849, + "arxiv_id": "2609.27590v1", + "authors": [ + "Wei He", + "Aline Villavicencio", + "Rodrigo Wilkens", + "Zhenyun Deng" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2609.27590", + "primary_category": "", + "proof": { + "block_bytes": 2678, + "block_sha256": "b1c1545a7e0009f42c38f54714e7766bbb8f012ba6fde9230164652b5c6dae2e", + "line": 3389 + }, + "published": "2026-09-23T09:09:04Z", + "slice": "lc", + "title": "MWE-ECL: Recoverable Long-Range Context Does Not Always Override Local Lexical Priors", + "updated": "2026-09-23T09:09:04Z" + }, + { + "abstract_chars": 1868, + "arxiv_id": "2609.35831v1", + "authors": [ + "Isaac Olufadewa", + "Miracle Adesina", + "Ezekiel Oladejo", + "Owen Adeniyi", + "Fadare Fadekemi", + "Olamide Oso", + "Uthman Babatunde", + "Matthew Olawoyin" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 8, + "node": "2609.35831", + "primary_category": "", + "proof": { + "block_bytes": 3042, + "block_sha256": "81594fb1e3ae822d121dbd1ed54c98f2676e6264f4e711948d63bd6036c62b24", + "line": 3353 + }, + "published": "2026-09-23T16:09:36Z", + "slice": "lc", + "title": "Beyond the Context Window: An Adaptive Entropy-Based Routing Framework for Hybrid Retrieval and Long-Context Language Models", + "updated": "2026-09-23T16:09:36Z" + }, + { + "abstract_chars": 1482, + "arxiv_id": "2609.29370v1", + "authors": [ + "Carolyn Cole", + "Matthias Deschryvere", + "Toqeer Ehsan", + "Arash Hajikhani" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "10.1007/978-981-92-2480-7_20", + "n_authors": 4, + "node": "2609.29370", + "primary_category": "", + "proof": { + "block_bytes": 2634, + "block_sha256": "20b60742e003f8f0d61b0bb3fff490e0b2705645a1b6c5d0b4862f16a40049f4", + "line": 3326 + }, + "published": "2026-09-24T10:49:37Z", + "slice": "lc", + "title": "From Policy Documents to Structured Survey Responses: Evaluating Large Language Models for Policy Monitoring", + "updated": "2026-09-24T10:49:37Z" + }, + { + "abstract_chars": 1095, + "arxiv_id": "2609.29828v1", + "authors": [ + "Amit Nautiyal", + "Ayush Bhatt", + "Gaurav Nautiyal" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2609.29828", + "primary_category": "", + "proof": { + "block_bytes": 1962, + "block_sha256": "e4b46501cb32d399f44868bed369569d639ed41ec9992ee8188622da8593d8cd", + "line": 3305 + }, + "published": "2026-09-24T13:59:51Z", + "slice": "lc", + "title": "ChunkRank: Model-Aware Text Chunking and Abstention-Aware Answer Selection for LLM Pipelines", + "updated": "2026-09-24T13:59:51Z" + }, + { + "abstract_chars": 1626, + "arxiv_id": "2609.31261v1", + "authors": [ + "Michele Paolicelli", + "Alessandro Petruzzelli", + "Alessandro Franceso Maria Martina", + "Cataldo Musto", + "Giovanni Semeraro" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2609.31261", + "primary_category": "", + "proof": { + "block_bytes": 2640, + "block_sha256": "bd60f5ae66ffe87b6b3421a58d7ed42077f810a4c56fe805fe00189a6ca092b8", + "line": 3278 + }, + "published": "2026-09-25T13:38:28Z", + "slice": "lc", + "title": "MoSAR: Mixture of Semantic Attention Regimes for Learning Adaptive and Approximable Attention Geometries", + "updated": "2026-09-25T13:38:28Z" + }, + { + "abstract_chars": 1335, + "arxiv_id": "2609.31382v1", + "authors": [ + "Zhaoyuan Xia", + "Qinghongbing Xie", + "Yung Xiang Hue", + "Jianguang Jiang", + "Gaofeng Lu", + "Zhenyu Jiao", + "Xing Yuan", + "Dai Dai", + "Tong Mo", + "Long Zeng" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 10, + "node": "2609.31382", + "primary_category": "", + "proof": { + "block_bytes": 3475, + "block_sha256": "496806caf8351024be8a49fda66fa877bfbcc87f5be3ae5fdd3fe90d400fb2fb", + "line": 3224 + }, + "published": "2026-09-25T15:16:35Z", + "slice": "lc", + "title": "Highlight-Then-Summarize: Learning to Compress Evidence for Long-Context Understanding", + "updated": "2026-09-25T15:16:35Z" + }, + { + "abstract_chars": 1737, + "arxiv_id": "2609.32474v1", + "authors": [ + "Ziyi Zhang", + "Shuang Cui", + "Haotian Zhang", + "Xiaoyu Wang" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2609.32474", + "primary_category": "", + "proof": { + "block_bytes": 2554, + "block_sha256": "469d84ef3dc6bd616719d4c06f5d4f86f5ef72c085193ed94348207b54dbbccc", + "line": 3201 + }, + "published": "2026-09-26T11:07:23Z", + "slice": "lc", + "title": "PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization", + "updated": "2026-09-26T11:07:23Z" + }, + { + "abstract_chars": 1321, + "arxiv_id": "2609.32663v1", + "authors": [ + "Xianpeng Shang", + "Canbin Huang", + "Jiang Li", + "Tian Lan", + "Qianyi Cai", + "Xiaojun Quan", + "Xiangdong Su" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 7, + "node": "2609.32663", + "primary_category": "", + "proof": { + "block_bytes": 2442, + "block_sha256": "fd267f7408154f257d1e9965a58727ff593491c0cc3f839a1b71f695c204c6ec", + "line": 3167 + }, + "published": "2026-09-26T14:20:58Z", + "slice": "lc", + "title": "Distance-KV: Exploiting Relative Distance for Efficient Long-Context Inference", + "updated": "2026-09-26T14:20:58Z" + }, + { + "abstract_chars": 1919, + "arxiv_id": "2609.32712v1", + "authors": [ + "Jingze Shi", + "Zhangyang Peng", + "Xianduo Li", + "Yanlin Qi", + "Xiaotian Lin", + "Haoxian Chen", + "Liangdong Wang", + "Guang Liu", + "Yuyu Luo" + ], + "categories": [ + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 9, + "node": "2609.32712", + "primary_category": "", + "proof": { + "block_bytes": 3071, + "block_sha256": "1da63cdefd373033a63626e7d0fd34de4ee137bc8f36fb74a016808b9c1551d7", + "line": 3128 + }, + "published": "2026-09-26T15:24:45Z", + "slice": "lc", + "title": "MassAlloc Attention: Let Attention Allocate Its Own Compute", + "updated": "2026-09-26T15:24:45Z" + }, + { + "abstract_chars": 1387, + "arxiv_id": "2609.32809v1", + "authors": [ + "Yu-Chi Lin", + "Aryan Seth", + "Anshul Aravind", + "Eugene Lee", + "Tanmay Parekh", + "Nanyun Peng", + "Kai-Wei Chang" + ], + "categories": [ + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 7, + "node": "2609.32809", + "primary_category": "", + "proof": { + "block_bytes": 2558, + "block_sha256": "96df2e27eb1e65b0c353f610e13261fd77bc45e84eca4912a8533ccdf4909129", + "line": 3094 + }, + "published": "2026-09-26T17:33:04Z", + "slice": "lc", + "title": "Overwhelmed by Choice: Studying LLM Decision Making at Scale", + "updated": "2026-09-26T17:33:04Z" + }, + { + "abstract_chars": 1343, + "arxiv_id": "2609.33465v3", + "authors": [ + "Yunao Zheng", + "Bin Wen", + "Xiaojie Wang", + "Kaiyu Jiang", + "Xuanyu Zheng", + "Changyi Liu", + "Hongyi Fu", + "Jianxiong Wang", + "Tianke Zhang", + "Haonan Fan", + "Yingxin Li", + "Jiankang Chen", + "Xu Wang", + "Tingting Gao", + "Han Li" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 15, + "node": "2609.33465", + "primary_category": "", + "proof": { + "block_bytes": 2766, + "block_sha256": "7b12459aeaa474a03f99c6e763be858367e08581173da71f03efbd93ab12c21d", + "line": 3038 + }, + "published": "2026-09-27T11:19:21Z", + "slice": "lc", + "title": "GSM: Efficient Language Modeling with Shared Global State", + "updated": "2026-10-15T03:28:02Z" + }, + { + "abstract_chars": 1322, + "arxiv_id": "2609.33485v1", + "authors": [ + "Guanzheng Chen", + "Viet Dac Lai", + "Subhojyoti Mukherjee", + "Branislav Kveton", + "Seunghyun Yoon", + "Franck Dernoncourt", + "Qizhe Xie", + "Trung Bui" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 8, + "node": "2609.33485", + "primary_category": "", + "proof": { + "block_bytes": 2393, + "block_sha256": "61647852e651aee40e03d510b8f3f82fd3ed030828278ca937fdf73c97771695", + "line": 3003 + }, + "published": "2026-09-27T11:52:58Z", + "slice": "lc", + "title": "DISCO: Distributed Long Context Scaling with Grounding-Reasoning Disaggregation", + "updated": "2026-09-27T11:52:58Z" + }, + { + "abstract_chars": 1801, + "arxiv_id": "2609.33642v1", + "authors": [ + "Haoyi Wu", + "Yang Xiao", + "Yusong Sun", + "Wenyang Hui", + "Zhaokai Luo", + "Chengyue Jiang", + "Mu Chuan" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2609.33642", + "primary_category": "", + "proof": { + "block_bytes": 2921, + "block_sha256": "24d05e896139f196f5d76829e8aacefdb3781cb97c9f0812c73d7d1d55f37081", + "line": 2969 + }, + "published": "2026-09-27T15:05:22Z", + "slice": "lc", + "title": "Learning to Learn from Context: Synthetic Training from Perturbed Public Documents", + "updated": "2026-09-27T15:05:22Z" + }, + { + "abstract_chars": 1660, + "arxiv_id": "2609.33889v1", + "authors": [ + "Jungseob Lee", + "Seungyoon Lee", + "Seongtae Hong", + "Sugyeong Eo", + "Heuiseok Lim" + ], + "categories": [ + "cs.LG", + "cs.CL", + "cs.PF" + ], + "doi": "", + "n_authors": 5, + "node": "2609.33889", + "primary_category": "", + "proof": { + "block_bytes": 2731, + "block_sha256": "bde73ff12c819ccc0299b8edcecca9620b4263cfd47ad8174ef27fb98d7202dd", + "line": 2940 + }, + "published": "2026-09-27T20:11:05Z", + "slice": "lc", + "title": "Where Activation Sparsity and KV-Cache Sparsity Cross in LLM Decoding", + "updated": "2026-09-27T20:11:05Z" + }, + { + "abstract_chars": 1383, + "arxiv_id": "2609.34385v1", + "authors": [ + "Bingyu Yan", + "Chaofan Li", + "Hongjin Qian", + "Shuqi Lu", + "Chaozhuo Li", + "Zheng Liu" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.IR", + "cs.LG" + ], + "doi": "", + "n_authors": 6, + "node": "2609.34385", + "primary_category": "", + "proof": { + "block_bytes": 2488, + "block_sha256": "4a4281b530798d7ca3797e4e7bb1cf164e006b9714b3ff58a39f66c519ac8b81", + "line": 2908 + }, + "published": "2026-09-28T06:01:09Z", + "slice": "lc", + "title": "Just-In-Time Agent Memory with Runtime Agentic Research", + "updated": "2026-09-28T06:01:09Z" + }, + { + "abstract_chars": 1569, + "arxiv_id": "2609.35664v2", + "authors": [ + "Prasoon Dev", + "Anirudh Sankar", + "Vasudeva Varma" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 3, + "node": "2609.35664", + "primary_category": "", + "proof": { + "block_bytes": 2437, + "block_sha256": "07e1ab5440937a49ad27ce2ff4feffb4f46467e8a34264f540884d3e88960931", + "line": 2887 + }, + "published": "2026-09-28T17:23:45Z", + "slice": "lc", + "title": "MS-GLA: Multi-Scale Gated Linear Attention for Addressing Representational Bottlenecks via Multi-Temporal Resolution", + "updated": "2026-10-09T00:44:36Z" + }, + { + "abstract_chars": 1598, + "arxiv_id": "2609.36218v1", + "authors": [ + "Mir Tafseer Nayeem", + "Susmoy Chakraborty", + "Davood Rafiei" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.ET", + "cs.LG" + ], + "doi": "", + "n_authors": 3, + "node": "2609.36218", + "primary_category": "", + "proof": { + "block_bytes": 2653, + "block_sha256": "6de2ffee82b2971d860ec2d89d905fb06413f270bd15bd252d7633277932865f", + "line": 2863 + }, + "published": "2026-09-28T20:16:09Z", + "slice": "lc", + "title": "CineSubBench: Evaluating LLMs on Long-Form Narrative and Cultural Understanding from Multilingual Movie Subtitles", + "updated": "2026-09-28T20:16:09Z" + }, + { + "abstract_chars": 1113, + "arxiv_id": "2609.36314v1", + "authors": [ + "Ivan Kobyzev", + "Abbas Ghaddar", + "Ali Nasiri-Sarvi", + "Lifeng Shang", + "Yufei Cui" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 5, + "node": "2609.36314", + "primary_category": "", + "proof": { + "block_bytes": 2097, + "block_sha256": "c8c96a37c4821cbbd683c73a1733e70acc623a066736f8e5209860210c294e20", + "line": 2835 + }, + "published": "2026-09-28T21:48:14Z", + "slice": "lc", + "title": "Fractional State Space Transition for Long Sequence Modeling", + "updated": "2026-09-28T21:48:14Z" + }, + { + "abstract_chars": 1247, + "arxiv_id": "2609.36529v1", + "authors": [ + "Oliver Sieberling", + "Bharat Runwal", + "David Jin", + "Ryan Chin", + "Rameswar Panda", + "Yoon Kim" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 6, + "node": "2609.36529", + "primary_category": "", + "proof": { + "block_bytes": 2310, + "block_sha256": "a682ecafbe0b40dc8d2c4a5e08526c97aae7f2265de6fe5766d311caa740749f", + "line": 2804 + }, + "published": "2026-09-29T02:20:45Z", + "slice": "lc", + "title": "Triadic Linear Attention: Three-Dimensional Recurrent States for Long-Context Sequence Modeling", + "updated": "2026-09-29T02:20:45Z" + }, + { + "abstract_chars": 771, + "arxiv_id": "2609.36617v3", + "authors": [ + "Sebastian Joseph", + "Zichao Wang", + "Jennifer Healey", + "Alexa Siu", + "Junyi Jessy Li", + "Ani Nenkova" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 6, + "node": "2609.36617", + "primary_category": "", + "proof": { + "block_bytes": 1780, + "block_sha256": "0cc56ca7824a55da8443d44df1915dc6d89bd4065683103875c90d40a583213b", + "line": 2774 + }, + "published": "2026-09-29T03:29:57Z", + "slice": "lc", + "title": "Generating Edit-Inducing Questions for AI Research Manuscripts", + "updated": "2026-10-09T11:46:03Z" + }, + { + "abstract_chars": 1846, + "arxiv_id": "2609.36903v1", + "authors": [ + "Ke Wang", + "Houxing Ren", + "Zimu Lu", + "Yunqiao Yang", + "Zhuofan Zong", + "Mingjie Zhan", + "Hongsheng Li" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.SD" + ], + "doi": "", + "n_authors": 7, + "node": "2609.36903", + "primary_category": "", + "proof": { + "block_bytes": 3025, + "block_sha256": "1fd7670895f2f80248881d55175cb358dd559f282b788cbaee24a5c3c63b5116", + "line": 2739 + }, + "published": "2026-09-29T07:25:29Z", + "slice": "lc", + "title": "MultiTalk: Scaling Full-Duplex Speech Models to Long, Multi-Party, Bilingual Conversation", + "updated": "2026-09-29T07:25:29Z" + }, + { + "abstract_chars": 1504, + "arxiv_id": "2609.36935v2", + "authors": [ + "Jingguang Li", + "Yebo Wu", + "Zuyi Guo", + "Kailang Ma", + "Xianjie Dai", + "Han Zheng", + "Benwang Chen", + "Li Li", + "Can Rong", + "Heye Huang" + ], + "categories": [ + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 10, + "node": "2609.36935", + "primary_category": "", + "proof": { + "block_bytes": 2819, + "block_sha256": "87b0917dca9aa8a7a270eb50474bdc869cfa4caba140ffc2ac6b8bf020461e36", + "line": 2696 + }, + "published": "2026-09-29T07:48:18Z", + "slice": "lc", + "title": "CoEM: Empowering Long-Context Reasoning with Commit-on-Evidence Memory", + "updated": "2026-09-30T09:18:33Z" + }, + { + "abstract_chars": 1260, + "arxiv_id": "2609.37782v1", + "authors": [ + "Zifeng Cheng", + "Jie Zheng", + "Zhiwei Jiang", + "Shuwen Wang", + "Fei Shen", + "Shiping Ge", + "Qing Gu" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 7, + "node": "2609.37782", + "primary_category": "", + "proof": { + "block_bytes": 2259, + "block_sha256": "53a0a34dc8979d4acd7c500d7ef558522bd5122d5b8cc467796bb9f0a6aefc29", + "line": 2664 + }, + "published": "2026-09-29T15:16:48Z", + "slice": "lc", + "title": "Selecting What Matters: Semantic Compression-Guided Selective Pooling for Long-Context Embeddings", + "updated": "2026-09-29T15:16:48Z" + }, + { + "abstract_chars": 1610, + "arxiv_id": "2609.38137v1", + "authors": [ + "Quang Hieu Pham", + "Thuy Duong Nguyen", + "Jocelyn Qiaochu Chen", + "Xi Ye" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2609.38137", + "primary_category": "", + "proof": { + "block_bytes": 2444, + "block_sha256": "a6cd77e054b1574818d3d32b0632b13b907e4a21fab89a145ffe73ae3d43819f", + "line": 2641 + }, + "published": "2026-09-29T17:55:07Z", + "slice": "lc", + "title": "LongHarness Bench: Stress-Testing Language Model Harnesses for Long-Context Reasoning", + "updated": "2026-09-29T17:55:07Z" + }, + { + "abstract_chars": 1188, + "arxiv_id": "2609.38530v1", + "authors": [ + "Eric Enouen", + "Sainyam Galhotra" + ], + "categories": [ + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2609.38530", + "primary_category": "", + "proof": { + "block_bytes": 1960, + "block_sha256": "c9337526fa9b5cbee81d6108cd6915ce2c77e1410dd455fd239800e2d4b43e59", + "line": 2623 + }, + "published": "2026-09-29T20:50:00Z", + "slice": "lc", + "title": "Shifting Mechanisms: How Positional Encoding Choice Shapes In-Context Retrieval", + "updated": "2026-09-29T20:50:00Z" + }, + { + "abstract_chars": 1600, + "arxiv_id": "2609.38809v1", + "authors": [ + "Naen Xu", + "Wanqing Cui", + "Yibo Hu", + "Shixin Hong", + "Hengyu An", + "Meiguang Jin", + "Junfeng Ma", + "Tianyu Du" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 8, + "node": "2609.38809", + "primary_category": "", + "proof": { + "block_bytes": 2748, + "block_sha256": "7f03b413f199057d30c66bcb4da1a1617f1df26ebd7507e470c5a14cf40d0d54", + "line": 2586 + }, + "published": "2026-09-30T02:38:52Z", + "slice": "lc", + "title": "StateTree: Enhancing Long-Term Dialogue Reasoning via Reinforcement Learning", + "updated": "2026-09-30T02:38:52Z" + }, + { + "abstract_chars": 1452, + "arxiv_id": "2609.38832v1", + "authors": [ + "Zizhuo Fu", + "Runsheng Wang", + "Meng Li" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2609.38832", + "primary_category": "", + "proof": { + "block_bytes": 2214, + "block_sha256": "f9f7fc836997b87ca9b2564d785f2a5c298dc185fcf611c4871bd243a502feb7", + "line": 2566 + }, + "published": "2026-09-30T02:53:17Z", + "slice": "lc", + "title": "Scaling Parameter and Context in Attention: Native Sparse Attention from Mixture-of-Head", + "updated": "2026-09-30T02:53:17Z" + }, + { + "abstract_chars": 1395, + "arxiv_id": "2609.38958v1", + "authors": [ + "Liang Twist Shan", + "Tianyu Hu", + "Hao Yan", + "Yiqiao Zhong" + ], + "categories": [ + "cs.AI", + "cs.CL", + "cs.LG", + "stat.AP" + ], + "doi": "", + "n_authors": 4, + "node": "2609.38958", + "primary_category": "", + "proof": { + "block_bytes": 2511, + "block_sha256": "3bec6f20862f84cd4e49b85a5bc7bdb77c2983898624091985dd346db25ec7f2", + "line": 2539 + }, + "published": "2026-09-30T04:27:00Z", + "slice": "lc", + "title": "Targeted Retrieval, Compact Representations: How CoT Reasoning Improves Long-Context Counting", + "updated": "2026-09-30T04:27:00Z" + }, + { + "abstract_chars": 1198, + "arxiv_id": "2609.39740v1", + "authors": [ + "Xiaoqiang Wang", + "Suyuchen Wang", + "Bang Liu" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2609.39740", + "primary_category": "", + "proof": { + "block_bytes": 2032, + "block_sha256": "c84c4276ae19570dd23f330bdbda3d37ccb62261bd5ffeb2ab11bd29291142fc", + "line": 2518 + }, + "published": "2026-09-30T13:42:26Z", + "slice": "lc", + "title": "LatentHarness: Learning Latent Actions for Memory and Reasoning via Counterfactual Policy Distillation", + "updated": "2026-09-30T13:42:26Z" + }, + { + "abstract_chars": 1474, + "arxiv_id": "2609.39819v1", + "authors": [ + "Kaihua Fu", + "Yukun Zhou", + "Chaokun Chang", + "Yinghao Yu", + "Luping Wang", + "Guodong Yang", + "Jiuchen Shi", + "Quan Chen", + "Wei Wang" + ], + "categories": [ + "cs.OS" + ], + "doi": "", + "n_authors": 9, + "node": "2609.39819", + "primary_category": "", + "proof": { + "block_bytes": 2568, + "block_sha256": "8c33568b6abd6d129d1f9d7cc91c0eb77f2c3d6a793cc649cd8059b3d8c9d77c", + "line": 2360 + }, + "published": "2026-09-30T14:22:14Z", + "slice": "lc2", + "title": "Capture the lifecycle: KV Cache management in ReAct Agents with KVTether", + "updated": "2026-09-30T14:22:14Z" + }, + { + "abstract_chars": 1222, + "arxiv_id": "2610.00418v1", + "authors": [ + "Joe McKenna", + "Anastasios Alexandridis", + "Nathan Susanj", + "Jing Liu" + ], + "categories": [ + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2610.00418", + "primary_category": "", + "proof": { + "block_bytes": 2036, + "block_sha256": "82091f434009870b9ab068ad19903f18ab9ff3b32c08f8552b229e38fdf29dfd", + "line": 2337 + }, + "published": "2026-09-30T14:36:50Z", + "slice": "lc2", + "title": "CommunityKV: Efficient Long-Context Decoding via Graph Partitioning", + "updated": "2026-09-30T14:36:50Z" + }, + { + "abstract_chars": 1861, + "arxiv_id": "2609.39929v1", + "authors": [ + "Yuyang Wu", + "Yufeng Du", + "Hao Peng" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2609.39929", + "primary_category": "", + "proof": { + "block_bytes": 2687, + "block_sha256": "1ebf0371b029d3767be74a28204444fed06c3c2aecc8b07680a3b677df746162", + "line": 2497 + }, + "published": "2026-09-30T15:14:39Z", + "slice": "lc", + "title": "RoPE at the End of Its Rope? Theory, Diagnosis, and Mitigation of Long-Context Failures", + "updated": "2026-09-30T15:14:39Z" + }, + { + "abstract_chars": 1233, + "arxiv_id": "2610.00562v1", + "authors": [ + "Taye Akinrele", + "Noorbakhsh Amiri Golilarz", + "Subash Neupane", + "Sudip Mittal", + "Shahram Rahimi" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.00562", + "primary_category": "", + "proof": { + "block_bytes": 2303, + "block_sha256": "2a649816228a0969c5dd1e3060bc9346a527473e217982a18c0971457f9e6cf9", + "line": 2469 + }, + "published": "2026-09-30T18:36:19Z", + "slice": "lc", + "title": "Can LLMs Reason Over Long Horizons? An Empirical Evaluation of Context Strategies for Longitudinal Clinical Reasoning", + "updated": "2026-09-30T18:36:19Z" + }, + { + "abstract_chars": 1328, + "arxiv_id": "2610.00964v2", + "authors": [ + "Chuxuan Hu", + "Hejie Cui", + "Norman Huang", + "Shubham Kumar Bharti", + "Wang-Chiew Tan", + "Sercan \u00d6. Ar\u0131k" + ], + "categories": [ + "cs.IR", + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 6, + "node": "2610.00964", + "primary_category": "", + "proof": { + "block_bytes": 2453, + "block_sha256": "35ba86384ae7f89d1eb111393afce767c1ab854d3f0a798836d4855c6251a09b", + "line": 2436 + }, + "published": "2026-10-01T02:52:24Z", + "slice": "lc", + "title": "RPTune: Learned Context Curation for LLM Catalog Search", + "updated": "2026-10-02T21:04:32Z" + }, + { + "abstract_chars": 1369, + "arxiv_id": "2610.00969v1", + "authors": [ + "Yingzhu Zhao", + "Vlad Pandelea", + "Han Yuan", + "Bo Hu", + "Wuqiong Luo", + "Li Zhang", + "Zheng Ma" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.00969", + "primary_category": "", + "proof": { + "block_bytes": 2445, + "block_sha256": "5eaa55b2afc6fc61f54dd79a14c7bd60b5b8ca5478d2f3d8ebed9f32cff7c2f7", + "line": 2403 + }, + "published": "2026-10-01T02:59:14Z", + "slice": "lc", + "title": "A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models", + "updated": "2026-10-01T02:59:14Z" + }, + { + "abstract_chars": 1690, + "arxiv_id": "2610.00982v1", + "authors": [ + "Xuehui Yu", + "Eason Yu", + "Meiyi Wang", + "Haozhe Du", + "Stefano V. Albrecht", + "Harold Soh" + ], + "categories": [ + "cs.RO", + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.00982", + "primary_category": "", + "proof": { + "block_bytes": 2700, + "block_sha256": "069c8a6b101b2b232dec1b3719ced3382160f2695c717c2ab97c9d6e83dc8956", + "line": 2253 + }, + "published": "2026-10-01T03:18:25Z", + "slice": "lc2", + "title": "Divide-and-Remember: Recursive Action-Relevant Memory for Long-Horizon VLA Policies", + "updated": "2026-10-01T03:18:25Z" + }, + { + "abstract_chars": 1767, + "arxiv_id": "2610.01230v2", + "authors": [ + "Lianjun Liu", + "Tiantian Zheng", + "You Huang", + "Weiqi Yan", + "Mingte Qiu", + "Huazhong Liu", + "Xiaofeng Zhu", + "Yunshan Zhong" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 8, + "node": "2610.01230", + "primary_category": "", + "proof": { + "block_bytes": 2798, + "block_sha256": "d50a42baa673a803a698041ec4a376c66c075704377e02b8ddcb257823bfc9c9", + "line": 2218 + }, + "published": "2026-10-01T07:31:44Z", + "slice": "lc2", + "title": "HHR: Hierarchical Hash Retrieval for Efficient LLM Generation", + "updated": "2026-10-11T08:33:58Z" + }, + { + "abstract_chars": 1401, + "arxiv_id": "2610.02181v1", + "authors": [ + "Haibo Wang", + "Jiteng Mu", + "Jialu Li", + "Jingru Yi", + "Yuanjun Xiong", + "Jianming Zhang", + "Lifu Huang", + "Mingze Xu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.02181", + "primary_category": "", + "proof": { + "block_bytes": 2434, + "block_sha256": "a2f40d060e7818877a5c1d2a49da5933ff57a49050075a915b9355936aebfa8c", + "line": 2183 + }, + "published": "2026-10-01T17:58:16Z", + "slice": "lc2", + "title": "OmniSeek: Native Tool Integration for Multi-turn Audio-Visual Reasoning", + "updated": "2026-10-01T17:58:16Z" + }, + { + "abstract_chars": 531, + "arxiv_id": "2610.02404v1", + "authors": [ + "Bryce Sandlund" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 1, + "node": "2610.02404", + "primary_category": "", + "proof": { + "block_bytes": 1334, + "block_sha256": "03ec8b5648feaa9ca6f6f80514e4ba42c526d24d58409b17c934ebc7a27ad8b0", + "line": 2387 + }, + "published": "2026-10-01T19:32:12Z", + "slice": "lc", + "title": "Trained Agentic Context Management", + "updated": "2026-10-01T19:32:12Z" + }, + { + "abstract_chars": 1221, + "arxiv_id": "2610.02472v1", + "authors": [ + "Chin-Lun Fu", + "Anagha Kulkarni", + "Hong Ni", + "Behrouz Madahian" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 4, + "node": "2610.02472", + "primary_category": "", + "proof": { + "block_bytes": 2188, + "block_sha256": "52b478ba9ad663627e426b71ace7f26775d7fd07b0131164e2711964c5be4087", + "line": 2362 + }, + "published": "2026-10-01T20:51:45Z", + "slice": "lc", + "title": "APDMem: Agent-Controlled Progressive Disclosure for Query-Adaptive Long-Term Memory", + "updated": "2026-10-01T20:51:45Z" + }, + { + "abstract_chars": 1384, + "arxiv_id": "2610.03027v1", + "authors": [ + "Minsoo Cheong", + "Donghyun Son", + "Sungjoo Yoo" + ], + "categories": [ + "cs.LG", + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.03027", + "primary_category": "", + "proof": { + "block_bytes": 2264, + "block_sha256": "289d2ef75de188b59e65bf0f02655fa51f17ed9cf5ee70ac1c1fd5ad55b83455", + "line": 2340 + }, + "published": "2026-10-02T09:04:25Z", + "slice": "lc", + "title": "Tailoring the Quantization Space for 1-Bit KV Cache Compression", + "updated": "2026-10-02T09:04:25Z" + }, + { + "abstract_chars": 1230, + "arxiv_id": "2610.03198v2", + "authors": [ + "Johannes Wesch", + "Danni Liu", + "Jan Niehues" + ], + "categories": [ + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.03198", + "primary_category": "", + "proof": { + "block_bytes": 2009, + "block_sha256": "3737f8178fa6856aa2e94ef3b6b4b6409821b66c123fc0827be6b398be1e8497", + "line": 2319 + }, + "published": "2026-10-02T12:11:35Z", + "slice": "lc", + "title": "KV$^2$: A Self-Refining KV Cache", + "updated": "2026-10-15T11:16:05Z" + }, + { + "abstract_chars": 1472, + "arxiv_id": "2610.04118v1", + "authors": [ + "Xinyi Liu", + "Rinat Khaziev", + "Dilek Hakkani-T\u00fcr", + "Tarek F. Abdelzaher" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2610.04118", + "primary_category": "", + "proof": { + "block_bytes": 2372, + "block_sha256": "f20f0937a6cd7e41cfa1e0f10301d520fd5594b4e2d513d061f68dd9ac0f6d52", + "line": 2295 + }, + "published": "2026-10-02T22:47:29Z", + "slice": "lc", + "title": "LongSocialBench: Do Long-Context LLMs Understand Online Discussion Threads?", + "updated": "2026-10-02T22:47:29Z" + }, + { + "abstract_chars": 1333, + "arxiv_id": "2610.06927v1", + "authors": [ + "Sara Abdali", + "Jongwoo Ko", + "Pashmina Cameron" + ], + "categories": [ + "cs.LG", + "cs.AI" + ], + "doi": "", + "n_authors": 3, + "node": "2610.06927", + "primary_category": "", + "proof": { + "block_bytes": 2160, + "block_sha256": "7b1d62becc788faa605cccc723b1a40a4d1247379de1e711b51ec879a78a607e", + "line": 2100 + }, + "published": "2026-10-03T00:33:53Z", + "slice": "lc2", + "title": "AttSVD:Prompt-Adaptive Low-Rank KV Cache Compression via Attention-Guided SVD", + "updated": "2026-10-03T00:33:53Z" + }, + { + "abstract_chars": 1269, + "arxiv_id": "2610.06963v1", + "authors": [ + "Guancheng Du", + "Luotian Huang", + "Shaowen Wang", + "Si Li", + "Kaifeng Lyu" + ], + "categories": [ + "cs.CL", + "cs.SD" + ], + "doi": "", + "n_authors": 5, + "node": "2610.06963", + "primary_category": "", + "proof": { + "block_bytes": 2178, + "block_sha256": "e138b6d41c7f25168af2c47d8c747e586aa0d5c5153624bf828ab88d7a6154b0", + "line": 2268 + }, + "published": "2026-10-03T17:01:53Z", + "slice": "lc", + "title": "WavePrune: One period is often enough for RoPE", + "updated": "2026-10-03T17:01:53Z" + }, + { + "abstract_chars": 1479, + "arxiv_id": "2610.04753v2", + "authors": [ + "Noam Elata", + "Itay Lamprecht", + "Mikey Shechter", + "Daniel Ohayon", + "Itay Hubara", + "Daniel Soudry" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.04753", + "primary_category": "", + "proof": { + "block_bytes": 2539, + "block_sha256": "e97c13a51e87fc4cdc91e630d46a32625e23eda109a060f14db5d1ff2a31c031", + "line": 2237 + }, + "published": "2026-10-03T20:38:43Z", + "slice": "lc", + "title": "More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding", + "updated": "2026-10-06T03:33:53Z" + }, + { + "abstract_chars": 1412, + "arxiv_id": "2610.04973v1", + "authors": [ + "Miao Peng", + "Qintong Zhang", + "Nuo Chen", + "Yuhan Li", + "Guochen Yan", + "Xinran Gu", + "Hongqiu Wu", + "Hai Wang", + "Lydell Huang", + "Wentao Zhang", + "Jia Li" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 11, + "node": "2610.04973", + "primary_category": "", + "proof": { + "block_bytes": 2615, + "block_sha256": "a770edcfe9f498b25b3eb68d2af1a76084e1aa09d9d4d53a6dde72990cd56048", + "line": 2193 + }, + "published": "2026-10-04T05:42:22Z", + "slice": "lc", + "title": "TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training", + "updated": "2026-10-04T05:42:22Z" + }, + { + "abstract_chars": 1705, + "arxiv_id": "2610.05842v1", + "authors": [ + "Zhuokun Chen", + "Xi Lin", + "Xiyu Wu", + "Jiahao He", + "Jianfei Cai", + "Bohan Zhuang" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 6, + "node": "2610.05842", + "primary_category": "", + "proof": { + "block_bytes": 2617, + "block_sha256": "38fd5727aa3fac13d0686ddb56595f0b60ccbdf17d42fe4610516b17773b91b1", + "line": 2164 + }, + "published": "2026-10-05T05:49:31Z", + "slice": "lc", + "title": "HLA: Expressive Hybrid Linear Attention via Chunk-Wise Dynamic Mixing", + "updated": "2026-10-05T05:49:31Z" + }, + { + "abstract_chars": 1326, + "arxiv_id": "2610.05940v1", + "authors": [ + "Li Yiheng", + "He Xu", + "Wang Shaobo", + "Shao Ling", + "Lu Shijian" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.05940", + "primary_category": "", + "proof": { + "block_bytes": 2241, + "block_sha256": "056314a298df366622d46e9f0c50747fede0de7f33e808f365262d9ba6f97811", + "line": 1998 + }, + "published": "2026-10-05T07:56:41Z", + "slice": "lc2", + "title": "ReMem: Streaming Video Understanding With Long Context Retention", + "updated": "2026-10-05T07:56:41Z" + }, + { + "abstract_chars": 1516, + "arxiv_id": "2610.06069v1", + "authors": [ + "Akshit Anchan", + "Nayonika Sen" + ], + "categories": [ + "cs.MA", + "cs.AI", + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.06069", + "primary_category": "", + "proof": { + "block_bytes": 2549, + "block_sha256": "fa2c9b12fe5e59e93b681c65ee696127a4d4e4d49bb8acb7c44e5111faf3f0aa", + "line": 2143 + }, + "published": "2026-10-05T10:04:20Z", + "slice": "lc", + "title": "Attention Tax, Handoff Tax: A Stylised Model of When Multi-Agent LLM Systems Help", + "updated": "2026-10-05T10:04:20Z" + }, + { + "abstract_chars": 1219, + "arxiv_id": "2610.06286v1", + "authors": [ + "Zhe Wang", + "Jiakai Li", + "Yujia Sun", + "Rongzheng Wang", + "Shuang Liang" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 5, + "node": "2610.06286", + "primary_category": "", + "proof": { + "block_bytes": 2079, + "block_sha256": "160e714423387d8175277fb9fb40e49daf70f1ff0eb58b11089a05d116f5d060", + "line": 2117 + }, + "published": "2026-10-05T13:13:14Z", + "slice": "lc", + "title": "DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression", + "updated": "2026-10-05T13:13:14Z" + }, + { + "abstract_chars": 1261, + "arxiv_id": "2610.06479v1", + "authors": [ + "Doo Hwan Hwang", + "Junyoung Jang", + "Junho Na", + "Hosung Lim", + "Kee-Eung Kim" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 5, + "node": "2610.06479", + "primary_category": "", + "proof": { + "block_bytes": 2177, + "block_sha256": "97ad6c9e8e332435617a6b7aec4690f7306a6f4e6519b6e5ad7678ce34693840", + "line": 2090 + }, + "published": "2026-10-05T15:06:18Z", + "slice": "lc", + "title": "Behavior-Preserving KV Cache Compression", + "updated": "2026-10-05T15:06:18Z" + }, + { + "abstract_chars": 1423, + "arxiv_id": "2610.06686v1", + "authors": [ + "Ashkan Shahbazi", + "Chayne Thrash", + "Soheil Kolouri" + ], + "categories": [ + "cs.LG" + ], + "doi": "", + "n_authors": 3, + "node": "2610.06686", + "primary_category": "", + "proof": { + "block_bytes": 2168, + "block_sha256": "09e6d78a58fe2bfc2433fabc9167d1e01e4a561972ebef6ace996e993cff6173", + "line": 1978 + }, + "published": "2026-10-05T16:51:21Z", + "slice": "lc2", + "title": "OVAL: Output-Aware Local Page Bases for KV Cache Retrieval", + "updated": "2026-10-05T16:51:21Z" + }, + { + "abstract_chars": 1916, + "arxiv_id": "2610.06750v1", + "authors": [ + "Hyunji Lee", + "Joykirat Singh", + "Zaid Khan", + "Justin Chih-Yao Chen", + "Elias Stengel-Eskin", + "Alessandro Sordoni", + "Arman Cohan", + "Mohit Bansal" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 8, + "node": "2610.06750", + "primary_category": "", + "proof": { + "block_bytes": 3157, + "block_sha256": "9b621d4d2dc78d018e936be4439b947345504f2b45ba9045e84b0535de717622", + "line": 2053 + }, + "published": "2026-10-05T17:27:30Z", + "slice": "lc", + "title": "Balancing Memory Pathways: Analyzing and Improving Memory Utilization in Hybrid LMs", + "updated": "2026-10-05T17:27:30Z" + }, + { + "abstract_chars": 1845, + "arxiv_id": "2610.07261v1", + "authors": [ + "Sumanyu Muku" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 1, + "node": "2610.07261", + "primary_category": "", + "proof": { + "block_bytes": 2494, + "block_sha256": "f47606e28cc508c4c82c05d7a18c3fc563d863059939fd80020ef4b0b413b5d2", + "line": 1964 + }, + "published": "2026-10-05T19:02:27Z", + "slice": "lc2", + "title": "Verifying Coordination in Parallel Coding Agents: NP-Bench and a Scheduling Planner", + "updated": "2026-10-05T19:02:27Z" + }, + { + "abstract_chars": 1273, + "arxiv_id": "2610.07782v1", + "authors": [ + "Hochan Son", + "Kyungdoe Han", + "Jaehan Koh", + "Xiaowu Dai", + "Wenlu Xu", + "Guang Cheng" + ], + "categories": [ + "cs.AI", + "cs.CL", + "cs.DC", + "cs.LG" + ], + "doi": "", + "n_authors": 6, + "node": "2610.07782", + "primary_category": "", + "proof": { + "block_bytes": 2557, + "block_sha256": "fe83e9085bd353c6203b3b5a16222c9ebc6b4d6d2d9edc60c0d922b6378aa9d5", + "line": 2020 + }, + "published": "2026-10-06T05:17:44Z", + "slice": "lc", + "title": "Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell", + "updated": "2026-10-06T05:17:44Z" + }, + { + "abstract_chars": 1177, + "arxiv_id": "2610.07940v1", + "authors": [ + "Yuhan Chen", + "Siyuan Zhang", + "Nan Wang", + "Feiyang Kang", + "Ruoxi Jia" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.07940", + "primary_category": "", + "proof": { + "block_bytes": 2085, + "block_sha256": "02a5aae0c81b66c7b9855a4f409352075a7d2cee330ad1c381f9356c54842656", + "line": 1993 + }, + "published": "2026-10-06T08:14:07Z", + "slice": "lc", + "title": "Hybrid Latent Attention for Looped Language Models", + "updated": "2026-10-06T08:14:07Z" + }, + { + "abstract_chars": 1447, + "arxiv_id": "2610.08463v1", + "authors": [ + "Edan Kinderman", + "Elad Hoffer", + "Yochai Blau", + "Brian Chmiel", + "Ron Banner", + "Daniel Soudry", + "Boris Ginsburg" + ], + "categories": [ + "cs.CL", + "cs.IR", + "cs.LG" + ], + "doi": "", + "n_authors": 7, + "node": "2610.08463", + "primary_category": "", + "proof": { + "block_bytes": 2564, + "block_sha256": "34d7b987fab44790f5b55cefae2092ed2656696446637f7f5f2c550cee476cfa", + "line": 1959 + }, + "published": "2026-10-06T14:48:53Z", + "slice": "lc", + "title": "UNREAL: Unifying Retrieval and Long-Context with a Single Model", + "updated": "2026-10-06T14:48:53Z" + }, + { + "abstract_chars": 881, + "arxiv_id": "2610.09025v2", + "authors": [ + "Yao Fu", + "Jiahan Chang", + "Ritchie Zhao", + "Bryce Long", + "Yueying Li", + "Mahdi Kamani", + "Samkit Jain", + "Rahul Raman", + "Tara Safavi", + "Shreya Gupta", + "Parsa Ashrafi Fashi", + "Minseok Lee", + "Julien Demouth", + "Bita Darvish Rouhani" + ], + "categories": [ + "cs.LG" + ], + "doi": "", + "n_authors": 14, + "node": "2610.09025", + "primary_category": "", + "proof": { + "block_bytes": 2349, + "block_sha256": "32171f3e9afceeae4d2a863e853b88e381d916ad0b24cc9397907c2d1318981f", + "line": 1850 + }, + "published": "2026-10-06T19:23:10Z", + "slice": "lc2", + "title": "SPIN: Shadow Predictive Indexer for Sparse Attention", + "updated": "2026-10-08T14:38:08Z" + }, + { + "abstract_chars": 1032, + "arxiv_id": "2610.09193v1", + "authors": [ + "Egor Pakhomov", + "Erik Nijkamp" + ], + "categories": [ + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 2, + "node": "2610.09193", + "primary_category": "", + "proof": { + "block_bytes": 1995, + "block_sha256": "afe27004747cecec0da7fb39b9702bb763576af49fd80fe385a0d2325da98572", + "line": 1940 + }, + "published": "2026-10-06T22:44:32Z", + "slice": "lc", + "title": "Bookkeeping, Composition, or Unreachable Gold? Reading MemoryAgentBench's Conflict-Resolution Scores Against a Frozen Last-Write Resolver", + "updated": "2026-10-06T22:44:32Z" + }, + { + "abstract_chars": 1452, + "arxiv_id": "2610.09827v1", + "authors": [ + "Sunjoo Whang", + "Jungjun Oh", + "Minsung Kim", + "Dongho Seo", + "Jisu Shin", + "Gregory Kielian", + "Hoi-Jun Yoo", + "Sangjin Kim" + ], + "categories": [ + "cs.LG" + ], + "doi": "", + "n_authors": 8, + "node": "2610.09827", + "primary_category": "", + "proof": { + "block_bytes": 2486, + "block_sha256": "41bc1a20ced370250937b23740aea64659ec8a20e90020886550579f86b7bc70", + "line": 1796 + }, + "published": "2026-10-07T10:50:06Z", + "slice": "lc2", + "title": "Dual-QK: Sharp Queries and Flat Keys for Prunable 2-bit KV Caches", + "updated": "2026-10-07T10:50:06Z" + }, + { + "abstract_chars": 1327, + "arxiv_id": "2610.10114v1", + "authors": [ + "Xiaoran Liu", + "Ziwei He", + "Xipeng Qiu" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.10114", + "primary_category": "", + "proof": { + "block_bytes": 2172, + "block_sha256": "ff502f3241779abfde1eecfee4b1c7f47c28c7244080ca207721f1de98b461cb", + "line": 1919 + }, + "published": "2026-10-07T14:02:35Z", + "slice": "lc", + "title": "Mechanics of Long-Context Hybrid Models Part 1.1: From Hybrid Attention to Hybrid Position", + "updated": "2026-10-07T14:02:35Z" + }, + { + "abstract_chars": 1887, + "arxiv_id": "2610.10156v1", + "authors": [ + "Leon Mayer", + "Lucas Luttner", + "Patrick Godau", + "Kai Fritzsche", + "Annika Reinke", + "Leonie Boland", + "Jule Brandt", + "Janne Heinecke", + "Chloe K. Nobuhara", + "Niklas Holzwarth", + "Evangelia Christodoulou", + "Marcel Knopp", + "Dominik Michael", + "Pascale Piermarco", + "Saliq Neyaz", + "Korhan Derin \u00d6zarslan", + "Jakob Hennighausen", + "Carlos Aumente-Maestro", + "Tim R\u00e4dsch", + "Dheeraj Baji", + "Peter Maximilian Full", + "Finn Aichholz", + "Justus Veit Erpenbeck", + "Linus Finn Schott", + "Bastian Winkelhausen", + "Claas de Boer", + "Bianca G\u00fcttner", + "Anneli Hummel", + "Gregor Just", + "Max Kirchner", + "Chenyang Li", + "Rozenn Raffaut", + "Ariel Rodriguez", + "Danush Kumar Venkatesh", + "Kevin Wang", + "Jinjing Xu", + "Mona Sheikh Zeinoddin", + "Salman Khan", + "Thomas M. Pausch", + "Stefanie Speidel", + "Danail Stoyanov", + "Daniel A. Hashimoto", + "Fiona R. Kolbinger", + "Thomas G. Weiser", + "Lena Maier-Hein" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 45, + "node": "2610.10156", + "primary_category": "", + "proof": { + "block_bytes": 5379, + "block_sha256": "da7c145102e54d0b492a51fa24efda383e4649ed26690a03716d88e447fa7913", + "line": 1649 + }, + "published": "2026-10-07T14:33:47Z", + "slice": "lc2", + "title": "HeiCo-FOCUS: A Clinically Grounded Dataset for Long-Context Video Understanding", + "updated": "2026-10-07T14:33:47Z" + }, + { + "abstract_chars": 1455, + "arxiv_id": "2610.10845v1", + "authors": [ + "Sietse Schelpe" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.DC", + "cs.LG" + ], + "doi": "", + "n_authors": 1, + "node": "2610.10845", + "primary_category": "", + "proof": { + "block_bytes": 2321, + "block_sha256": "898e32b851020f78f696cf884d282dfc10630c953f46b530ef2ec0c293b3afc8", + "line": 1902 + }, + "published": "2026-10-07T19:50:53Z", + "slice": "lc", + "title": "Real Long-Term Memory for AI: A 50-Million-Token Window That Is Faster and Cheaper Than Recompute", + "updated": "2026-10-07T19:50:53Z" + }, + { + "abstract_chars": 1573, + "arxiv_id": "2610.10918v1", + "authors": [ + "Hala Almaghout", + "Christian Federmann", + "Qin Gao" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.10918", + "primary_category": "", + "proof": { + "block_bytes": 2419, + "block_sha256": "7fecd487339a08573920024301659ba83c283842207c7b0f9a716c524b470e5d", + "line": 1881 + }, + "published": "2026-10-07T21:17:26Z", + "slice": "lc", + "title": "Large Language Models for Machine Translation Quality Annotation: Humans and Models Are Both Challenged", + "updated": "2026-10-07T21:17:26Z" + }, + { + "abstract_chars": 1755, + "arxiv_id": "2610.11245v1", + "authors": [ + "Siddharth Bhandari", + "Lucas Gretta", + "Krishna Balasubramanian", + "Shiva Kasiviswanathan" + ], + "categories": [ + "cs.LG", + "cs.CL", + "cs.PF" + ], + "doi": "", + "n_authors": 4, + "node": "2610.11245", + "primary_category": "", + "proof": { + "block_bytes": 2785, + "block_sha256": "68e53978d5076c9da3d95dd810aa7208d9e941e5bcbaba7eb72ee8b61ce1aeb6", + "line": 1854 + }, + "published": "2026-10-08T04:47:41Z", + "slice": "lc", + "title": "Read What Matters: Query-Adaptive Quantization for KV Caches", + "updated": "2026-10-08T04:47:41Z" + }, + { + "abstract_chars": 1238, + "arxiv_id": "2610.11430v1", + "authors": [ + "Roshan Balaji", + "Pavan Kumar S", + "Vasudev Gupta", + "Sreejith N", + "Keerthana Sridhar", + "Nirav Bhatt" + ], + "categories": [ + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 6, + "node": "2610.11430", + "primary_category": "", + "proof": { + "block_bytes": 2261, + "block_sha256": "cb661da7c20451f3e0e7141c723ad077eaa04d3c3e9c18d29646e5f5ee2c66ee", + "line": 1824 + }, + "published": "2026-10-08T07:54:12Z", + "slice": "lc", + "title": "BioBigBird: A Sparse Attention Model for Long-Range Dependency Processing in Biomedical Text", + "updated": "2026-10-08T07:54:12Z" + }, + { + "abstract_chars": 741, + "arxiv_id": "2610.11592v1", + "authors": [ + "Hadeel Al-Negheimish", + "Jasna Ilieva", + "Yoon Kim" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.11592", + "primary_category": "", + "proof": { + "block_bytes": 1572, + "block_sha256": "c99102240b89c2894d5fd4e17387651afcb0020d0917a32c0d0ac4d936e657df", + "line": 1803 + }, + "published": "2026-10-08T09:42:07Z", + "slice": "lc", + "title": "Probing for Long-Horizon Deductive Reasoning Capabilities in Language Models with Prolog", + "updated": "2026-10-08T09:42:07Z" + }, + { + "abstract_chars": 988, + "arxiv_id": "2610.12338v1", + "authors": [ + "Neha Verma", + "Sungwon Kim", + "Kenton Murray", + "Kevin Duh" + ], + "categories": [ + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2610.12338", + "primary_category": "", + "proof": { + "block_bytes": 1848, + "block_sha256": "9f139a425083f001b080a9d07fcdf029199da16c39a20e03ff91c799388d6139", + "line": 1779 + }, + "published": "2026-10-08T17:14:28Z", + "slice": "lc", + "title": "VFold: Symmetry-Aware Cross-Layer Value Cache Compression", + "updated": "2026-10-08T17:14:28Z" + }, + { + "abstract_chars": 1461, + "arxiv_id": "2610.13041v1", + "authors": [ + "Ke Wan", + "Chen Chen" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 2, + "node": "2610.13041", + "primary_category": "", + "proof": { + "block_bytes": 2246, + "block_sha256": "0da1a56b789844d66813bd1663cada184bd883acad6764394927bc635a98a931", + "line": 1761 + }, + "published": "2026-10-09T05:57:33Z", + "slice": "lc", + "title": "RAMP: Recurrent Adaptive Mixed Precision for Efficient Prefill in Recurrent-Depth Language Models", + "updated": "2026-10-09T05:57:33Z" + }, + { + "abstract_chars": 1181, + "arxiv_id": "2610.13060v1", + "authors": [ + "Taiga Ikeda", + "Daisuke Miyashita", + "Jun Deguchi" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.13060", + "primary_category": "", + "proof": { + "block_bytes": 1929, + "block_sha256": "0c22cb2653699b8dfeeadb1945b5da7901feec486345ee48f57d015dc3bfdf0c", + "line": 1741 + }, + "published": "2026-10-09T06:17:10Z", + "slice": "lc", + "title": "KV-Repurpose: A Testbed for Evaluating Non-Prefix KV-Cache Reuse", + "updated": "2026-10-09T06:17:10Z" + }, + { + "abstract_chars": 1559, + "arxiv_id": "2610.13132v1", + "authors": [ + "Zhihao Liu", + "Yitian Cheng", + "Shuang Liu", + "Rui Wen", + "Yuke Hu", + "Zhan Qin" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.13132", + "primary_category": "", + "proof": { + "block_bytes": 2469, + "block_sha256": "7321b0bdcb40b9fdc5894b08c8193d1cffcec38a79f6c192090123409526998d", + "line": 1552 + }, + "published": "2026-10-09T07:25:17Z", + "slice": "lc2", + "title": "DP-MIND: Differentially private memory-guided Long context Inference", + "updated": "2026-10-09T07:25:17Z" + }, + { + "abstract_chars": 1714, + "arxiv_id": "2610.13202v1", + "authors": [ + "Yuhang He", + "Hongyu Ge", + "Zihan Lin", + "Siyi Liu", + "Yongqi Zhang" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 5, + "node": "2610.13202", + "primary_category": "", + "proof": { + "block_bytes": 2642, + "block_sha256": "35057e99bad15fe3ef4e57afa427df1e3221f9c53091a55fb5cdfa7af11e3ada", + "line": 1714 + }, + "published": "2026-10-09T08:22:40Z", + "slice": "lc", + "title": "S$^3$R: Fast and Faithful RL Rollouts via Self-Sparse Speculative Decoding", + "updated": "2026-10-09T08:22:40Z" + }, + { + "abstract_chars": 1173, + "arxiv_id": "2610.13314v1", + "authors": [ + "Han Luo", + "Zhan Zhuang", + "Xu He", + "Jujia Zhao", + "Yu Li", + "Suqin Yuan", + "Dong Li", + "Lei Feng" + ], + "categories": [ + "cs.IR" + ], + "doi": "", + "n_authors": 8, + "node": "2610.13314", + "primary_category": "", + "proof": { + "block_bytes": 2171, + "block_sha256": "65431e370d8557ff8cc51ee2b2a50230ffbcaf69533c212ff4193e3b1c345098", + "line": 1517 + }, + "published": "2026-10-09T09:57:27Z", + "slice": "lc2", + "title": "NEAR: Neighborhood-Aware Residuals for Memory Retrieval", + "updated": "2026-10-09T09:57:27Z" + }, + { + "abstract_chars": 1538, + "arxiv_id": "2610.13325v1", + "authors": [ + "Mohammad Siavashi", + "Pascal Schwinte", + "Ali Banaei", + "Gerald Q. Maguire", + "Marco Chiesa", + "Dejan Kosti\u0107" + ], + "categories": [ + "cs.DC", + "cs.CL", + "cs.LG", + "cs.PF" + ], + "doi": "", + "n_authors": 6, + "node": "2610.13325", + "primary_category": "", + "proof": { + "block_bytes": 2668, + "block_sha256": "fb637896d05c3ce6bfc4b2178d903815e21e1285a79048331ec32de3befd1493", + "line": 1682 + }, + "published": "2026-10-09T10:05:09Z", + "slice": "lc", + "title": "Taking Tokenization off the Host for Agentic LLM Serving", + "updated": "2026-10-09T10:05:09Z" + }, + { + "abstract_chars": 1387, + "arxiv_id": "2610.13708v1", + "authors": [ + "Naji Alazhar", + "Wassel Alazhar" + ], + "categories": [ + "cs.AI", + "cs.CL", + "cs.DC", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.13708", + "primary_category": "", + "proof": { + "block_bytes": 2355, + "block_sha256": "c43323a82f57f598a9e9222abbf28544f3722b9d18aac4ea6a8732fb7ba3adca", + "line": 1661 + }, + "published": "2026-10-09T15:02:35Z", + "slice": "lc", + "title": "Adaptive DHiSparse: Speculative Decoding over a Load-Adaptive KV Hierarchy", + "updated": "2026-10-09T15:02:35Z" + }, + { + "abstract_chars": 1403, + "arxiv_id": "2610.14219v1", + "authors": [ + "Zongyue Qin", + "Haoran Deng", + "Jason Cong", + "Yizhou Sun" + ], + "categories": [ + "cs.LG", + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2610.14219", + "primary_category": "", + "proof": { + "block_bytes": 2388, + "block_sha256": "1cd28d3b881afa6cd1ce2619c64ed88fde69f6a41d0b8199198993e02ffdca14", + "line": 1635 + }, + "published": "2026-10-09T18:30:52Z", + "slice": "lc", + "title": "Learnable Low-Rank Polynomial Sketch for Effective Linear Attention", + "updated": "2026-10-09T18:30:52Z" + }, + { + "abstract_chars": 1728, + "arxiv_id": "2610.14475v1", + "authors": [ + "S M Mahbub Murshed", + "Hayden Bright", + "Rezaul Karim", + "Ali Shiri Sichani" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2610.14475", + "primary_category": "", + "proof": { + "block_bytes": 2608, + "block_sha256": "50222751ce08e1bfff74f789c5fde8c0edb766cf11de565d58c98e97fcc74313", + "line": 1612 + }, + "published": "2026-10-10T02:09:08Z", + "slice": "lc", + "title": "EdgeLLM-Nano: Auditing Polar-Guided Key-Cache Compression and Consistency-Anchored Pruning on a 33.6 MB On-Device Language Model", + "updated": "2026-10-10T02:09:08Z" + }, + { + "abstract_chars": 1890, + "arxiv_id": "2610.15371v1", + "authors": [ + "Sutanshu Saksena Raj", + "Prasanjith Pasunuti", + "Parijat Chatterjee", + "Daksh Maan", + "Purusharth Malik", + "Nayanjit Sarkar", + "Avinash Benki" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.15371", + "primary_category": "", + "proof": { + "block_bytes": 3034, + "block_sha256": "c5129ad17ba698c80c446c32ddd6db961a2385b8b8d3866feff238f046b11f3d", + "line": 1575 + }, + "published": "2026-10-11T05:52:29Z", + "slice": "lc", + "title": "A Sovereign, Indic-First, Reasoning Model", + "updated": "2026-10-11T05:52:29Z" + }, + { + "abstract_chars": 969, + "arxiv_id": "2610.15373v1", + "authors": [ + "Avinash Benki", + "Prasanjith Pasunuti", + "Sutanshu Saksena Raj", + "Parijat Chatterjee", + "Nayanjit Sarkar", + "Daksh Maan" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.15373", + "primary_category": "", + "proof": { + "block_bytes": 2093, + "block_sha256": "b6c1af706b58226381a8d4627efcbb33795c485cec0d703a881ce31f5177267a", + "line": 1544 + }, + "published": "2026-10-11T05:53:00Z", + "slice": "lc", + "title": "In-Place Indic Tokenizer Expansion and Continual Pretraining of Nemotron-3-Nano-30B-A3B", + "updated": "2026-10-11T05:53:00Z" + }, + { + "abstract_chars": 1917, + "arxiv_id": "2610.15542v1", + "authors": [ + "Project Apertus", + ":", + "Yixuan Xu", + "Yassine Turki", + "Vinko Sabol\u010dec", + "Valentina Pyatkin", + "Tommy Chu", + "Sven Najem-Meyer", + "Sean F. Carroll", + "Robert Smith", + "Raphael Kreft", + "Oscar Alessandro Tazza", + "Oleg Lavrovsky", + "Nicola Irmiger", + "Matteo Santelmo", + "Marian Schneider", + "Juan Garc\u00eda Giraldo", + "Hanna Yukhymenko", + "Eduard \u010eurech", + "Davit Melikidze", + "Dani Tamayo", + "Bettina Messmer", + "Aryan Ahadinia", + "Anunay Yadav", + "Allen Huang", + "Ahmad Fraij", + "Alessandro Bombarda", + "Alex Padula", + "Alexander H\u00e4gele", + "Alexander Sternfeld", + "Anna Hedstr\u00f6m", + "Anna Kosovskaia", + "Arthur Wuhrmann", + "Arundhati Balasubramaniam", + "Badr Al Mahouri", + "Barna Pasztor", + "Bartosz Szostakiewicz", + "Bich Ngoc Doan", + "Bryan Schmid", + "Burak Sezen", + "Camille Challier", + "Cl\u00e9ment Charmillot", + "Dana Shayakhmetova", + "Daniel Perruchoud", + "David Br\u00fcggemann", + "David Isztl", + "Elia Palme", + "Emma Anastassova", + "Fabian B\u00f6sch", + "Faruk Zahiragi\u0107", + "Fawzi Roberto Mohamed", + "Fiona Panicali", + "Florian Kolly", + "Flynn Guerra", + "Francesco Monti", + "Frederike L\u00fcbeck", + "Gennaro Oliva", + "Haofeng Yang", + "Haoliang Shang", + "Helen El Khoury", + "Henrique Mendon\u00e7a", + "Jannis Vamvas", + "J\u00e9rome Landolt", + "Jessica Lam", + "Jingchun Xiao", + "Jonathan Coles", + "Joshua Oyebanji", + "Khanh Nguyen", + "Konstantinos Pitas", + "Lasse B. Strand", + "Li Mi", + "Lo\u00efc Deslarzes", + "Lorenzo Baggi", + "Lorenzo Noci", + "Luca Baumann", + "Luca Sartori", + "Lukas Drescher", + "Marco De Negri", + "Marco Passerini", + "Mark Klein", + "Marko Stojanovic", + "Martin Majsec", + "Matin Ansaripour", + "Mattea Busato", + "Mauro Pellonara", + "Max Neuwinger", + "Michael Graber", + "Michal Te\u0161nar", + "Michelle Wastl", + "Miguel Gila", + "Mikolaj Boronski", + "Morgane Magnin", + "Moritz Reihs", + "Mukhammadali Sayfiddinov", + "Nathan Ranchin", + "Nicolas Cuveillier", + "Oscar Wohlfahrt", + "Qianqian Zou", + "Rada Kamysheva", + "Rita Sevastjanova", + "Roman Machacek", + "Sebastian Keller", + "Simon Matrenok", + "Simon Pierre", + "Stefano Schuppli", + "Suei-Wen Chen", + "Szabina Horv\u00e1th-Mikulas", + "Taliesin Perez", + "Thilo Spinner", + "Thomas Kleine Buening", + "Tim Robinson", + "Tymoteusz Kwiecinski", + "Vil\u00e9m Zouhar", + "Vinzenz Thoma", + "Xiaozhe Yao", + "Yannick Metz", + "Yuhei Fukuhara", + "Yusif Askari", + "Zixuan Chen", + "Alexander Ilic", + "Ana Klimovic", + "Andreas Krause", + "Andrei Kucharavy", + "Elliott Ash", + "Joost VandeVondele", + "Martin Rajman", + "Mennatallah El-Assady", + "Thomas Schulthess", + "Timo Kehrer", + "Torsten Hoefler", + "Antoine Bosselut", + "Martin Jaggi", + "Imanol Schlag" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 133, + "node": "2610.15542", + "primary_category": "", + "proof": { + "block_bytes": 17778, + "block_sha256": "2d4e8b8ac124a4d253d9fc9c71ef4966cce307bfcdd20b68b75808685809582b", + "line": 1000 + }, + "published": "2026-10-11T11:34:43Z", + "slice": "lc", + "title": "Apertus 1.5: From Open Text Models to Open Multimodal Reasoners", + "updated": "2026-10-11T11:34:43Z" + }, + { + "abstract_chars": 989, + "arxiv_id": "2610.17202v1", + "authors": [ + "Zile Wang", + "Zhide Xie", + "Tao Ji" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.17202", + "primary_category": "", + "proof": { + "block_bytes": 1793, + "block_sha256": "b0ab8f0a619450893e6f43405fe2c63fadefd1e942c30924950cc2117a0445f8", + "line": 979 + }, + "published": "2026-10-12T17:59:10Z", + "slice": "lc", + "title": "MLAfication: Efficiently Enabling High-Fidelity MLA for Modern LLMs", + "updated": "2026-10-12T17:59:10Z" + }, + { + "abstract_chars": 1913, + "arxiv_id": "2610.17959v1", + "authors": [ + "Xibo Ding", + "Guoxia Wang", + "Jinle Zeng", + "Jiabin Yang", + "Sirui Tao", + "Chao Yang", + "Dianhai Yu" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.17959", + "primary_category": "", + "proof": { + "block_bytes": 2993, + "block_sha256": "8b4ebc73607d08706cc5e7af8b6e72726f707cc53f3f129c1b1011e9a7134ce8", + "line": 945 + }, + "published": "2026-10-13T08:39:20Z", + "slice": "lc", + "title": "Virtual Head Attention", + "updated": "2026-10-13T08:39:20Z" + }, + { + "abstract_chars": 1040, + "arxiv_id": "2610.17966v1", + "authors": [ + "Yaoyang Liu", + "Shuwei Shen", + "Jincheng Tang", + "Jinguang Liu", + "Jinbao Xue", + "Hailong Yang", + "Ke Zhang", + "Yinjun Wu" + ], + "categories": [ + "cs.LG", + "cs.AI" + ], + "doi": "", + "n_authors": 8, + "node": "2610.17966", + "primary_category": "", + "proof": { + "block_bytes": 2162, + "block_sha256": "aa1170b19b4359860bbce81607875a023136f9ce259d67d5ba2183583b373a51", + "line": 756 + }, + "published": "2026-10-13T08:42:38Z", + "slice": "lc2", + "title": "BELT : BEhavior-Aligned Low-Rank KV Cache Compression with Learned Top-k Rank Allocation", + "updated": "2026-10-13T08:42:38Z" + }, + { + "abstract_chars": 1491, + "arxiv_id": "2610.18642v1", + "authors": [ + "Yangchengyu Zhou", + "Zhiping Wu", + "Runchang Jiang", + "Dongdong Ren", + "Youfang Han", + "Wei Zhao", + "Dongqi Cai", + "Wenbin Li" + ], + "categories": [ + "cs.LG" + ], + "doi": "", + "n_authors": 8, + "node": "2610.18642", + "primary_category": "", + "proof": { + "block_bytes": 2611, + "block_sha256": "bbbf52a10bd56c13fe9399af002f6c526e6689cefa40afe83fc88610838f427a", + "line": 720 + }, + "published": "2026-10-13T16:10:45Z", + "slice": "lc2", + "title": "MultiAlloc: Budget-Aware Precision Allocation for KV Cache Quantization", + "updated": "2026-10-13T16:10:45Z" + }, + { + "abstract_chars": 1598, + "arxiv_id": "2610.19026v1", + "authors": [ + "Jiwon Song", + "Yoongon Kim", + "Jae-Joon Kim" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.19026", + "primary_category": "", + "proof": { + "block_bytes": 2343, + "block_sha256": "ac28844ee9156767c77865ae1e11c23cd9b8c74d7b8df5efbeac838e79b986e9", + "line": 925 + }, + "published": "2026-10-13T18:18:47Z", + "slice": "lc", + "title": "Joint Subspace Sparse Attention for Efficient Long-Context Decoding", + "updated": "2026-10-13T18:18:47Z" + }, + { + "abstract_chars": 1796, + "arxiv_id": "2610.19210v1", + "authors": [ + "Sarah Pan", + "Ali Behrouz" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 2, + "node": "2610.19210", + "primary_category": "", + "proof": { + "block_bytes": 2560, + "block_sha256": "a8ab05f955c80af03eef10894d65d96ca770d90bc7f7053189774f09a84e3c02", + "line": 907 + }, + "published": "2026-10-13T21:23:58Z", + "slice": "lc", + "title": "Titan-Llama: Retrofitting Pre-trained LLMs with External Neural Memory Modules", + "updated": "2026-10-13T21:23:58Z" + }, + { + "abstract_chars": 775, + "arxiv_id": "2610.19247v1", + "authors": [ + "Nathan Godey", + "Yoav Artzi" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 2, + "node": "2610.19247", + "primary_category": "", + "proof": { + "block_bytes": 1489, + "block_sha256": "4275055939aa759c93f26e4ab8173d7c459ec60989b01b93a3f394c0b0d4563f", + "line": 889 + }, + "published": "2026-10-13T22:03:18Z", + "slice": "lc", + "title": "Copy-Paste Language Models", + "updated": "2026-10-13T22:03:18Z" + }, + { + "abstract_chars": 1205, + "arxiv_id": "2610.19928v1", + "authors": [ + "Jiangcheng Song", + "Haodong Jing", + "Yulin Mu", + "Lesong Tao", + "Jixin Wang", + "Jin Cui", + "Tianjing Ren", + "Runxuan Xie", + "Yongqiang Ma", + "Nanning Zheng" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 10, + "node": "2610.19928", + "primary_category": "", + "proof": { + "block_bytes": 2353, + "block_sha256": "30805ba33e97daf19f779ef87c1ed441f6b21aac2d9bc179f36ace05428ef528", + "line": 848 + }, + "published": "2026-10-14T10:16:13Z", + "slice": "lc", + "title": "MemDuet: Learning Dual-Process Memory for Long-Context Reasoning", + "updated": "2026-10-14T10:16:13Z" + }, + { + "abstract_chars": 1234, + "arxiv_id": "2610.20392v1", + "authors": [ + "Shuxuan Li", + "Jialiang Kang", + "Yanghao Zhou", + "Ziye Zhu", + "Xiao Yang" + ], + "categories": [ + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.20392", + "primary_category": "", + "proof": { + "block_bytes": 2178, + "block_sha256": "15bdaef998307a9c01629b8f9023043d1184e708c888462db26d439fc0db3639", + "line": 821 + }, + "published": "2026-10-14T15:55:10Z", + "slice": "lc", + "title": "FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decoding", + "updated": "2026-10-14T15:55:10Z" + }, + { + "abstract_chars": 1125, + "arxiv_id": "2610.20686v1", + "authors": [ + "Shiyu Ji", + "Peng Ling", + "Chen Lin", + "Shupeng Li", + "Yixuan Wang", + "Qingfu Zhu", + "Wanxiang Che" + ], + "categories": [ + "cs.LG", + "stat.ML" + ], + "doi": "", + "n_authors": 7, + "node": "2610.20686", + "primary_category": "", + "proof": { + "block_bytes": 2190, + "block_sha256": "57378c59b8dae670eb85e741ccbe020fd99b43e35b3d7de401273e1d5c181ccd", + "line": 601 + }, + "published": "2026-10-14T16:46:48Z", + "slice": "lc2", + "title": "RoLaQ: Joint Rotation and Range Calibration for 2-Bit KV Caches in Multi-Head Latent Attention", + "updated": "2026-10-14T16:46:48Z" + }, + { + "abstract_chars": 1379, + "arxiv_id": "2610.20582v1", + "authors": [ + "Yingfa Chen", + "Xingyu Shen", + "Chaojun Xiao", + "Xu Han" + ], + "categories": [ + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2610.20582", + "primary_category": "", + "proof": { + "block_bytes": 2276, + "block_sha256": "d6269c9cfe765ef7e0c67274f0ec45b90a720f42bd14296101979298b124d50c", + "line": 796 + }, + "published": "2026-10-14T17:57:01Z", + "slice": "lc", + "title": "Latent Compaction with Test-Time Training", + "updated": "2026-10-14T17:57:01Z" + }, + { + "abstract_chars": 1366, + "arxiv_id": "2610.21126v1", + "authors": [ + "Wanyang Hong", + "Zhaoning Zhang" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 2, + "node": "2610.21126", + "primary_category": "", + "proof": { + "block_bytes": 2084, + "block_sha256": "67c33042d1afcbd79f697d1580c624b5e775fb0b21f91063c642a4560d3a8719", + "line": 779 + }, + "published": "2026-10-15T02:30:27Z", + "slice": "lc", + "title": "Compression Does Not End at Selection: Post-Selection Positional Geometry for Sparse KV Caches", + "updated": "2026-10-15T02:30:27Z" + }, + { + "abstract_chars": 1310, + "arxiv_id": "2610.21147v2", + "authors": [ + "Bingbing Wang", + "Jingjie Lin", + "Weiming Qiao", + "Jing Li", + "Ruifeng Xu" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.21147", + "primary_category": "", + "proof": { + "block_bytes": 2232, + "block_sha256": "cafe18f1e4ce0f9aac905586ca40f5ba55a88ddd833a8fd48776ce64e2ec469d", + "line": 574 + }, + "published": "2026-10-15T03:02:24Z", + "slice": "lc2", + "title": "All-in-One Memory: Process-Rewarded Reinforcement Learning for Memory Agents", + "updated": "2026-10-16T05:35:53Z" + }, + { + "abstract_chars": 1776, + "arxiv_id": "2610.21165v1", + "authors": [ + "Chaogui Gou" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 1, + "node": "2610.21165", + "primary_category": "", + "proof": { + "block_bytes": 2440, + "block_sha256": "722152e159a53b00f853d953026b2103c2df97706c690a621ba362d9dd1a7659", + "line": 765 + }, + "published": "2026-10-15T03:24:36Z", + "slice": "lc", + "title": "From Long Context to Selective Memory:A Survey of Memory-Centric Compression for Large Language Models", + "updated": "2026-10-15T03:24:36Z" + }, + { + "abstract_chars": 1769, + "arxiv_id": "2610.21375v1", + "authors": [ + "Adibvafa Fallahpour", + "Parsa Idehpour", + "Vignesh Kothapalli", + "Nikita Mounier", + "Shirley Wu", + "Shayan Pardis", + "Jure Leskovec" + ], + "categories": [ + "cs.LG", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.21375", + "primary_category": "", + "proof": { + "block_bytes": 2886, + "block_sha256": "b7cc5bb4ed99e21b1e1be97119c6078971c169aa6fda06f2e1135638de40ed9a", + "line": 526 + }, + "published": "2026-10-15T06:55:55Z", + "slice": "lc2", + "title": "Memorilla: Latent Semantic Memory for LLMs", + "updated": "2026-10-15T06:55:55Z" + }, + { + "abstract_chars": 1608, + "arxiv_id": "2610.22067v1", + "authors": [ + "Shiwen Qin", + "Cameron Barker", + "Henry Gouk", + "Elliot J. Crowley", + "Shay B. Cohen", + "Mirella Lapata", + "Miao Li" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 7, + "node": "2610.22067", + "primary_category": "", + "proof": { + "block_bytes": 2604, + "block_sha256": "7c60d6e9a43b695509ba124f297aa753d3b6522bec53d00698b5d35a74fc3c1a", + "line": 733 + }, + "published": "2026-10-15T15:28:33Z", + "slice": "lc", + "title": "Beyond Context Length: Characterising the Difficulty of Long-Context Reasoning", + "updated": "2026-10-15T15:28:33Z" + }, + { + "abstract_chars": 1471, + "arxiv_id": "2610.22130v1", + "authors": [ + "Aozhong Zhang", + "Selcuk Gurses", + "Yanxia Deng", + "Naigang Wang", + "Chi-Chun Liu", + "Davis Wertheimer", + "Derrick Liu", + "Xin Li", + "Zi Yang", + "Felix X. -F. Ye", + "Penghang Yin" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 11, + "node": "2610.22130", + "primary_category": "", + "proof": { + "block_bytes": 2762, + "block_sha256": "d0f38a612cb8810129fc166bc1630e8790e775fe980979619dd3730164e64500", + "line": 449 + }, + "published": "2026-10-15T16:05:17Z", + "slice": "lc2", + "title": "DropKV: Decoupling Residual-Output Perturbation for Near-Optimal KV-Cache Eviction", + "updated": "2026-10-15T16:05:17Z" + }, + { + "abstract_chars": 1626, + "arxiv_id": "2610.22985v1", + "authors": [ + "Zhenxu Tian", + "Kebin Liu", + "Zhengwu Yang", + "Yi Su", + "Qingqing Dang", + "Yanlin Sha", + "Kaipeng Deng", + "Dianhai Yu", + "Yanjun Ma", + "Juntao Li", + "Min Zhang" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 11, + "node": "2610.22985", + "primary_category": "", + "proof": { + "block_bytes": 2999, + "block_sha256": "f7806ea5f91a16b21edaf28c4078c710c01c765c98b192e5493b2dfa8eda32b2", + "line": 687 + }, + "published": "2026-10-16T06:11:20Z", + "slice": "lc", + "title": "Prism Attention: Proposal-Refined Index Sharing Mechanism for Efficient LLMs Inference", + "updated": "2026-10-16T06:11:20Z" + }, + { + "abstract_chars": 1646, + "arxiv_id": "2610.23167v1", + "authors": [ + "Ziyang Chen", + "Junlong Jia", + "Xing Wu", + "Tinghao Yu", + "Songlin Hu" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.23167", + "primary_category": "", + "proof": { + "block_bytes": 2590, + "block_sha256": "daf97e098e1c0825e39b881802bf59c74d240cde0c77ab3a5319abaf78357193", + "line": 376 + }, + "published": "2026-10-16T09:05:30Z", + "slice": "lc2", + "title": "LongForge: Measuring and Improving Long-Context Instruction Data via Evidence-Assertion Reasoning Graphs", + "updated": "2026-10-16T09:05:30Z" + }, + { + "abstract_chars": 1309, + "arxiv_id": "2610.23250v1", + "authors": [ + "Zhoufeng Xie", + "Guanjun Wu", + "Shuai Zhang", + "Xinggang Wang", + "Wenyu Liu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.23250", + "primary_category": "", + "proof": { + "block_bytes": 2195, + "block_sha256": "268c955c9688fe91d1abc26b79e92ac8ab6a6eeb100f5ccf03c0bce98de6c69b", + "line": 350 + }, + "published": "2026-10-16T10:24:17Z", + "slice": "lc2", + "title": "LonGaussian: Tracking Foundation Priors for Long-Context Feedforward Gaussian Reconstruction", + "updated": "2026-10-16T10:24:17Z" + }, + { + "abstract_chars": 1394, + "arxiv_id": "2610.23787v1", + "authors": [ + "Jiaming Xu", + "Hanzhen Wang", + "Tianlang Zhao", + "Jiewen Xiao", + "Chengze Yuan", + "Jiayi Pan", + "Yongkang Zhou", + "Jiancai Ye", + "Yu Wang", + "Guohao Dai" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 10, + "node": "2610.23787", + "primary_category": "", + "proof": { + "block_bytes": 2585, + "block_sha256": "d3f045b643dbd7f4e4541a8bfc5182afc6a23cbc460a32c1caa1c969eb5ee994", + "line": 645 + }, + "published": "2026-10-16T17:18:54Z", + "slice": "lc", + "title": "DLite: History-free Speculative Decoding for Agentic AI", + "updated": "2026-10-16T17:18:54Z" + }, + { + "abstract_chars": 1621, + "arxiv_id": "2610.24378v1", + "authors": [ + "Shidu Ren", + "Rong-cheng Tu", + "Hang Zhou", + "Xiao Luo" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.24378", + "primary_category": "", + "proof": { + "block_bytes": 2528, + "block_sha256": "0e8c0f18a79340681e03e5cabccf0ac571143c04cec428b245ee8ba25963f06f", + "line": 3406 + }, + "published": "2026-10-17T02:24:19Z", + "slice": "mm", + "title": "PACE-Mem: Prefix-Aware Complementary Evidence for Multimodal Agents", + "updated": "2026-10-17T02:24:19Z" + }, + { + "abstract_chars": 1878, + "arxiv_id": "2610.24379v1", + "authors": [ + "Wonjun Lee", + "Vaidehi Patil", + "Zaid Khan", + "Yue Zhang", + "Hyunji Lee", + "Suhyun Kim", + "Mohit Bansal" + ], + "categories": [ + "cs.CR", + "cs.CL", + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.24379", + "primary_category": "", + "proof": { + "block_bytes": 3087, + "block_sha256": "0235ecd0332cbfce40d09c84182007cd8829477c6a8ad9b6209e0e15c6ffeb21", + "line": 3371 + }, + "published": "2026-10-17T02:26:09Z", + "slice": "mm", + "title": "Defending Against Dormant Poisoning Attacks Across Language and Multimodal Agents", + "updated": "2026-10-17T02:26:09Z" + }, + { + "abstract_chars": 1663, + "arxiv_id": "2610.24395v1", + "authors": [ + "Xinyu Chen", + "Liangjian Wen", + "Jiang Duan", + "Dongkai Wang", + "Yong Dai", + "Jiayu Bai", + "Jianzhuang Liu", + "Zhen Tian", + "Guoping Qiu", + "Zhao Kan" + ], + "categories": [ + "cs.AI", + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 10, + "node": "2610.24395", + "primary_category": "", + "proof": { + "block_bytes": 3030, + "block_sha256": "5f911ffe6987cb493bf06b7333dec259cea848fe5f31764976292b6f54f24e8c", + "line": 3327 + }, + "published": "2026-10-17T02:54:30Z", + "slice": "mm", + "title": "MSCR: Jointly Balancing Utilization Across Modalities and Discovering Synergistic Information", + "updated": "2026-10-17T02:54:30Z" + }, + { + "abstract_chars": 1483, + "arxiv_id": "2610.24452v2", + "authors": [ + "Junsu Kim", + "Naeun Kim", + "Dongyoon Han", + "Seungryul Baek" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 4, + "node": "2610.24452", + "primary_category": "", + "proof": { + "block_bytes": 2505, + "block_sha256": "d3ab7f7e99eb2ceb65a90566206786d18b505b4bafafb9f2f0537ba2d3d53e0f", + "line": 3302 + }, + "published": "2026-10-17T04:43:01Z", + "slice": "mm", + "title": "HumanSkill-4D: Training-Free Language Querying of Animatable Gaussian Avatars in Space and Time", + "updated": "2026-10-20T04:37:26Z" + }, + { + "abstract_chars": 1529, + "arxiv_id": "2610.24537v1", + "authors": [ + "Kerui Chen", + "Jinglu Wang", + "Yun Wang", + "Xinjiang Wang", + "Yan Lu" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.24537", + "primary_category": "", + "proof": { + "block_bytes": 2456, + "block_sha256": "0c88c3928af040eefbea47994a0ed8e417ac0330ffe4f761dc01e4c1213e23d6", + "line": 3275 + }, + "published": "2026-10-17T07:58:29Z", + "slice": "mm", + "title": "Write Once, Query Many: Evolving Compact Reusable Memory for Long Videos", + "updated": "2026-10-17T07:58:29Z" + }, + { + "abstract_chars": 1602, + "arxiv_id": "2610.24771v1", + "authors": [ + "Xuchao Ren", + "Siyuan Feng", + "Jing Huang", + "Yanhua Yao", + "Jing Wang", + "Lingyu Alina Wang", + "Anan Chen", + "Hangjie Yuan", + "Tao Feng", + "Qiong Wu", + "Sai Ma" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 11, + "node": "2610.24771", + "primary_category": "", + "proof": { + "block_bytes": 2879, + "block_sha256": "256e9292d7aa8c9d983d84f2ef2a6c7bc19193a5ad207253a9a95c5757b89d0a", + "line": 3230 + }, + "published": "2026-10-17T16:29:33Z", + "slice": "mm", + "title": "Design Anything, Design at Scale", + "updated": "2026-10-17T16:29:33Z" + }, + { + "abstract_chars": 1353, + "arxiv_id": "2610.24786v1", + "authors": [ + "Benedetta Liberatori", + "Lorenzo Vaquero", + "Elisa Ricci", + "Paolo Rota" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.24786", + "primary_category": "", + "proof": { + "block_bytes": 2213, + "block_sha256": "337a801ab901ed47178853a7bf74fd21a1684f3d533eba1e9b034ecda080ddbd", + "line": 3206 + }, + "published": "2026-10-17T17:24:59Z", + "slice": "mm", + "title": "Video-Language Entailment for Video Similarity Estimation", + "updated": "2026-10-17T17:24:59Z" + }, + { + "abstract_chars": 1705, + "arxiv_id": "2610.24991v1", + "authors": [ + "Runguo Li" + ], + "categories": [ + "cs.LG", + "cs.CL" + ], + "doi": "", + "n_authors": 1, + "node": "2610.24991", + "primary_category": "", + "proof": { + "block_bytes": 2492, + "block_sha256": "be41ff03c0bee3e7db7d71130609ce0959c432099fc879b471c2f2ce79d6266a", + "line": 629 + }, + "published": "2026-10-18T03:50:13Z", + "slice": "lc", + "title": "Certified Sparse Attention via Perturbed Retrieval", + "updated": "2026-10-18T03:50:13Z" + }, + { + "abstract_chars": 1285, + "arxiv_id": "2610.25005v1", + "authors": [ + "Guangzong Si", + "Dong Wang", + "Yifan Yu", + "Miao Liu", + "Panwang Pan", + "Wentao Zhu" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.25005", + "primary_category": "", + "proof": { + "block_bytes": 2355, + "block_sha256": "1dd29bfaa1f6947ad61bf4cd653a3af542ae322448ae890b88382a2df5c61b2e", + "line": 3175 + }, + "published": "2026-10-18T04:19:13Z", + "slice": "mm", + "title": "ReTrace: Visual Backtracking for Efficient Multimodal Large Language Models", + "updated": "2026-10-18T04:19:13Z" + }, + { + "abstract_chars": 1432, + "arxiv_id": "2610.26951v1", + "authors": [ + "Debopriyo Banerjee", + "Owais Aijaz", + "Ahmer Tabassum", + "Zhuohan Xie", + "Preslav Nakov", + "Veselin Stoyanov" + ], + "categories": [ + "cs.CL", + "cs.IR" + ], + "doi": "", + "n_authors": 6, + "node": "2610.26951", + "primary_category": "", + "proof": { + "block_bytes": 2492, + "block_sha256": "b6449d16db472fc35b1207ecb1ed7ef5df317de14bf3e3544edcce29baea4451", + "line": 599 + }, + "published": "2026-10-18T09:10:42Z", + "slice": "lc", + "title": "The Bottleneck Is Retrieval, Not Reading: Diagnosing Evidence-Based Generation with RAG for Long Context Question Answering", + "updated": "2026-10-18T09:10:42Z" + }, + { + "abstract_chars": 1677, + "arxiv_id": "2610.25247v1", + "authors": [ + "Run Shao", + "Zhaoyang Zhang", + "Ziyu Li", + "Linrui Xu", + "Ji Qi", + "Xiu Su", + "Yichao Cao", + "Chao Tao", + "Haifeng Li" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.25247", + "primary_category": "", + "proof": { + "block_bytes": 2735, + "block_sha256": "5ef12907efaf923719d5e3d5cbf91441485c5d306c3bce52f09b027531764516", + "line": 3137 + }, + "published": "2026-10-18T13:06:46Z", + "slice": "mm", + "title": "Visual Scaffolding: Toward Native Multimodal Reasoning", + "updated": "2026-10-18T13:06:46Z" + }, + { + "abstract_chars": 1402, + "arxiv_id": "2610.25404v2", + "authors": [ + "Houyuan Chen", + "Fanzhou Wang", + "Xiangyu Fan", + "Zesong Qiu", + "Yukun Wei", + "Songlin Yang", + "Zhitao Yang", + "Lvmin Zhang", + "Pei Yang", + "Hao Zhao", + "Dahua Lin", + "Lei Yang", + "Anyi Rao" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 13, + "node": "2610.25404", + "primary_category": "", + "proof": { + "block_bytes": 2846, + "block_sha256": "f75b47cbc77c2dbc64f21d91520221164190310e13ec04739acb37e7b370990f", + "line": 3086 + }, + "published": "2026-10-18T17:01:40Z", + "slice": "mm", + "title": "MT Forcing: Towards Stable and Consistent Multi-Turn Image Editing with Autoregressive Diffusion", + "updated": "2026-10-21T08:45:58Z" + }, + { + "abstract_chars": 1617, + "arxiv_id": "2610.25418v1", + "authors": [ + "Shuochen Chang", + "Bingjie Gao", + "Qingyang Liu", + "Qianli Ma", + "Yibo Miao", + "Haonan Zhao", + "Zhaohe Liao", + "Xiaofeng Zhang", + "Jiangtong Li", + "Li Niu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.25418", + "primary_category": "", + "proof": { + "block_bytes": 2790, + "block_sha256": "2b303cf5004f28e2e5000dcc9729c1ae958285555d027b383f8e8474b3b90383", + "line": 3045 + }, + "published": "2026-10-18T17:17:59Z", + "slice": "mm", + "title": "From Label Priors to Task Evidence: Efficient Long-Video Frame Selection via Bayesian GRPO", + "updated": "2026-10-18T17:17:59Z" + }, + { + "abstract_chars": 1571, + "arxiv_id": "2610.25448v1", + "authors": [ + "Ang Liu", + "Xiang Gu", + "Ruikai Li", + "Qiyue Wang", + "Yizhe Fan", + "Hao Shan", + "Ziyang Yan", + "Han Jiang", + "Zhenning Li", + "Xiaoshuai Hao", + "Yilong Ren", + "Zhiyong Cui", + "Haiyang Yu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 13, + "node": "2610.25448", + "primary_category": "", + "proof": { + "block_bytes": 2979, + "block_sha256": "3269a952cade9f0b44b4429863bb3b4a7117dd074aab043e477e3742441ebf1b", + "line": 2994 + }, + "published": "2026-10-18T18:11:32Z", + "slice": "mm", + "title": "UBD-Bench: Benchmarking and Analyzing Unimodal Branch Degradation in Multimodal Perception for Autonomous Driving", + "updated": "2026-10-18T18:11:32Z" + }, + { + "abstract_chars": 1262, + "arxiv_id": "2610.25463v2", + "authors": [ + "Owen Bianchi", + "Samer Aslan", + "Ryunosuke Saito" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 3, + "node": "2610.25463", + "primary_category": "", + "proof": { + "block_bytes": 2179, + "block_sha256": "4719bf13980e8ba09a1ecd3208ed23fdbe61fc6d4a587483738309a7e3df4ee5", + "line": 577 + }, + "published": "2026-10-18T18:47:42Z", + "slice": "lc", + "title": "DiaLong: Benchmarking Reminiscence in Long-Context Dialogues", + "updated": "2026-10-20T19:55:41Z" + }, + { + "abstract_chars": 1584, + "arxiv_id": "2610.25470v1", + "authors": [ + "Shashwat Singh", + "He He", + "Tal Linzen" + ], + "categories": [ + "cs.AI", + "cs.CL", + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.25470", + "primary_category": "", + "proof": { + "block_bytes": 2500, + "block_sha256": "dde49016e762c3f5ab99027c5e57614569b1a38d6abc490acc4068ddd5609236", + "line": 2972 + }, + "published": "2026-10-18T18:53:18Z", + "slice": "mm", + "title": "A failure of Imagination: VLMs fail to use visual representations for text, but self-distillation can help", + "updated": "2026-10-18T18:53:18Z" + }, + { + "abstract_chars": 1813, + "arxiv_id": "2610.25481v2", + "authors": [ + "Antonio Scardace", + "Silvia Ingala", + "Sebastiano Battiato", + "Daniele Rav\u00ec" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 4, + "node": "2610.25481", + "primary_category": "", + "proof": { + "block_bytes": 2778, + "block_sha256": "6a0943feff93730cfcf9d3e8a723ce8d402ae84d1424c3449957e15522892452", + "line": 2947 + }, + "published": "2026-10-18T19:09:40Z", + "slice": "mm", + "title": "Multimodal-Conditioned Latent Diffusion Models for Spatiotemporal Brain MRI Forecasting", + "updated": "2026-10-20T10:25:35Z" + }, + { + "abstract_chars": 1181, + "arxiv_id": "2610.25493v1", + "authors": [ + "Xiyuan Liang", + "Yu Wang", + "Zuhao Yang", + "Ziting Wang", + "Duo Li", + "Sudong Wang", + "Zhongyu Yang", + "Xiaoqin Zhang", + "Ling Shao", + "Shijian Lu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.25493", + "primary_category": "", + "proof": { + "block_bytes": 2336, + "block_sha256": "74fbad43ed3cb4092255e669a660c089ad2c1289c8c257f23f9bd2c0ff73bfcc", + "line": 2906 + }, + "published": "2026-10-18T19:26:54Z", + "slice": "mm", + "title": "GroundedVDR: Grounding Video-to-Web Evidence Dependencies in Video Deep Research", + "updated": "2026-10-18T19:26:54Z" + }, + { + "abstract_chars": 1214, + "arxiv_id": "2610.25533v1", + "authors": [ + "Duc Kieu", + "Kien Do", + "Minh Khoa Le", + "Tung Kieu", + "Dang Nguyen", + "Thin Nguyen" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.25533", + "primary_category": "", + "proof": { + "block_bytes": 2193, + "block_sha256": "70d65a9c9b107d459f4a8576a9ed01284a56d378cbd7702f33e56d1d4e5efb5a", + "line": 2876 + }, + "published": "2026-10-18T21:07:26Z", + "slice": "mm", + "title": "Modaliff: A Unified Token Diffusion Model for Any-to-Any Generation", + "updated": "2026-10-18T21:07:26Z" + }, + { + "abstract_chars": 1204, + "arxiv_id": "2610.25570v1", + "authors": [ + "Cheng-Han Lee", + "Amir Salimi", + "Hsiang-Wei Huang", + "Che-Chun Su", + "Min Sun", + "Cheng-Hao Kuo" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.25570", + "primary_category": "", + "proof": { + "block_bytes": 2294, + "block_sha256": "2b359545d24127521bdb6f54a0e8ce8e3d104c5691342e55e8ae5e5597321850", + "line": 2846 + }, + "published": "2026-10-18T22:17:03Z", + "slice": "mm", + "title": "DiffGround: Semantic Difference-Guided Zero-Shot Video Question Grounding", + "updated": "2026-10-18T22:17:03Z" + }, + { + "abstract_chars": 1508, + "arxiv_id": "2610.25617v1", + "authors": [ + "Muntaqim Ahmed Raju", + "Priyanka Siddappa", + "Md Shifat Haider Al Amin", + "Ruizhe Ma", + "Md Ripon Ahammed" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.25617", + "primary_category": "", + "proof": { + "block_bytes": 2589, + "block_sha256": "e151f0e07fc6b89c6f4811221a8665f48516307e351ff64965f1dab3b8077eea", + "line": 2818 + }, + "published": "2026-10-19T00:45:16Z", + "slice": "mm", + "title": "CheXFuse: Guided Differential Joint Attention Fusion for Robust Multimodal Chest X-Ray Classification in Data-Scarce Medical Settings", + "updated": "2026-10-19T00:45:16Z" + }, + { + "abstract_chars": 1027, + "arxiv_id": "2610.25649v2", + "authors": [ + "Senhe Zhang", + "Tao Zhang", + "Yujia Zhang", + "Zeyu Zhang", + "Dong Gong" + ], + "categories": [ + "cs.RO", + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.25649", + "primary_category": "", + "proof": { + "block_bytes": 1964, + "block_sha256": "6b46b2d9276ca85bbbdfc96a330cb5676e41b55a0389a078862155a9626abc81", + "line": 2791 + }, + "published": "2026-10-19T01:51:14Z", + "slice": "mm", + "title": "InteractAgent: Agentic Human Motion Interaction with Memory-Augmented Reflection", + "updated": "2026-10-20T06:57:04Z" + }, + { + "abstract_chars": 1586, + "arxiv_id": "2610.25919v1", + "authors": [ + "Howard Yen", + "Nitya Mani", + "Alex Renda", + "Christopher S. Hardin" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2610.25919", + "primary_category": "", + "proof": { + "block_bytes": 2505, + "block_sha256": "7f6f866ceeffaaade7ab6dabb1597f7cd05c2115d5f142013a12f3262ed7dec1", + "line": 553 + }, + "published": "2026-10-19T07:19:45Z", + "slice": "lc", + "title": "LEAPS: Long-context Evaluation of Adaptive Pattern Learning and State Tracking", + "updated": "2026-10-19T07:19:45Z" + }, + { + "abstract_chars": 1478, + "arxiv_id": "2610.25926v1", + "authors": [ + "Hongrui Wu", + "Kaiwen Tuo", + "Congcong Wang", + "Gen Li", + "Shuai Dong", + "Xinlei Yu", + "Yuqi Xu", + "Haowen Hou", + "Zelin Peng", + "Jiaqi Wang" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.25926", + "primary_category": "", + "proof": { + "block_bytes": 2687, + "block_sha256": "db595f035066451ad637f9bc98a8e33de09d8bec3cf1429b206ccc8437969f05", + "line": 2749 + }, + "published": "2026-10-19T07:24:44Z", + "slice": "mm", + "title": "MIRA: A Multimodal Illustrated Deep Research Agent for Controllable Reports", + "updated": "2026-10-19T07:24:44Z" + }, + { + "abstract_chars": 1444, + "arxiv_id": "2610.25999v1", + "authors": [ + "Xiyue Zhang", + "Keru Zhou", + "Ziyi Wang", + "Bing Hu", + "Li Wang" + ], + "categories": [ + "cs.CL", + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.25999", + "primary_category": "", + "proof": { + "block_bytes": 2513, + "block_sha256": "34337914b6b694efee045a276f2c3036329e949efd6d852e1f3f40a64e30de1b", + "line": 2720 + }, + "published": "2026-10-19T08:22:28Z", + "slice": "mm", + "title": "TempoMoE: Identifying and Steering Fast-Slow Thinking Experts for Efficient Multimodal Reasoning", + "updated": "2026-10-19T08:22:28Z" + }, + { + "abstract_chars": 1373, + "arxiv_id": "2610.26022v1", + "authors": [ + "Jiaxuan Sun", + "Biao Wang", + "Shuai Li" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 3, + "node": "2610.26022", + "primary_category": "", + "proof": { + "block_bytes": 2199, + "block_sha256": "bb36238132839636ca0032116784e360ee61e92291ed64dab30ea5016f26cd16", + "line": 2699 + }, + "published": "2026-10-19T08:45:21Z", + "slice": "mm", + "title": "FrameGRPO: Incentivizing Video Reasoning via Multi-Frame Rollouts and Temporal Credit", + "updated": "2026-10-19T08:45:21Z" + }, + { + "abstract_chars": 1062, + "arxiv_id": "2610.26046v1", + "authors": [ + "Mingyang Wu", + "Kaituo Feng", + "Bohao Li", + "Kaixiong Gong", + "Zihao Yin", + "Xiangyu Yue" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.26046", + "primary_category": "", + "proof": { + "block_bytes": 1987, + "block_sha256": "a15c491f6cb648aa95cca557f8cddb6c093696fe962b3afb70cd457f77d0d1c0", + "line": 2670 + }, + "published": "2026-10-19T09:05:39Z", + "slice": "mm", + "title": "AVTime: Reinforcing Dense Audio-Visual Captions with Bidirectional Alignment", + "updated": "2026-10-19T09:05:39Z" + }, + { + "abstract_chars": 1544, + "arxiv_id": "2610.26078v1", + "authors": [ + "Gwang-Ho Na", + "Ho-Joong Kim", + "Seong-Whan Lee" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.26078", + "primary_category": "", + "proof": { + "block_bytes": 2440, + "block_sha256": "b443ed6f112d7eec896929708e3edf115253150bedf6754c70134165b41974f7", + "line": 2649 + }, + "published": "2026-10-19T09:34:58Z", + "slice": "mm", + "title": "DCR-TSF: Dual-Level Compositional Reasoning with Triadic Spherical Fusion for Training-Free Zero-Shot Composed Image Retrieval", + "updated": "2026-10-19T09:34:58Z" + }, + { + "abstract_chars": 1324, + "arxiv_id": "2610.26084v1", + "authors": [ + "Peijun Shi", + "Xiujin Zhu", + "Zhenguo Lao", + "Chee-Onn Chow", + "Wei Ru Wong", + "Zhen Liu", + "Xiaobing Jiang" + ], + "categories": [ + "cs.CV", + "cs.HC" + ], + "doi": "", + "n_authors": 7, + "node": "2610.26084", + "primary_category": "", + "proof": { + "block_bytes": 2406, + "block_sha256": "07feedf0232cc4870f0f398e722b41ab99944a0964fd461399c76acb23766513", + "line": 2616 + }, + "published": "2026-10-19T09:43:01Z", + "slice": "mm", + "title": "Context-Aware Topological Distillation Graph Network for Asymmetric EEG-Eye Movement Emotion Recognition", + "updated": "2026-10-19T09:43:01Z" + }, + { + "abstract_chars": 1287, + "arxiv_id": "2610.26194v1", + "authors": [ + "Yu Yan", + "Shengjia Cheng", + "Fei Ma", + "Zhe Wang", + "Peng Chen" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.26194", + "primary_category": "", + "proof": { + "block_bytes": 2222, + "block_sha256": "8efc0c80ee4d89a1fdedca0236e92c1d40e02201c8061d9b647ca3f760eed6c9", + "line": 2589 + }, + "published": "2026-10-19T11:23:14Z", + "slice": "mm", + "title": "GeoEdit: Adversarial De-Evidencing for Silent Geoprivacy Protection via Image Editing", + "updated": "2026-10-19T11:23:14Z" + }, + { + "abstract_chars": 1359, + "arxiv_id": "2610.26203v1", + "authors": [ + "Fuyao Zhang", + "Wenwen He", + "Jiaming Zhang", + "Yurong Hao", + "Xuan Wang", + "Guowei Guan", + "Che Wang", + "Longtao Huang", + "Wei Yang Bryan Lim" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.26203", + "primary_category": "", + "proof": { + "block_bytes": 2417, + "block_sha256": "a618304fdaba8a294eaa685292337b53b0ba5bb3ce31a22d7ace0f998ee665fd", + "line": 2551 + }, + "published": "2026-10-19T11:30:48Z", + "slice": "mm", + "title": "Focused Omni-Modal GUI Agents", + "updated": "2026-10-19T11:30:48Z" + }, + { + "abstract_chars": 1886, + "arxiv_id": "2610.26357v2", + "authors": [ + "Peike Yu", + "Wuchao Liu", + "Jihong Guan", + "Shuigeng Zhou" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.26357", + "primary_category": "", + "proof": { + "block_bytes": 2849, + "block_sha256": "210cca327b927e8fdc71e31305fe07d359cab7589868a1afb870a069177e65ff", + "line": 2527 + }, + "published": "2026-10-19T13:19:03Z", + "slice": "mm", + "title": "HGASurv: Hierarchical Granularity-Aware Multimodal Integration for Survival Prediction", + "updated": "2026-10-20T16:17:16Z" + }, + { + "abstract_chars": 1694, + "arxiv_id": "2610.26431v1", + "authors": [ + "Alessia Intini", + "Lorenzo Vaiani", + "Enrico Chen", + "Luca Cagliero" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.26431", + "primary_category": "", + "proof": { + "block_bytes": 2571, + "block_sha256": "403134cc7f62557ee85a68a8dbe01b1cbbe4b9170fc839e76d6186dbcbabdf94", + "line": 2503 + }, + "published": "2026-10-19T13:56:33Z", + "slice": "mm", + "title": "Long-form Video-to-Text Summarization using Recursive Language Models", + "updated": "2026-10-19T13:56:33Z" + }, + { + "abstract_chars": 1913, + "arxiv_id": "2610.26538v2", + "authors": [ + "Xiaomeng Li" + ], + "categories": [ + "cs.HC", + "cs.CV", + "q-bio.QM" + ], + "doi": "", + "n_authors": 1, + "node": "2610.26538", + "primary_category": "", + "proof": { + "block_bytes": 3106, + "block_sha256": "f48fee0ef68ccfab462652707e887ac6503c1e70abb5af05ff35d3068e018bd2", + "line": 2486 + }, + "published": "2026-10-19T15:00:20Z", + "slice": "mm", + "title": "Small Average Error, Wide Individual Error: General-Purpose LLMs Estimating Energy Intake from Meal Photos in a Feeding Trial", + "updated": "2026-10-20T19:44:32Z" + }, + { + "abstract_chars": 1324, + "arxiv_id": "2610.26585v1", + "authors": [ + "Tong Zhao", + "Zhiyuan Han", + "Lin Chen", + "Bowen Xie", + "Yunxi Qiao", + "Bohan Li", + "Weiqing Xiao", + "Gen Li", + "Shu Han", + "Xuyang Dai", + "Cheng Bi", + "Hao Zhao", + "Chaojian Li" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 13, + "node": "2610.26585", + "primary_category": "", + "proof": { + "block_bytes": 2649, + "block_sha256": "9b3aa943d76e96689eef827e7b93b7912ce3ac6fb0616bc7d8199d10d27b4a4b", + "line": 2436 + }, + "published": "2026-10-19T15:34:28Z", + "slice": "mm", + "title": "Drive2Gauss: FeedForward 4D Gaussian Reconstruction from Multimodal Generative Driving Videos", + "updated": "2026-10-19T15:34:28Z" + }, + { + "abstract_chars": 1553, + "arxiv_id": "2610.26751v1", + "authors": [ + "Shiyun Xiong", + "Dongming Wu", + "Peiwen Sun", + "Bokang Yang", + "Jiaxu Wang", + "Xiaolou Sun", + "Mingxing Wen", + "Xiangyu Yue" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.26751", + "primary_category": "", + "proof": { + "block_bytes": 2583, + "block_sha256": "b0033051e96551587cbabf2a03187f39154fad5d747b3495d4dd8cdb27c7592d", + "line": 2401 + }, + "published": "2026-10-19T17:14:37Z", + "slice": "mm", + "title": "Beyond Omni: A Unified MLLM for Embodied Sensory Understanding", + "updated": "2026-10-19T17:14:37Z" + }, + { + "abstract_chars": 1339, + "arxiv_id": "2610.26754v1", + "authors": [ + "Liana Patel", + "Rishabh Ranjan", + "Ion Stoica", + "Matei Zaharia", + "Carlos Guestrin" + ], + "categories": [ + "cs.CL", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.26754", + "primary_category": "", + "proof": { + "block_bytes": 2298, + "block_sha256": "af09fbe0890e457c1abb22ef5a9ae74305840a814995e66586275aa3a650300f", + "line": 526 + }, + "published": "2026-10-19T17:15:53Z", + "slice": "lc", + "title": "TokenGate: Adapting LLMs for Fast and Memory-Efficient Prefill with Learned Token Pruning", + "updated": "2026-10-19T17:15:53Z" + }, + { + "abstract_chars": 1272, + "arxiv_id": "2610.26826v1", + "authors": [ + "Yuchi Wang", + "Rongyao Fang", + "Weihao Yu", + "Xilin Wei", + "Tiancheng Gu", + "Dingkang Yang", + "Hang Zhang", + "Dayiheng Liu", + "Hongsheng Li", + "Shuai Bai" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.26826", + "primary_category": "", + "proof": { + "block_bytes": 2674, + "block_sha256": "8f9676289202700b46ed00539455de3b0d954213bd2addad5b9615ed6b3db49f", + "line": 2357 + }, + "published": "2026-10-19T17:55:06Z", + "slice": "mm", + "title": "RefCraft: Benchmarking Visual-Reference-Conditioned Agentic Generation through Web Development", + "updated": "2026-10-19T17:55:06Z" + }, + { + "abstract_chars": 1569, + "arxiv_id": "2610.26827v1", + "authors": [ + "Ziqing Man", + "Di Wu", + "Jia-Chen Gu", + "Junyi Zhang", + "Kai-Wei Chang", + "Nanyun Peng" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 6, + "node": "2610.26827", + "primary_category": "", + "proof": { + "block_bytes": 2615, + "block_sha256": "8b642f066f1f30480b06a6e13536318a86317e2bc7bc20bd68916e85fe87d45c", + "line": 496 + }, + "published": "2026-10-19T17:55:18Z", + "slice": "lc", + "title": "KEEP-Bench: Evaluating Evidence Preservation in Context Compression", + "updated": "2026-10-19T17:55:18Z" + }, + { + "abstract_chars": 1428, + "arxiv_id": "2610.26834v1", + "authors": [ + "Anamaria-Roberta Hartl", + "Levente Z\u00f3lyomi", + "Michael List", + "G\u00fcnter Klambauer", + "Sebastian B\u00f6ck", + "Sepp Hochreiter" + ], + "categories": [ + "cs.LG", + "cs.AI" + ], + "doi": "", + "n_authors": 6, + "node": "2610.26834", + "primary_category": "", + "proof": { + "block_bytes": 2433, + "block_sha256": "b38ba4506ee0ff95a1de8662c49ee38ad4abcca990e0f5b24ef3733139af510d", + "line": 190 + }, + "published": "2026-10-19T17:56:52Z", + "slice": "lc2", + "title": "Kronecker Delta Rule for Long Context Linear Attention", + "updated": "2026-10-19T17:56:52Z" + }, + { + "abstract_chars": 1513, + "arxiv_id": "2610.26855v1", + "authors": [ + "Tianqi Liu", + "Hanfei Zhao", + "Qifeng Liang", + "Hui En Pang", + "Jiarui Xu", + "Sayang Mu", + "Penghao Qiu", + "YingSheng Zhang", + "Jun Wang", + "Ziang Cao", + "Mingze Sun", + "Yukang Cao", + "Fangzhou Hong", + "Zhaoxi Chen", + "Ziwei Liu" + ], + "categories": [ + "cs.CV", + "cs.RO" + ], + "doi": "", + "n_authors": 15, + "node": "2610.26855", + "primary_category": "", + "proof": { + "block_bytes": 3174, + "block_sha256": "9cfc94cfe6a551ee5a82f91a0cc9b9745eb0077a16b2f81f66e44214d9f33145", + "line": 2299 + }, + "published": "2026-10-19T17:59:55Z", + "slice": "mm", + "title": "Ropedia W0: Scaling Loco-Manipulation World Models across Embodiments with Human Experience", + "updated": "2026-10-19T17:59:55Z" + }, + { + "abstract_chars": 1302, + "arxiv_id": "2610.27049v1", + "authors": [ + "Jing Wang", + "Yanlin Li", + "Mong-Li Lee", + "Wynne Hsu", + "Shengqiong Wu", + "Hao Fei" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.27049", + "primary_category": "", + "proof": { + "block_bytes": 2282, + "block_sha256": "9865583fc531593c6b0a253f97fc178eb827f22e9578ccb9c920d5d0e6993171", + "line": 2269 + }, + "published": "2026-10-19T17:59:55Z", + "slice": "mm", + "title": "VitronEdit: Universal Visual Editing across Images, Videos, and 3D Scenes", + "updated": "2026-10-19T17:59:55Z" + }, + { + "abstract_chars": 1665, + "arxiv_id": "2610.26856v1", + "authors": [ + "Shiao Xie", + "Siyu Chen", + "Jianwei Lv", + "Xiandong Li", + "Yujin Wang" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.26856", + "primary_category": "", + "proof": { + "block_bytes": 2598, + "block_sha256": "f57362c46e2626a93bc12914de15ea03b324c423d8e13aa4f8f2fdb92cef9c62", + "line": 2242 + }, + "published": "2026-10-19T17:59:56Z", + "slice": "mm", + "title": "Reinforcement Learning with Visually Attributable On-Policy Self-Distillation", + "updated": "2026-10-19T17:59:56Z" + }, + { + "abstract_chars": 1692, + "arxiv_id": "2610.26860v1", + "authors": [ + "Yu Zhou", + "Cheng-Fu Yang", + "Rui Sun", + "Di Wu", + "Sibo Peng", + "Mingyang Zhang", + "Zhen Yang", + "Ruiyi Zhang", + "Nanyun Peng", + "Zhe Gan", + "Kai-Wei Chang" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.CV", + "cs.LG", + "cs.MM" + ], + "doi": "", + "n_authors": 11, + "node": "2610.26860", + "primary_category": "", + "proof": { + "block_bytes": 3163, + "block_sha256": "ae717fc08a229531acaaeb1ddfe2f897b060d1b493172a24638b4c788962bfd4", + "line": 2194 + }, + "published": "2026-10-19T17:59:58Z", + "slice": "mm", + "title": "OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory", + "updated": "2026-10-19T17:59:58Z" + }, + { + "abstract_chars": 1000, + "arxiv_id": "2610.26863v2", + "authors": [ + "Keshigeyan Chandrasegaran", + "Yue Zhao", + "Armin W. Thomas", + "Ehsan Adeli", + "Jiajun Wu", + "Juan Carlos Niebles", + "Li Fei-Fei", + "Michael Poli" + ], + "categories": [ + "cs.LG", + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.26863", + "primary_category": "", + "proof": { + "block_bytes": 2221, + "block_sha256": "0e6cae83ab381265d6ee8426e0190fe8f27f9687eb232e63a6512368f8d4cb17", + "line": 2157 + }, + "published": "2026-10-19T17:59:59Z", + "slice": "mm", + "title": "Text-to-Image Generative Modeling Without Language Pretraining", + "updated": "2026-10-20T15:44:34Z" + }, + { + "abstract_chars": 1498, + "arxiv_id": "2610.27192v1", + "authors": [ + "Joong Ho", + "Choi", + "Aditya Paul", + "Nidhi Singh" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 4, + "node": "2610.27192", + "primary_category": "", + "proof": { + "block_bytes": 2521, + "block_sha256": "3fde329070219f2478948bff2a467b0dfbc329df5b9f76b7694d25ffe0647cd0", + "line": 2131 + }, + "published": "2026-10-19T19:29:12Z", + "slice": "mm", + "title": "CARLAR Influence: A Structured Hallucination Risk in Multimodal Cheque Extraction and an Exploratory Compressed-Image Countermeasure", + "updated": "2026-10-19T19:29:12Z" + }, + { + "abstract_chars": 1619, + "arxiv_id": "2610.27234v1", + "authors": [ + "Zhiwei Liu", + "Zhujun Lan", + "Jielin Qiu", + "Zixiang Chen", + "Liangwei Yang", + "Ming Zhu", + "Akshara Prabhakar", + "Wenting Zhao", + "John Emmons", + "Jason Wu", + "Shafiq Rayhan Joty", + "Junnan Li", + "Shelby Heinecke", + "Silvio Savarese", + "Huan Wang" + ], + "categories": [ + "cs.AI" + ], + "doi": "", + "n_authors": 15, + "node": "2610.27234", + "primary_category": "", + "proof": { + "block_bytes": 3066, + "block_sha256": "372447f2f12cf3b0cbf6f41795c74672d9817da1542a6e96673d12ecf6c7872d", + "line": 134 + }, + "published": "2026-10-19T20:02:07Z", + "slice": "lc2", + "title": "EGI-BENCH: An Enterprise General Intelligence Benchmark Suite", + "updated": "2026-10-19T20:02:07Z" + }, + { + "abstract_chars": 1266, + "arxiv_id": "2610.27298v1", + "authors": [ + "Avi Gupta", + "Nilotpal Sinha", + "Vishnu Raj", + "Sambuddha Saha", + "Pratik Joshi", + "Koteswar Rao Jerripothula", + "Tammam Tillo" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.27298", + "primary_category": "", + "proof": { + "block_bytes": 2427, + "block_sha256": "1419e0f80623047a973352d56d7b3374a9a57f01a28fcb3875d97ab54bf9bf94", + "line": 2097 + }, + "published": "2026-10-19T21:13:45Z", + "slice": "mm", + "title": "Generalizing Multimodal Foundational Models in Context-Driven Class Incremental Learning", + "updated": "2026-10-19T21:13:45Z" + }, + { + "abstract_chars": 1501, + "arxiv_id": "2610.27341v1", + "authors": [ + "Zerui Chen", + "Changrui Chen", + "Fei Ni", + "Jiankang Deng" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.27341", + "primary_category": "", + "proof": { + "block_bytes": 2438, + "block_sha256": "9c64f23aa94c739f2bec214bca39e38576415972e1f8caa90bfe3730b722676f", + "line": 2073 + }, + "published": "2026-10-19T22:11:24Z", + "slice": "mm", + "title": "Look Before You Reason: Implicit Visual Thinking for Efficient Multimodal Reasoning", + "updated": "2026-10-19T22:11:24Z" + }, + { + "abstract_chars": 1539, + "arxiv_id": "2610.27360v1", + "authors": [ + "Rohit Saxena", + "Alessandro Suglia", + "Marek Rei", + "Pasquale Minervini" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 4, + "node": "2610.27360", + "primary_category": "", + "proof": { + "block_bytes": 2420, + "block_sha256": "8a1edd2c76b0b31c4550e853989297199012717175fb3d82b7bae71993a8d5fc", + "line": 2049 + }, + "published": "2026-10-19T22:39:42Z", + "slice": "mm", + "title": "On the Limits of Scale: Inverse Scaling in Vision-Language Models", + "updated": "2026-10-19T22:39:42Z" + }, + { + "abstract_chars": 1438, + "arxiv_id": "2610.27521v1", + "authors": [ + "Jian Zhang", + "Manrong Liu", + "Yilei Huang", + "Wenhua Liu", + "Xiaohui Yang", + "Lijun Yang" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.27521", + "primary_category": "", + "proof": { + "block_bytes": 2423, + "block_sha256": "d3298bff937a8055d40906220aa33b43d153e3496285be830bf9f7dd809ad670", + "line": 2020 + }, + "published": "2026-10-20T02:35:16Z", + "slice": "mm", + "title": "Multiscale Temporal-Spectral-Spatial EEG Learning With Modality-Specific and Modality-Invariant Representations for Emotion Recognition", + "updated": "2026-10-20T02:35:16Z" + }, + { + "abstract_chars": 1238, + "arxiv_id": "2610.27565v1", + "authors": [ + "Qizhou Wang", + "Jiawen Zhu", + "Guansong Pang", + "Christopher Leckie" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 4, + "node": "2610.27565", + "primary_category": "", + "proof": { + "block_bytes": 2204, + "block_sha256": "ace96365e838d8bb55f9c52fd4e6d2057503fb9957ca9ce14ab9cb04e5d4f630", + "line": 1995 + }, + "published": "2026-10-20T03:29:08Z", + "slice": "mm", + "title": "AnomalyJev: Towards Evaluating Image Anomaly Explanations via Claim-Level Verification", + "updated": "2026-10-20T03:29:08Z" + }, + { + "abstract_chars": 1349, + "arxiv_id": "2610.27571v2", + "authors": [ + "Xiaohua Huang", + "Bingrui Lei", + "Xiuyan Shao", + "Ling Zhou", + "Yuan Zong", + "Wenming Zheng", + "Guoying Zhao" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.27571", + "primary_category": "", + "proof": { + "block_bytes": 2410, + "block_sha256": "b3f94a2aa7e15427dc1d27c25b86cb78e22f4857a4c3b36eac1b98a648512210", + "line": 1962 + }, + "published": "2026-10-20T03:39:51Z", + "slice": "mm", + "title": "Text-Anchored Modality Experts with Uncertainty-Guided Routing for Multimodal Sentiment Analysis", + "updated": "2026-10-21T02:07:53Z" + }, + { + "abstract_chars": 1376, + "arxiv_id": "2610.27657v1", + "authors": [ + "Zhan Yi", + "Yuchen Wang", + "Chao Li", + "Lei Hong", + "Boyuan Yang" + ], + "categories": [ + "cs.RO", + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.27657", + "primary_category": "", + "proof": { + "block_bytes": 2297, + "block_sha256": "e833c81d41ee8a11dc01f544e7f6f95a883929afb011ce47f3b78e03b3974fa6", + "line": 1935 + }, + "published": "2026-10-20T05:15:35Z", + "slice": "mm", + "title": "PLaCA: Learning Patch-Level Future Latent Change for Action Generation", + "updated": "2026-10-20T05:15:35Z" + }, + { + "abstract_chars": 1733, + "arxiv_id": "2610.27692v1", + "authors": [ + "Ziwei Zhao", + "Yuhang Liu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 2, + "node": "2610.27692", + "primary_category": "", + "proof": { + "block_bytes": 2499, + "block_sha256": "220604eda178e60c353876bfb55f5fdf65c30e6f4581881706c6a0548a33d629", + "line": 1917 + }, + "published": "2026-10-20T06:12:30Z", + "slice": "mm", + "title": "A Principled Optimal Transport Framework for Frame Selection in Long Video Understanding", + "updated": "2026-10-20T06:12:30Z" + }, + { + "abstract_chars": 1844, + "arxiv_id": "2610.27782v1", + "authors": [ + "Siyuan Ma", + "Yu Qi", + "Cheng Ye", + "Ruotian Peng", + "Xinyi Xu", + "Zitiantao Lin", + "Zedong Cai", + "Yijian Huang", + "Weiyang Liu", + "Siyuan Wang", + "Yandong Wen" + ], + "categories": [ + "cs.CV", + "cs.RO" + ], + "doi": "", + "n_authors": 11, + "node": "2610.27782", + "primary_category": "", + "proof": { + "block_bytes": 3200, + "block_sha256": "d33d246bc0df235c38a72035685b79964069c15915053bd23dffe4a365df8f6b", + "line": 1871 + }, + "published": "2026-10-20T07:48:41Z", + "slice": "mm", + "title": "RoboJudge: Multimodal Language Models as Judges for Embodied Video Generation", + "updated": "2026-10-20T07:48:41Z" + }, + { + "abstract_chars": 1552, + "arxiv_id": "2610.27829v1", + "authors": [ + "Weijian Jian", + "Siyang Chen", + "Yuguang Yang", + "Yajun Zhang", + "Chunyu Xie", + "Dawei Leng", + "Yuhui Yin" + ], + "categories": [ + "cs.CV", + "cs.IR" + ], + "doi": "", + "n_authors": 7, + "node": "2610.27829", + "primary_category": "", + "proof": { + "block_bytes": 2673, + "block_sha256": "dab5f7086ddef8c4282088aa9d7244d47f72105e95722a473a6f8a09bf7a08cc", + "line": 1837 + }, + "published": "2026-10-20T08:19:14Z", + "slice": "mm", + "title": "GARRET: Generative Feedback for Region Retrieval in Visual Documents", + "updated": "2026-10-20T08:19:14Z" + }, + { + "abstract_chars": 1076, + "arxiv_id": "2610.27894v1", + "authors": [ + "Manar Ali", + "Lisa Gottschalk", + "Simeon Junker", + "Lisa Hudalla", + "Alon Fishman", + "Joana Cholin", + "Stefan Kopp", + "Hendrik Buschmeier", + "Sina Zarrie\u00df" + ], + "categories": [ + "cs.CL", + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.27894", + "primary_category": "", + "proof": { + "block_bytes": 2332, + "block_sha256": "1efbb31861463e9d563f2156d52991402d530a0b6746a7cb2584ff5753ffa9f8", + "line": 1797 + }, + "published": "2026-10-20T09:13:16Z", + "slice": "mm", + "title": "Testing Associative Creativity in Humans and Multimodal LLMs with Difficult-to-Name Visual Stimuli", + "updated": "2026-10-20T09:13:16Z" + }, + { + "abstract_chars": 862, + "arxiv_id": "2610.27904v1", + "authors": [ + "Genshin Kakimoto", + "Atsushi Yanagisawa" + ], + "categories": [ + "cs.AI", + "cs.CL", + "cs.CV" + ], + "doi": "", + "n_authors": 2, + "node": "2610.27904", + "primary_category": "", + "proof": { + "block_bytes": 1936, + "block_sha256": "a6ebd75d85efe0f7649071e39bdb71dad0d2e36519c62017b185d3d3df0349b9", + "line": 1777 + }, + "published": "2026-10-20T09:19:36Z", + "slice": "mm", + "title": "Staged Continual Adaptation of Multimodal Foundation Models for Japanese Financial Documents", + "updated": "2026-10-20T09:19:36Z" + }, + { + "abstract_chars": 1362, + "arxiv_id": "2610.27974v1", + "authors": [ + "David Fischinger", + "Marcel Hasenbalg", + "Silvia Poletti", + "Davide Antonutti", + "Mina Sch\u00fctz", + "Lam Pham", + "Justin Ilyes", + "P\u00e9ter Rjabcsenk\u00f3", + "Simon Freitter", + "Martin Boyer" + ], + "categories": [ + "cs.CV", + "cs.MM" + ], + "doi": "", + "n_authors": 10, + "node": "2610.27974", + "primary_category": "", + "proof": { + "block_bytes": 2759, + "block_sha256": "6d6e4fdc65c755aba9700e8bfbd30218c6c25fdaca32adb9877e7e64c99dd033", + "line": 1734 + }, + "published": "2026-10-20T10:18:49Z", + "slice": "mm", + "title": "Media Intelligence Platform: Multimodal Detection of Synthetic and Manipulated Content", + "updated": "2026-10-20T10:18:49Z" + }, + { + "abstract_chars": 1612, + "arxiv_id": "2610.27999v1", + "authors": [ + "Jihai Zhang", + "Runjia Qian", + "Kaiqin Kong", + "Biao Jiang", + "Puyi Wang", + "Siru Chen", + "Tianle Li", + "Guanjie Chen", + "Junyi Wu", + "Chubin Chen", + "Yuanhang Li", + "Kaichen Huang", + "Haobo Zhang", + "Yangguang Li", + "Wei Yu", + "Guibin Chen", + "Yu Cheng", + "Yahui Zhou" + ], + "categories": [ + "cs.CV", + "cs.GR" + ], + "doi": "", + "n_authors": 18, + "node": "2610.27999", + "primary_category": "", + "proof": { + "block_bytes": 3403, + "block_sha256": "3d338208ed9a1eb07c688e1a1161cb98dbb5b64e91d1a174e63a461d1d2066d0", + "line": 1667 + }, + "published": "2026-10-20T10:41:38Z", + "slice": "mm", + "title": "Matrix-Game 4.0: Harnessing Video Models for Real-Time Playable Game Worlds", + "updated": "2026-10-20T10:41:38Z" + }, + { + "abstract_chars": 1090, + "arxiv_id": "2610.28087v2", + "authors": [ + "Zijian Yu", + "Hangwei Zhang", + "Jun Lan", + "Huijia Zhu", + "Weiqiang Wang", + "Jianfu Zhang" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.28087", + "primary_category": "", + "proof": { + "block_bytes": 2153, + "block_sha256": "ce05333ffc1d0c3189cdcfba6d7479ce8226616d0f8abd5a7b01e471333bc79e", + "line": 1637 + }, + "published": "2026-10-20T12:07:16Z", + "slice": "mm", + "title": "WildAIGC-Bench: Can AI Image Detectors Handle the Wild? A Benchmark of Generated and Edited Images in Online Circulation", + "updated": "2026-10-22T08:50:02Z" + }, + { + "abstract_chars": 1846, + "arxiv_id": "2610.28129v1", + "authors": [ + "Yue Zhuo", + "Jingjia Yan", + "Fangyu Liu", + "Lingjun Liu", + "Zongjun Chen", + "Zhisheng Luo", + "Zhonghua Xie" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.28129", + "primary_category": "", + "proof": { + "block_bytes": 2928, + "block_sha256": "7ff710beeefecad62e5f2fe38661b70c3612ff8197e34e9f96f9e677f0baee3c", + "line": 1604 + }, + "published": "2026-10-20T12:35:39Z", + "slice": "mm", + "title": "GAMF-Net: Grouped Availability-Aware Multimodal Fusion for Smartphone Skin Lesion Classification", + "updated": "2026-10-20T12:35:39Z" + }, + { + "abstract_chars": 1463, + "arxiv_id": "2610.28264v1", + "authors": [ + "Yuheng Zhang", + "Jie Zhang", + "Yuecong Min", + "Yunwei Zhao", + "Meichen Liu", + "Qiankun Li", + "Shiguang Shan" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.28264", + "primary_category": "", + "proof": { + "block_bytes": 2646, + "block_sha256": "7845ba3875c17abec848bbd270a767184cb5bc6a2f66e3588106db69de8a536e", + "line": 1570 + }, + "published": "2026-10-20T14:20:39Z", + "slice": "mm", + "title": "PI-MLLM: Psychophysics-Inspired Multimodal Large Language Model for Oddly Satisfying Video Emotion Analysis", + "updated": "2026-10-20T14:20:39Z" + }, + { + "abstract_chars": 1482, + "arxiv_id": "2610.28266v1", + "authors": [ + "Haenara Shin", + "Dongjoo Lee", + "Sungwoo Bae", + "Kwon Joong Na", + "Daeseung Lee", + "Hongyoon Choi" + ], + "categories": [ + "cs.CV", + "cs.AI", + "q-bio.QM" + ], + "doi": "", + "n_authors": 6, + "node": "2610.28266", + "primary_category": "", + "proof": { + "block_bytes": 2665, + "block_sha256": "c92bf5244977ad87a3934d100683820adee3e9427b2411dd11aa3e1baa69f25f", + "line": 1538 + }, + "published": "2026-10-20T14:22:47Z", + "slice": "mm", + "title": "VGL-stGen: Learning a shared multimodal model for lung histology and spatial transcriptomics", + "updated": "2026-10-20T14:22:47Z" + }, + { + "abstract_chars": 1218, + "arxiv_id": "2610.28282v1", + "authors": [ + "Qi Wang", + "Peijie Wang", + "Jun Cao", + "Haoyang Tong", + "Xiao-Hui Li", + "Fei Yin", + "Cheng-Lin Liu" + ], + "categories": [ + "cs.AI", + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.28282", + "primary_category": "", + "proof": { + "block_bytes": 2256, + "block_sha256": "7fed5612ab2d60795f067c469c42786e3dfb4d6a028a58b11b6432e42cfccf62", + "line": 1505 + }, + "published": "2026-10-20T14:34:54Z", + "slice": "mm", + "title": "ChartEvo: Self-Evolving Agent Harnesses for Long-Tail Chart Reasoning", + "updated": "2026-10-20T14:34:54Z" + }, + { + "abstract_chars": 1705, + "arxiv_id": "2610.28356v2", + "authors": [ + "Marc Chapus", + "Carlos Crispim-Junior", + "V\u00e9ronique Eglin", + "Atilla Baskurt" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2610.28356", + "primary_category": "", + "proof": { + "block_bytes": 2812, + "block_sha256": "7fc0a0d87dcf97e47224e9bfcaf8c698dac3251f3a4ba9d815ef0717c2535b49", + "line": 1479 + }, + "published": "2026-10-20T15:20:28Z", + "slice": "mm", + "title": "CountVideoBench: A Benchmark to Evaluate Prediction Biases on the Object Counting task by Video-Language Models", + "updated": "2026-10-21T11:52:51Z" + }, + { + "abstract_chars": 1249, + "arxiv_id": "2610.28382v1", + "authors": [ + "Eric Tao", + "Minhao Sun", + "Liyan Liu", + "Zhijing Wu", + "Xiaohan Yu", + "Lang Mei", + "Li Huang", + "Chao Feng", + "Jinchao Ma", + "Sichen Kang", + "Siyu Mo", + "Chong Chen" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 12, + "node": "2610.28382", + "primary_category": "", + "proof": { + "block_bytes": 2518, + "block_sha256": "12e34ad8124be212f5564dd4604a6ab9946068733a2eff6190b9ce8e1b8b891f", + "line": 1432 + }, + "published": "2026-10-20T15:33:24Z", + "slice": "mm", + "title": "RACE: Learning Multimodal Search through Referential Abstraction and Compositional Evidence", + "updated": "2026-10-20T15:33:24Z" + }, + { + "abstract_chars": 1759, + "arxiv_id": "2610.28393v1", + "authors": [ + "Jinghui Zhang", + "Lang Gao", + "Zongfang Liu", + "Ruihong Zeng", + "Zirui Song", + "Rui Yan", + "Kentaro Inui", + "Xiuying Chen" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 8, + "node": "2610.28393", + "primary_category": "", + "proof": { + "block_bytes": 2848, + "block_sha256": "1c668db6ff2eff77cda6053e37a049c80fd7e85075c4b056fc5192c87f3a38c5", + "line": 460 + }, + "published": "2026-10-20T15:40:54Z", + "slice": "lc", + "title": "When Copying Is Hard: Copy-Constrained Decoding for Exact Span Reproduction", + "updated": "2026-10-20T15:40:54Z" + }, + { + "abstract_chars": 1873, + "arxiv_id": "2610.28416v1", + "authors": [ + "Zhenghan Chen", + "Zekai Shao", + "Xin Lin", + "Leting Cheng", + "Siming Chen" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.28416", + "primary_category": "", + "proof": { + "block_bytes": 2851, + "block_sha256": "75a3cabebd362f4142d41d51ce34984dd85c7e6c38a677acad1984fc1963bc89", + "line": 1405 + }, + "published": "2026-10-20T15:51:41Z", + "slice": "mm", + "title": "Code2Video-Compass: A Comprehensive Benchmark for General-Purpose Code-Based Video Generation across T2V, I2V, and V2V", + "updated": "2026-10-20T15:51:41Z" + }, + { + "abstract_chars": 1542, + "arxiv_id": "2610.28419v1", + "authors": [ + "Dan Zlotnikov", + "Ohad Ben-Shahar" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.28419", + "primary_category": "", + "proof": { + "block_bytes": 2394, + "block_sha256": "945144eff84e01e4e96c23fd460867621d42f2d4e21d4a0e6575ab1a7778267d", + "line": 1852 + }, + "published": "2026-10-20T15:53:23Z", + "slice": "mm2", + "title": "DISTRACT: Degradation-Indexed Study of Textual Reference Across Competing Targets", + "updated": "2026-10-20T15:53:23Z" + }, + { + "abstract_chars": 1496, + "arxiv_id": "2610.28476v1", + "authors": [ + "Pengying Wu", + "Mingye Jiang", + "Yunze Hu", + "Zhejia Wen", + "Kangjie Zhou", + "Zongru Yang", + "Zhe Peng", + "Chang Liu" + ], + "categories": [ + "cs.CV", + "cs.RO" + ], + "doi": "", + "n_authors": 8, + "node": "2610.28476", + "primary_category": "", + "proof": { + "block_bytes": 2676, + "block_sha256": "034367df50fb5ec82b23e691c91c11ae75d86adb6b7f0a4f578234803946da08", + "line": 1815 + }, + "published": "2026-10-20T16:27:33Z", + "slice": "mm2", + "title": "CLOSER: Evidence-Aware Active Visual Verification for Embodied Object-Goal Navigation", + "updated": "2026-10-20T16:27:33Z" + }, + { + "abstract_chars": 1141, + "arxiv_id": "2610.28502v1", + "authors": [ + "Trong-Thang Pham", + "Anh Nguyen", + "Hien Van Nguyen", + "Ngan Le" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.28502", + "primary_category": "", + "proof": { + "block_bytes": 2043, + "block_sha256": "e78e4c29fb1e17411c681b138471168ae34b8b2cfca09d480a13baa93355b3a4", + "line": 1791 + }, + "published": "2026-10-20T16:43:06Z", + "slice": "mm2", + "title": "GazeLens for Efficient Egocentric Video Question Answering with Simple Gaze-Driven Adaptive Token Reduction", + "updated": "2026-10-20T16:43:06Z" + }, + { + "abstract_chars": 1675, + "arxiv_id": "2610.28626v1", + "authors": [ + "Rahul Sajnani", + "Diego Romeres", + "Mingyuan Zhang", + "Kai Gao", + "Carl Qi", + "Baichuan Huang", + "Srinath Sridhar", + "Dylan Randle", + "Lillian J. Ratliff", + "Jose Barreiros", + "Manikantan Nambi", + "Jeroen Vanbaar" + ], + "categories": [ + "cs.RO", + "cs.AI", + "cs.CV" + ], + "doi": "", + "n_authors": 12, + "node": "2610.28626", + "primary_category": "", + "proof": { + "block_bytes": 3164, + "block_sha256": "1729322aa5cb3720254ac39956a9ed717d7e09a77cad30b1e524f9ebd6d7a21f", + "line": 1741 + }, + "published": "2026-10-20T17:59:04Z", + "slice": "mm2", + "title": "UniWALM: Unified World Action Language Model for Embodied Robot Control", + "updated": "2026-10-20T17:59:04Z" + }, + { + "abstract_chars": 1912, + "arxiv_id": "2610.28801v1", + "authors": [ + "Jiahan Li", + "Huangyuan Su", + "Shengbang Tong", + "Shusheng Yang", + "Ruihan Guo", + "Suozhi Huang", + "Hexu Zhao", + "Pratyusha Sharma", + "Sherry Yang", + "Jiatao Gu", + "Rob Fergus", + "Kyunghyun Cho" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 12, + "node": "2610.28801", + "primary_category": "", + "proof": { + "block_bytes": 3414, + "block_sha256": "745c5154f59746ad0c9f2b0af9da41fbdf3a3002f15108f66c10f3f17e00457a", + "line": 1357 + }, + "published": "2026-10-20T18:25:09Z", + "slice": "mm", + "title": "JUICE: Unified Multimodal Modeling in Pretrained Representation Spaces", + "updated": "2026-10-20T18:25:09Z" + }, + { + "abstract_chars": 1391, + "arxiv_id": "2610.28880v1", + "authors": [ + "Matthew Strong", + "Ankush K. Dhawan", + "Julien Poffet", + "Giuse Pham", + "Jinho So", + "Monroe Kennedy" + ], + "categories": [ + "cs.RO", + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.28880", + "primary_category": "", + "proof": { + "block_bytes": 2556, + "block_sha256": "66050b2ef1f7d4abc0364150ec8a8b67e238f22499c0a493a815896fa7ad1413", + "line": 1710 + }, + "published": "2026-10-20T19:59:24Z", + "slice": "mm2", + "title": "Real2Sem2Real: 3D Semantic Augmentations for Robot Learning from a Single Human RGB Demonstration", + "updated": "2026-10-20T19:59:24Z" + }, + { + "abstract_chars": 1904, + "arxiv_id": "2610.28964v1", + "authors": [ + "Md Khalid Syfullah", + "Alvi Ataur Khalil" + ], + "categories": [ + "quant-ph", + "cs.AI", + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.28964", + "primary_category": "", + "proof": { + "block_bytes": 2834, + "block_sha256": "f8620344f2b178a4ac48e7f1540484b8dc6c65e7634357132cbcdecabf9a3fdd", + "line": 1337 + }, + "published": "2026-10-20T22:28:17Z", + "slice": "mm", + "title": "Can Quantum Layers offer Performance and Security Advantages in Vision-Language Models?", + "updated": "2026-10-20T22:28:17Z" + }, + { + "abstract_chars": 1538, + "arxiv_id": "2610.29025v1", + "authors": [ + "Yongsheng Lian" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 1, + "node": "2610.29025", + "primary_category": "", + "proof": { + "block_bytes": 2338, + "block_sha256": "9c3a8cd0707263c919e5b190bcfaa4f8ab214e673711c93ccc7b91df0cf6bd31", + "line": 1675 + }, + "published": "2026-10-21T00:59:03Z", + "slice": "mm2", + "title": "Single-Image Food Mass Estimators Do Not Transfer Their Gram Scale Across Datasets", + "updated": "2026-10-21T00:59:03Z" + }, + { + "abstract_chars": 1743, + "arxiv_id": "2610.29174v1", + "authors": [ + "Jiachen Guo", + "Xinshan Zhu", + "Boyun Wang", + "Yanyan Liang", + "Jun Wan", + "Feng Lin", + "Ajian Liu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.29174", + "primary_category": "", + "proof": { + "block_bytes": 2789, + "block_sha256": "731d09f2b44bf5a6a87e6e82f18a0d57584048f36d05193eb24e2d898efe0813", + "line": 1304 + }, + "published": "2026-10-21T04:04:32Z", + "slice": "mm", + "title": "LocalAgent: Collaborative Agentic Verification for Fine-Grained Instance-Level Consistency", + "updated": "2026-10-21T04:04:32Z" + }, + { + "abstract_chars": 1862, + "arxiv_id": "2610.29196v1", + "authors": [ + "Eric Liang", + "Alan Luo", + "Kaiwen Yuan" + ], + "categories": [ + "cs.CV", + "cs.CR", + "cs.LG" + ], + "doi": "", + "n_authors": 3, + "node": "2610.29196", + "primary_category": "", + "proof": { + "block_bytes": 3014, + "block_sha256": "405723569472045426d5eff5621bb1d58c6f9ffe1d373012de44690f0e1c8b56", + "line": 1652 + }, + "published": "2026-10-21T04:38:02Z", + "slice": "mm2", + "title": "A Unified Evaluation Framework of Physical Adversarial Robustness in the Edge VLM Era", + "updated": "2026-10-21T04:38:02Z" + }, + { + "abstract_chars": 1428, + "arxiv_id": "2610.29231v2", + "authors": [ + "Tan Zhang", + "Xing Deng", + "Lu Zhang", + "Xiaofeng Zhu", + "Ping Hu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.29231", + "primary_category": "", + "proof": { + "block_bytes": 2454, + "block_sha256": "20c5b0a875e5aa955d562f6f99a6e715260851809218f123867f8a130002491a", + "line": 1277 + }, + "published": "2026-10-21T05:41:44Z", + "slice": "mm", + "title": "DisasterRoute: Evidence-Guided Dual-System Routing for Visual Disaster Question Answering", + "updated": "2026-10-23T05:34:13Z" + }, + { + "abstract_chars": 1284, + "arxiv_id": "2610.29232v1", + "authors": [ + "Junjie Wang", + "Zhihao Yuan", + "Yunhan Tang", + "Sheng Xu", + "Jiaqi Mao", + "Xiaoyu Ye", + "Yueru Luo", + "Xu Yan", + "Chun-Mei Feng", + "Zhen Li" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.29232", + "primary_category": "", + "proof": { + "block_bytes": 2502, + "block_sha256": "941bfee62d629b2fdc693295b06f832967325ef88ab7e46f4d0f904213110f1a", + "line": 1583 + }, + "published": "2026-10-21T05:42:29Z", + "slice": "mm2", + "title": "Think-Capture: Active 3D Geometry Acquisition for Spatial Reasoning in Vision-Language Models", + "updated": "2026-10-21T05:42:29Z" + }, + { + "abstract_chars": 1368, + "arxiv_id": "2610.29241v1", + "authors": [ + "Anat Veikherman", + "Mor Ventura", + "Nitay Calderon", + "Lihi Zelnik-Manor", + "Roi Reichart" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.29241", + "primary_category": "", + "proof": { + "block_bytes": 2230, + "block_sha256": "93c67cd08dabc60eedab0580206881eb403d47e5a9bcf63bc680a6a27e89baf1", + "line": 1557 + }, + "published": "2026-10-21T05:47:57Z", + "slice": "mm2", + "title": "Encoded but Unused: Bounding the Sources of VLM Errors", + "updated": "2026-10-21T05:47:57Z" + }, + { + "abstract_chars": 1609, + "arxiv_id": "2610.29244v1", + "authors": [ + "Han Hu", + "He Chen" + ], + "categories": [ + "cs.CV", + "cs.RO" + ], + "doi": "", + "n_authors": 2, + "node": "2610.29244", + "primary_category": "", + "proof": { + "block_bytes": 2439, + "block_sha256": "5351c5eb678c8a1c678916994d2092bd00cdec72189606e746457c4ebf9a842b", + "line": 1538 + }, + "published": "2026-10-21T05:49:05Z", + "slice": "mm2", + "title": "Failure Modes of Vision-Language Models for Human Activity Understanding in Thermal HRI", + "updated": "2026-10-21T05:49:05Z" + }, + { + "abstract_chars": 1331, + "arxiv_id": "2610.29318v1", + "authors": [ + "Jiaxuan Guo", + "Xingyu Ren", + "Kejia Zhang", + "Jingxin Yang", + "Youran Sun", + "Haizhao Yang" + ], + "categories": [ + "cs.CL", + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.29318", + "primary_category": "", + "proof": { + "block_bytes": 2324, + "block_sha256": "fa1ae20f0499f070f8cb1b7d3154717c0db3e93626e98c32934060d3e1ad2177", + "line": 1508 + }, + "published": "2026-10-21T07:21:08Z", + "slice": "mm2", + "title": "Asking What a Director Sees Can Change What Vision-Language Models Choose", + "updated": "2026-10-21T07:21:08Z" + }, + { + "abstract_chars": 1644, + "arxiv_id": "2610.29352v1", + "authors": [ + "Ziqing Qiao", + "Xiaoyue Xu", + "Sikui Zhang", + "Yinuo Xu", + "Bingxiang He", + "Chaojun Xiao", + "Xu Han" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 7, + "node": "2610.29352", + "primary_category": "", + "proof": { + "block_bytes": 2685, + "block_sha256": "38a8c17e21fb705db00d49c8d81f03acb4ad871cc28623ffa3932d9285f7baab", + "line": 427 + }, + "published": "2026-10-21T07:46:55Z", + "slice": "lc", + "title": "Don't Stop Long-Context Continual Pre-Training Too Early: An Empirical Scaling Law", + "updated": "2026-10-21T07:46:55Z" + }, + { + "abstract_chars": 1677, + "arxiv_id": "2610.29409v1", + "authors": [ + "Abdullah Hamdi" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 1, + "node": "2610.29409", + "primary_category": "", + "proof": { + "block_bytes": 2423, + "block_sha256": "edf9916ff637e4465dd00eea26c9e89d30f4295f84ab53b58910e48e67676ef6", + "line": 1261 + }, + "published": "2026-10-21T08:35:16Z", + "slice": "mm", + "title": "LLMSeg: Training-Free Text-Prompted Image Segmentation with B-Splines", + "updated": "2026-10-21T08:35:16Z" + }, + { + "abstract_chars": 950, + "arxiv_id": "2610.29495v1", + "authors": [ + "Geetanjali Sharma", + "Aryan Jain", + "Dev Nagaich", + "Aditya Nigam", + "Raghavendra Ramachandra" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.29495", + "primary_category": "", + "proof": { + "block_bytes": 1906, + "block_sha256": "bd21ccad872b27dccb4d8a10ed478b1c84a2a2abafc22af9826ca571e71a274c", + "line": 1234 + }, + "published": "2026-10-21T09:50:08Z", + "slice": "mm", + "title": "Balancing Foundation Models and Trait-Specific Learning for Forehead-Crease Recognition", + "updated": "2026-10-21T09:50:08Z" + }, + { + "abstract_chars": 1699, + "arxiv_id": "2610.29552v1", + "authors": [ + "Xin Zhang", + "Haochen Wang", + "Beibei Lin", + "Zhaoxiang Zhang", + "Robby T. Tan", + "Jason Li", + "Dacheng Tao" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.29552", + "primary_category": "", + "proof": { + "block_bytes": 2753, + "block_sha256": "c06349a7bbe9e0d28b572abaa6a8d8767191ff6e8bbc4e5714a9ca2e8f27b0b2", + "line": 1201 + }, + "published": "2026-10-21T10:39:56Z", + "slice": "mm", + "title": "Generalized CycleGRPO for Fine-Grained Multimodal Understanding and Grounding", + "updated": "2026-10-21T10:39:56Z" + }, + { + "abstract_chars": 1581, + "arxiv_id": "2610.29581v1", + "authors": [ + "Martin Thi\u00dfen", + "Elke Hergenr\u00f6ther" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.29581", + "primary_category": "", + "proof": { + "block_bytes": 2409, + "block_sha256": "8a0be7d2083dafa62738a3a75837a927e1aad4b62940dcc278b440bc0d997d08", + "line": 1489 + }, + "published": "2026-10-21T11:22:58Z", + "slice": "mm2", + "title": "Unlocking Spatial Grounding in Flow-Matching Models via SNR Tuning", + "updated": "2026-10-21T11:22:58Z" + }, + { + "abstract_chars": 1096, + "arxiv_id": "2610.29590v1", + "authors": [ + "Jingzhe Zhang", + "Peixuan Zhang", + "Genying Li", + "Bing Ma", + "Shuchen Weng", + "Si Li", + "Boxin Shi" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.29590", + "primary_category": "", + "proof": { + "block_bytes": 2152, + "block_sha256": "87909b88567f026fe37b07fb064ddd11f7c5d56c603fec84c7213db976156886", + "line": 1456 + }, + "published": "2026-10-21T11:30:09Z", + "slice": "mm2", + "title": "CineEvolve: An Agentic Self-Evolution Framework for Cinematic Multi-Shot Video Generation", + "updated": "2026-10-21T11:30:09Z" + }, + { + "abstract_chars": 1517, + "arxiv_id": "2610.29642v1", + "authors": [ + "Yimin Wei", + "Hongruixuan Chen", + "Hao Zheng", + "Hao Liu", + "Jian Song", + "Yuting Zhu", + "Junshi Xia", + "Naoto Yokoya" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.29642", + "primary_category": "", + "proof": { + "block_bytes": 2564, + "block_sha256": "5a8c64691cd03f802ac9d4f5221285f296d8cb8b335043ffdd9c46327a930af7", + "line": 1166 + }, + "published": "2026-10-21T12:25:26Z", + "slice": "mm", + "title": "OpenEarth-OVS44: A Multimodal Remote Sensing Dataset for Open-Vocabulary Segmentation", + "updated": "2026-10-21T12:25:26Z" + }, + { + "abstract_chars": 1256, + "arxiv_id": "2610.30206v1", + "authors": [ + "Minsang Kim", + "Seungjun Baek" + ], + "categories": [ + "cs.LG", + "cs.AI" + ], + "doi": "", + "n_authors": 2, + "node": "2610.30206", + "primary_category": "", + "proof": { + "block_bytes": 2142, + "block_sha256": "0faa70313c48adbde520ac0fa072043209329550d8169eae61de629e2c38c5de", + "line": 79 + }, + "published": "2026-10-21T13:06:30Z", + "slice": "lc2", + "title": "MoEZip: Routing-Aware KV Cache Compression for Sparse Mixture-of-Experts LLMs", + "updated": "2026-10-21T13:06:30Z" + }, + { + "abstract_chars": 1323, + "arxiv_id": "2610.29740v1", + "authors": [ + "Md Shihabul Islam Shovo", + "Nishi Kanta Paul", + "Jamil Fayyad" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.29740", + "primary_category": "", + "proof": { + "block_bytes": 2218, + "block_sha256": "709745a506ff8761af54dab575434a6c2c06ec6507b53af0657b0b0ef67103bc", + "line": 1145 + }, + "published": "2026-10-21T13:39:07Z", + "slice": "mm", + "title": "APED-CXR: Adaptive Privileged Evidence Distillation for Chest X-Ray Grounding with Image-Only Inference", + "updated": "2026-10-21T13:39:07Z" + }, + { + "abstract_chars": 1478, + "arxiv_id": "2610.29768v1", + "authors": [ + "Linfei Li", + "Ruining Hu", + "Lin Zhang", + "Zhong Wang", + "Fengyi Zhang", + "Ying Shen", + "Binqiang Wang", + "Xin Zhang" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.29768", + "primary_category": "", + "proof": { + "block_bytes": 2640, + "block_sha256": "b05796ee0e26f95c68a18f9b449365fd010eb4bd4ea129b145fb785c21c8a9e7", + "line": 1109 + }, + "published": "2026-10-21T14:02:25Z", + "slice": "mm", + "title": "UniRAP: Towards Unified Part-level Physical Affordance Reasoning and Actionable Perception", + "updated": "2026-10-21T14:02:25Z" + }, + { + "abstract_chars": 1378, + "arxiv_id": "2610.29811v1", + "authors": [ + "Puru Vaish", + "Meelad Dashti", + "Christoph Brune", + "Pascal Mettes", + "Tatiana Tommasi", + "Nicola Strisciuglio" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 6, + "node": "2610.29811", + "primary_category": "", + "proof": { + "block_bytes": 2453, + "block_sha256": "5a98918ee8d28c883bff1a0c5b9a5d82569f6322e6dac96a896adeac3bc03a83", + "line": 1390 + }, + "published": "2026-10-21T14:34:51Z", + "slice": "mm2", + "title": "Compositionality with Primitives: A Unified View from Euclidean to Hyperbolic Vision-Language Models", + "updated": "2026-10-21T14:34:51Z" + }, + { + "abstract_chars": 1629, + "arxiv_id": "2610.29881v1", + "authors": [ + "DM BAPPY", + "Eunsu Kim", + "Hanjoo Lee", + "Sung Hak Lee", + "Sangjeong Ahn" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.29881", + "primary_category": "", + "proof": { + "block_bytes": 2615, + "block_sha256": "25a76c17d8a678d0b7030cc89b66052df4e727bb1385a4d48c8be6b73af8a308", + "line": 1363 + }, + "published": "2026-10-21T15:28:40Z", + "slice": "mm2", + "title": "Expandable Modality Experts for Medical Vision-Language Learning", + "updated": "2026-10-21T15:28:40Z" + }, + { + "abstract_chars": 1424, + "arxiv_id": "2610.29905v1", + "authors": [ + "Dai Lam Le", + "Minh Khoi Nguyen", + "Son Dinh Nguyen", + "Amir Reza Jafari", + "Viet Ha", + "Nguyen Son", + "Reza Farahbakhsh", + "Noel Crespi", + "Phi Le Nguyen" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.29905", + "primary_category": "", + "proof": { + "block_bytes": 2711, + "block_sha256": "3727f550bcd4eadf5cef9f4c6310e4cfd8aa364377a4f1c48f8a9180cd4632c8", + "line": 1324 + }, + "published": "2026-10-21T15:46:37Z", + "slice": "mm2", + "title": "ViBMR: A Large-Scale Multi-Sequence Brain MRI Dataset and Comprehensive Evaluation for Vietnamese Radiology Report Generation", + "updated": "2026-10-21T15:46:37Z" + }, + { + "abstract_chars": 1873, + "arxiv_id": "2610.29913v1", + "authors": [ + "Marcos Junca", + "Mauro Junca" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 2, + "node": "2610.29913", + "primary_category": "", + "proof": { + "block_bytes": 2928, + "block_sha256": "2235d30185f91514314a4d6c878b0f0fc7c78f7aa1b5ed74e1010af226f712c3", + "line": 1088 + }, + "published": "2026-10-21T15:53:17Z", + "slice": "mm", + "title": "Asking a Multimodal LLM Whether Someone Fell: Zero-Shot Screening of Low-Resolution Thermal Video in a Laboratory and an Occupied Home", + "updated": "2026-10-21T15:53:17Z" + }, + { + "abstract_chars": 1672, + "arxiv_id": "2610.30089v1", + "authors": [ + "Ruotong Liao", + "Meikel Kokowski", + "Xiaoxiao Sun", + "Yongqin Xian", + "Laura Bravo S\u00e1nchez", + "Shiye Su", + "Federico Tombari", + "Serena Yeung-Levy", + "Volker Tresp" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.30089", + "primary_category": "", + "proof": { + "block_bytes": 2899, + "block_sha256": "48bc1c1e13f76a4524133d547b9e5b490cb617e383534392145bd190ddb7767e", + "line": 1049 + }, + "published": "2026-10-21T17:37:58Z", + "slice": "mm", + "title": "ProactEgoMem: Benchmarking Proactive Memory in Streaming Egocentric Video", + "updated": "2026-10-21T17:37:58Z" + }, + { + "abstract_chars": 1810, + "arxiv_id": "2610.30097v1", + "authors": [ + "Likui Zhang", + "Zhe Zhu", + "Zhihao Zhan", + "Yibo Bai", + "Hanlin Wang", + "Dongwei Li", + "Bin Wang", + "Tianle Zhang", + "Xiaodan Liang", + "Liang Lin" + ], + "categories": [ + "cs.RO", + "cs.AI", + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.30097", + "primary_category": "", + "proof": { + "block_bytes": 3097, + "block_sha256": "ec77e161a06750cfbdae6b5eb0cc146ae2364ebd1c0786a76ff882008377b68c", + "line": 1281 + }, + "published": "2026-10-21T17:45:24Z", + "slice": "mm2", + "title": "AtomicRL: Atomic Reinforcement Learning for Long-Horizon Robotic Manipulation", + "updated": "2026-10-21T17:45:24Z" + }, + { + "abstract_chars": 1402, + "arxiv_id": "2610.30108v1", + "authors": [ + "Yanzhe Chen", + "Ziyi Yang", + "Jifeng Zhu", + "Qiming Huang", + "Ruihe An", + "Peiyao Xu", + "Hesen Yang", + "Runda Liu", + "Chang Gong", + "Zhijun Cao", + "Zechen Bai", + "Wenzheng Zeng", + "Yiqi Lin", + "Guoqiang Liang", + "Kevin Yuchen Ma", + "Kevin Qinghong Lin", + "Mike Zheng Shou" + ], + "categories": [ + "cs.RO", + "cs.AI", + "cs.CV", + "cs.MA", + "cs.MM" + ], + "doi": "", + "n_authors": 17, + "node": "2610.30108", + "primary_category": "", + "proof": { + "block_bytes": 3380, + "block_sha256": "8445695026a149ec37bc2da3f8713147b6f94f428918d6f0895b6338a09e55b0", + "line": 982 + }, + "published": "2026-10-21T17:52:48Z", + "slice": "mm", + "title": "Multimodal Embodied Agents: A Unified Capability-centric Perspective from Computer-Use to Robot-Use", + "updated": "2026-10-21T17:52:48Z" + }, + { + "abstract_chars": 1499, + "arxiv_id": "2610.30132v1", + "authors": [ + "Zhennan Wan", + "Jianfei Chen" + ], + "categories": [ + "cs.CL", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.30132", + "primary_category": "", + "proof": { + "block_bytes": 2356, + "block_sha256": "e1fdc69c7a20c9449d22df1a3fc7dfd4c9bf78090264253a31403b986df562e8", + "line": 408 + }, + "published": "2026-10-21T17:59:14Z", + "slice": "lc", + "title": "LongZero: Enhancing Long-Context Reasoning in LLMs from Zero Data", + "updated": "2026-10-21T17:59:14Z" + }, + { + "abstract_chars": 1525, + "arxiv_id": "2610.30326v1", + "authors": [ + "Bangpu Chen", + "Yaxuan Li", + "Shirui Peng", + "Xiangtian Si", + "Liuxin Chu", + "Xitong Cao", + "Hongbo Jin", + "Jiayu Ding" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.30326", + "primary_category": "", + "proof": { + "block_bytes": 2670, + "block_sha256": "36c1f37dea29ae1e2f4bb76cefcd45349ae416e787dbaeabf37bb4b15bdc205d", + "line": 946 + }, + "published": "2026-10-21T18:42:09Z", + "slice": "mm", + "title": "R4DGS: Referring Segmentation in 4D Gaussian Splatting", + "updated": "2026-10-21T18:42:09Z" + }, + { + "abstract_chars": 1527, + "arxiv_id": "2610.30592v1", + "authors": [ + "Minhyuk Seo", + "Minjae Lee", + "Chaeeun Lee", + "Wei Lin", + "Muhammad Jehanzeb Mirza", + "Tinne Tuytelaars", + "Jonghyun Choi" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.30592", + "primary_category": "", + "proof": { + "block_bytes": 2629, + "block_sha256": "073d500f1e145623d3e8a9cd44bbe00f7f41f4c86db7cded8ccf6c916327bfce", + "line": 912 + }, + "published": "2026-10-22T01:48:28Z", + "slice": "mm", + "title": "Visual Grounding First, Multimodal In-context Learning Follows", + "updated": "2026-10-22T01:48:28Z" + }, + { + "abstract_chars": 1344, + "arxiv_id": "2610.30634v1", + "authors": [ + "Aijing Yu", + "Kuangpu Guo", + "Jian Liang", + "Xiao-Yu Zhang" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.30634", + "primary_category": "", + "proof": { + "block_bytes": 2197, + "block_sha256": "fbb96e439f0ff0bcf4c03f0554ff57a194155d648a11bdbd5d3baa38b3b4dc59", + "line": 1257 + }, + "published": "2026-10-22T02:56:05Z", + "slice": "mm2", + "title": "FedBST: Bilateral Self-Training for Unsupervised Federated Classification", + "updated": "2026-10-22T02:56:05Z" + }, + { + "abstract_chars": 1581, + "arxiv_id": "2610.30680v1", + "authors": [ + "Shiming Chen", + "Shuhuang Chen", + "Salman Khan", + "Fahad Shahbaz Khan" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.30680", + "primary_category": "", + "proof": { + "block_bytes": 2439, + "block_sha256": "58c279549542e86078ced12c00bdb47e6ce1ee7bceacb77f26f45ec2e5bd6e79", + "line": 1232 + }, + "published": "2026-10-22T03:47:32Z", + "slice": "mm2", + "title": "Zero-Shot Domain Generalization via Domain Prompt Learning", + "updated": "2026-10-22T03:47:32Z" + }, + { + "abstract_chars": 1430, + "arxiv_id": "2610.30732v1", + "authors": [ + "Shiyang Zhang", + "Miao Yang", + "Zhengda Li", + "Yang Shao", + "Ruifang Zhai", + "Hui Peng", + "Peng Song" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.30732", + "primary_category": "", + "proof": { + "block_bytes": 2522, + "block_sha256": "a04f4e7d5e62111de41b4997db335361baa0647ffcf6a31cabdbfa54c590b774", + "line": 1199 + }, + "published": "2026-10-22T04:58:45Z", + "slice": "mm2", + "title": "SmolVLA-MoE: Sparse Mixture-of-Experts for Efficient Multi-Task Robotic Manipulation", + "updated": "2026-10-22T04:58:45Z" + }, + { + "abstract_chars": 1576, + "arxiv_id": "2610.30740v1", + "authors": [ + "Ryugo Morita", + "Shunsuke Kitada", + "Stanislav Frolov", + "Brian Bernhard Moser", + "Ko Watanabe", + "Riku Takahashi", + "Jinjia Zhou", + "Andreas Dengel" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.30740", + "primary_category": "", + "proof": { + "block_bytes": 2764, + "block_sha256": "6d70845463986c2d5ec6299a2b07420e2e0422f2c10eb789aa23912664c282fd", + "line": 1163 + }, + "published": "2026-10-22T05:11:07Z", + "slice": "mm2", + "title": "Where Did the Light Come From? Diagnosing Cast-Shadow Reasoning in VLMs and Borrowing the Missing Shadow Prior from Image Generation Models", + "updated": "2026-10-22T05:11:07Z" + }, + { + "abstract_chars": 1692, + "arxiv_id": "2610.30814v1", + "authors": [ + "Zhaolu Kang", + "Tailong Luo", + "Lei Wei", + "Guangyuan Dong", + "Sihan Liu", + "Yingjie He", + "Siheng Wang", + "Shuaibo Li", + "Rongchao Zhang", + "Zhen Tian", + "Richeng Xuan", + "Zhichao Hu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 12, + "node": "2610.30814", + "primary_category": "", + "proof": { + "block_bytes": 3004, + "block_sha256": "aeaa275645de88eff3615d81f44b7890ca08e5c1f2546b55c0440753d75cc0cc", + "line": 1115 + }, + "published": "2026-10-22T06:40:31Z", + "slice": "mm2", + "title": "DRILL: Training World Models to Improve Policies, Not Predict Pixels", + "updated": "2026-10-22T06:40:31Z" + }, + { + "abstract_chars": 1635, + "arxiv_id": "2610.30824v1", + "authors": [ + "Wencheng Ye", + "Anning Hu", + "Hongye Fang", + "Tianyi Wang", + "Junchi Yan" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.30824", + "primary_category": "", + "proof": { + "block_bytes": 2527, + "block_sha256": "b64c9c84be6c71bbd6fafd463b3667e7b61e0ab126a22b7b2c12f9b178961d54", + "line": 1089 + }, + "published": "2026-10-22T06:53:13Z", + "slice": "mm2", + "title": "Loop to Look Better: Learning Adaptive Depth for Question-Guided Perception in Vision-Language Models", + "updated": "2026-10-22T06:53:13Z" + }, + { + "abstract_chars": 1519, + "arxiv_id": "2610.30834v1", + "authors": [ + "Zhaolu Kang", + "Tailong Luo", + "Chenxin Li", + "Yingjie He", + "Zhenyu Yu", + "Fengyu Zhou", + "Jiachen Qian", + "Lei Wei", + "Shuang Chen", + "Jiachen Li", + "Eric Hanchen Jiang", + "Rongchao Zhang", + "Zhengtao Yao", + "Hoi Leong Lee", + "Guansu Wang", + "Kaiyue Zhou" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 16, + "node": "2610.30834", + "primary_category": "", + "proof": { + "block_bytes": 3067, + "block_sha256": "9931ad34c47ef769534645c9e9023f402ce95f7d23589acee30c988ed3e0c82e", + "line": 1029 + }, + "published": "2026-10-22T07:04:23Z", + "slice": "mm2", + "title": "RECAP: Looking Once Is Not Enough for Vision-Language Reasoning", + "updated": "2026-10-22T07:04:23Z" + }, + { + "abstract_chars": 1355, + "arxiv_id": "2610.30908v1", + "authors": [ + "Dominik Engel", + "Yousef Rajeh", + "Leon Sick", + "Ivan Viola" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 4, + "node": "2610.30908", + "primary_category": "", + "proof": { + "block_bytes": 2234, + "block_sha256": "2d1cfc62bc9683e08cb52448e7dca35c9abb2d6f48bc9c46a48bf00582ad2e23", + "line": 1005 + }, + "published": "2026-10-22T08:31:12Z", + "slice": "mm2", + "title": "Query-Time Calibration of CLIP Features for Open-Vocabulary 3D Segmentation", + "updated": "2026-10-22T08:31:12Z" + }, + { + "abstract_chars": 1565, + "arxiv_id": "2610.30913v1", + "authors": [ + "Nimrod Shabtay", + "Asaf Yehudai", + "Avihu Dekel", + "Eli Schwartz", + "Raja Giryes" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.30913", + "primary_category": "", + "proof": { + "block_bytes": 2446, + "block_sha256": "0bdbb06535227872ac1e034fb61ea71cff95bf8d7e1c8432fafedb13b6fa6411", + "line": 979 + }, + "published": "2026-10-22T08:34:24Z", + "slice": "mm2", + "title": "Watch and Learn: Teaching Visual In-Context Learning by Removing Textual Shortcuts", + "updated": "2026-10-22T08:34:24Z" + }, + { + "abstract_chars": 1743, + "arxiv_id": "2610.30926v2", + "authors": [ + "Songlin Yang", + "Zhe Wang", + "Xiaotong Zhao", + "Xi Wang", + "Ran Zhang", + "Shuai Li", + "Taiyi Wu", + "Songlian Li", + "Eric Liu", + "Alan Zhao", + "Anyi Rao" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 11, + "node": "2610.30926", + "primary_category": "", + "proof": { + "block_bytes": 2956, + "block_sha256": "8845caed8ccdebad0fa68b4ad341396be5c0c5eb409fddbdee753b791d0a553d", + "line": 868 + }, + "published": "2026-10-22T08:43:48Z", + "slice": "mm", + "title": "Making MLLM Latents Matter: Factor-Aware Predictive Learning for Cinematic Video Generation", + "updated": "2026-10-23T11:09:51Z" + }, + { + "abstract_chars": 1919, + "arxiv_id": "2610.30942v1", + "authors": [ + "David Hamlyn", + "Sunny Chaudhary", + "Jonathon Hare", + "Tasmiat Rahman" + ], + "categories": [ + "eess.IV", + "cs.AI", + "cs.CV", + "cs.LG" + ], + "doi": "10.1016/j.egyai.2026.100917", + "n_authors": 4, + "node": "2610.30942", + "primary_category": "", + "proof": { + "block_bytes": 3191, + "block_sha256": "1cfd5183798585e1335a33f503bec09a1a04c913fb7cf18e2b9f8da7aa2a5534", + "line": 839 + }, + "published": "2026-10-22T08:58:18Z", + "slice": "mm", + "title": "GateFormer: Forecast-Space Decomposition for Intra-Hour Solar Irradiance Prediction from Sky Images", + "updated": "2026-10-22T08:58:18Z" + }, + { + "abstract_chars": 1871, + "arxiv_id": "2610.30980v1", + "authors": [ + "Ignacy Kolton", + "Wenxuan Li", + "Zongwei Zhou", + "Jaros\u0142aw B. \u0106wik\u0142a", + "Arkadiusz Sitek", + "Pedro R. A. S. Bassi", + "Szymon P\u0142otka" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 7, + "node": "2610.30980", + "primary_category": "", + "proof": { + "block_bytes": 3062, + "block_sha256": "1ecc49e591a2d73c139818f998ac6f4cfd1203a902dcab844e7c04d242f3d360", + "line": 945 + }, + "published": "2026-10-22T09:26:17Z", + "slice": "mm2", + "title": "Diagnostic Loss: Asymmetric Supervision for Radiology Report Generation", + "updated": "2026-10-22T09:26:17Z" + }, + { + "abstract_chars": 1587, + "arxiv_id": "2610.31087v1", + "authors": [ + "Xiaoting Xie", + "Feng Qiao", + "Xianwei Zhang", + "Hailong Chen", + "Kaiwen Zheng", + "Joemon M. Jose", + "Xuri Ge", + "Yujun Li" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.31087", + "primary_category": "", + "proof": { + "block_bytes": 2673, + "block_sha256": "85e7215440c9b48cdd4381d2279f4fdc500162abad3d84a92d41bf98e33c4ddf", + "line": 804 + }, + "published": "2026-10-22T10:57:20Z", + "slice": "mm", + "title": "I$^2$-KAN: Interpretable Intra- and Inter-Modal Multi-Pathway Representation Learning for Multimodal Sentiment Analysis", + "updated": "2026-10-22T10:57:20Z" + }, + { + "abstract_chars": 1343, + "arxiv_id": "2610.31098v1", + "authors": [ + "Dor Tsur", + "Maor Ashkenazi", + "Maximilian Golub", + "Peter Hicks", + "Yaniv Galron", + "Talor Abramovich", + "Yoav Miron", + "Tiyasa Mitra", + "Bita Darvish Rouhani", + "Ran Zilberstein" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 10, + "node": "2610.31098", + "primary_category": "", + "proof": { + "block_bytes": 2538, + "block_sha256": "d788bc9879acdcf6a9d624f79be727d2b1698bb41346cc11e7b29900bc7d24a0", + "line": 367 + }, + "published": "2026-10-22T11:12:23Z", + "slice": "lc", + "title": "RIFT: KV Cache Compression for Draft Models with Complementary Compressibility Training", + "updated": "2026-10-22T11:12:23Z" + }, + { + "abstract_chars": 1291, + "arxiv_id": "2610.31135v1", + "authors": [ + "Aman Behera", + "Namit Solanki", + "Mehul Anand" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 3, + "node": "2610.31135", + "primary_category": "", + "proof": { + "block_bytes": 2393, + "block_sha256": "c34f29144243f34480b7edd2c9a65695c03861dd783c7fa762b0f8038bf74dcc", + "line": 344 + }, + "published": "2026-10-22T11:54:30Z", + "slice": "lc", + "title": "Mixing Matters: Evidence Position Bias Across Sequence Mixers in Long-Context Question Answering", + "updated": "2026-10-22T11:54:30Z" + }, + { + "abstract_chars": 1285, + "arxiv_id": "2610.31145v1", + "authors": [ + "Enzhe Zhao", + "Marco Fiorucci", + "Lamberto Ballan" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.31145", + "primary_category": "", + "proof": { + "block_bytes": 2104, + "block_sha256": "83a5d58c05b07eda87aa654b448ebe0bd718a05af840256e6cb75e80c9d87569", + "line": 924 + }, + "published": "2026-10-22T12:03:19Z", + "slice": "mm2", + "title": "RankAlign: Vision-Language Representation Alignment via Rank Transformation", + "updated": "2026-10-22T12:03:19Z" + }, + { + "abstract_chars": 1578, + "arxiv_id": "2610.31158v1", + "authors": [ + "Jiahao Meng", + "Qize Yang", + "Yuxuan Wang", + "Yunfei Chu", + "Wensi Dai", + "Jin Xu", + "Yunhai Tong" + ], + "categories": [ + "cs.CV", + "cs.CL" + ], + "doi": "", + "n_authors": 7, + "node": "2610.31158", + "primary_category": "", + "proof": { + "block_bytes": 2637, + "block_sha256": "09be1aaba46167cb54c0597710b2eac10070d515d6e34d98a65d16b728ea1d35", + "line": 771 + }, + "published": "2026-10-22T12:15:30Z", + "slice": "mm", + "title": "Beyond Watching and Searching: Benchmarking Agents for Video-centered Deep Research Reports", + "updated": "2026-10-22T12:15:30Z" + }, + { + "abstract_chars": 993, + "arxiv_id": "2610.31166v1", + "authors": [ + "Chenyuan Chen", + "Ran Ding", + "Lechen Zhang", + "Zewen He", + "Yoshihiko Nakamura" + ], + "categories": [ + "cs.RO", + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.31166", + "primary_category": "", + "proof": { + "block_bytes": 2178, + "block_sha256": "eab7edf3ae6fd1b03ca54e40693bc977b1919d0a144b3f53ae07722ab24787a3", + "line": 895 + }, + "published": "2026-10-22T12:24:25Z", + "slice": "mm2", + "title": "Memory before Goal: Role of Pre-History Memory for Humanoid Loco-Manipulation", + "updated": "2026-10-22T12:24:25Z" + }, + { + "abstract_chars": 1509, + "arxiv_id": "2610.31205v1", + "authors": [ + "Ronald Fecso", + "Jos\u00e9 Morano", + "Botond Fazekas", + "Paul Widmann-Sedlnitzky", + "Dorota Himel", + "Laetita Hinterhuber", + "Virginia Mares", + "Andreas Pollreisz", + "Hrvoje Bogunovi\u0107" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.31205", + "primary_category": "", + "proof": { + "block_bytes": 2730, + "block_sha256": "bccf69fa5c0a6b6dbd19d2fe81e6db6f50176d09f55e471a20ba7aa9db3a72ad", + "line": 732 + }, + "published": "2026-10-22T12:54:19Z", + "slice": "mm", + "title": "A Visual Grounding Benchmark for Retinal OCT with Multimodal Large Language Models", + "updated": "2026-10-22T12:54:19Z" + }, + { + "abstract_chars": 1626, + "arxiv_id": "2610.31282v1", + "authors": [ + "Changseon Yu", + "Hyeokjun Kweon" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 2, + "node": "2610.31282", + "primary_category": "", + "proof": { + "block_bytes": 2315, + "block_sha256": "6df292b2ba9f62933fec38f2d02385ea3df0a25e7c75809ce1b517dac3d2b0cf", + "line": 878 + }, + "published": "2026-10-22T13:48:41Z", + "slice": "mm2", + "title": "ReCoG: Relational Concept Graph for Training-Free Personalization", + "updated": "2026-10-22T13:48:41Z" + }, + { + "abstract_chars": 1684, + "arxiv_id": "2610.31284v1", + "authors": [ + "Raffaele Cali", + "Giuseppe Lando", + "Rosario Forte", + "Antonino Furnari" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 4, + "node": "2610.31284", + "primary_category": "", + "proof": { + "block_bytes": 2520, + "block_sha256": "a5be1c83ca4613cd81943b5ab6f677faea5b40c28188b58bd9be83fe5676a42c", + "line": 708 + }, + "published": "2026-10-22T13:49:30Z", + "slice": "mm", + "title": "Retrieval-Augmented Online Textual Memory for Episodic Memory Video Question Answering", + "updated": "2026-10-22T13:49:30Z" + }, + { + "abstract_chars": 1625, + "arxiv_id": "2610.31304v1", + "authors": [ + "Yue Zhou", + "Shujun Zhao", + "Xue Yang", + "Ruigang Li", + "Tianwen Zhang", + "Mengcheng Lan", + "Chaofeng Chen", + "Lingfei Ma", + "Hongjie He", + "Jonathan Li" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "10.1109/MGRS.2026.3696441", + "n_authors": 10, + "node": "2610.31304", + "primary_category": "", + "proof": { + "block_bytes": 3160, + "block_sha256": "24a573e30b1329cd942ffa3a5819da46dc95e355e5d7490d48822b94aeb72d08", + "line": 832 + }, + "published": "2026-10-22T14:03:29Z", + "slice": "mm2", + "title": "Data-Driven Vision-Language Models for Remote Sensing: A Survey", + "updated": "2026-10-22T14:03:29Z" + }, + { + "abstract_chars": 1078, + "arxiv_id": "2610.31329v1", + "authors": [ + "Tianming Liang", + "Junyi Pan", + "Yuxi Li", + "Canmiao Fu", + "Zhipeng Huang", + "Chong Sun", + "Chen Li", + "Jing Lyu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.31329", + "primary_category": "", + "proof": { + "block_bytes": 2102, + "block_sha256": "1a9a9915d3ff6324bd6e27763061b33368539ed3ded0411a5c5c8ed1fee268dd", + "line": 797 + }, + "published": "2026-10-22T14:19:50Z", + "slice": "mm2", + "title": "WeVisOne-VL: Unified Visual Perception from Objects to Pixels", + "updated": "2026-10-22T14:19:50Z" + }, + { + "abstract_chars": 1064, + "arxiv_id": "2610.31385v1", + "authors": [ + "Yufei Tong", + "Guanjie Cheng", + "Tianle Wu", + "Leilei Zhang", + "Hang Zheng", + "Peihan Wu", + "Jianwei Yin", + "Shuiguang Deng" + ], + "categories": [ + "cs.CV", + "cs.CL", + "cs.IR" + ], + "doi": "", + "n_authors": 8, + "node": "2610.31385", + "primary_category": "", + "proof": { + "block_bytes": 2341, + "block_sha256": "7c7800632cbfe71860da55ecf851d9e265340d9329d49ee871a7b6e8f134a125", + "line": 670 + }, + "published": "2026-10-22T14:52:47Z", + "slice": "mm", + "title": "A Task-Centric Survey of Long-Document Visual Question Answering: Taxonomy, Evolution, and Future Directions", + "updated": "2026-10-22T14:52:47Z" + }, + { + "abstract_chars": 1667, + "arxiv_id": "2610.31471v1", + "authors": [ + "Di Yang", + "Xiaochang Li", + "Muyang Liu", + "Yufei Wang", + "Yanhai Xiong" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.31471", + "primary_category": "", + "proof": { + "block_bytes": 2550, + "block_sha256": "78180a52a28433ce6dca3cfae3c660a7d0bba886fceec29dfa6045987b08895e", + "line": 771 + }, + "published": "2026-10-22T15:59:59Z", + "slice": "mm2", + "title": "Ask About the Right Moment: Training-Free Object Identity Reasoning for Video-Language Models", + "updated": "2026-10-22T15:59:59Z" + }, + { + "abstract_chars": 1691, + "arxiv_id": "2610.31478v1", + "authors": [ + "Khaled Waleed Dawoud", + "Muhammad Zaigham Zaheer", + "Khan Muhammad", + "Muhammad Haris Khan" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2610.31478", + "primary_category": "", + "proof": { + "block_bytes": 2771, + "block_sha256": "6ddb9afc97fd41fd688800d845484b10c8e7d0906c95da683d3f3be43fe15a62", + "line": 745 + }, + "published": "2026-10-22T16:03:47Z", + "slice": "mm2", + "title": "MoG-VLM: Efficient Video Anomaly Detection through Motion-Guided Vision-Language Models", + "updated": "2026-10-22T16:03:47Z" + }, + { + "abstract_chars": 1494, + "arxiv_id": "2610.31494v1", + "authors": [ + "Advait Gupta", + "Sachin Konan", + "Tom Yin", + "Gabriel Sarch", + "Zhuang Liu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.31494", + "primary_category": "", + "proof": { + "block_bytes": 2440, + "block_sha256": "7f47391cab6226acb7d935ff59a424c4a6fdb13e8959bb3a9ba805e89a9d47b3", + "line": 718 + }, + "published": "2026-10-22T16:13:35Z", + "slice": "mm2", + "title": "AgentVQA: A Unified Benchmark for Agentic Visual Understanding", + "updated": "2026-10-22T16:13:35Z" + }, + { + "abstract_chars": 1046, + "arxiv_id": "2610.31538v1", + "authors": [ + "Jihoon Hong", + "Alireza Kheirandish", + "Rohan Sanda", + "Sara Fridovich-Keil" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 4, + "node": "2610.31538", + "primary_category": "", + "proof": { + "block_bytes": 1939, + "block_sha256": "f6593ed070b75d752e61cabf3563f66fcc5c8812a52f004a5487acef8a1ba19f", + "line": 646 + }, + "published": "2026-10-22T16:46:09Z", + "slice": "mm", + "title": "LACToS: Local Anomaly Detection via Conditional Typicality of Superpixels", + "updated": "2026-10-22T16:46:09Z" + }, + { + "abstract_chars": 1372, + "arxiv_id": "2610.31566v1", + "authors": [ + "Ilan Theodoro", + "Jord\u00e3o Bragantini", + "Lo\u00efc A. Royer" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.31566", + "primary_category": "", + "proof": { + "block_bytes": 2141, + "block_sha256": "9285f0886bf21623cf955eef654059cf11df0c4281103567a9afa726cd223bd5", + "line": 698 + }, + "published": "2026-10-22T17:09:12Z", + "slice": "mm2", + "title": "CellTrack-Bench: Microscopic Cell Tracking Benchmark for Vision-Language Models", + "updated": "2026-10-22T17:09:12Z" + }, + { + "abstract_chars": 1375, + "arxiv_id": "2610.31670v2", + "authors": [ + "Yunfei Xie", + "Howard H. Qian", + "Shiyi Lan", + "Kaiyu Hang", + "Chen Wei" + ], + "categories": [ + "cs.CV", + "cs.LG", + "cs.RO" + ], + "doi": "", + "n_authors": 5, + "node": "2610.31670", + "primary_category": "", + "proof": { + "block_bytes": 2484, + "block_sha256": "5033ff1b430505ab091a27f2b3325c57cb4f6393ae9709d4b30041f6892bc293", + "line": 669 + }, + "published": "2026-10-22T17:59:51Z", + "slice": "mm2", + "title": "Sensorimotor Alignment: A Platonic Proxy for Embodied Policy Success", + "updated": "2026-10-23T05:34:10Z" + }, + { + "abstract_chars": 1424, + "arxiv_id": "2610.31803v1", + "authors": [ + "Xiaopeng Zhang", + "Luzhe Sun", + "Yiqing Xu", + "Matthew R. Walter" + ], + "categories": [ + "cs.CV", + "cs.RO" + ], + "doi": "", + "n_authors": 4, + "node": "2610.31803", + "primary_category": "", + "proof": { + "block_bytes": 2467, + "block_sha256": "b0b8dfdff0cb00862a68b90a87ace14ecac45e2b418e7a10513797aab39ab675", + "line": 620 + }, + "published": "2026-10-22T18:41:21Z", + "slice": "mm", + "title": "StackGen3D: Stable 3D Block Stack Generation from Multiview Silhouettes", + "updated": "2026-10-22T18:41:21Z" + }, + { + "abstract_chars": 1820, + "arxiv_id": "2610.31835v1", + "authors": [ + "Jiaxi Liu", + "Keshu Wu", + "Weizhe Tang", + "Bofeng Cao", + "Sikai Chen", + "Xiaopeng Li", + "Steven T. Parker", + "Bin Ran" + ], + "categories": [ + "cs.CV", + "cs.RO" + ], + "doi": "", + "n_authors": 8, + "node": "2610.31835", + "primary_category": "", + "proof": { + "block_bytes": 3085, + "block_sha256": "d63fd8d2d82363e181dfd9ee300efe3e4d022206f51a02ad3f1874704d909cf1", + "line": 632 + }, + "published": "2026-10-22T19:14:17Z", + "slice": "mm2", + "title": "SAGE: A hybrid vision-language and geometry framework for work-zone pathway prediction under temporary traffic control", + "updated": "2026-10-22T19:14:17Z" + }, + { + "abstract_chars": 1838, + "arxiv_id": "2610.31845v1", + "authors": [ + "Chubin Zhang", + "Changyuan Wang", + "Yirui Wang", + "Ao Li", + "Shilin Ma", + "Yue Su", + "Cai Zhou", + "Xiuwei Xu", + "Tianle Zhang", + "Yansong Tang" + ], + "categories": [ + "cs.RO", + "cs.CV" + ], + "doi": "", + "n_authors": 10, + "node": "2610.31845", + "primary_category": "", + "proof": { + "block_bytes": 3139, + "block_sha256": "b8d96955465e8c21307390c4ee1f446149c7d0a98312bc775fea273362192c99", + "line": 589 + }, + "published": "2026-10-22T19:28:43Z", + "slice": "mm2", + "title": "EgoForesight: Effectively Scaling Policy Learning with Noisy Egocentric Actions", + "updated": "2026-10-22T19:28:43Z" + }, + { + "abstract_chars": 1144, + "arxiv_id": "2610.31898v1", + "authors": [ + "Blessing Agyei Kyem", + "Richard Dzinyela", + "Joshua Kofi Asamoah", + "Eugene Denteh", + "Andrews Danyo", + "Solomon Owusu-Ansah", + "Dickson Gyimah Asiedu", + "Armstrong Aboah" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 8, + "node": "2610.31898", + "primary_category": "", + "proof": { + "block_bytes": 2334, + "block_sha256": "a01907019dfb62706cc41610903382c02f48fc0bb81ce4e97f5f056b45f3d09b", + "line": 553 + }, + "published": "2026-10-22T20:52:22Z", + "slice": "mm2", + "title": "StateBridge: Phase- and Track-Grounded Reasoning for Synthetic-to-Real Traffic Video Captioning and VQA", + "updated": "2026-10-22T20:52:22Z" + }, + { + "abstract_chars": 1539, + "arxiv_id": "2610.31911v1", + "authors": [ + "Keqi Deng", + "Ruchao Fan", + "Jinyu Li" + ], + "categories": [ + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.31911", + "primary_category": "", + "proof": { + "block_bytes": 2303, + "block_sha256": "776fa70a831723ee304119822b7164042a3af059b576b4b9c970ee1e7c254f10", + "line": 324 + }, + "published": "2026-10-22T21:04:07Z", + "slice": "lc", + "title": "LazyFlash: Forward-Dense, Backward-Sparse Attention for Accelerated Long-Context Fine-Tuning", + "updated": "2026-10-22T21:04:07Z" + }, + { + "abstract_chars": 1528, + "arxiv_id": "2610.31945v1", + "authors": [ + "Aleph Alpha", + ":", + "Moritz Althaus", + "Artur Baranowski", + "Michael Barlow", + "Fabien C. Y. Benureau", + "Felix Berkenkamp", + "Amrita Bhattacherjee", + "Lukas Bl\u00fcbaum", + "Duncan Blythe", + "Augustijn de Boer", + "Bastian Boll", + "Thomas F. Burns", + "Bj\u00f6rn Deiseroth", + "Niko D\u00fcrr", + "B\u00e9ni Bal\u00e1zs Egressy", + "Niklas Finken", + "Niklas Freymuth", + "Fabian Gebhart", + "Max Hammer", + "Bastian Harren", + "Andreas Hartel", + "Johann Higl", + "Steffen Hirschmann", + "Pablo Iyu Guerrero", + "Yasser Jadidi", + "Andreas Jagusch", + "Mitja Kleider", + "Markus Klein", + "Jonas Knupp", + "Murali Kondragunta", + "Garwin Lechner", + "Dominik L\u00ea-Kellner", + "Jurek Leonhardt", + "Jiaze Li", + "Sohir Maskey", + "Omar Mehio", + "Pit Neitemeier", + "Letitia Parcalabescu", + "Alejandro Petry Pacheco", + "Pranav Ragupathy", + "Martin Reinhardt", + "Peter Rodenkirch Nfissi", + "Dylan Rodriquez", + "Leonard Salewski", + "Raziye Sari", + "Jordan Sassoon", + "Ivo Schaper", + "Ilhan Scheer", + "Frank Schneider", + "Philipp Scholl", + "Lukas Schott", + "Eric Schreiber", + "Pablo Schumacher", + "Alessio Serra", + "Philipp Siedler", + "Prabhu Teja Sivaprasad", + "Mohamed Soliman", + "Till Speicher", + "Volker Stampa", + "Simon Thel", + "Serge Thilges", + "Irina Vidal Migall\u00f3n", + "Denis Wa\u00dfmann", + "Samuel Weinbach", + "Sascha Wirges", + "Michael W\u00fcthrich", + "Alexei Zacharov" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 68, + "node": "2610.31945", + "primary_category": "", + "proof": { + "block_bytes": 6416, + "block_sha256": "6485f84cf04e4a36e89d56a4dda8f3074d5930f665fcf769782502b8b3a823c7", + "line": 105 + }, + "published": "2026-10-22T21:45:10Z", + "slice": "lc", + "title": "Kolibri: A Sovereign European Model on the Pareto Frontier", + "updated": "2026-10-22T21:45:10Z" + }, + { + "abstract_chars": 1480, + "arxiv_id": "2610.31986v1", + "authors": [ + "Xianglong Wang", + "Neil Rodrigues", + "Pei Guo", + "Yiru Fang", + "Kevin Beussman", + "Shuyang Wang", + "Jingzhi Wang", + "Liangju Li", + "Shunyao Xu", + "Zhongwei Cheng", + "Wei Li", + "Lin Chen" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 12, + "node": "2610.31986", + "primary_category": "", + "proof": { + "block_bytes": 2810, + "block_sha256": "58f566efa785a6f389cc479dfa274810151db3b61bd644b26b3787ed9653003a", + "line": 505 + }, + "published": "2026-10-22T23:04:49Z", + "slice": "mm2", + "title": "OpenHome: From Perception to Insight in Smart-Home Camera Videos", + "updated": "2026-10-22T23:04:49Z" + }, + { + "abstract_chars": 1578, + "arxiv_id": "2610.32013v1", + "authors": [ + "Shunshun Gu", + "Enze Zhang", + "Ming Pei", + "Hang Zhou", + "Xiao Luo" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.32013", + "primary_category": "", + "proof": { + "block_bytes": 2535, + "block_sha256": "4cf052a880fb904e3d0e88295673d34b1f4b77f6ab532d03e3fabf158a998225", + "line": 478 + }, + "published": "2026-10-23T00:24:44Z", + "slice": "mm2", + "title": "MAGIC: Margin-gated Contrastive Debiasing with Evidence Restoration for VLM Test-time Robustness Scaling", + "updated": "2026-10-23T00:24:44Z" + }, + { + "abstract_chars": 1733, + "arxiv_id": "2610.32073v1", + "authors": [ + "Mulugeta Weldezgina Asres", + "Lei Jiao", + "Christian Walter Omlin" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32073", + "primary_category": "", + "proof": { + "block_bytes": 2703, + "block_sha256": "4f0d9b4fcf2f2e168c0d39b3efb64399ea00f70899caf788c8b48148e6a43532", + "line": 598 + }, + "published": "2026-10-23T02:19:42Z", + "slice": "mm", + "title": "Guided Zero-Shot Anomaly Explanation for Anonymized Crowd Video Monitoring: Context, Categorization, and Spatial Localization", + "updated": "2026-10-23T02:19:42Z" + }, + { + "abstract_chars": 1567, + "arxiv_id": "2610.32146v1", + "authors": [ + "Mingyang Gao", + "Yuwei Wu", + "Shiyu Luo", + "Wei Wu", + "Xiaomeng Fan", + "Qihao Lv", + "Haoyu Zhang", + "Rui Gao", + "Bingzhen Liu", + "Zhi Gao", + "Che Sun" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 11, + "node": "2610.32146", + "primary_category": "", + "proof": { + "block_bytes": 2829, + "block_sha256": "bdcac5caa32106133c96b2003f5ef5619d25810237b806c846dde177a2412a10", + "line": 553 + }, + "published": "2026-10-23T04:25:17Z", + "slice": "mm", + "title": "Separating Angular Alignment from Radial Ordering in Hyperbolic Vision-Language Models", + "updated": "2026-10-23T04:25:17Z" + }, + { + "abstract_chars": 1372, + "arxiv_id": "2610.32177v1", + "authors": [ + "Khai Loong Aw", + "Klemen Kotar", + "Baihan Zhang", + "Yifan Liu", + "Lilian Chen", + "Atlas Kazemian", + "Rahul Venkatesh", + "Daniel Yamins" + ], + "categories": [ + "cs.AI", + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 8, + "node": "2610.32177", + "primary_category": "", + "proof": { + "block_bytes": 2568, + "block_sha256": "e450ef0252a23be267937cb32ac57f7ac9aebd5fc24059f259a330d9453d2bed", + "line": 396 + }, + "published": "2026-10-23T05:24:02Z", + "slice": "mm2", + "title": "$\u03a8$-0.6: Adaptive Streams of Thought in a Unified Vision-Language World Model", + "updated": "2026-10-23T05:24:02Z" + }, + { + "abstract_chars": 1230, + "arxiv_id": "2610.32182v1", + "authors": [ + "Muhammad Zeeshan Karamat", + "Syed Talal Hassan", + "Christiana Chamon Garcia" + ], + "categories": [ + "cs.CV", + "cs.CL", + "cs.CR", + "cs.LG" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32182", + "primary_category": "", + "proof": { + "block_bytes": 2333, + "block_sha256": "97f9b033413d95a76884f51c1f9c364da7e13df9f7f796a2195160e27721933e", + "line": 372 + }, + "published": "2026-10-23T05:28:49Z", + "slice": "mm2", + "title": "Depth-Dependent Safety Geometry in Vision-Language Models: Layer-Wise Localization and Bidirectional Refusal Control", + "updated": "2026-10-23T05:28:49Z" + }, + { + "abstract_chars": 1148, + "arxiv_id": "2610.32213v1", + "authors": [ + "Seiya Tokui", + "Shoichiro Yamaguchi", + "Sosuke Kobayashi" + ], + "categories": [ + "cs.LG", + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32213", + "primary_category": "", + "proof": { + "block_bytes": 2043, + "block_sha256": "e099bbe1437c3aab047602ca1d3c0a150fd757aca708c2277af5f76e0b5792e5", + "line": 83 + }, + "published": "2026-10-23T06:08:34Z", + "slice": "lc", + "title": "Head Dimension Matters in Language Models for Long-Context Retrieval", + "updated": "2026-10-23T06:08:34Z" + }, + { + "abstract_chars": 1505, + "arxiv_id": "2610.32220v1", + "authors": [ + "Parsa Esmaeilkhani", + "Longin Jan Latecki" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 2, + "node": "2610.32220", + "primary_category": "", + "proof": { + "block_bytes": 2227, + "block_sha256": "c9a3fac25a45eef1e80517756e0234da57a62784cd4ff65f898427d4a1fedbe5", + "line": 355 + }, + "published": "2026-10-23T06:16:32Z", + "slice": "mm2", + "title": "Angular Supervision for Visual Object Grounding in Autoregressive Vision-Language Models", + "updated": "2026-10-23T06:16:32Z" + }, + { + "abstract_chars": 1191, + "arxiv_id": "2610.32263v1", + "authors": [ + "Xiaobo Zhu", + "Shiwei Wu", + "Yu An", + "Yuechen Tao", + "He Sun", + "Song Zhang", + "Jianbo Wang", + "Xiaojing Wang", + "Junwei Liu", + "Wei Guo", + "Yanfei Shao", + "Xuan Zhao", + "Jiangwei Xiao", + "Wenbo Niu", + "Bo Wei", + "Yuhan Wang", + "Gang Hu", + "Fei Liu", + "Kunshan He", + "Chongwei Chi", + "Jianqiang Tang", + "Kang Zhang", + "Jie Tian", + "Zhenyu Liu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 24, + "node": "2610.32263", + "primary_category": "", + "proof": { + "block_bytes": 3125, + "block_sha256": "aab689e72c53efccc7a4572a62a6d5470655a5d744a90ab7b929fc834ac5aaed", + "line": 470 + }, + "published": "2026-10-23T07:17:28Z", + "slice": "mm", + "title": "LapaFM: A Laparoscopic Foundation Model via Multi-Stage Continual Learning", + "updated": "2026-10-23T07:17:28Z" + }, + { + "abstract_chars": 571, + "arxiv_id": "2610.32294v1", + "authors": [ + "Gabriel Tseng", + "Favyen Bastani", + "Patrick Alan Johnson", + "Yawen Zhang", + "Piper Wolters", + "Ando Shah", + "Hadrien Sablon", + "Joseph Redmon", + "Heather DeHaven", + "Rachel Ratner", + "Sasha Levy", + "Jordan Steward", + "Katrina Midgley", + "Andrew Howe", + "Hunter Pitelka", + "Ted Schmitt" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 16, + "node": "2610.32294", + "primary_category": "", + "proof": { + "block_bytes": 2063, + "block_sha256": "08a09d8a97eaa24f8bcb93c0a4ea2f0f1e9e083fa478c4b495855f01aeb50bc9", + "line": 411 + }, + "published": "2026-10-23T07:53:00Z", + "slice": "mm", + "title": "OlmoEarth v1.3: Embeddings", + "updated": "2026-10-23T07:53:00Z" + }, + { + "abstract_chars": 1586, + "arxiv_id": "2610.32311v1", + "authors": [ + "Radoslaw Malek", + "Szymon Soltysiak", + "Aleksandra Kawala-Sterniuk", + "Piotr Szymanski" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "10.1145/3849726.3856091", + "n_authors": 4, + "node": "2610.32311", + "primary_category": "", + "proof": { + "block_bytes": 2912, + "block_sha256": "ace3348ddd61e9c2f5e8eb8318bc0ccfe4f34eddb0d7b1b690f792c1d29a49bd", + "line": 384 + }, + "published": "2026-10-23T08:11:23Z", + "slice": "mm", + "title": "GeoLEON-CLIP: Graph-Anchored Multimodal Contrastive Learning for Geographic Region Representation", + "updated": "2026-10-23T08:11:23Z" + }, + { + "abstract_chars": 1235, + "arxiv_id": "2610.32332v1", + "authors": [ + "Yanhao Jia", + "Yi Zhu", + "Yiran Zhong", + "Weigao Sun", + "Feida Zhu", + "Pengkun Jiao", + "Sihan Yang", + "Ming Ma", + "Steven Hoi", + "Erik Cambria" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.CL", + "cs.MM" + ], + "doi": "", + "n_authors": 10, + "node": "2610.32332", + "primary_category": "", + "proof": { + "block_bytes": 2652, + "block_sha256": "50384402f59df56bac04861fb616c18cb079966963a122013fc8e2fb81c5fcdf", + "line": 339 + }, + "published": "2026-10-23T08:28:29Z", + "slice": "mm", + "title": "4DMemory: Benchmarking Long-Horizon Spatiotemporal Memory with Harness-Augmented Agents", + "updated": "2026-10-23T08:28:29Z" + }, + { + "abstract_chars": 1482, + "arxiv_id": "2610.32360v1", + "authors": [ + "Oliver Wei\u00dfl", + "Eduardo Breitembach", + "Andrea Stocco" + ], + "categories": [ + "cs.CV", + "cs.SE" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32360", + "primary_category": "", + "proof": { + "block_bytes": 2310, + "block_sha256": "2fc43508d0cd58d702761dec55f602073ea10fc1365bdf8ad7f83f435614e720", + "line": 334 + }, + "published": "2026-10-23T08:52:02Z", + "slice": "mm2", + "title": "Search-Based Testing of Modality Sensitivity in Vision Language Models", + "updated": "2026-10-23T08:52:02Z" + }, + { + "abstract_chars": 1712, + "arxiv_id": "2610.32423v1", + "authors": [ + "Somraj Gautam", + "Gaurav Harit" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.CL" + ], + "doi": "", + "n_authors": 2, + "node": "2610.32423", + "primary_category": "", + "proof": { + "block_bytes": 2579, + "block_sha256": "a9e567d59068bbd6bb71de656acb8e170bbd2d2e543c85ae88482e0e1004f126", + "line": 315 + }, + "published": "2026-10-23T09:50:37Z", + "slice": "mm2", + "title": "Cycle-of-Thought: Self-Evaluative Iterative Reasoning for Table Visual Question Answering in Document Images", + "updated": "2026-10-23T09:50:37Z" + }, + { + "abstract_chars": 1540, + "arxiv_id": "2610.32440v1", + "authors": [ + "Mayank Nautiyal", + "Tianru Zhang", + "Li Ju", + "Ekta Vats", + "Prashant Singh" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 5, + "node": "2610.32440", + "primary_category": "", + "proof": { + "block_bytes": 2491, + "block_sha256": "c08bafd873af4018cb450224001e2425a8c5e38366bc5295d1c2ccbb203f0c0a", + "line": 288 + }, + "published": "2026-10-23T10:06:50Z", + "slice": "mm2", + "title": "PROVE: Probabilistic Visual Grounding via Patch-Level Evidence for Vision-Language Models", + "updated": "2026-10-23T10:06:50Z" + }, + { + "abstract_chars": 1638, + "arxiv_id": "2610.32442v1", + "authors": [ + "Aishwarya Venkataramanan", + "Christian Ickler", + "Joachim Denzler" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32442", + "primary_category": "", + "proof": { + "block_bytes": 2489, + "block_sha256": "17c6ed0ed15eece690f145009f3c3ebf6a79edfb792bc496105ddb08de787630", + "line": 318 + }, + "published": "2026-10-23T10:07:27Z", + "slice": "mm", + "title": "Learning Fine-Grained Visual Classification with Text as Privileged Information via Multimodal Distillation", + "updated": "2026-10-23T10:07:27Z" + }, + { + "abstract_chars": 1856, + "arxiv_id": "2610.32478v1", + "authors": [ + "Cristian Tommasino", + "Antonio M. Rinaldi" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.32478", + "primary_category": "", + "proof": { + "block_bytes": 2795, + "block_sha256": "011a5025f8c2044638e59a124f976508d70b725a7e7992a2da3ac2a6f27ed144", + "line": 269 + }, + "published": "2026-10-23T10:47:40Z", + "slice": "mm2", + "title": "PathJev: Decision-Native Vision-Language Modelling for Histopathology", + "updated": "2026-10-23T10:47:40Z" + }, + { + "abstract_chars": 1725, + "arxiv_id": "2610.32483v1", + "authors": [ + "Shao Zhang", + "Hangfan Zhang", + "Yuanyuan Shi", + "Hao Li", + "Min-Le Su", + "Kangcong Li", + "Jingping Wang", + "Chunjiang Mu", + "Chen Zhang", + "Yang Chen", + "Bo Zhang", + "Shuyue Hu" + ], + "categories": [ + "cs.AI", + "cs.CL", + "cs.SE" + ], + "doi": "", + "n_authors": 12, + "node": "2610.32483", + "primary_category": "", + "proof": { + "block_bytes": 3159, + "block_sha256": "423e93b5e4d91123f6efa980c832fea5ccac2d3e5ac3b0f81650f5b73fb996b1", + "line": 33 + }, + "published": "2026-10-23T10:57:54Z", + "slice": "lc", + "title": "When Agents Fail: Model or Harness--Who's to Blame?", + "updated": "2026-10-23T10:57:54Z" + }, + { + "abstract_chars": 1779, + "arxiv_id": "2610.32485v1", + "authors": [ + "Shengchao Chen", + "Ting Shu", + "Sufen Ren" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32485", + "primary_category": "", + "proof": { + "block_bytes": 2643, + "block_sha256": "2873229968c568dfba58e75fdad172064be412737811015410646f48a9e59890", + "line": 248 + }, + "published": "2026-10-23T11:02:02Z", + "slice": "mm2", + "title": "PCFBench: How Far Can Large Vision-Language Models Go in Physics-aware Photonic Inverse Design?", + "updated": "2026-10-23T11:02:02Z" + }, + { + "abstract_chars": 1633, + "arxiv_id": "2610.32486v1", + "authors": [ + "Khaled Waleed Dawoud", + "Muhammad Haris Khan" + ], + "categories": [ + "cs.CV", + "cs.AI", + "cs.LG" + ], + "doi": "", + "n_authors": 2, + "node": "2610.32486", + "primary_category": "", + "proof": { + "block_bytes": 2546, + "block_sha256": "dbd005f350a9554f247f2f9fa868b8ed05d69fad21ef1d5faeab2c68901c0d27", + "line": 228 + }, + "published": "2026-10-23T11:02:16Z", + "slice": "mm2", + "title": "Efficient Zero-Shot Video Anomaly Detection via Signal-Aware Adaptive Fusion (SAAF)", + "updated": "2026-10-23T11:02:16Z" + }, + { + "abstract_chars": 1415, + "arxiv_id": "2610.32612v1", + "authors": [ + "Zhiran Yan", + "Savankumar Bhanderi", + "Sourabh Lolge", + "Rui Song", + "Girdharbhai Paneliya", + "Shiva Agrawal", + "Gordon Elger" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 7, + "node": "2610.32612", + "primary_category": "", + "proof": { + "block_bytes": 2516, + "block_sha256": "497bbf069e04f79d35cb88acdebbb97eb2c201fbf2510bd702cf7a8d56f7b18f", + "line": 285 + }, + "published": "2026-10-23T13:33:39Z", + "slice": "mm", + "title": "DriveOSS: Dataset and Benchmark for 3D Anomaly Segmentation and Open-set Semantic Segmentation in Autonomous Driving", + "updated": "2026-10-23T13:33:39Z" + }, + { + "abstract_chars": 1514, + "arxiv_id": "2610.32635v1", + "authors": [ + "Zhile Guan", + "Xu Jiang", + "Yule Duan", + "Gongbo Zhang", + "Shuyu Wang", + "Xiao Chen", + "Jian Zhang" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 7, + "node": "2610.32635", + "primary_category": "", + "proof": { + "block_bytes": 2600, + "block_sha256": "d1eb82c733f3aa2e1c037389118626fdb42a9d1f585a4c0e7aa53ad221451cea", + "line": 194 + }, + "published": "2026-10-23T13:46:53Z", + "slice": "mm2", + "title": "EditJev: System One Routing for Image Editing Models", + "updated": "2026-10-23T13:46:53Z" + }, + { + "abstract_chars": 1637, + "arxiv_id": "2610.32664v1", + "authors": [ + "Zhensheng Hu", + "Guanglong Xu", + "Guanqiang Hu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32664", + "primary_category": "", + "proof": { + "block_bytes": 2404, + "block_sha256": "f986aa1180b38581bab0d02d8aa40e03bd85093dec9b40f08d39eac0e31ac2a1", + "line": 265 + }, + "published": "2026-10-23T14:07:26Z", + "slice": "mm", + "title": "The Answer Knows Where to Look: Zooming before MLLMs Answer under Visual-Token Budgets", + "updated": "2026-10-23T14:07:26Z" + }, + { + "abstract_chars": 929, + "arxiv_id": "2610.32697v1", + "authors": [ + "Haoxiang Tang", + "Dong Zhou", + "Shen Tan", + "Minxuan Jiang", + "Xitong Li" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 5, + "node": "2610.32697", + "primary_category": "", + "proof": { + "block_bytes": 1861, + "block_sha256": "cf6170fce2b4498f4adc222523527f8f0c3308a4e4eb6785b192d1f40aa5ec7e", + "line": 167 + }, + "published": "2026-10-23T14:21:58Z", + "slice": "mm2", + "title": "SP-Guide: Enhancing Aerial Vision-Language Navigation with Spatial Priors", + "updated": "2026-10-23T14:21:58Z" + }, + { + "abstract_chars": 1853, + "arxiv_id": "2610.32781v1", + "authors": [ + "Juan Felipe Duran", + "Arthur Tobler", + "Martin Valli\u00e8res" + ], + "categories": [ + "cs.CL", + "cs.AI", + "cs.IR" + ], + "doi": "", + "n_authors": 3, + "node": "2610.32781", + "primary_category": "", + "proof": { + "block_bytes": 2932, + "block_sha256": "8679200feb50419a5e2d473ec0783e0287fce8cf422fb5c103a32e3198a18bba", + "line": 10 + }, + "published": "2026-10-23T15:28:39Z", + "slice": "lc", + "title": "Every Edge Needs a Quote: Building a Quote-Grounded Knowledge Graph of Healthcare Software Adoption with Language-Model Agents", + "updated": "2026-10-23T15:28:39Z" + }, + { + "abstract_chars": 1437, + "arxiv_id": "2610.32784v1", + "authors": [ + "Yonghui Niu", + "Yuhao Ji", + "Chang Nie", + "Jiao Zhang", + "Yilong Li", + "Junlan Feng", + "Ran He", + "Caifeng Shan", + "Chaoyou Fu" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 9, + "node": "2610.32784", + "primary_category": "", + "proof": { + "block_bytes": 2672, + "block_sha256": "f4fa986bb9a35e1cfb8639c709dbd9ff9e32ee40572fa7e5607cd370898461ec", + "line": 226 + }, + "published": "2026-10-23T15:32:41Z", + "slice": "mm", + "title": "Video-MemComp: Taylor-Guided Sensitivity-Aware Memory Management for Streaming Video Understanding", + "updated": "2026-10-23T15:32:41Z" + }, + { + "abstract_chars": 1118, + "arxiv_id": "2610.32835v1", + "authors": [ + "Ankit Gupta", + "Akshat Pandya", + "Christoph Adami", + "Emily Dolson" + ], + "categories": [ + "cs.CV", + "cs.CL", + "cs.HC" + ], + "doi": "", + "n_authors": 4, + "node": "2610.32835", + "primary_category": "", + "proof": { + "block_bytes": 2195, + "block_sha256": "74e081ef59981dadeb8b9dcc2858a9518673afc1324d52ea9f94a628c2ec590f", + "line": 200 + }, + "published": "2026-10-23T16:09:57Z", + "slice": "mm", + "title": "SPOOK: Sparse Pixel Optimization for Off-Manifold Knowledge in Vision Encoders", + "updated": "2026-10-23T16:09:57Z" + }, + { + "abstract_chars": 1821, + "arxiv_id": "2610.32880v1", + "authors": [ + "Yi Qin", + "Marawan Elbatel", + "Shanshan Song", + "Taoran Huang", + "Jiarong Guo", + "Ningshu Li", + "Lehan Wang", + "Chenxu Zhao", + "Jiexin He", + "Machteld J. Boonstra", + "Stephan van der Zwaard", + "Marielle C. van de Veerdonk", + "Pere Lopez-Gutierrez", + "Lydia Dux-Santoy", + "Andrea Guala", + "Enrique Almar-Munoz", + "Sebastian Johannes Reinstadler", + "Radek Debiec", + "Yi-Hang Zhu", + "Huiyu Zhou", + "Adrian P Cheong", + "Yike Guo", + "Agnes Mayr", + "Karim Lekadir", + "Yong Jiang", + "Nilesh J. Samani", + "Dacheng Tao", + "Folkert W. Asselbergs", + "Hongwen Fei", + "Alex PW Lee", + "Xiaomeng Li" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 31, + "node": "2610.32880", + "primary_category": "", + "proof": { + "block_bytes": 4294, + "block_sha256": "9d19f8360e04c40b2061dea09d8b5ad1ed13ae5ec3cb54a668846a7dd9cb0295", + "line": 96 + }, + "published": "2026-10-23T16:47:01Z", + "slice": "mm", + "title": "Multimodal Generative AI Assists Comprehensive Echocardiographic Interpretation", + "updated": "2026-10-23T16:47:01Z" + }, + { + "abstract_chars": 927, + "arxiv_id": "2610.32890v1", + "authors": [ + "Shubham Gupta", + "Siva Reddy", + "Perouz Taslakian", + "Valentina Zantedeschi", + "Cem Subakan" + ], + "categories": [ + "cs.AI", + "cs.CV" + ], + "doi": "", + "n_authors": 5, + "node": "2610.32890", + "primary_category": "", + "proof": { + "block_bytes": 1870, + "block_sha256": "1c5bcdf9101707e782cb51099c30eaf44f22b97c59d89f85e7e1e9b79fb685c3", + "line": 69 + }, + "published": "2026-10-23T16:57:48Z", + "slice": "mm", + "title": "Closing the Modality Gap via Simplex-Constrained Representations", + "updated": "2026-10-23T16:57:48Z" + }, + { + "abstract_chars": 1915, + "arxiv_id": "2610.32894v1", + "authors": [ + "Panagiotis Koromilas", + "Eleanna Vali", + "Diogenis Antonopoulos", + "Eleni Saka", + "Dimitris Christofis", + "Nikolaos Ioannis Bountos", + "Konstantin Klemmer", + "Ioannis Papoutsis", + "Yannis Panagakis", + "Mihalis A. Nicolaou" + ], + "categories": [ + "cs.CV", + "cs.LG" + ], + "doi": "", + "n_authors": 10, + "node": "2610.32894", + "primary_category": "", + "proof": { + "block_bytes": 3194, + "block_sha256": "d1befaa355545117b04f2c4c4054fbd258dc2d61e42b26690f61d6019dcf36bd", + "line": 27 + }, + "published": "2026-10-23T17:01:04Z", + "slice": "mm", + "title": "LoCA: Enabling Multi-Modality in Geospatial Location Encoders", + "updated": "2026-10-23T17:01:04Z" + }, + { + "abstract_chars": 1787, + "arxiv_id": "2610.32948v1", + "authors": [ + "Dianye Huang", + "Jiamei Guo", + "Yue Zhou", + "Mingde Li", + "Yi Xiong", + "Wei Wang", + "Nassir Navab", + "Zhongliang Jiang" + ], + "categories": [ + "cs.CV", + "cs.AI" + ], + "doi": "", + "n_authors": 8, + "node": "2610.32948", + "primary_category": "", + "proof": { + "block_bytes": 2907, + "block_sha256": "6797fb01fb9783f636378687b9b3409afb5cb4f578aab3a2590f32f7bb55807b", + "line": 27 + }, + "published": "2026-10-23T17:40:58Z", + "slice": "mm2", + "title": "Beyond Discrete Tokens: Preserving Numerical Continuity in Medical Vision-Language Models", + "updated": "2026-10-23T17:40:58Z" + }, + { + "abstract_chars": 1066, + "arxiv_id": "2610.32967v1", + "authors": [ + "Tarunya Prasad", + "Bharatesh Chakravarthi" + ], + "categories": [ + "cs.CV" + ], + "doi": "", + "n_authors": 2, + "node": "2610.32967", + "primary_category": "", + "proof": { + "block_bytes": 1786, + "block_sha256": "b28f04f7e647c1ee918d34ffc5465982a5b039fe4ccd5f9ad7c0b3b0872b6929", + "line": 10 + }, + "published": "2026-10-23T17:55:02Z", + "slice": "mm", + "title": "MiD-VLM: Detecting and Grounding Global Semantic Misinformation in Image-Caption Pairs", + "updated": "2026-10-23T17:55:02Z" + } + ] +} \ No newline at end of file diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/edges.jsonl b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/edges.jsonl new file mode 100644 index 0000000..cb3888d --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/edges.jsonl @@ -0,0 +1,94 @@ +{"from": "2610.32263", "hash": "c0d2785a6b02cceda12c72cdb8c61bdffe0f5b9a6e3d4bc89c21cae7b39f71ce", "jaccard": 0.5556, "prev_hash": "0000000000000000000000000000000000000000000000000000000000000000", "seq": 1, "to": "2610.27298"} +{"from": "2610.31205", "hash": "957657371b688031807cab83207a6051121fd0d07e22513004e3b1268efa0d8a", "jaccard": 0.4167, "prev_hash": "c0d2785a6b02cceda12c72cdb8c61bdffe0f5b9a6e3d4bc89c21cae7b39f71ce", "seq": 2, "to": "2610.25005"} +{"from": "2610.11592", "hash": "d3d880c2ee63701312dc2c3a0035bb9f29fb340acacd5c5cbca9ec1aad48a5a5", "jaccard": 0.3636, "prev_hash": "957657371b688031807cab83207a6051121fd0d07e22513004e3b1268efa0d8a", "seq": 3, "to": "2609.38137"} +{"from": "2610.32263", "hash": "2f510363a8d3e72a9ebaaea28bed3ddfd9b807a9fc72f045f566aec50c98247d", "jaccard": 0.3636, "prev_hash": "d3d880c2ee63701312dc2c3a0035bb9f29fb340acacd5c5cbca9ec1aad48a5a5", "seq": 4, "to": "2610.27904"} +{"from": "2609.36529", "hash": "3793a445542d163daa6a2173e63e81d5db0f7d43c75df2e69b6718e3a68ccdbd", "jaccard": 0.3333, "prev_hash": "2f510363a8d3e72a9ebaaea28bed3ddfd9b807a9fc72f045f566aec50c98247d", "seq": 5, "to": "2609.36314"} +{"from": "2610.17966", "hash": "0038bd6e8600148342b08e8755f689f199a34689a60dc6632d61a93dbca3065f", "jaccard": 0.3333, "prev_hash": "3793a445542d163daa6a2173e63e81d5db0f7d43c75df2e69b6718e3a68ccdbd", "seq": 6, "to": "2610.06479"} +{"from": "2610.19928", "hash": "2e6462261593b5b72d9198ddf318334558cbb08bc1c138d0238de8fd510a7d8a", "jaccard": 0.3333, "prev_hash": "0038bd6e8600148342b08e8755f689f199a34689a60dc6632d61a93dbca3065f", "seq": 7, "to": "2609.36935"} +{"from": "2610.26203", "hash": "0cedec4ce66fb53831be0a813144c0dc9b695f8243e280f1b822fa8d483d455d", "jaccard": 0.3333, "prev_hash": "2e6462261593b5b72d9198ddf318334558cbb08bc1c138d0238de8fd510a7d8a", "seq": 8, "to": "2609.25611"} +{"from": "2610.31304", "hash": "934ce7f3ef23532ceb51137a92bc147d577ecaf8b0f9c587c1e487caf5b8e31e", "jaccard": 0.3333, "prev_hash": "0cedec4ce66fb53831be0a813144c0dc9b695f8243e280f1b822fa8d483d455d", "seq": 9, "to": "2610.29642"} +{"from": "2610.31494", "hash": "e7f371b93a0ded3286fc076a551f61b28e4a62572072880f69c15a3ad92a7069", "jaccard": 0.3333, "prev_hash": "934ce7f3ef23532ceb51137a92bc147d577ecaf8b0f9c587c1e487caf5b8e31e", "seq": 10, "to": "2610.26826"} +{"from": "2610.32440", "hash": "b5d18bf5c1e5bc53a63294ef4e3ab6b236a8cfcccabf527962afe3793bd6e08a", "jaccard": 0.3333, "prev_hash": "e7f371b93a0ded3286fc076a551f61b28e4a62572072880f69c15a3ad92a7069", "seq": 11, "to": "2610.32220"} +{"from": "2610.27904", "hash": "1c652fa03156a18ad9d3e1b4bcbb6d2ef626e3c793a05979849a0c86821cae6c", "jaccard": 0.3077, "prev_hash": "b5d18bf5c1e5bc53a63294ef4e3ab6b236a8cfcccabf527962afe3793bd6e08a", "seq": 12, "to": "2610.27298"} +{"from": "2610.28626", "hash": "adf08df5b84c667b03651b920064149badabf7c549a0f613836d178916ba6a12", "jaccard": 0.3077, "prev_hash": "1c652fa03156a18ad9d3e1b4bcbb6d2ef626e3c793a05979849a0c86821cae6c", "seq": 13, "to": "2610.27782"} +{"from": "2610.31158", "hash": "e33be759dac78f2f14a18fbabf268d0fd746924c9af34627a2aa19f5007ccbd8", "jaccard": 0.3077, "prev_hash": "adf08df5b84c667b03651b920064149badabf7c549a0f613836d178916ba6a12", "seq": 14, "to": "2610.25926"} +{"from": "2610.32486", "hash": "2fad0dff9b4e857b50d2712561e70d824a42aa02b88cbedb24ee57f32200c80b", "jaccard": 0.3077, "prev_hash": "e33be759dac78f2f14a18fbabf268d0fd746924c9af34627a2aa19f5007ccbd8", "seq": 15, "to": "2610.31478"} +{"from": "2610.10114", "hash": "16b2afa9c818375c3c6e03efced15244f4e1a56711e36f4d18d09e02fc1451d2", "jaccard": 0.3, "prev_hash": "2fad0dff9b4e857b50d2712561e70d824a42aa02b88cbedb24ee57f32200c80b", "seq": 16, "to": "2610.07940"} +{"from": "2610.19026", "hash": "b36589cd0ba8ce14ac4de3b5747d1e965fcb82280a3f64b6e201444b9f24d7c3", "jaccard": 0.3, "prev_hash": "16b2afa9c818375c3c6e03efced15244f4e1a56711e36f4d18d09e02fc1451d2", "seq": 17, "to": "2610.00418"} +{"from": "2610.19928", "hash": "4d90c6fd47b9ad947d9d799e5914c1e04e6724c4f84cda18241ed7535707f276", "jaccard": 0.3, "prev_hash": "b36589cd0ba8ce14ac4de3b5747d1e965fcb82280a3f64b6e201444b9f24d7c3", "seq": 18, "to": "2609.38809"} +{"from": "2610.25247", "hash": "f770df43866ee02413278f2dc6f26707a071902da61723339d6d6fd5166e9b20", "jaccard": 0.3, "prev_hash": "4d90c6fd47b9ad947d9d799e5914c1e04e6724c4f84cda18241ed7535707f276", "seq": 19, "to": "2610.02181"} +{"from": "2610.26431", "hash": "18c69ce71cb111beb6f39bb142c3c17ec8cb6b3901c077b7bc7d9464ad691733", "jaccard": 0.3, "prev_hash": "f770df43866ee02413278f2dc6f26707a071902da61723339d6d6fd5166e9b20", "seq": 20, "to": "2609.38137"} +{"from": "2610.28282", "hash": "1c70d2dbe52563a357ea89f9696b5d3de7dad11c6399e03c163c97f849127fa6", "jaccard": 0.3, "prev_hash": "18c69ce71cb111beb6f39bb142c3c17ec8cb6b3901c077b7bc7d9464ad691733", "seq": 21, "to": "2609.38137"} +{"from": "2610.28282", "hash": "44ac30a03f25704e0a913230f09f778ee180d3e8eb303295663552861e5c0c4a", "jaccard": 0.3, "prev_hash": "1c70d2dbe52563a357ea89f9696b5d3de7dad11c6399e03c163c97f849127fa6", "seq": 22, "to": "2610.22067"} +{"from": "2610.30097", "hash": "8b10323bfeb2a1a3ae208c3c0e377b8f6fbfdc514833716145ec69cdd5c098dd", "jaccard": 0.3, "prev_hash": "44ac30a03f25704e0a913230f09f778ee180d3e8eb303295663552861e5c0c4a", "seq": 23, "to": "2609.38809"} +{"from": "2610.30132", "hash": "2a34229fb3839c81e001ddad840c1bf5c324d1c5493ae3c1635cf15d98ae2d00", "jaccard": 0.3, "prev_hash": "8b10323bfeb2a1a3ae208c3c0e377b8f6fbfdc514833716145ec69cdd5c098dd", "seq": 24, "to": "2609.38809"} +{"from": "2610.32213", "hash": "eff84b3e35cf2dac2882720c744d6ca3fbc4ce4ac2e4f32a235b9c4978818403", "jaccard": 0.3, "prev_hash": "2a34229fb3839c81e001ddad840c1bf5c324d1c5493ae3c1635cf15d98ae2d00", "seq": 25, "to": "2610.08463"} +{"from": "2610.32213", "hash": "b27eb9da95cfa254328cd9124b4ccd81d63f78d80bee254822c2b025b5bd1028", "jaccard": 0.3, "prev_hash": "eff84b3e35cf2dac2882720c744d6ca3fbc4ce4ac2e4f32a235b9c4978818403", "seq": 26, "to": "2610.26431"} +{"from": "2610.32263", "hash": "6820eabea4aa4e305bd6cbf2728026b7e7511f447def9b3511786a386bbda210", "jaccard": 0.3, "prev_hash": "b27eb9da95cfa254328cd9124b4ccd81d63f78d80bee254822c2b025b5bd1028", "seq": 27, "to": "2610.29495"} +{"from": "2610.32332", "hash": "5c820211d28f3a1ec2449771c05320dd864a6c0b97f56cbea271c2204bb86f90", "jaccard": 0.3, "prev_hash": "6820eabea4aa4e305bd6cbf2728026b7e7511f447def9b3511786a386bbda210", "seq": 28, "to": "2610.28282"} +{"from": "2610.32360", "hash": "37d47d49714c7e7a9acf52b9ff3ffc3b23e5de0abbbe07e3e86a68c5fc357b13", "jaccard": 0.3, "prev_hash": "5c820211d28f3a1ec2449771c05320dd864a6c0b97f56cbea271c2204bb86f90", "seq": 29, "to": "2610.31304"} +{"from": "2610.32784", "hash": "5fd9515cb74eebed9abdac418df344693632766c54937ea66318509d4ec82365", "jaccard": 0.3, "prev_hash": "37d47d49714c7e7a9acf52b9ff3ffc3b23e5de0abbbe07e3e86a68c5fc357b13", "seq": 30, "to": "2610.30089"} +{"from": "2610.06479", "hash": "84fd4315ba0aade327d63c8d49fab2ebcdeaa4bb5e607d4b46eb523c2976ec1a", "jaccard": 0.2857, "prev_hash": "5fd9515cb74eebed9abdac418df344693632766c54937ea66318509d4ec82365", "seq": 31, "to": "2610.03027"} +{"from": "2610.12338", "hash": "fb24a7a3248048c57d59bea19537f9103f9267fe4379836520375ce44dbfd9c4", "jaccard": 0.2857, "prev_hash": "84fd4315ba0aade327d63c8d49fab2ebcdeaa4bb5e607d4b46eb523c2976ec1a", "seq": 32, "to": "2610.06479"} +{"from": "2610.19247", "hash": "ebff381aeecc3ac4576a994a6637bbde9241d07be69a7adb1af2df5f9b388f87", "jaccard": 0.2857, "prev_hash": "fb24a7a3248048c57d59bea19537f9103f9267fe4379836520375ce44dbfd9c4", "seq": 33, "to": "2610.07940"} +{"from": "2610.26431", "hash": "1ddda6d6943dd7c06761372b9ecce4834e8da419665e90e3c56d78805c169ebc", "jaccard": 0.2857, "prev_hash": "ebff381aeecc3ac4576a994a6637bbde9241d07be69a7adb1af2df5f9b388f87", "seq": 34, "to": "2610.19247"} +{"from": "2610.26863", "hash": "602ea694f0f93b1e85cb8d9cf0c666d0da176f2414b467b31b73d316fb98b40d", "jaccard": 0.2857, "prev_hash": "1ddda6d6943dd7c06761372b9ecce4834e8da419665e90e3c56d78805c169ebc", "seq": 35, "to": "2610.19247"} +{"from": "2610.27341", "hash": "c2120f5946926ce98fffe15117674e31d8655514be584483f27c1299c9e65d74", "jaccard": 0.2857, "prev_hash": "602ea694f0f93b1e85cb8d9cf0c666d0da176f2414b467b31b73d316fb98b40d", "seq": 36, "to": "2610.25999"} +{"from": "2610.31098", "hash": "9fccd40736c7b5e89ee08812ed1733251a6d9a4b94bfebda4d34e4a0b844e4b3", "jaccard": 0.2857, "prev_hash": "c2120f5946926ce98fffe15117674e31d8655514be584483f27c1299c9e65d74", "seq": 37, "to": "2610.06479"} +{"from": "2610.10156", "hash": "99d27fc38f27967781b5c0f9f201de2fbb4c8a313609806f6d94b386dd15203d", "jaccard": 0.2727, "prev_hash": "9fccd40736c7b5e89ee08812ed1733251a6d9a4b94bfebda4d34e4a0b844e4b3", "seq": 38, "to": "2610.05940"} +{"from": "2610.19928", "hash": "c543fe695199079c3cc1ade4a8f5b80023ec1091e728b14a616e8ae234f15715", "jaccard": 0.2727, "prev_hash": "99d27fc38f27967781b5c0f9f201de2fbb4c8a313609806f6d94b386dd15203d", "seq": 39, "to": "2609.39740"} +{"from": "2610.22067", "hash": "38c4b463c6f66566aca397faf76abe2bf88d829414cd0e032f7e9a80fde87529", "jaccard": 0.2727, "prev_hash": "c543fe695199079c3cc1ade4a8f5b80023ec1091e728b14a616e8ae234f15715", "seq": 40, "to": "2610.13132"} +{"from": "2610.26431", "hash": "3a67e5d0dcb9b47ceb040ec9fd9b643d7617ff74a9a09a8b5261a300d3e2ec36", "jaccard": 0.2727, "prev_hash": "38c4b463c6f66566aca397faf76abe2bf88d829414cd0e032f7e9a80fde87529", "seq": 41, "to": "2610.11592"} +{"from": "2610.26585", "hash": "0a0273e86c10b1e2804025c04f3ac4aaff30a4fb23ba3281c0387c53b384d597", "jaccard": 0.2727, "prev_hash": "3a67e5d0dcb9b47ceb040ec9fd9b643d7617ff74a9a09a8b5261a300d3e2ec36", "seq": 42, "to": "2610.23250"} +{"from": "2610.27782", "hash": "10a976097e4050157ec738f66d31d4037253f92736df50ab16df8f90003d7e1e", "jaccard": 0.2727, "prev_hash": "0a0273e86c10b1e2804025c04f3ac4aaff30a4fb23ba3281c0387c53b384d597", "seq": 43, "to": "2610.26431"} +{"from": "2610.27782", "hash": "38026681ca472dc7468e92d93e57fbbc2cdcc305569aa11c6876dc45fe0aa18e", "jaccard": 0.2727, "prev_hash": "10a976097e4050157ec738f66d31d4037253f92736df50ab16df8f90003d7e1e", "seq": 44, "to": "2610.26863"} +{"from": "2610.28382", "hash": "70ee30e0d3cddcf4c72ac32acb90bc7dfc9d0172109e1c8792b5ea1d5bf95a68", "jaccard": 0.2727, "prev_hash": "38026681ca472dc7468e92d93e57fbbc2cdcc305569aa11c6876dc45fe0aa18e", "seq": 45, "to": "2609.31382"} +{"from": "2610.28382", "hash": "005ade964a2d46368dc92f9f96ba887eccbf2fbf28b27be5fdbba8bb82c09353", "jaccard": 0.2727, "prev_hash": "70ee30e0d3cddcf4c72ac32acb90bc7dfc9d0172109e1c8792b5ea1d5bf95a68", "seq": 46, "to": "2610.24378"} +{"from": "2610.29590", "hash": "c0eb47317b9cbd771441442397b5931eceb912d329bf00fb7fe23edf5d3f350b", "jaccard": 0.2727, "prev_hash": "005ade964a2d46368dc92f9f96ba887eccbf2fbf28b27be5fdbba8bb82c09353", "seq": 47, "to": "2610.26585"} +{"from": "2610.30108", "hash": "4c8fe3ba13ac91982ba93162e1d5371b8735c82ac88a1b6f00a2f827a8cfed21", "jaccard": 0.2727, "prev_hash": "c0eb47317b9cbd771441442397b5931eceb912d329bf00fb7fe23edf5d3f350b", "seq": 48, "to": "2610.24378"} +{"from": "2610.30132", "hash": "150fd76d53de2edd28901220b4a4894a0239cebda8fcb0948eea899c7a2dbc5b", "jaccard": 0.2727, "prev_hash": "4c8fe3ba13ac91982ba93162e1d5371b8735c82ac88a1b6f00a2f827a8cfed21", "seq": 49, "to": "2610.23167"} +{"from": "2610.32213", "hash": "4d0c7b7482c0357ecbb275497dcc8261f31cdf4d6842f17a589637b49f117aea", "jaccard": 0.2727, "prev_hash": "150fd76d53de2edd28901220b4a4894a0239cebda8fcb0948eea899c7a2dbc5b", "seq": 50, "to": "2609.38137"} +{"from": "2610.32311", "hash": "598fb0e3375c458e2c0f48af4e8a7372d1dd1e842819c4b99676ea366edfb96a", "jaccard": 0.2727, "prev_hash": "4d0c7b7482c0357ecbb275497dcc8261f31cdf4d6842f17a589637b49f117aea", "seq": 51, "to": "2610.32263"} +{"from": "2610.32332", "hash": "cfd8baaa540b55d0f007b463b03735faa3dd448d0b54dfe0225152d8987bad79", "jaccard": 0.2727, "prev_hash": "598fb0e3375c458e2c0f48af4e8a7372d1dd1e842819c4b99676ea366edfb96a", "seq": 52, "to": "2609.38137"} +{"from": "2610.32332", "hash": "16e71923cc9422066232dcc7cb19b2eb267c041f714b41139d7087ec5ed7defd", "jaccard": 0.2727, "prev_hash": "cfd8baaa540b55d0f007b463b03735faa3dd448d0b54dfe0225152d8987bad79", "seq": 53, "to": "2610.02472"} +{"from": "2610.32485", "hash": "4f94d0235636505efd115b49b31e114ffa43ea93326bdf55879fc53b3cf94ce9", "jaccard": 0.2727, "prev_hash": "16e71923cc9422066232dcc7cb19b2eb267c041f714b41139d7087ec5ed7defd", "seq": 54, "to": "2610.27360"} +{"from": "2610.32612", "hash": "4613acaa92879f528af026db5cc1ae79cd512de81d00167264a783820e17b029", "jaccard": 0.2727, "prev_hash": "4f94d0235636505efd115b49b31e114ffa43ea93326bdf55879fc53b3cf94ce9", "seq": 55, "to": "2610.29642"} +{"from": "2610.32784", "hash": "89ddfcccfde591d4a3fdd87b1b7bcab6b38cd4cfc1008adc51d79d0e354f5245", "jaccard": 0.2727, "prev_hash": "4613acaa92879f528af026db5cc1ae79cd512de81d00167264a783820e17b029", "seq": 56, "to": "2610.05940"} +{"from": "2610.21165", "hash": "90bec0558c471ccc576284a865566e1ad74da33ffa28e7a94f0d213d1a09c6ab", "jaccard": 0.2667, "prev_hash": "89ddfcccfde591d4a3fdd87b1b7bcab6b38cd4cfc1008adc51d79d0e354f5245", "seq": 57, "to": "2609.29370"} +{"from": "2610.28264", "hash": "1f15742a9fee9adf803f86fc277c01798e69c88002a9b47e65b7be2626ef5578", "jaccard": 0.2667, "prev_hash": "90bec0558c471ccc576284a865566e1ad74da33ffa28e7a94f0d213d1a09c6ab", "seq": 58, "to": "2610.25005"} +{"from": "2610.28264", "hash": "c96471d12ef21c73ae9f7b172e49474c3ec030336f14dde69773bbefc1da8f6f", "jaccard": 0.2667, "prev_hash": "1f15742a9fee9adf803f86fc277c01798e69c88002a9b47e65b7be2626ef5578", "seq": 59, "to": "2610.27782"} +{"from": "2610.31205", "hash": "a22e89c6c267f72015cc140bfdd1d878fca3cb53e9783db1c25670be327dd7df", "jaccard": 0.2667, "prev_hash": "c96471d12ef21c73ae9f7b172e49474c3ec030336f14dde69773bbefc1da8f6f", "seq": 60, "to": "2610.00969"} +{"from": "2610.32213", "hash": "d00a635764924e7402f8d5e1527f13c9dcb2498aa11cf568ce2c360256eef068", "jaccard": 0.2667, "prev_hash": "a22e89c6c267f72015cc140bfdd1d878fca3cb53e9783db1c25670be327dd7df", "seq": 61, "to": "2609.35831"} +{"from": "2610.00982", "hash": "1ef5f897e2ae1d8cd43e9e8ff1305b974a7bc92c6c20f02c3d5fafe2e0dcfa39", "jaccard": 0.25, "prev_hash": "d00a635764924e7402f8d5e1527f13c9dcb2498aa11cf568ce2c360256eef068", "seq": 62, "to": "2609.39740"} +{"from": "2610.06479", "hash": "deec88bc693b903ec5c0bbb0a1b0a9cefa518e861040505ffcf061583e82fa24", "jaccard": 0.25, "prev_hash": "1ef5f897e2ae1d8cd43e9e8ff1305b974a7bc92c6c20f02c3d5fafe2e0dcfa39", "seq": 63, "to": "2610.03198"} +{"from": "2610.06479", "hash": "c3cf55b318faeec630c7f432a743c35aeba9882d4ff8d2b5c6090818622d110d", "jaccard": 0.25, "prev_hash": "deec88bc693b903ec5c0bbb0a1b0a9cefa518e861040505ffcf061583e82fa24", "seq": 64, "to": "2610.06286"} +{"from": "2610.06479", "hash": "815513954e85fa177c422487ce87cad0341e81ee93206e27d8e0e5351e3ad2d6", "jaccard": 0.25, "prev_hash": "c3cf55b318faeec630c7f432a743c35aeba9882d4ff8d2b5c6090818622d110d", "seq": 65, "to": "2610.06927"} +{"from": "2610.10918", "hash": "a2da1eb421a8e7dec089f060793ce901c9b1ffd485c78b4a6a3840b3f908d1b3", "jaccard": 0.25, "prev_hash": "815513954e85fa177c422487ce87cad0341e81ee93206e27d8e0e5351e3ad2d6", "seq": 66, "to": "2610.00969"} +{"from": "2610.15542", "hash": "f58297056629f83f975b12c631fdc064ec0551e2de55822a727065431f360d5d", "jaccard": 0.25, "prev_hash": "a2da1eb421a8e7dec089f060793ce901c9b1ffd485c78b4a6a3840b3f908d1b3", "seq": 67, "to": "2610.15371"} +{"from": "2610.19247", "hash": "64f383299793eba4d60511d0cda1f68d242741e2b864f1d0b36aacd2f79d4296", "jaccard": 0.25, "prev_hash": "f58297056629f83f975b12c631fdc064ec0551e2de55822a727065431f360d5d", "seq": 68, "to": "2609.33465"} +{"from": "2610.19247", "hash": "9ca646214fa5543a4d53bd27c58988c6c47bb7a6ca674280c23cbd619a26100f", "jaccard": 0.25, "prev_hash": "64f383299793eba4d60511d0cda1f68d242741e2b864f1d0b36aacd2f79d4296", "seq": 69, "to": "2609.38137"} +{"from": "2610.25005", "hash": "128dd7f04609fa79711f7b42fbfc37c1c94f0d57581a7d77c829ac65ce62aa15", "jaccard": 0.25, "prev_hash": "9ca646214fa5543a4d53bd27c58988c6c47bb7a6ca674280c23cbd619a26100f", "seq": 70, "to": "2609.33465"} +{"from": "2610.25919", "hash": "3b3eb0a6d97dbf870162963e8cc643e50a658fa1b81bef333bb06f063dd4623b", "jaccard": 0.25, "prev_hash": "128dd7f04609fa79711f7b42fbfc37c1c94f0d57581a7d77c829ac65ce62aa15", "seq": 71, "to": "2609.38809"} +{"from": "2610.26431", "hash": "feb6146f2ab614aad76bd71aafa0c0f92909a5d2a0aa9669b9d04734dbb579df", "jaccard": 0.25, "prev_hash": "3b3eb0a6d97dbf870162963e8cc643e50a658fa1b81bef333bb06f063dd4623b", "seq": 72, "to": "2609.36529"} +{"from": "2610.26431", "hash": "c5c7f5dd3453bb9aa8b62300564fe1c495e6c0fd849a5972654e35be475733af", "jaccard": 0.25, "prev_hash": "feb6146f2ab614aad76bd71aafa0c0f92909a5d2a0aa9669b9d04734dbb579df", "seq": 73, "to": "2610.13041"} +{"from": "2610.26431", "hash": "45a6404233a651c60f113e4074bf13c8d81670e42aff4a4a6b774c046f388adc", "jaccard": 0.25, "prev_hash": "c5c7f5dd3453bb9aa8b62300564fe1c495e6c0fd849a5972654e35be475733af", "seq": 74, "to": "2610.21165"} +{"from": "2610.27341", "hash": "8aded827378b4919e216949f4683a680ed62735f0e7aadb045794b52ee27791d", "jaccard": 0.25, "prev_hash": "45a6404233a651c60f113e4074bf13c8d81670e42aff4a4a6b774c046f388adc", "seq": 75, "to": "2610.25247"} +{"from": "2610.27692", "hash": "c85e917aa8db9a3084489ff9b76d4dee86dc3d61da9a2c22b25f843bfcf116ae", "jaccard": 0.25, "prev_hash": "8aded827378b4919e216949f4683a680ed62735f0e7aadb045794b52ee27791d", "seq": 76, "to": "2610.05940"} +{"from": "2610.27692", "hash": "c5a5fdc4462100c095f40e8718b350cdf5738db128a46f84586098adba2133a2", "jaccard": 0.25, "prev_hash": "c85e917aa8db9a3084489ff9b76d4dee86dc3d61da9a2c22b25f843bfcf116ae", "seq": 77, "to": "2610.10156"} +{"from": "2610.27782", "hash": "01ea1d41b65164b086ac3d3f827dd498bd94e1b34430ff13e4fb5a43e8f80ab5", "jaccard": 0.25, "prev_hash": "c5a5fdc4462100c095f40e8718b350cdf5738db128a46f84586098adba2133a2", "seq": 78, "to": "2610.26585"} +{"from": "2610.29495", "hash": "12627418754763093e3e93d56d80951dc8575d3bcb66671ffacd4fa6a0d74262", "jaccard": 0.25, "prev_hash": "01ea1d41b65164b086ac3d3f827dd498bd94e1b34430ff13e4fb5a43e8f80ab5", "seq": 79, "to": "2610.27298"} +{"from": "2610.29590", "hash": "b7074562ff3565b1e588493c7ccf79d98e99cd1bb3739c84b57976cf159ab40c", "jaccard": 0.25, "prev_hash": "12627418754763093e3e93d56d80951dc8575d3bcb66671ffacd4fa6a0d74262", "seq": 80, "to": "2610.26022"} +{"from": "2610.29590", "hash": "5726c98bbed7af9235c858b1fc7dbb7235123daa4bf15d640b51967a5d149e78", "jaccard": 0.25, "prev_hash": "b7074562ff3565b1e588493c7ccf79d98e99cd1bb3739c84b57976cf159ab40c", "seq": 81, "to": "2610.27782"} +{"from": "2610.30206", "hash": "27ec221bbf7953fe92ff73955c22c44309f5a4050c00bd1043cb53418fc23908", "jaccard": 0.25, "prev_hash": "5726c98bbed7af9235c858b1fc7dbb7235123daa4bf15d640b51967a5d149e78", "seq": 82, "to": "2610.06479"} +{"from": "2610.30913", "hash": "b149f5d440aa18d85887aa57e8bfd2a322c95a0ff2cba6b38d3e7283f064bd1e", "jaccard": 0.25, "prev_hash": "27ec221bbf7953fe92ff73955c22c44309f5a4050c00bd1043cb53418fc23908", "seq": 83, "to": "2610.30592"} +{"from": "2610.31098", "hash": "6fb0e6797353702c763b2cd585f846c53675c8d115478eb7fc900c7a61e4d668", "jaccard": 0.25, "prev_hash": "b149f5d440aa18d85887aa57e8bfd2a322c95a0ff2cba6b38d3e7283f064bd1e", "seq": 84, "to": "2610.20582"} +{"from": "2610.31158", "hash": "f5c3b3d8264d7d5c17c31d857d3b7a1d159fbe3ed01af18731c3c7398ac061ef", "jaccard": 0.25, "prev_hash": "6fb0e6797353702c763b2cd585f846c53675c8d115478eb7fc900c7a61e4d668", "seq": 85, "to": "2610.25493"} +{"from": "2610.31205", "hash": "91d861f3113778c2ff32e8072a4f0383f99ffa9dd35267ad760a08472b06fed6", "jaccard": 0.25, "prev_hash": "f5c3b3d8264d7d5c17c31d857d3b7a1d159fbe3ed01af18731c3c7398ac061ef", "seq": 86, "to": "2610.28264"} +{"from": "2610.31945", "hash": "5df7dafd79141080d3ed7a0a03b6be33df2800b66188f8af31d2f771f3b73ec0", "jaccard": 0.25, "prev_hash": "91d861f3113778c2ff32e8072a4f0383f99ffa9dd35267ad760a08472b06fed6", "seq": 87, "to": "2610.15371"} +{"from": "2610.32177", "hash": "8001e13fe0582edf31cb651c0874c6848622c35de5082cc769d95f1b1318322c", "jaccard": 0.25, "prev_hash": "5df7dafd79141080d3ed7a0a03b6be33df2800b66188f8af31d2f771f3b73ec0", "seq": 88, "to": "2610.29811"} +{"from": "2610.32213", "hash": "678347bf306fe8863aabe0d1d718c07b1f190dff193a6d5fe0e3ff1a98e9dfe8", "jaccard": 0.25, "prev_hash": "8001e13fe0582edf31cb651c0874c6848622c35de5082cc769d95f1b1318322c", "seq": 89, "to": "2610.11592"} +{"from": "2610.32213", "hash": "b23e48e6f1f89d784d185d5cc6f9fcf95074fa86638228b1361c3541f31fb99d", "jaccard": 0.25, "prev_hash": "678347bf306fe8863aabe0d1d718c07b1f190dff193a6d5fe0e3ff1a98e9dfe8", "seq": 90, "to": "2610.19247"} +{"from": "2610.32213", "hash": "3661607cd21f889e0d783b76bb600101bfa264b6ce0988f793a9bd3e9dea3054", "jaccard": 0.25, "prev_hash": "b23e48e6f1f89d784d185d5cc6f9fcf95074fa86638228b1361c3541f31fb99d", "seq": 91, "to": "2610.25005"} +{"from": "2610.32263", "hash": "91023ceb7ce6f6e6bc55a55535e0aa6a2b21e94123ea262428713ce27d3a81ac", "jaccard": 0.25, "prev_hash": "3661607cd21f889e0d783b76bb600101bfa264b6ce0988f793a9bd3e9dea3054", "seq": 92, "to": "2610.28266"} +{"from": "2610.32360", "hash": "522e7d002efafb897aba326608d903c8d7028a06fb02552c65dba8ac79e007ca", "jaccard": 0.25, "prev_hash": "91023ceb7ce6f6e6bc55a55535e0aa6a2b21e94123ea262428713ce27d3a81ac", "seq": 93, "to": "2610.19247"} +{"from": "2610.32478", "hash": "2c0bf612e7c9db3cd0db0ac91cee031e4c2ef20d2e0b72722e4775f058e4988c", "jaccard": 0.25, "prev_hash": "522e7d002efafb897aba326608d903c8d7028a06fb02552c65dba8ac79e007ca", "seq": 94, "to": "2610.27360"} diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/indep_check.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/indep_check.py new file mode 100644 index 0000000..156556f --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/indep_check.py @@ -0,0 +1,148 @@ +#!/usr/bin/env python3 +"""indep_check.py -- a SECOND verifier, written from scratch. + +Deliberately shares no code with run_verdict.py: it re-fetches the live arXiv +API and compares the archived corpus against what arXiv serves NOW, and it +re-walks the frozen sources using a different parsing strategy (regex over +raw bytes, not ElementTree). + +Exit 0 iff the archived corpus is consistent with live arXiv and with itself. + + python3 indep_check.py # exit 0 = independently corroborated +""" +import hashlib +import json +import os +import re +import sys +import urllib.parse +import urllib.request + +HERE = os.path.dirname(os.path.abspath(__file__)) +FAILS = [] + + +def ck(name, cond, detail=""): + print(f" [{'PASS' if cond else 'FAIL'}] {name}" + (f" -- {detail}" if detail else "")) + if not cond: + FAILS.append(name) + + +def main(): + corpus = json.load(open(os.path.join(HERE, "corpus.json"))) + + # --- A. live arXiv corroboration ------------------------------------- + # Re-query arXiv for the exact ids we archived and confirm the titles and + # publication dates still match what we froze. + ids = sorted({nd["node"] for nd in corpus["nodes"]}) + ck("corpus has nodes", len(ids) > 0, f"{len(ids)} nodes") + + live = {} + B = 50 + for i in range(0, len(ids), B): + chunk = ids[i:i + B] + q = urllib.parse.urlencode( + {"id_list": ",".join(chunk), "start": 0, "max_results": len(chunk)} + ) + url = f"https://export.arxiv.org/api/query?{q}" + try: + req = urllib.request.Request(url, headers={"User-Agent": "sphinx-indep/1.0"}) + body = urllib.request.urlopen(req, timeout=90).read().decode("utf-8", "replace") + except Exception as ex: + ck(f"live fetch chunk {i}", False, f"{type(ex).__name__}: {ex}") + continue + # regex parse, NOT ElementTree + for m in re.finditer(r"(.*?)", body, re.S): + blk = m.group(1) + idm = re.search(r"http://arxiv\.org/abs/([^<]+)", blk) + tm = re.search(r"(.*?)", blk, re.S) + pm = re.search(r"([^<]+)", blk) + if not (idm and tm): + continue + node = re.sub(r"v\d+$", "", idm.group(1).strip()) + live[node] = { + "title": re.sub(r"\s+", " ", tm.group(1)).strip(), + "published": pm.group(1).strip() if pm else "", + } + ck(f"live fetch chunk {i} returned entries", len(live) > 0, f"cumulative {len(live)}") + + print(f" [info] live arXiv returned {len(live)} of {len(ids)} archived ids") + + mism = [] + for nd in corpus["nodes"]: + lv = live.get(nd["node"]) + if lv is None: + mism.append((nd["node"], "absent from live arXiv")) + elif lv["title"] != nd["title"]: + mism.append((nd["node"], "title differs")) + ck("archived titles match live arXiv", not mism, f"{len(mism)} mismatches") + for n, why in mism[:5]: + print(f" {n}: {why}") + + # --- B. frozen source integrity, parsed by regex --------------------- + for fm in corpus["fetch"]: + p = os.path.join(HERE, fm["raw_path"]) + if not os.path.exists(p): + ck(f"source exists {fm['label']}", False) + continue + raw = open(p, "rb").read() + ck(f"source sha256 {fm['label']}", + hashlib.sha256(raw).hexdigest() == fm["raw_sha256"]) + # count blocks by regex and compare to the manifest + n_blocks = len(re.findall(rb"", raw)) + ck(f"entry count {fm['label']}", n_blocks == fm["returned"], + f"regex={n_blocks} manifest={fm['returned']}") + + # --- C. journal chain, recomputed with a different construction ------ + rows = [json.loads(l) for l in open(os.path.join(HERE, "edges.jsonl")) if l.strip()] + ck("journal non-empty", len(rows) > 0, f"{len(rows)} rows") + prev = "0" * 64 + bad = 0 + for i, r in enumerate(rows, start=1): + expect = hashlib.sha256( + json.dumps( + {"seq": i, "from": r["from"], "to": r["to"], + "jaccard": r["jaccard"], "prev_hash": prev}, + sort_keys=True, separators=(",", ":"), + ).encode() + ).hexdigest() + if r["hash"] != expect or r["prev_hash"] != prev: + bad += 1 + prev = r["hash"] + ck("journal chain recomputes", bad == 0, f"{bad} bad") + ck("journal head matches manifest", prev == corpus["journal"]["head"]) + + # --- D. DAG by Kahn's algorithm (different method than run_verdict) -- + nodes = [nd["node"] for nd in corpus["nodes"]] + pub = {nd["node"]: nd["published"] for nd in corpus["nodes"]} + indeg = {n: 0 for n in nodes} + adj = {n: [] for n in nodes} + for e in corpus["edges"]: + adj[e["from"]].append(e["to"]) + indeg[e["to"]] = indeg.get(e["to"], 0) + 1 + queue = [n for n in nodes if indeg[n] == 0] + seen = 0 + while queue: + u = queue.pop() + seen += 1 + for v in adj[u]: + indeg[v] -= 1 + if indeg[v] == 0: + queue.append(v) + ck("Kahn topological sort consumes all nodes (acyclic)", seen == len(nodes), + f"consumed {seen}/{len(nodes)}") + + # --- E. edge direction sanity ---------------------------------------- + bad_dir = [e for e in corpus["edges"] if pub[e["to"]] > pub[e["from"]]] + ck("edges respect publication order", not bad_dir, f"{len(bad_dir)} violations") + + print() + if FAILS: + print(f"VERDICT: FAIL -- {len(FAILS)} failed: {', '.join(FAILS)}") + return 1 + print(f"VERDICT: PASS -- independently corroborated ({len(ids)} nodes vs live arXiv)") + return 0 + + +if __name__ == "__main__": + sys.exit(main()) diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/mutation_battery.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/mutation_battery.py new file mode 100644 index 0000000..6454769 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/mutation_battery.py @@ -0,0 +1,159 @@ +#!/usr/bin/env python3 +"""mutation_battery.py -- falsifiability harness for run_verdict.py. + +Each mutation corrupts ONE thing in a copy of the archive; run_verdict.py must +FAIL on that copy. If any mutation goes undetected, the verdict is not a real +test. Exit 0 iff every mutation is caught. + + python3 mutation_battery.py # exit 0 = all mutations caught +""" +import json +import os +import shutil +import subprocess +import sys +import tempfile + +HERE = os.path.dirname(os.path.abspath(__file__)) +CAUGHT = [] +MISSED = [] + + +def run_verdict_in(d): + p = subprocess.run( + [sys.executable, os.path.join(d, "run_verdict.py")], + capture_output=True, text=True, cwd=d, + ) + return p.returncode + + +def clone(): + d = tempfile.mkdtemp(prefix="mut-") + for name in ("corpus.json", "run_verdict.py"): + shutil.copy(os.path.join(HERE, name), os.path.join(d, name)) + os.makedirs(os.path.join(d, "source"), exist_ok=True) + for f in os.listdir(os.path.join(HERE, "source")): + shutil.copy(os.path.join(HERE, "source", f), os.path.join(d, "source", f)) + os.makedirs(os.path.join(d, "source"), exist_ok=True) + shutil.copy(os.path.join(HERE, "edges.jsonl"), os.path.join(d, "edges.jsonl")) + return d + + +def mutate(name, fn): + d = clone() + fn(d) + rc = run_verdict_in(d) + ok = rc != 0 + (CAUGHT if ok else MISSED).append(name) + print(f" [{'CAUGHT' if ok else 'MISSED'}] {name} (verdict rc={rc})") + shutil.rmtree(d, ignore_errors=True) + + +def load(d): + return json.load(open(os.path.join(d, "corpus.json"))) + + +def save(d, m): + json.dump(m, open(os.path.join(d, "corpus.json"), "w"), indent=2, sort_keys=True) + + +def m_title(d): + m = load(d) + m["nodes"][0]["title"] = "TOTALLY FABRICATED TITLE" + save(d, m) + + +def m_proof_line(d): + m = load(d) + m["nodes"][0]["proof"]["line"] += 7 + save(d, m) + + +def m_proof_hash(d): + m = load(d) + m["nodes"][1]["proof"]["block_sha256"] = "0" * 64 + save(d, m) + + +def m_edge_jaccard(d): + m = load(d) + m["edges"][0]["jaccard"] = 0.9999 + save(d, m) + + +def m_edge_reverse(d): + m = load(d) + e = m["edges"][0] + e["from"], e["to"] = e["to"], e["from"] + save(d, m) + + +def m_count(d): + m = load(d) + m["counts"]["distinct_nodes"] += 5 + save(d, m) + + +def m_source_bytes(d): + p = os.path.join(d, "source", "arxiv-mm.xml") + b = open(p, "rb").read() + open(p, "wb").write(b + b"\n\n") + + +def m_node_missing(d): + m = load(d) + m["nodes"] = m["nodes"][:-1] + save(d, m) + + +def m_edge_endpoint(d): + m = load(d) + m["edges"][0]["from"] = "9999.99999" + save(d, m) + + +def m_journal_row(d): + p = os.path.join(d, "edges.jsonl") + lines = open(p).read().splitlines() + row = json.loads(lines[0]) + row["jaccard"] = 0.1111 + lines[0] = json.dumps(row, sort_keys=True) + open(p, "w").write("\n".join(lines) + "\n") + + +def m_drop_journal(d): + os.remove(os.path.join(d, "edges.jsonl")) + + +def main(): + # baseline: unmutated copy must PASS + d0 = clone() + base = run_verdict_in(d0) + shutil.rmtree(d0, ignore_errors=True) + print(f" [{'PASS' if base == 0 else 'FAIL'}] baseline unmutated archive (rc={base})") + if base != 0: + print("VERDICT: FAIL -- baseline does not pass; mutations are meaningless") + return 1 + + mutate("title rewritten", m_title) + mutate("proof line number shifted", m_proof_line) + mutate("proof block hash zeroed", m_proof_hash) + mutate("edge jaccard inflated", m_edge_jaccard) + mutate("edge direction reversed", m_edge_reverse) + mutate("manifest node count inflated", m_count) + mutate("raw source bytes appended", m_source_bytes) + mutate("node dropped from manifest", m_node_missing) + mutate("edge endpoint set to unknown node", m_edge_endpoint) + mutate("journal row body altered", m_journal_row) + mutate("journal file deleted", m_drop_journal) + + print() + if MISSED: + print(f"VERDICT: FAIL -- {len(MISSED)} mutations MISSED: {', '.join(MISSED)}") + return 1 + print(f"VERDICT: PASS -- {len(CAUGHT)}/{len(CAUGHT)} mutations caught") + return 0 + + +if __name__ == "__main__": + sys.exit(main()) diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe.py new file mode 100644 index 0000000..f773b6e --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe.py @@ -0,0 +1,12 @@ +import glob, re, xml.etree.ElementTree as ET + +A = "{http://www.w3.org/2005/Atom}" +for p in sorted(glob.glob("source/*.xml")): + b = open(p, "rb").read() + print("=====", p, len(b), "bytes; arXiv: mentions =", + len(re.findall(rb"arXiv:\s*\d{4}\.\d{4,5}", b, re.I))) + root = ET.fromstring(b) + for e in root.findall(A + "entry")[:3]: + aid = re.search(r"abs/(.+)$", e.findtext(A + "id", "")).group(1) + ab = re.sub(r"\s+", " ", (e.findtext(A + "summary", "") or "")) + print(" ", aid, "|", ab[:230]) diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_figs.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_figs.py new file mode 100644 index 0000000..0cad94b --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_figs.py @@ -0,0 +1,24 @@ +"""probe_figs.py -- MEASURE multimodal asset availability in the corpus. + +For the lane's core papers, fetch ar5iv HTML and count /
and +math elements. This decides the archive's multimodal dimension. +""" +import re +import urllib.request + +IDS = ["2610.32213", "2610.32781", "2610.32967", "2610.32483", "2610.32612"] + +for aid in IDS: + url = f"https://ar5iv.labs.arxiv.org/html/{aid}" + try: + req = urllib.request.Request(url, headers={"User-Agent": "sphinx/1.0"}) + body = urllib.request.urlopen(req, timeout=60).read().decode("utf-8", "replace") + imgs = re.findall(r"]+>", body) + figs = re.findall(r"={len(imgs):3d}
={len(figs):3d} ={len(svgs):3d} alts={len(alts)}") + if alts: + print(" e.g.", alts[0][:100]) + except Exception as ex: + print(f"{aid} FAIL {type(ex).__name__}: {ex}") diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_idlist.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_idlist.py new file mode 100644 index 0000000..4d9628a --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_idlist.py @@ -0,0 +1,14 @@ +import urllib.parse, urllib.request, re + +ids = ["2610.32213", "2610.32781", "2610.15371", "2609.25611"] +q = urllib.parse.urlencode({"search_query": "id_list=" + ",".join(ids), "start": 0, "max_results": 50}) +url = "https://export.arxiv.org/api/query?" + q +print("URL:", url) +req = urllib.request.Request(url, headers={"User-Agent": "sphinx/1.0"}) +body = urllib.request.urlopen(req, timeout=60).read().decode("utf-8", "replace") +print("bytes:", len(body)) +print("entries:", len(re.findall(r"", body))) +print(body[:400]) +print("...") +m = re.search(r"(.*?)", body, re.S) +print("feed title:", m.group(1)[:200] if m else None) diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_kws.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_kws.py new file mode 100644 index 0000000..509b148 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_kws.py @@ -0,0 +1,28 @@ +"""probe_kws.py -- MEASURE lane-keyword density across the fetched corpus.""" +import glob +import re +import xml.etree.ElementTree as ET + +A = "{http://www.w3.org/2005/Atom}" +KW = [ + "multimodal", "multi-modal", "vision-language", "vlm", "mllm", + "long context", "long-context", "long context", "kv cache", "kv-cache", + "context window", "token", "retrieval-augmented", "rag", "benchmark", + "grounding", "hallucination", "attention", "fine-tuning", "rlhf", +] +recs = [] +for p in sorted(glob.glob("source/*.xml")): + root = ET.fromstring(open(p, "rb").read()) + for e in root.findall(A + "entry"): + aid = re.search(r"abs/(.+)$", e.findtext(A + "id", "")).group(1) + ab = re.sub(r"\s+", " ", (e.findtext(A + "summary", "") or "")).lower() + recs.append((aid, ab)) + +print("corpus:", len(recs)) +counts = {k: 0 for k in KW} +for aid, ab in recs: + for k in KW: + if k in ab: + counts[k] += 1 +for k in sorted(KW, key=lambda x: -counts[x]): + print(f" {counts[k]:3d}/{len(recs)} {k}") diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_refs.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_refs.py new file mode 100644 index 0000000..54849f6 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_refs.py @@ -0,0 +1,39 @@ +"""probe_refs.py -- MEASURE the real citation signal. + +Fetch the arXiv (ar5iv) HTML for a sample of the fetched papers and count +how many of their reference-list entries resolve to arXiv IDs that are also +in our slice. This decides whether the citation graph is a real artifact or +a tautological empty set. +""" +import os +import re +import urllib.request + +IDS = ["2610.32213", "2610.32781", "2610.32967", "2610.32483", "2610.32612"] +SLICE = set() +for line in open("probe_titles.py"): + pass + +# load slice ids from the saved XML +import glob +import xml.etree.ElementTree as ET + +A = "{http://www.w3.org/2005/Atom}" +for p in sorted(glob.glob("source/*.xml")): + root = ET.fromstring(open(p, "rb").read()) + for e in root.findall(A + "entry"): + SLICE.add(re.search(r"abs/(.+)$", e.findtext(A + "id", "")).group(1)) + +ARXIV_REF = re.compile(r"arXiv:\s*(\d{4}\.\d{4,5})", re.I) + +for aid in IDS: + for host in ("ar5iv.labs.arxiv.org/html/", "arxiv.org/abs/"): + url = f"https://{host}{aid}" + try: + req = urllib.request.Request(url, headers={"User-Agent": "sphinx/1.0"}) + body = urllib.request.urlopen(req, timeout=60).read() + n = len(ARXIV_REF.findall(body.decode("utf-8", "replace"))) + print(f"{aid:14s} {host:32s} {len(body):8d} B arXiv-refs={n}") + break + except Exception as ex: + print(f"{aid:14s} {host:32s} FAIL {type(ex).__name__}: {ex}") diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_titles.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_titles.py new file mode 100644 index 0000000..44dea56 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_titles.py @@ -0,0 +1,58 @@ +"""probe_titles.py -- MEASURE title-overlap density between fetched papers. + +Question: is there a real, non-trivial graph signal between the two slices +(multimodal cs.CV and long-context cs.CL)? Titles are stripped of stopwords +and stemmed crudely; we report pairwise Jaccard similarity so we can pick a +threshold that yields a genuine graph rather than a hairball or an empty set. +""" +import glob +import re +import xml.etree.ElementTree as ET +from itertools import combinations + +A = "{http://www.w3.org/2005/Atom}" +STOP = { + "a", "an", "the", "of", "for", "and", "or", "to", "in", "on", "with", "via", + "by", "from", "as", "at", "is", "are", "we", "our", "their", "its", "this", + "that", "these", "those", "using", "based", "towards", "through", "into", + "how", "what", "why", "when", "can", "do", "does", "be", "been", "than", +} + +recs = [] +for p in sorted(glob.glob("source/*.xml")): + root = ET.fromstring(open(p, "rb").read()) + for e in root.findall(A + "entry"): + aid = re.search(r"abs/(.+)$", e.findtext(A + "id", "")).group(1) + t = re.sub(r"\s+", " ", (e.findtext(A + "title", "") or "")) + toks = set() + for w in re.findall(r"[A-Za-z][A-Za-z\-]+", t.lower()): + w = w.strip("-") + if len(w) < 3 or w in STOP: + continue + if len(w) > 4: + w = w[:4] # crude stem + toks.add(w) + recs.append((aid, t, toks)) + +print("records:", len(recs)) +pairs = 0 +buckets = {0.2: 0, 0.25: 0, 0.3: 0, 0.35: 0, 0.4: 0} +best = [] +for (a1, t1, s1), (a2, t2, s2) in combinations(recs, 2): + if not s1 or not s2: + continue + j = len(s1 & s2) / len(s1 | s2) + if j > 0: + pairs += 1 + for thr in buckets: + if j >= thr: + buckets[thr] += 1 + best.append((j, a1, a2)) + +best.sort(reverse=True) +print("pairs with jaccard>0:", pairs) +for thr in sorted(buckets): + print(f" jaccard >= {thr}: {buckets[thr]} pairs") +print("top 12 overlaps:") +for j, a1, a2 in best[:12]: + print(f" {j:.3f} {a1} <-> {a2}") diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_xref.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_xref.py new file mode 100644 index 0000000..cfee360 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/probes/probe_xref.py @@ -0,0 +1,32 @@ +"""probe_xref.py -- MEASURE whether real cross-references exist within the slice.""" +import glob +import re +import xml.etree.ElementTree as ET + +A = "{http://www.w3.org/2005/Atom}" +recs = [] +for p in sorted(glob.glob("source/*.xml")): + root = ET.fromstring(open(p, "rb").read()) + for e in root.findall(A + "entry"): + aid = re.search(r"abs/(.+)$", e.findtext(A + "id", "")).group(1) + ab = re.sub(r"\s+", " ", (e.findtext(A + "summary", "") or "")).lower() + recs.append((aid, ab)) + +# Jaccard overlap between abstract sets +def toks(s): + return set(re.findall(r"[a-z]{4,}", s)) + +nodes = {a: toks(ab) for a, ab in recs} +hits = [] +ids = list(nodes) +for i in range(len(ids)): + for j in range(i + 1, len(ids)): + a, b = ids[i], ids[j] + inter = nodes[a] & nodes[b] + if len(inter) >= 8: + hits.append((len(inter), a, b, sorted(inter)[:8])) + +hits.sort(reverse=True) +print("pairs with >=8 shared rare-ish tokens:", len(hits)) +for n, a, b, ex in hits[:10]: + print(f" {n:3d} {a} <-> {b} {ex}") diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/run_verdict.py b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/run_verdict.py new file mode 100644 index 0000000..4c1d303 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/run_verdict.py @@ -0,0 +1,209 @@ +#!/usr/bin/env python3 +"""run_verdict.py -- sphinx Archive lane. THE VERDICT COMMAND. + +Exit 0 iff the archive holds. Written independently of build_corpus.py: +it re-parses the frozen raw XML from scratch, re-derives every node and +every proof, re-walks the hash chain, and checks the DAG property. + + python3 run_verdict.py # exit 0 = the archive holds +""" +import hashlib +import json +import os +import re +import sys +import xml.etree.ElementTree as ET + +HERE = os.path.dirname(os.path.abspath(__file__)) +ATOM = "{http://www.w3.org/2005/Atom}" +ARXIV = "{http://arxiv.org/schemas/atom}" +FAILS = [] + + +def check(name, cond, detail=""): + print(f" [{'PASS' if cond else 'FAIL'}] {name}" + (f" -- {detail}" if detail else "")) + if not cond: + FAILS.append(name) + + +def canon(aid): + return re.sub(r"v\d+$", "", aid.strip()) + + +def h(b): + return hashlib.sha256(b).hexdigest() + + +def main(): + corpus = json.load(open(os.path.join(HERE, "corpus.json"))) + nodes = corpus["nodes"] + print(f"archive: {corpus['artifact']} built {corpus['built_utc']}") + print(f"nodes={len(nodes)} edges={len(corpus['edges'])}") + + # ---- 1. raw sources exist and match their recorded hash ---- + for fm in corpus["fetch"]: + p = os.path.join(HERE, fm["raw_path"]) + ok = os.path.exists(p) + check(f"source present: {fm['raw_path']}", ok) + if not ok: + continue + raw = open(p, "rb").read() + check(f"source sha256 matches: {fm['label']}", h(raw) == fm["raw_sha256"], + f"recorded={fm['raw_sha256'][:12]} actual={h(raw)[:12]}") + check(f"source byte count matches: {fm['label']}", len(raw) == fm["raw_bytes"]) + + # ---- 2. every node's proof line + block hash re-derive from raw XML ---- + raw_by_label = {} + for fm in corpus["fetch"]: + raw_by_label[fm["label"]] = open(os.path.join(HERE, fm["raw_path"]), "rb").read() + + bad_line = bad_hash = bad_title = 0 + for nd in nodes: + raw = raw_by_label[nd["slice"]] + lines = raw.split(b"\n") + ln = nd["proof"]["line"] + if not (1 <= ln <= len(lines)) or lines[ln - 1].strip() != b"": + bad_line += 1 + continue + # re-derive block + starts = [i for i, x in enumerate(lines) if x.strip() == b""] + idx = starts.index(ln - 1) + end = starts[idx + 1] if idx + 1 < len(starts) else len(lines) + block = b"\n".join(lines[ln - 1:end]) + if h(block) != nd["proof"]["block_sha256"] or len(block) != nd["proof"]["block_bytes"]: + bad_hash += 1 + # re-derive the title from the block itself + m = re.search(rb"]*>(.*?)", block, re.S) + if m: + t = re.sub(r"\s+", " ", m.group(1).decode("utf-8", "replace")).strip() + if t != nd["title"]: + bad_title += 1 + check("proof line numbers all point at ", bad_line == 0, f"{bad_line} bad") + check("proof block hashes all re-derive", bad_hash == 0, f"{bad_hash} bad") + check("titles re-derive from proof block", bad_title == 0, f"{bad_title} bad") + + # ---- 3. dedupe: node ids unique, and every node is present in its raw slice ---- + ids = [nd["node"] for nd in nodes] + check("node ids unique", len(ids) == len(set(ids))) + present = set() + for label, raw in raw_by_label.items(): + root = ET.fromstring(raw) + for e in root.findall(f"{ATOM}entry"): + aid = re.search(r"abs/([^/]+)$", e.findtext(f"{ATOM}id", "").strip()) + if aid: + present.add(canon(aid.group(1))) + check("every node exists in frozen raw XML", set(ids) <= present, + f"{len(set(ids) - present)} missing") + + # ---- 4. hash-chained append-only edge journal ---- + prev = "0" * 64 + bad_chain = 0 + rows = [json.loads(l) for l in open(os.path.join(HERE, corpus["journal"]["path"])) if l.strip()] + for i, row in enumerate(rows, start=1): + if row["seq"] != i or row["prev_hash"] != prev: + bad_chain += 1 + continue + body = {k: row[k] for k in ("seq", "from", "to", "jaccard", "prev_hash")} + if h(json.dumps(body, sort_keys=True, separators=(",", ":")).encode()) != row["hash"]: + bad_chain += 1 + prev = row["hash"] + check("edge journal hash chain intact", bad_chain == 0, f"{bad_chain} bad rows") + check("journal head matches manifest", prev == corpus["journal"]["head"]) + check("journal entry count matches manifest", len(rows) == corpus["journal"]["entries"]) + + # ---- 5. DAG: every edge points later-published -> earlier-published ---- + pub = {nd["node"]: nd["published"] for nd in nodes} + bad_dir = [e for e in corpus["edges"] if not (pub[e["to"]] <= pub[e["from"]])] + check("all edges point to an earlier-or-equal publication date", not bad_dir, + f"{len(bad_dir)} violations") + + # ---- 6. cycle check by longest-path (a DAG has longest path <= node count) ---- + adj = {} + for e in corpus["edges"]: + adj.setdefault(e["from"], set()).add(e["to"]) + # iterative DFS longest path with memo; detect cycle via recursion stack + WHITE, GREY, BLACK = 0, 1, 2 + colour = {n: WHITE for n in ids} + cycle = [] + + def dfs(u, stack): + colour[u] = GREY + for v in sorted(adj.get(u, ())): + if colour.get(v, WHITE) == GREY: + cycle.append(stack + [v]) + elif colour.get(v, WHITE) == WHITE: + dfs(v, stack + [v]) + colour[u] = BLACK + + for n in ids: + if colour[n] == WHITE: + dfs(n, [n]) + check("graph is acyclic", not cycle, f"{len(cycle)} cycles") + + # ---- 7. edge endpoints are real nodes ---- + known = set(ids) + bad_ep = [e for e in corpus["edges"] if e["from"] not in known or e["to"] not in known] + check("all edge endpoints are corpus nodes", not bad_ep, f"{len(bad_ep)} bad") + + # ---- 7b. edges RE-DERIVE from the archived titles (no trust in corpus.json) ---- + STOP = { + "a", "an", "the", "of", "for", "and", "or", "to", "in", "on", "with", "via", + "by", "from", "as", "at", "is", "are", "we", "our", "their", "its", "this", + "that", "these", "those", "using", "based", "towards", "through", "into", + "how", "what", "why", "when", "can", "do", "does", "be", "been", "than", + } + title_by_node = {nd["node"]: nd["title"] for nd in nodes} + thr = corpus["counts"]["threshold"] + + def tt(s): + out = set() + for w in re.findall(r"[A-Za-z][A-Za-z\-]+", s.lower()): + w = w.strip("-") + if len(w) < 3 or w in STOP: + continue + out.add(w[:4] if len(w) > 4 else w) + return out + + bad_jac = 0 + rederived = set() + for e in corpus["edges"]: + sa, sb = tt(title_by_node[e["from"]]), tt(title_by_node[e["to"]]) + if not sa or not sb: + bad_jac += 1 + continue + j = round(len(sa & sb) / len(sa | sb), 4) + if abs(j - e["jaccard"]) > 1e-9: + bad_jac += 1 + rederived.add((e["from"], e["to"])) + check("edge jaccard re-derives from archived titles", bad_jac == 0, f"{bad_jac} bad") + + # no edge may be missing: recompute the full edge set independently + expected = set() + for i in range(len(ids)): + for j in range(i + 1, len(ids)): + a, b = ids[i], ids[j] + sa, sb = tt(title_by_node[a]), tt(title_by_node[b]) + if not sa or not sb: + continue + if len(sa & sb) / len(sa | sb) >= thr: + expected.add((b, a)) + missing = expected - rederived + extra = rederived - expected + check("edge set is exactly the recomputed edge set", not missing and not extra, + f"{len(missing)} missing, {len(extra)} extra") + + # ---- 8. counts in the manifest are honest ---- + c = corpus["counts"] + check("manifest node count honest", c["distinct_nodes"] == len(nodes)) + check("manifest edge count honest", c["similarity_edges"] == len(corpus["edges"])) + + print() + if FAILS: + print(f"VERDICT: FAIL ({len(FAILS)} checks failed: {', '.join(FAILS)})") + return 1 + print(f"VERDICT: PASS -- {len(nodes)} nodes, {len(corpus['edges'])} edges, all checks green") + return 0 + + +if __name__ == "__main__": + sys.exit(main()) diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc.xml b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc.xml new file mode 100644 index 0000000..0b1433f --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc.xml @@ -0,0 +1,3529 @@ + + + https://arxiv.org/api/WgUIs+NvuZzyfBb7JEAbIrUBqoQ + arXiv Query: search_query=cat:cs.CL AND abs:"long context"&id_list=&start=0&max_results=100 + 2026-10-26T11:17:14Z + + 100 + 1785 + 0 + + http://arxiv.org/abs/2610.32781v1 + Every Edge Needs a Quote: Building a Quote-Grounded Knowledge Graph of Healthcare Software Adoption with Language-Model Agents + 2026-10-23T15:28:39Z + + + Hospitals regularly buy software that clinicians and patients depend on. Because these purchases are costly, hard to reverse and can affect patient care, buyers look for evidence of which peer institutions already use a product and which systems it connects to. This evidence is public but scattered across vendor websites, press releases and third-party pages. Language-model agents can now collect it at low cost, but the correctness of the extracted claims is difficult to establish, and a wrongly listed customer can mislead buyers and misrepresent an organisation. We present a pipeline that builds a knowledge graph of customer and integration relations from the open web under one rule: every edge must be supported by a verbatim quote from its source page. Pages come from a deterministic crawl of each vendor's site and a budgeted ReAct agent that searches the rest of the web. A permissive extractor proposes relations with quotes, and a layered grounding stage decides which to keep, using a referent step that reads the whole page when a quote names only one side, deterministic checks, and a panel of five model calls voting on nine criteria. On 61 vendors, the pipeline reaches 0.94 precision and 0.71 recall against a page-level key covering the 6,428 candidate relations proposed by its extractor, whose verdicts were drafted by one model and re-checked with a second. Against the golden reference, the marketplace's own curated list, it scores lower, but 89% of the relations it keeps that the reference lacks are stated on a page. A confidence score built from the panel's votes keeps more correct relations than the fixed rule at the same precision, and reaches 0.90 precision at 0.90 recall. We also discuss how narrow, bounded model calls, string-matched evidence and voting address long-context degradation and run-to-run variance. + + + + 2026-10-23T15:28:39Z + 19 pages, 3 figures, 9 tables. Code: https://github.com/MEDomicsLab/healthcare-agentic-kg + + + Juan Felipe Duran + + + Arthur Tobler + + + Martin Vallières + + + + http://arxiv.org/abs/2610.32483v1 + When Agents Fail: Model or Harness--Who's to Blame? + 2026-10-23T10:57:54Z + + + LLM agents combine models with execution harnesses, so agentic benchmark performance reflects their joint behavior. We argue that harnesses should therefore be evaluated through their interactions with underlying models. We develop a framework combining five complementary measures: (i) Valid Completion Rate (VCR), how reliably agents finish normally and deliver evaluable results, irrespective of task correctness; (ii) Model-Harness Fit, how well a harness supports task achievement through valid completion for a given model; (iii) Cross-Model Fit, a harness's overall suitability across evaluated models; (iv) Interaction Residuals, pairing-specific execution strengths and weaknesses hidden by component-level summaries; and (v) Token Load, the token demands of agent execution, including failed attempts. We evaluate four general-purpose harnesses (OpenCode, Codex CLI, Pi CLI, and DeepAgents) with four core models, plus two fixed native model-harness systems, on six benchmarks covering context management, tool use, long-context planning, multimodal interaction, and artifact handoff. Including native references and stress conditions, 111 evaluation settings yield 52,168 trajectories. Harness rankings vary across models and benchmarks; task performance and valid completion can favor different pairings, and similar task scores can accompany distinct execution profiles. OpenCode ranks first in cross-model performance, while DeepSeek V4 Flash Preview maintains consistently high Mean VCR across harnesses on the shared four-benchmark panel. These findings support evaluating model-harness interactions, training transferable harness-use capabilities in models, and harness designs adapted to the model and task. + + + + 2026-10-23T10:57:54Z + Preprint under review + + + Shao Zhang + + + Hangfan Zhang + + + Yuanyuan Shi + + + Hao Li + + + Min-Le Su + + + Kangcong Li + + + Jingping Wang + + + Chunjiang Mu + + + Chen Zhang + + + Yang Chen + + + Bo Zhang + + + Shuyue Hu + + + + http://arxiv.org/abs/2610.32213v1 + Head Dimension Matters in Language Models for Long-Context Retrieval + 2026-10-23T06:08:34Z + + + Multi-head attention retrieves and combines context representations through query--key interactions and value aggregation, with head dimension constraining the per-head representation space. In long-context processing, it remains unclear whether allocating a fixed parameter budget to fewer, wider heads improves information retrieval. In this paper, we investigate how head dimension affects the performance of long-context retrieval tasks. Our empirical studies reveal that pretraining loss and short-context non-retrieval task performance are not affected much by head dimension, while long-context retrieval performance improves with wider heads at fixed model sizes. We find that models with wider heads have a higher proportion of retrieval heads, associating more parameters with retrieval. Our ablation studies also show that the retrieval performance improves with wider heads even when the projection weights in attention modules are frozen during long-context continual pretraining, suggesting that wider heads not only benefit updates in attention modules but lead to more effective adaptation of components such as embeddings and MLPs. + + + + 2026-10-23T06:08:34Z + + + Seiya Tokui + + + Shoichiro Yamaguchi + + + Sosuke Kobayashi + + + + http://arxiv.org/abs/2610.31945v1 + Kolibri: A Sovereign European Model on the Pareto Frontier + 2026-10-22T21:45:10Z + + + This report introduces Kolibri, an English-German mixture-of-experts transformer with 78.1B total parameters and 3.46B active parameters per token, released as open weights under the Apache 2.0 licence. We built Kolibri for sovereign and specialised deployment, with a particular focus on German and on regulated domains such as public administration, industry, and aerospace. To support these settings, we control the full model-development process, including data, architecture, training infrastructure, post-training, and evaluation. + We train Kolibri on 24T tokens across pre-training, mid-training, and long-context extension, with German accounting for more than 20% of the data mix by bytes. To reach this share, we complement German datasets with more than 2T German tokens that we curate from the web with our own pipeline and generate synthetically. Post-training combines supervised fine-tuning on curated German and English data with reinforcement learning on more than 1.2M internally curated tasks, which cover reasoning, tool use, instruction following, code, and retrieval. The model activates 4.4% of its parameters per token, and among the open models evaluated in this report, it lies on the Pareto frontier of quality and serving cost in English and German. + Kolibri builds on Kolibri Origin, an earlier iteration that validated our full pipeline at scale. Both models come from our Model Factory, which connects data, experimentation, training, evaluation, and deployment through version-controlled workflows. + + + + 2026-10-22T21:45:10Z + + + Aleph Alpha + + + : + + + Moritz Althaus + + + Artur Baranowski + + + Michael Barlow + + + Fabien C. Y. Benureau + + + Felix Berkenkamp + + + Amrita Bhattacherjee + + + Lukas Blübaum + + + Duncan Blythe + + + Augustijn de Boer + + + Bastian Boll + + + Thomas F. Burns + + + Björn Deiseroth + + + Niko Dürr + + + Béni Balázs Egressy + + + Niklas Finken + + + Niklas Freymuth + + + Fabian Gebhart + + + Max Hammer + + + Bastian Harren + + + Andreas Hartel + + + Johann Higl + + + Steffen Hirschmann + + + Pablo Iyu Guerrero + + + Yasser Jadidi + + + Andreas Jagusch + + + Mitja Kleider + + + Markus Klein + + + Jonas Knupp + + + Murali Kondragunta + + + Garwin Lechner + + + Dominik Lê-Kellner + + + Jurek Leonhardt + + + Jiaze Li + + + Sohir Maskey + + + Omar Mehio + + + Pit Neitemeier + + + Letitia Parcalabescu + + + Alejandro Petry Pacheco + + + Pranav Ragupathy + + + Martin Reinhardt + + + Peter Rodenkirch Nfissi + + + Dylan Rodriquez + + + Leonard Salewski + + + Raziye Sari + + + Jordan Sassoon + + + Ivo Schaper + + + Ilhan Scheer + + + Frank Schneider + + + Philipp Scholl + + + Lukas Schott + + + Eric Schreiber + + + Pablo Schumacher + + + Alessio Serra + + + Philipp Siedler + + + Prabhu Teja Sivaprasad + + + Mohamed Soliman + + + Till Speicher + + + Volker Stampa + + + Simon Thel + + + Serge Thilges + + + Irina Vidal Migallón + + + Denis Waßmann + + + Samuel Weinbach + + + Sascha Wirges + + + Michael Wüthrich + + + Alexei Zacharov + + + + http://arxiv.org/abs/2610.31911v1 + LazyFlash: Forward-Dense, Backward-Sparse Attention for Accelerated Long-Context Fine-Tuning + 2026-10-22T21:04:07Z + + + As large language models (LLMs) process increasingly long sequences, attention becomes a major computational bottleneck. Sparse attention mostly targets inference, yet many methods still train densely or cannot support sparse training, and their added complexity makes sparsity hard to turn into wall-clock speedups, leaving dense attention widely used in practice. This paper introduces LazyFlash, a forward-dense, backward-sparse attention method built on the observation that attention training is dominated by the backward pass. LazyFlash keeps the forward pass exactly dense, so the trained model remains a standard dense model that existing systems such as vLLM can serve without any change. For the backward pass, LazyFlash proposes a gradient-aware block sparsification design that ranks query blocks by their attention-output gradient norms and skips those contributing negligibly to parameter updates, turning the dense backward into a block-sparse one. A gradient-mass budget adapts the amount of skipped computation to each head and training step, while importance sampling preserves the dense gradient in expectation. These designs are implemented inside the tiled FlashAttention backward kernel, where skipped blocks are never loaded or computed, translating gradient sparsity into real wall-clock acceleration. Experiments on long-context text and speech LLMs show that LazyFlash maintains downstream performance while achieving up to 5.7x attention-backward speedup over FlashAttention and 1.7x end-to-end training speedup. + + 2026-10-22T21:04:07Z + + + Keqi Deng + + + Ruchao Fan + + + Jinyu Li + + + + http://arxiv.org/abs/2610.31135v1 + Mixing Matters: Evidence Position Bias Across Sequence Mixers in Long-Context Question Answering + 2026-10-22T11:54:30Z + + + Long-context models often use answer-bearing evidence less effectively when it appears away from a prompt boundary. We compare this position bias across Transformer, state-space, and hybrid Mamba architectures by moving one gold document through a fixed set of nine distractors. The evaluated Transformers show a beginning advantage that the evaluated state-space models lack, while both families favor evidence near the end. A matched pure-versus-hybrid Mamba comparison points in the same direction but remains statistically uncertain. The family difference appears among models that can answer the task. Transformer primacy reappears on synthetic retrieval, where state-space ceiling prevents a family comparison. A corpus swap within one state-space architecture changes overall accuracy without a detectable change in curve shape. Prompt changes can create or nearly remove a beginning advantage. Position remains decodable across architectures even when response curves differ, and attention concentration near initial tokens covaries with beginning sensitivity in the tested Transformer family. These exploratory results show that effective context use depends on the evaluated architecture family, capability, task, and prompt, without isolating the sequence mixer as the sole cause. + + + + 2026-10-22T11:54:30Z + Accepted at the 2nd Workshop on Principles of Generative Modeling (PriGM), NeurIPS 2026. 9 pages. Code: https://github.com/beingamanforever/Mixing-Matters + + + Aman Behera + + + Namit Solanki + + + Mehul Anand + + + + http://arxiv.org/abs/2610.31098v1 + RIFT: KV Cache Compression for Draft Models with Complementary Compressibility Training + 2026-10-22T11:12:23Z + + + Speculative decoding is a popular decode acceleration method. As such, it is particularly relevant to long-output generation, which requires an increasingly large KV cache. KV cache compression offers a way to constrain costs in long-context drafting. However, compression methods that focus on prefill information can lose relevance as the output length grows. We term this phenomenon decode staleness and show that it degrades draft model accuracy under selection-based KV cache compression. We introduce RIFT, a family of selection-based KV cache compression strategies that balance prefill information and recent generated tokens. We show that refreshing the KV cache selection during token generation significantly improves the drafter's quality at the cost of additional decode latency. To alleviate the refresh costs, we propose an adaptive KV refresh strategy that reduces the number of score calculations while retaining the drafter's quality. We further demonstrate how a compressibility-driven drafter training phase, based on sparse attention masks, can improve the drafter's quality under a compressed KV cache. Combined with compressibility training, RIFT enables Qwen3.5-4B, drafting for Qwen3.5-122B, to retain over 98% of its full-cache acceptance length on 32K-token inputs, 4K-token outputs, and an 8K-token KV cache budget. + + 2026-10-22T11:12:23Z + + + Dor Tsur + + + Maor Ashkenazi + + + Maximilian Golub + + + Peter Hicks + + + Yaniv Galron + + + Talor Abramovich + + + Yoav Miron + + + Tiyasa Mitra + + + Bita Darvish Rouhani + + + Ran Zilberstein + + + + http://arxiv.org/abs/2610.30132v1 + LongZero: Enhancing Long-Context Reasoning in LLMs from Zero Data + 2026-10-21T17:59:14Z + + + Reinforcement learning (RL) is an effective way to strengthen the long-context reasoning of large language models (LLMs), but it needs training data that are long, diverse, challenging, and verifiable. Human annotation of such data is expensive, naturally occurring data are too scarce to sustain RL, and existing synthesis methods depend on external corpora or stronger teacher models, which become harder to obtain as the trained models get stronger. Recently, RL from zero data, in which a model learns from tasks it proposes itself, has achieved excellent performance, but existing methods target short-context tasks. Therefore, we propose $\textbf{LongZero}$, a method that lets an LLM improve its own long-context reasoning without any external data. Instead of writing questions and answers over existing documents, LongZero first has the model synthesize the question and answer with its supporting evidence in a compact structured form, and only then separately expands the evidence into a long multi-document context. LongZero combines these self-written multi-hop reasoning tasks with self-written multi-round retrieval tasks and trains the model with GRPO. We evaluate LongZero on two LLMs across five long-context reasoning benchmarks and compare it with RL on data synthesized from external corpora. Experimental results show that LongZero can generalize to real tasks, and outperforms both baselines, suggesting a viable and promising path to improving long-context reasoning of LLMs. + + + 2026-10-21T17:59:14Z + Code and data are available at https://github.com/zhennan1/LongZero + + + Zhennan Wan + + + Jianfei Chen + + + + http://arxiv.org/abs/2610.29352v1 + Don't Stop Long-Context Continual Pre-Training Too Early: An Empirical Scaling Law + 2026-10-21T07:46:55Z + + + Long-context continual pre-training (LCCP) is widely used to improve long-context capability, but how its benefits scale with the number of tokens used for LCCP remains unclear. We investigate this question through modeling, monitoring, and validating the benefits of scaling LCCP. First, we establish an empirical additive power law relating long-context performance to model size and the respective token budgets of short-context pre-training and LCCP. Experiments across five model scales and more than one hundred short- and long-context budget configurations show that the fitted law reproduces the observed trends and extrapolates well to held-out model scales. Second, we introduce \textsc{Constant-Last4}, a training and observation protocol that averages the four most recent consecutive checkpoints from a constant-learning-rate run to enable stable monitoring along a single extensible training trajectory. Under this protocol, the same scaling-law form fits well and accurately predicts the LCCP performance trajectory of a 1.22B-parameter model trained on approximately 100B LCCP tokens. Finally, downstream evaluations along this trajectory show continued improvements in long-context performance, with no clear sign of saturation within the evaluated range. These gains persist after both 128K context extension and supervised fine-tuning, with benefits extending to long-context understanding and agentic tasks. Together, these results argue for continuing to scale LCCP rather than stopping early: its gains are stably observable along an extensible trajectory, quantitatively predictable, and transferable to downstream tasks. + + 2026-10-21T07:46:55Z + 32 pages, 18 figures + + + Ziqing Qiao + + + Xiaoyue Xu + + + Sikui Zhang + + + Yinuo Xu + + + Bingxiang He + + + Chaojun Xiao + + + Xu Han + + + + http://arxiv.org/abs/2610.28393v1 + When Copying Is Hard: Copy-Constrained Decoding for Exact Span Reproduction + 2026-10-20T15:40:54Z + + + Precisely reproducing a target span verbatim within a long context is a fundamental capability test for LLMs: even when the target string is present in context, models often still drift within the span or fail to stop correctly, revealing limitations in source grounding and boundary control. This capability has broad practical relevance. For instance, code generation often requires embedding sensitive strings such as API keys exactly as they appear in context. In this work, we construct a benchmark to test exact span reproduction ability across contracts, scientific literature, code, and random sequences, and find that current models still make surprisingly frequent errors. To address this, we propose CopyGen, a lightweight copy-constrained plugin for frozen LLMs that turns copying from a byproduct of next-token prediction into a controlled process. Our key idea is to decompose copying into three distinct decisions: when to copy, how far to copy, and when to stop. Concretely, CopyGen first determines whether to enter copy mode, then predicts a tentative copy length, and finally verifies the generated span token by token. During verification, we adaptively adjust the logits of copy continuation tokens to incentivize or suppress continuation, and emit only the longest valid prefix. Across three LLM backbones and four benchmark tasks, CopyGen improves average exact match by 35% relative without model finetuning, and integrates seamlessly with SFT to further improve it by 4%, while substantially accelerating generation. These results suggest that reliable exact copying is not something LLMs obtain for free, but a decoding-time control problem that requires explicit modeling. Code is available at https://github.com/mbzuai-nlp/CopyGen. + + 2026-10-20T15:40:54Z + NeurIPS 2026 + + + Jinghui Zhang + + + Lang Gao + + + Zongfang Liu + + + Ruihong Zeng + + + Zirui Song + + + Rui Yan + + + Kentaro Inui + + + Xiuying Chen + + + + http://arxiv.org/abs/2610.26827v1 + KEEP-Bench: Evaluating Evidence Preservation in Context Compression + 2026-10-19T17:55:18Z + + + Context compression improves long-context efficiency but may introduce faithfulness issues through an information bottleneck. Existing evaluations rely on QA metrics, but a reader can still answer correctly from an unfaithful compression, so these metrics underestimate such loss. To bridge this gap, we introduce KEEP-Bench, a diagnostic benchmark that directly assesses compression faithfulness with 4,102 cases across three challenging settings that require keeping evidence for plausible reference resolutions, explicit qualifiers, and minority perspectives. Experiments show that even with tailored prompting, the strongest models remain unreliable: despite context windows exceeding 100K tokens and inputs averaging only 3.1K tokens, the best open-weight model (31B) preserves all required evidence in only 66.8% of cases, and the best proprietary model in only 61.6%. Performance also varies sharply across evidence structures, so conclusions from limited structures may be biased. We further introduce a metric, Evidence Preservation Return (EPR), to relate evidence recall to inference FLOPs, and find that it peaks at moderate scales (4B-8B), where recall remains low. Additional output budget mainly benefits already strong models and widens capability gaps, yet the stronger preservation of these models comes at a steep computational cost. These findings highlight the importance for future work to investigate compressors with strong information preservation under a small computation budget, rather than relying on a large output budget or model scaling. + + 2026-10-19T17:55:18Z + Code: https://github.com/PlusLabNLP/KEEP-Bench Project: https://pluslabnlp.github.io/KEEP-Bench/ + + + Ziqing Man + + + Di Wu + + + Jia-Chen Gu + + + Junyi Zhang + + + Kai-Wei Chang + + + Nanyun Peng + + + + http://arxiv.org/abs/2610.26754v1 + TokenGate: Adapting LLMs for Fast and Memory-Efficient Prefill with Learned Token Pruning + 2026-10-19T17:15:53Z + + + Expert human readers process large inputs (e.g., code repositories and long documents) by skimming to closely read only what matters. On the other hand, language models process all input tokens through each model layer, resulting in significant processing costs for long-context inputs. We introduce TokenGate, a small, drop-in component that extends existing trained models to enable end-to-end learnable token pruning over long-context inputs for fast and memory-efficient prefill. To enable end-to-end learning despite the non-differentiable top-K operator for token pruning, we introduce token-gated attention, a mechanism inspired by Mixture-of-Experts that re-weights attention logits using token importance scores. Across diverse tasks, TokenGate achieves $1.4$-$11.3\times$ faster time-to-first token (TTFT) and $1.5$-$3.4\times$ lower peak memory at no accuracy degradation for prefill in transformers. Compared to the best-performing prior methods for token-pruning, TokenGate gives up to $6.4\times$ faster prefill and $2\times$ lower peak memory. TokenGate natively extends both standard transformers (e.g., Qwen3) and hybrid-attention models (e.g., Qwen3.5) with simple lightweight adaptation comparable to standard parameter-efficient fine-tuning. We make our code available at: https://github.com/tokengate-models/TokenGate. + + + 2026-10-19T17:15:53Z + + + Liana Patel + + + Rishabh Ranjan + + + Ion Stoica + + + Matei Zaharia + + + Carlos Guestrin + + + + http://arxiv.org/abs/2610.25919v1 + LEAPS: Long-context Evaluation of Adaptive Pattern Learning and State Tracking + 2026-10-19T07:19:45Z + + + Long-context language models (LCLMs) power agents that act over long trajectories, from improving a codebase to running research experiments to forecasters that condition on lengthy histories. These applications draw on three distinct long-context capabilities: recall, where the answer is a fact present in the context; state tracking, where the outcome can be computed by performing a series of transformations to a specified state; and pattern learning, where the goal is to make a prediction by sampling from a distribution inferred from many observations. Existing benchmarks primarily focus on the first capability. In this work, we introduce LEAPS (Long-context Evaluation of Adaptive Pattern learning and State tracking), a collection of 12 novel datasets, spanning agentic workflows, behavioral modeling, and forecasting of market and world events. By construction, LEAPS is resistant to data contamination, extends to millions of input tokens, and uses reliable metrics. We evaluate 30 API and open models from 8K to 512K input tokens. LEAPS distinguishes models that perform near perfectly on recall tasks, finding that such models' state tracking and pattern learning abilities can vary significantly and degrade much more dramatically with increasing input lengths--even for pattern learning, where more observations should make learning a theoretically easier task. Moreover, thinking models often underperform their base counterparts, exhausting their generation budget or oversimplifying the task. We hope LEAPS can guide the development of the next generation of LCLMs. + + 2026-10-19T07:19:45Z + Code and data available at https://github.com/howard-yen/LEAPS + + + Howard Yen + + + Nitya Mani + + + Alex Renda + + + Christopher S. Hardin + + + + http://arxiv.org/abs/2610.25463v2 + DiaLong: Benchmarking Reminiscence in Long-Context Dialogues + 2026-10-20T19:55:41Z + + + How well can transformer-based Large Language Models (LLMs) retain and recall memories in long contexts of dialogue? LLMs are known to forget long-range factual information in their context, yet the field lacks a comprehensive benchmark to quantitatively assess these shortcomings. We present DiaLong, a long-context dialogue dataset and accompanying memory task that standardizes evaluation in this space. It consists of 100 unique conversations created by humans and then augmented with LLMs, extending beyond lengths found in existing datasets. Our selected memory task is fact recall: classify 40 candidate facts about a dialogue as true or false. This task directly probes the model's ability to actively retain and retrieve information, serving as a critical measure of memory within extended conversational contexts. In testing both the latest LLMs and proposed memory enhancements on DiaLong, we demonstrate that more work needs to be done to enable LLMs with better memory performance. By enhancing memory capabilities, LLMs can improve in maintaining coherence, relevance, and human-like interaction over extended conversation. Improving these capabilities will help LLMs fulfill diverse user needs and expectations in various conversational scenarios. + + + 2026-10-18T18:47:42Z + Equal contribution. Work conducted in 2023 at Johns Hopkins University + + + Owen Bianchi + + + Samer Aslan + + + Ryunosuke Saito + + + + http://arxiv.org/abs/2610.26951v1 + The Bottleneck Is Retrieval, Not Reading: Diagnosing Evidence-Based Generation with RAG for Long Context Question Answering + 2026-10-18T09:10:42Z + + + Retrieval-augmented generation (RAG) is the dominant paradigm for grounding large language models in external corpora, but its similarity-driven, chunked pipeline has structural blind spots: it cannot anticipate which passages a question requires and discards document-level context that resolves cross-passage references. We introduce evidence-based generation (EBG), requiring models to return an answer with line-level citations, and a joint Ans+Evid metric that scores correctness and grounding simultaneously. We reformulate two corpora into evidence-grounded multi-document QA benchmarks- MultiHop-RAG and QASPER-MP, a multi-paper adaptation of QASPER with realistic short paper cues, and pair them with a controlled synthetic two-hop haystack and an evidence-augmented NoLiMa spanning 10K-1M characters. Across ten proprietary frontier and three open-weight LLMs, EBG isolates two RAG limitations that long-context models avoid: similarity retrieval surfaces any relevant chunk far more reliably than all required chunks for multi-fact queries, and chunking destroys document meta-information needed to resolve identity-bearing queries. EBG also exposes grounding failures invisible to answer-only evaluation, including incomplete citations in two-needle settings and a widening gap between Ans and Ans+Evid when context contradicts parametric knowledge. Data and code are available at https://github.com/debobanerjee/LC-EBG. + + + 2026-10-18T09:10:42Z + + + Debopriyo Banerjee + + + Owais Aijaz + + + Ahmer Tabassum + + + Zhuohan Xie + + + Preslav Nakov + + + Veselin Stoyanov + + + + http://arxiv.org/abs/2610.24991v1 + Certified Sparse Attention via Perturbed Retrieval + 2026-10-18T03:50:13Z + + + Sparse attention speeds up long-context decoding by reading few keys of the KV cache, but existing methods do not control the error of a query, and on real KV caches their errors have heavy tails. We show that perturbing the score of every key with an independent Exp(1) variable turns threshold retrieval into sampling keys with probability proportional to their attention weights. Lowering the threshold along a geometric grid gives nested samples, a Horvitz--Thompson estimate of the output at every level, and confidence bounds that hold simultaneously over all levels, so each head stops at the first level whose certificate meets the target error $\varepsilon$. With fresh perturbations at every decoding step, each certificate fails with probability at most $δ$ during generation. At a suitable threshold, the estimator reads $O(\varepsilon^{-2}\log(1/δ))$ values regardless of the context length, and no adaptive method reads fewer, up to constants. A 4-bit scan with deterministic bounds, shared across a grouped-query-attention group, generates the candidates exactly but reads every key. On three LLMs and ten settings at 16K--128K tokens, no certificate is violated, and at equal keys read our 90th-percentile error is 4.6--7.9$\times$ lower than that of the best of 15 baseline families. At equal bytes, the best baselines have 0.6--1.6 times our 90th-percentile error and at least 4.9 times our largest. End to end, our method stays within one point of dense attention on tasks and within 0.1\% in PG-19 perplexity, and the strongest baselines at equal bytes score as well. On CPU, decoding steps at 32K--128K tokens run 1.1--1.4$\times$ faster than dense attention on the same 16-bit cache. + + + 2026-10-18T03:50:13Z + 58 pages (10 pages main text, 48 pages appendix), 10 figures, 35 tables + + + Runguo Li + + + + http://arxiv.org/abs/2610.23787v1 + DLite: History-free Speculative Decoding for Agentic AI + 2026-10-16T17:18:54Z + + + Speculative decoding has become a mainstream technique for accelerating large language model (LLM) inference by using a lightweight draft model to generate candidate tokens that are subsequently verified by the target model. However, agentic workloads introduce long and continuously evolving contexts and frequent multi-turn interactions. Under such workloads, we observe that existing draft models suffer from up to an 80% degradation in acceptance length, while maintaining their historical KV cache introduces substantial system overhead. In this paper, we identify the growing historical context as a common source of both problems and introduce DLite, a history-free speculative decoding framework for agentic AI. DLite directly reuses contextual hidden states from the target model and performs local speculative prediction without explicitly maintaining the historical context, transforming an increasingly complex modeling problem into local simple prediction problem. A lightweight sequential head further restores intra-block causal dependencies with low overhead. To effectively train this heterogeneous history-free architecture, we introduce a tailored two-stage training strategy. Experiments on general-purpose, long-context and agentic workloads show that DLite achieves 2-6 acceptance length and outperforms the state-of-the-art speculative decoding method, DSpark, up to 70%. + + 2026-10-16T17:18:54Z + 14 pages, 5 figures + + + Jiaming Xu + + + Hanzhen Wang + + + Tianlang Zhao + + + Jiewen Xiao + + + Chengze Yuan + + + Jiayi Pan + + + Yongkang Zhou + + + Jiancai Ye + + + Yu Wang + + + Guohao Dai + + + + http://arxiv.org/abs/2610.22985v1 + Prism Attention: Proposal-Refined Index Sharing Mechanism for Efficient LLMs Inference + 2026-10-16T06:11:20Z + + + Long-context decoding in large language models (LLMs) is increasingly bottlenecked by the memory and computation required to attend over an ever-growing Key-Value (KV) cache at each autoregressive step. Although token-level sparse attention reduces this burden by restricting computation to a small subset of relevant past tokens, its practical gains are often offset by repeatedly recomputing layer-wise sparse indices as the context grows. A common remedy is to share sparse indices across layers by computing them only at designated anchor layers, but such static reuse ignores the layer-wise evolution of attention patterns, causing the reused indices to progressively deviate from the layer-specific optima and incur substantial attention loss. By revisiting cross-layer sparsity from the perspective of attention dynamics, we find that inter-layer salient token shift is highly localized: although the exact top-$κ$ indices differ across layers, the core high-attention tokens remain stable, with changes concentrated near the expanded boundary of previously selected regions. Motivated by this, we propose Prism Attention, a proposal-refined sparse attention framework. It replaces rigid cross-layer index reuse with a coarse-to-fine strategy, preserving layer-wise adaptability while retaining the efficiency benefits of cross-layer sharing. Extensive experiments show that Prism Attention achieves state-of-the-art performance among mainstream sparse attention methods on both reasoning and long-context benchmarks, while attaining a $3.4\times$ end-to-end decoding speedup over FlashAttention at 128K context length. + + + 2026-10-16T06:11:20Z + Published as a main conference paper at NeurIPS 2026 + + + Zhenxu Tian + + + Kebin Liu + + + Zhengwu Yang + + + Yi Su + + + Qingqing Dang + + + Yanlin Sha + + + Kaipeng Deng + + + Dianhai Yu + + + Yanjun Ma + + + Juntao Li + + + Min Zhang + + + + http://arxiv.org/abs/2610.22067v1 + Beyond Context Length: Characterising the Difficulty of Long-Context Reasoning + 2026-10-15T15:28:33Z + + + Long-context language models support ever longer context windows, and evaluations typically treat context length as the main indicator of difficulty. However, context length alone cannot explain why models fail on long-context tasks that require reasoning over complex information. Contexts of equal length can pose very different challenges: a task may be solvable from a single local passage, or it may require integrating evidence distributed across the full context. We quantitatively characterise this difficulty through three properties: evidence scope, how much necessary information must be found; evidence dispersion, how widely that information is scattered within the context; and reasoning depth, how many dependent steps are needed to derive an answer from it. We construct LURCH, a multi-domain question-answering benchmark of 6,550 instances with supporting evidence and reasoning graphs, enabling all three properties to be quantified. Evaluations of proprietary and open-weight models show that: (1) at fixed context length, all our three properties are strongly negatively correlated with model performance; (2) as context length increases, performance degrades sharply on samples with dispersed evidence, whereas it remains relatively stable on samples with localised evidence; and (3) difficulty compounds across properties, as questions with moderately high values on all three are harder than those with an extreme value on just one. These findings establish evidence scope, dispersion and reasoning depth as measures of long-context reasoning difficulty that complement context length. + + 2026-10-15T15:28:33Z + + + Shiwen Qin + + + Cameron Barker + + + Henry Gouk + + + Elliot J. Crowley + + + Shay B. Cohen + + + Mirella Lapata + + + Miao Li + + + + http://arxiv.org/abs/2610.21165v1 + From Long Context to Selective Memory:A Survey of Memory-Centric Compression for Large Language Models + 2026-10-15T03:24:36Z + + + Long-context capability has become essential for large language models (LLMs) to handle complex tasks, yet continuously expanding the context window does not remove the computational, storage, and information-selection pressures incurred at inference time. Existing work on prompt compression, KV-cache management, efficient serving, retrieval augmentation, and agent memory is usually discussed in isolation, leaving the flow of information between storage and computation insufficiently understood. This survey reframes long-context compression as a memory-management problem for allocating inference-time resources. We distinguish compute-active memory, which directly participates in model computation, from compute-inactive memory, which lies outside the computation path but can be stored, retrieved, updated, or forgotten, and we characterize offloaded KV caches, persistent prefix caches, and precomputed KV states as intermediate states on the activation path. On this basis, we formulate writing, offloading, recall, retrieval-and-injection, materialization, eviction, consolidation, and forgetting as state transitions within an information lifecycle, and introduce a budgeted cost model that places these operations in a single cost account. The resulting framework unifies short-term context compression, long-term memory management, and the transitions between them, and shows that the central challenge is not merely reducing information volume but deciding which information should participate in costly inference, when, and in what form. We further summarize evaluation dimensions, benchmark gaps, and open challenges, and argue that future research should move from static, pointwise compression toward dynamic, governable, lifecycle-aware memory management. + + 2026-10-15T03:24:36Z + + + Chaogui Gou + + + + http://arxiv.org/abs/2610.21126v1 + Compression Does Not End at Selection: Post-Selection Positional Geometry for Sparse KV Caches + 2026-10-15T02:30:27Z + + + Sparse KV compression reduces long-context inference costs by retaining selected historical states, yet these states typically keep their coordinates from the full history. Under Rotary Position Embedding (RoPE), gaps left by evicted tokens continue to affect query-key matching, potentially limiting the use of retained evidence. We study post-selection positional geometry on a fixed selector-produced cache, examining how positional organization affects the use of retained information and which coordinate and continuation rules improve answer quality. To reorganize this geometry, we propose RoPERelay, which assigns compact, order-preserving RoPE coordinates, relocates cached key phases through inverse rotation and re-rotation, and synchronizes the current query and subsequent generation. It reuses existing K/V without renewed selection, historical re-prefill, or additional cache budget. Across 36 comparisons spanning two models, six sparse selectors, and three long-term memory tasks, RoPERelay improves answer quality in 32 cases. For Llama-3.1-8B-Instruct with BM25 on LongMemEval-S, accuracy increases from 23.6% to 35.4%. Measured complete-request time overhead is approximately 1%-3% in the evaluated configurations. These findings establish positional organization as a distinct optimization dimension for sparse KV caches after content selection. + + 2026-10-15T02:30:27Z + + + Wanyang Hong + + + Zhaoning Zhang + + + + http://arxiv.org/abs/2610.20582v1 + Latent Compaction with Test-Time Training + 2026-10-14T17:57:01Z + + + Long contexts enlarge key--value (KV) caches, increasing memory use and attention costs during generation. Compressing these caches must preserve information for unseen questions. We introduce **Latent Compaction**, which learns a compact document-specific cache through test-time training. We initialize cache entries using reconstruction importance, teacher attention, and key-space diversity. Training first fits attention outputs and log-normalizers to those of the full cache, with reconstruction-selected entries held fixed. It then jointly optimizes the entire cache through end-to-end distillation from the full-cache model. Model weights remain frozen throughout, and training uses only generic prompts about the document, without access to downstream questions or answers. Experiments on RULER, LongBench, and Phonebook Lookup demonstrate substantial gains over budget-matched compression baselines. On a RULER, for example, our method achieves 96.7% accuracy at 32$\times$ compression, compared with 40.0% for KVZip+. The method also transfers across model scales and families, with retrieval gains on both Qwen3 and MiniCPM5. These results show that treating the KV cache as a neural network and optimizing it with test-time training can preserve retrieval accuracy under aggressive compression. The code is released at https://www.github.com/THUNLP/latent-compaction + + + 2026-10-14T17:57:01Z + 19 pages, 21 figures + + + Yingfa Chen + + + Xingyu Shen + + + Chaojun Xiao + + + Xu Han + + + + http://arxiv.org/abs/2610.20392v1 + FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decoding + 2026-10-14T15:55:10Z + + + Speculative decoding accelerates LLM generation through lightweight drafting and parallel verification. It is particularly promising for long inputs, where KV-cache access costs can be amortized over multiple accepted tokens. Yet most drafters are trained on short sequences and degrade on long inputs, while long-context training is costly. Existing training-free approaches restrict the context window, rescale positions, or augment recent context with retrieved distant entries. Drafters, however, read target hidden states that already encode contextual and positional information, and their lightweight architecture makes full-history attention affordable. We propose FOLD, a training-free method that preserves exact local positions and treats all distant entries as far memory at a shared position. To counter attention dilution as the memory grows, we sharpen attention within it to emphasize relevant entries while separately controlling its total weight relative to the local window. Across six target-drafter pairs and diverse benchmarks of up to 256K tokens, FOLD predominantly delivers the highest speedup, with the best case more than doubling the speedup over autoregressive decoding, from 2.08$\times$ to 4.22$\times$. + + + 2026-10-14T15:55:10Z + + + Shuxuan Li + + + Jialiang Kang + + + Yanghao Zhou + + + Ziye Zhu + + + Xiao Yang + + + + http://arxiv.org/abs/2610.19928v1 + MemDuet: Learning Dual-Process Memory for Long-Context Reasoning + 2026-10-14T10:16:13Z + + + Reasoning over infinitely long documents is becoming a reality with recurrent memory agents. However, increasing context length exacerbates the trade-off between reasoning performance and inference efficiency. Inspired by Kahneman's account of fast and slow thinking, we propose MemDuet, a dual-process memory framework that learns to coordinate a small language model for fast, parallel evidence selection from raw context chunks (System 1) with a large language model for memory-update verification and memory updates in document order (System 2). We train MemDuet in three stages: supervised fine-tuning of System 1 for evidence selection, Group Relative Policy Optimization (GRPO) of System 2 for verification and memory rewriting, and joint optimization of both policies to coordinate selection and updating for long-context reasoning. Experiments on diverse long-context reasoning benchmarks (RULER-HQA, LongBench v2, and 2WikiMultiHopQA) demonstrate a favorable accuracy-efficiency trade-off as context length grows. Averaged across evaluation settings on the three datasets, MemDuet achieves an end-to-end inference speedup of 9.74x and an output-token reduction of 73.91% relative to RL-MemAgent. + + 2026-10-14T10:16:13Z + + + Jiangcheng Song + + + Haodong Jing + + + Yulin Mu + + + Lesong Tao + + + Jixin Wang + + + Jin Cui + + + Tianjing Ren + + + Runxuan Xie + + + Yongqiang Ma + + + Nanning Zheng + + + + http://arxiv.org/abs/2610.19247v1 + Copy-Paste Language Models + 2026-10-13T22:03:18Z + + + Transformers are intuitively considered to be efficient at copying from their inputs. We actually show that the ability of LLMs to copy in context can be improved through explicit modeling. We propose Copy-Paste Language Models (CPLMs), which add a lightweight Copy-Paste head to the conventional language modeling (LM) head. CPLMs improve training efficiency, downstream performance, and offer new operating points in long-context and retrieval setups. We validate our approach by pretraining models from 135M to 1.7B parameters, showing improvements across all scales and backbones with negligible training and inference overheads. We explain the success of CPLMs by showing that they partially mitigate the LM head gradient bottleneck through an alternative gradient path. + + + 2026-10-13T22:03:18Z + + + Nathan Godey + + + Yoav Artzi + + + + http://arxiv.org/abs/2610.19210v1 + Titan-Llama: Retrofitting Pre-trained LLMs with External Neural Memory Modules + 2026-10-13T21:23:58Z + + + Transformers are efficient to pre-train at scale because attention permits parallel computation across sequence positions, but long-context inference requires increasingly large KV caches. Efficient recurrent alternatives reduce the asymptotic complexity of inference, but their sequential dependence limits token-wise parallelism during training, making them harder to scale. Further, the current paradigm of extending long context tasks creates competing notions of retaining information precisely and keeping long-context inference efficient. To address this gap, we introduce Titan-Llama, a post-training method for retrofitting attention-based language models with a hierarchical memory architecture that updates parameters at test-time. Titan-Llama applies a blockwise attention mask and preserves full-fidelity attention over recent tokens while compressing historical context into recurrent, fixed-size neural memory modules (NMMs). Our formulation allows pre-trained attention layers to be replaced without training a new language model from scratch. On Llama-3.2-1B-Instruct, Titan-Llama raises accuracy over segmented attention windows from 23.87\% to 40.51\% on QuALITY and from 14.50\% to 40.75\% on LongHealth. Inference benchmarks show more than 20\% faster prefill, 37\% faster decode at medium context lengths, and 24\% lower steady-state decode memory usage in the evaluated configurations. Together, these results demonstrate that incorporating memory architecture mechanisms that utilize test-time training effectively modulates long-context behavior of pre-trained models, offering a practical route to adapting pre-trained transformers for efficient long-context inference. Our code is released on Github \href{https://github.com/sarahpannn/titans-pytorch/tree/main}{GitHub} + + + 2026-10-13T21:23:58Z + + + Sarah Pan + + + Ali Behrouz + + + + http://arxiv.org/abs/2610.19026v1 + Joint Subspace Sparse Attention for Efficient Long-Context Decoding + 2026-10-13T18:18:47Z + + + Sparse attention reduces the KV-cache traffic that dominates long-context LLM decoding, but practical methods largely operate at coarse granularity. Token-level selection offers finer control, yet presents two challenges: low-dimensional scoring may lose query--key structure needed for accurate ranking, while gathering scattered selected tokens can offset the resulting latency benefit. We introduce Joint Subspace Sparse Attention (JSSA) to address both challenges. For selection quality, JSSA learns a shared low-dimensional query--key subspace by minimizing token-score preservation error. We upper-bound the resulting non-convex objective with a tractable marginal objective that admits a closed-form spectral solution; direct refinement of the exact objective provides no measurable improvement in the tested settings. For execution efficiency, we develop a gather-free token-level indexed-attention kernel that supports distinct per-KV-head selections under the standard grouped-query attention (GQA) KV-cache layout. Across standard GQA, hybrid sliding-window/global attention, and Multi-head Latent Attention (MLA) models, JSSA consistently remains close to full-KV accuracy while avoiding the substantial generation-length inflation and architecture-dependent failures observed with competing methods. On an NVIDIA B200 GPU, JSSA achieves up to $6.43\times$ the decoding throughput of full-KV attention at 128K context. JSSA achieves reasoning accuracy comparable to model-native DSA without model training and reaches 96--99\% of its decoding throughput even at 700B scale large models. + + 2026-10-13T18:18:47Z + + + Jiwon Song + + + Yoongon Kim + + + Jae-Joon Kim + + + + http://arxiv.org/abs/2610.17959v1 + Virtual Head Attention + 2026-10-13T08:39:20Z + + + The design of attention mechanisms in long-context large language models faces an ``impossible triangle'' among KV cache size, training and prefill FLOPs, and model quality. GQA achieves strong quality but incurs high KV cache overhead; alternative approaches such as MLA and MFA can compress the cache, but MLA suffers from quality loss while MFA substantially increases training and prefill compute. We propose Virtual Head Attention (VHA), which simultaneously improves all three vertices through two lightweight linear operations: Q Premix applies a near-identity transformation to queries within each KV group to recover virtual head diversity from halved physical query heads, and Linear Postmix fuses inter-head features via a low-rank $I + AB^\top$ residual structure. Since VHA introduces no nonlinear operations, Premix can be folded into the query projection and Postmix into the output projection at inference time, reducing the model to a standard GQA-2 architecture that directly reuses all existing GQA inference optimizations. With only two KV heads, the group size in large models readily reaches 64, fully exploiting Tensor Core parallelism during decoding. Across four scales with 4K-context 50B-token pretraining, VHA consistently surpasses the standard GQA baseline at every scale ($+$0.05\% to $+$0.81\%), while reducing KV cache by $4\times$ vs.\ GQA-8 at dense scales and $2\times$ vs.\ GQA-4 at the MoE scale, and lowering training and prefill FLOPs by 7.9\% (1.7B, $S{=}4096$). On an industrial 30B-A3B MoE model trained on 500B tokens at 8K context, VHA outperforms both MLA and GQA-4 by $+$0.70\,/\,$+$2.60\,\% on a 12-benchmark base-model evaluation suite; in a separate matched 10B-A1B MoE comparison after long-context mid-training, VHA attains an average RULER score of 84.4 over 8K--128K versus 73.0 for GQA, while using two rather than four KV heads in the full-attention layers. + + + 2026-10-13T08:39:20Z + Published as a main conference paper at NeurIPS 2026 + + + Xibo Ding + + + Guoxia Wang + + + Jinle Zeng + + + Jiabin Yang + + + Sirui Tao + + + Chao Yang + + + Dianhai Yu + + + + http://arxiv.org/abs/2610.17202v1 + MLAfication: Efficiently Enabling High-Fidelity MLA for Modern LLMs + 2026-10-12T17:59:10Z + + + Multi-Head Latent Attention (MLA) compresses the KV cache into a latent representation, reducing inference memory and bandwidth. Existing MHA2MLA/TransMLA methods do not support QKNorm and require costly recovery on modern LLMs, especially MoE. We present MLAfication, a QKNorm-compatible, parameter-efficient extension of MHA2MLA. It combines calibrated KNorm, parameter-efficient distillation, contribution-aware Partial-RoPE, and activation-aware joint KV initialization. Across MHA and GQA models, including QKNorm- and MoE-equipped variants, MLAfication preserves performance under substantial KV-cache compression, surpasses the current SOTA on commonsense and long-context benchmarks, and extends MLA conversion to modern architectures. On Qwen3-30B-A3B, MLAfication delivers up to $5.35\times$ the serving throughput of BF16 GQA and, combined with 4-bit KV quantization, reduces the KV-cache footprint by $94.73\%$. Our code is available at https://github.com/JT-Ushio/MLAfication. + + + 2026-10-12T17:59:10Z + + + Zile Wang + + + Zhide Xie + + + Tao Ji + + + + http://arxiv.org/abs/2610.15542v1 + Apertus 1.5: From Open Text Models to Open Multimodal Reasoners + 2026-10-11T11:34:43Z + + + Language models are becoming infrastructure, and infrastructure built in the open, by public institutions, on documented data, is the alternative to dependence on a few providers; Apertus shows this is viable at scale. Apertus 1.5 extends the fully open Apertus family from text to multimodal reasoning. Continued pretraining of the Apertus 1.0 models, on 4T additional tokens for the 8B and 2T for the 70B, adds image and audio understanding and extends the context window fourfold to 262,144 tokens; multimodality enters through the tokenizer, the language-model head remains restricted to text, and the architecture is unchanged. Supervised finetuning, long-context finetuning, reinforcement learning with verifiable rewards, and preference alignment complete the released models. Thinking is a flag of the chat template rather than a separate model, and lifts mathematical reasoning by up to 20 points on the 8B model. The released models improve over their predecessors on nearly every benchmark; among fully open models of its class, the 8B leads on knowledge, instruction following, and cultural benchmarks, and its instruction following surpasses all compared models, including open-weight ones. On image and audio understanding, a first for the family, the models are competitive with fully open multimodal models, strongest on document understanding and long-form and lower-resource speech recognition, while specialized vision and audio models remain ahead on perception and transcription of English and other high-resource languages. As in Apertus 1.0, we train only on openly available data, respect crawler opt-outs retroactively, and exclude restrictively licensed material. We release the model weights, data preparation and training recipes, and evaluation suites under permissive licenses; openness extends to values, with the Apertus charter guiding alignment stages published alongside the models. + + 2026-10-11T11:34:43Z + + + Project Apertus + ETH Zurich + + + : + ETH Zurich + + + Yixuan Xu + ETH Zurich + + + Yassine Turki + EPFL + + + Vinko Sabolčec + EPFL + + + Valentina Pyatkin + ETH Zurich + + + Tommy Chu + EPFL + + + Sven Najem-Meyer + EPFL + + + Sean F. Carroll + EPFL + + + Robert Smith + ETH Zurich + + + Raphael Kreft + ETH Zurich + + + Oscar Alessandro Tazza + ETH Zurich + + + Oleg Lavrovsky + EPFL + + + Nicola Irmiger + ETH Zurich + + + Matteo Santelmo + EPFL + + + Marian Schneider + ETH Zurich + + + Juan García Giraldo + EPFL + + + Hanna Yukhymenko + ETH Zurich + + + Eduard Ďurech + ETH Zurich + + + Davit Melikidze + ETH Zurich + + + Dani Tamayo + EPFL + + + Bettina Messmer + EPFL + + + Aryan Ahadinia + EPFL + + + Anunay Yadav + EPFL + + + Allen Huang + EPFL + + + Ahmad Fraij + ETH Zurich + + + Alessandro Bombarda + EPFL + + + Alex Padula + ETH Zurich + + + Alexander Hägele + EPFL + + + Alexander Sternfeld + HES-SO Valais-Wallis + + + Anna Hedström + ETH Zurich + + + Anna Kosovskaia + ETH Zurich + + + Arthur Wuhrmann + EPFL + + + Arundhati Balasubramaniam + ETH Zurich + + + Badr Al Mahouri + EPFL + + + Barna Pasztor + ETH Zurich + + + Bartosz Szostakiewicz + ETH Zurich + + + Bich Ngoc Doan + EPFL + + + Bryan Schmid + FHNW + + + Burak Sezen + ETH Zurich + + + Camille Challier + EPFL + + + Clément Charmillot + EPFL + + + Dana Shayakhmetova + EPFL + + + Daniel Perruchoud + FHNW + + + David Brüggemann + SDSC + + + David Isztl + CSCS + + + Elia Palme + CSCS + + + Emma Anastassova + EPFL + + + Fabian Bösch + CSCS + + + Faruk Zahiragić + EPFL + + + Fawzi Roberto Mohamed + CSCS + + + Fiona Panicali + FHNW + + + Florian Kolly + EPFL + + + Flynn Guerra + FHNW + + + Francesco Monti + EPFL + + + Frederike Lübeck + ETH Zurich + + + Gennaro Oliva + CSCS + + + Haofeng Yang + ETH Zurich + + + Haoliang Shang + ETH Zurich + + + Helen El Khoury + EPFL + + + Henrique Mendonça + CSCS + + + Jannis Vamvas + University of Zurich + + + Jérome Landolt + FHNW + + + Jessica Lam + ETH Zurich + + + Jingchun Xiao + ETH Zurich + + + Jonathan Coles + CSCS + + + Joshua Oyebanji + EPFL + + + Khanh Nguyen + EPFL + + + Konstantinos Pitas + ETH Zurich + + + Lasse B. Strand + ETH Zurich + + + Li Mi + ETH Zurich + + + Loïc Deslarzes + EPFL + + + Lorenzo Baggi + ETH Zurich + + + Lorenzo Noci + ETH Zurich + + + Luca Baumann + ETH Zurich + + + Luca Sartori + ETH Zurich + + + Lukas Drescher + CSCS + + + Marco De Negri + ETH Zurich + + + Marco Passerini + CSCS + + + Mark Klein + CSCS + + + Marko Stojanovic + EPFL + + + Martin Majsec + EPFL + + + Matin Ansaripour + EPFL + + + Mattea Busato + EPFL + + + Mauro Pellonara + EPFL + + + Max Neuwinger + ETH Zurich + + + Michael Graber + FHNW + + + Michal Tešnar + ETH Zurich + + + Michelle Wastl + University of Zurich + + + Miguel Gila + CSCS + + + Mikolaj Boronski + EPFL + + + Morgane Magnin + EPFL + + + Moritz Reihs + ETH Zurich + + + Mukhammadali Sayfiddinov + ETH Zurich + + + Nathan Ranchin + ETH Zurich + EPFL + + + Nicolas Cuveillier + EPFL + + + Oscar Wohlfahrt + EPFL + + + Qianqian Zou + SDSC + + + Rada Kamysheva + ETH Zurich + + + Rita Sevastjanova + ETH Zurich + + + Roman Machacek + University of Bern + + + Sebastian Keller + CSCS + + + Simon Matrenok + EPFL + + + Simon Pierre + EPFL + + + Stefano Schuppli + CSCS + + + Suei-Wen Chen + ETH Zurich + + + Szabina Horváth-Mikulas + EPFL + + + Taliesin Perez + EPFL + + + Thilo Spinner + ETH Zurich + + + Thomas Kleine Buening + ETH Zurich + + + Tim Robinson + CSCS + + + Tymoteusz Kwiecinski + ETH Zurich + + + Vilém Zouhar + ETH Zurich + + + Vinzenz Thoma + ETH Zurich + + + Xiaozhe Yao + ETH Zurich + + + Yannick Metz + ETH Zurich + + + Yuhei Fukuhara + EPFL + + + Yusif Askari + EPFL + + + Zixuan Chen + ETH Zurich + + + Alexander Ilic + ETH Zurich + + + Ana Klimovic + ETH Zurich + + + Andreas Krause + ETH Zurich + + + Andrei Kucharavy + HES-SO Valais-Wallis + + + Elliott Ash + ETH Zurich + + + Joost VandeVondele + CSCS + + + Martin Rajman + EPFL + + + Mennatallah El-Assady + ETH Zurich + + + Thomas Schulthess + CSCS + + + Timo Kehrer + University of Bern + + + Torsten Hoefler + ETH Zurich + + + Antoine Bosselut + EPFL + + + Martin Jaggi + EPFL + + + Imanol Schlag + ETH Zurich + + + + http://arxiv.org/abs/2610.15373v1 + In-Place Indic Tokenizer Expansion and Continual Pretraining of Nemotron-3-Nano-30B-A3B + 2026-10-11T05:53:00Z + + + We adapted Nemotron-3-Nano-30B-A3B for eight Indian languages without changing its backbone architecture. We expanded the vocabulary in place from 131,072 to 163,072 entries using continued byte-pair encoding and AdaptMix rebalancing, reducing tokens per word by 38.6%. We initialized new input and output rows by averaging their original constituent rows, then trained them on 90% Indic and 10% English text before updating the backbone. Continual pretraining then progressed through broad training, high-quality annealing, and long-context training over approximately 1.27 trillion tokens. The annealed checkpoint gained 12.9 points on the Indic MILU benchmark but lost 3.4 on English MMLU. We also report practical negative results. Direct token addition underperformed continued byte-pair encoding. AdamW weight decay changed rows intended to stay fixed. Perplexity on an Indic-heavy holdout did not select the learning rate that best preserved English performance. + + + 2026-10-11T05:53:00Z + Accepted at the GlobalSouthAI Workshop, NeurIPS 2026 + + + Avinash Benki + + + Prasanjith Pasunuti + + + Sutanshu Saksena Raj + + + Parijat Chatterjee + + + Nayanjit Sarkar + + + Daksh Maan + + + + http://arxiv.org/abs/2610.15371v1 + A Sovereign, Indic-First, Reasoning Model + 2026-10-11T05:52:29Z + + + Gnani-Evon-v3.3-30B-A3B is a long-context hybrid Mamba-Transformer mixture-of-experts model for reasoning, instruction following, and tool use in English and eight Indian languages. Starting from NVIDIA's Nemotron-3-Nano-30B-A3B checkpoint, it retains the 52-layer backbone and changes the vocabulary, training data, and post-training objectives. An in-place expansion from 131,072 to 163,072 tokens reduces mean Indian-language fertility by 38.6%. The new embedding rows are initialized from their upstream decompositions and warmed before the backbone is updated. Continual pretraining then adds broad English-Indic data, high-quality annealing, and direct training at a 131,072-token sequence length. + The central result appears after post-training. Reinforcement learning across four verifiable task environments improves mathematics, graduate-level science, and instruction following, but degrades Indic extractive question answering because the rewards do not require an answer in the requested language. The share of Indic extraction items answered in English rises from 8.7% to 91.7%. Accuracy conditional on answering in the target script roughly doubles, which is consistent with preserved reading ability but is measured on a self-selected subset. + Two unreleased studies test repairs. A scoped Indic reward restores the language convention. A 26B-A4B generative judge outperforms a 235B-parameter model on RM-Bench, and distillation restores 81% of the capabilities displaced by optimizing against it. + Relative to the architecture-identical starting checkpoint, the released model gains 5.2 points on an Indic aggregate while giving up 1.7 points of English retention. The unreleased Indic-aware branch trades further, gaining 14.6 Indic points at a cost of 5.4 in English. A planned FP8 release reduces the artifact to 32GB with near-zero mean change across 32 paired benchmarks. + + + 2026-10-11T05:52:29Z + 69 pages, 24 figures, 49 tables. Technical Report + + + Sutanshu Saksena Raj + + + Prasanjith Pasunuti + + + Parijat Chatterjee + + + Daksh Maan + + + Purusharth Malik + + + Nayanjit Sarkar + + + Avinash Benki + + + + http://arxiv.org/abs/2610.14475v1 + EdgeLLM-Nano: Auditing Polar-Guided Key-Cache Compression and Consistency-Anchored Pruning on a 33.6 MB On-Device Language Model + 2026-10-10T02:09:08Z + + + Deploying language models (LMs) on the edge presents unique memory, latency, and power challenges absent in high-performance computing. KV-cache compression emerges as a promising approach to address these challenges. However, the effectiveness of current KV-cache compression methods has not been thoroughly examined on edge devices. Moreover, we show that existing evaluation methods do not always involve the KV-cache under test. We propose EdgeLLM-Nano, a measurement study of KV-cache compression using a nano-scale decoder-only LM (transformer) testbed that has 8.39M parameters, i.e., 33.6 MB, to enable end-to-end examination of each backend, seed, and power sample. Our results give a negative verdict for a polar-guided key-cache quantizer (round-to-nearest (RTN) control causes an order of magnitude less damage), as well as a consistency-anchored progressive weight pruner (one-shot magnitude-based pruning performs as well as, if not better). We also introduce Long-Context Decode Fidelity (LCDF) evaluation, a token-by-token examination of teacher-forced log-losses using the KV-cache under test. Unlike perplexity that gives the same 5.461 score to all methods, LCDF distinguishes different KV-cache compression backends thanks to its paired statistics across seeds and effect sizes. Our companion Raspberry Pi 5 measurement shows all compression backends we tested to be less energy-efficient per token compared to uncompressed FP16 inference. Except for KIVI that is close to lossless in terms of LCDF, our findings indicate KV-cache compression can be improved. LCDF offers a simple and effective way of shedding light on KV-cache compression methods, whose negative impacts have been overlooked by perplexity. + + 2026-10-10T02:09:08Z + + + S M Mahbub Murshed + + + Hayden Bright + + + Rezaul Karim + + + Ali Shiri Sichani + + + + http://arxiv.org/abs/2610.14219v1 + Learnable Low-Rank Polynomial Sketch for Effective Linear Attention + 2026-10-09T18:30:52Z + + + Softmax attention in Transformers suffers from quadratic complexity in sequence length, making it impractical for long-context applications. Linear attention alleviates this issue by replacing the exponential kernel with alternative functions that enable linear-time computation. Among existing linear attention approaches, recent studies have shown that polynomial kernels are particularly effective, as they exhibit sparse and spiky behavior similar to softmax attention, which emphasizes large dot products while suppressing irrelevant interactions. However, the exact computation of high-degree polynomial kernels is infeasible for high-dimensional representations. As a result, prior work relies on approximate polynomial kernels. This introduces a non-negligible approximation error. In this paper, we show that, from the perspective of polynomial kernel approximation, existing linear attention methods are still suboptimal. We propose \textbf{L}earnable \textbf{Lo}w-Rank \textbf{P}olynomial \textbf{S}ketch (LLoPS), a principled and flexible framework for approximating polynomial kernels with linear attention. Our method learns a low-rank polynomial sketch that provably achieves a strictly smaller approximation error than existing approaches. Experiment results show that LLoPS achieves the highest performance across extensive benchmarks, comparing with various linear attention baselines. + + + + 2026-10-09T18:30:52Z + Neurips 2026 + + + Zongyue Qin + + + Haoran Deng + + + Jason Cong + + + Yizhou Sun + + + + http://arxiv.org/abs/2610.13708v1 + Adaptive DHiSparse: Speculative Decoding over a Load-Adaptive KV Hierarchy + 2026-10-09T15:02:35Z + + + Long-context serving runs out of KV memory before the hardware reaches its useful throughput. HiSparse stores history in host memory and fetches only the selected entries, but it uses one cache budget at every load and does not handle draft-model speculative decoding such as DSpark and DFlash2. We present Adaptive DHiSparse, which supports speculative decoding over hierarchical sparse KV and adapts residency to load. It protects the required working set, retains additional history while GPU memory is spare, and recovers the rest through exact fused retrieval. DSpark and DFlash2 keep their proposal and acceptance rules: queries share missing-row retrieval, draft KV uses a window-bounded ring, and verification staging is reused across layer groups. At 100K context and concurrency 128, GLM-5.3 with DFlash2 delivers 793 output tokens/s per decode GPU, 1.45$\times$ HiSparse and 1.27$\times$ non-speculative adaptive serving. Held to the same latency bounds as HiSparse, it sustains up to 4$\times$ the concurrency and 2.3 to 3.7$\times$ the output, depending on the per-token bound. On DeepSeek-V4.1-Flash at 500K context and concurrency 512, Adaptive DHiSparse with DSpark delivers 1.85$\times$ the output of resident serving with DSpark. In a load step, optional residency reduces host fetches from 14.2% to 1.4% of selected rows at low load and releases memory under pressure. + + + + + 2026-10-09T15:02:35Z + 16 pages, 11 figures, 6 tables + + + Naji Alazhar + + + Wassel Alazhar + + + + http://arxiv.org/abs/2610.13325v1 + Taking Tokenization off the Host for Agentic LLM Serving + 2026-10-09T10:05:09Z + + + Agentic workloads resend long contexts that barely change between calls. Prefix caching now skips most of their prefill, yet every request must still be tokenized in full before the cache can even be consulted. Tokenization, a CPU stage long treated as negligible, becomes the largest part of time-to-first-token (TTFT), and a frontend that tokenizes for a whole GPU fleet limits how many GPUs it can feed. We present GraphTok, a GPU tokenizer that runs the entire encoding pipeline, from pre-tokenization through byte-pair encoding (BPE) merging to token-ID assembly, as one replayable CUDA graph. GraphTok reproduces the reference token IDs bit-for-bit on GPT-2, Llama 3, Qwen 2.5, DeepSeek-V3, and Gemma 3, hands short inputs to a CPU engine where the GPU cannot win, and plugs into unmodified vLLM and NVIDIA Dynamo. GraphTok encodes one million GPT-2 tokens in 1.7-3.2 ms including data transfers, and on Llama 3 it is 4.7-6.0x faster than gigatoken, the strongest CPU tokenizer. On TokTier's own single-request benchmark, it is 2.6-3.9x faster than gigatoken and up to 18.1x faster than TokTier. In vLLM with a cached prefix, it lowers mean TTFT by 2.1-2.4x. The largest gain is capacity. Within a 2 s P99 target, one Dynamo frontend with GraphTok sustains 518 requests/s of 121k-token traffic, the busiest-hour load of 56 GPUs, against 296 with gigatoken and 18.5 with the default tokenizer. Across 121k to one million tokens, this is 1.75-2.5x the load gigatoken sustains, with a P99 up to 64x lower where gigatoken's tail breaks. + + + + + 2026-10-09T10:05:09Z + + + Mohammad Siavashi + + + Pascal Schwinte + + + Ali Banaei + + + Gerald Q. Maguire + + + Marco Chiesa + + + Dejan Kostić + + + + http://arxiv.org/abs/2610.13202v1 + S$^3$R: Fast and Faithful RL Rollouts via Self-Sparse Speculative Decoding + 2026-10-09T08:22:40Z + + + Fast rollout generation for long-context reinforcement learning with verifiable rewards (RLVR) requires reducing KV-cache traffic without changing the response groups used for policy optimization. In our profiled RLVR workloads, attention accounts for 72--76\% of autoregressive decoding kernel time. Sparse attention reduces these reads, but sampling directly from a sparse policy changes the response groups used for learning. For group-relative optimization, we show that even exact response-wise reweighting does not generally recover the expected dense-policy update because the advantage of each response depends on the rewards of other group members. We propose Self-Sparse Speculative Rollouts (S$^3$R). It uses sparse attention to propose tokens, then generates responses through full-attention verification and exact speculative sampling. Drafting and verification share the same policy parameter, eliminating the need to train or update a separate drafter. The resulting response groups follow the dense-policy distribution. Under S$^3$R, we characterize speedup conditions and the costs of drafting and verification. We found that dense verification still requires the complete historical KV cache. A KV-aware scheduler therefore limits KV-cache repeated offloading and restoration while maintaining rollout parallelism. % OR thrashing In a matched ablation with an aggressive sparse drafting budget, S$^3$R maintains stable training while direct sparse sampling with training-side correction becomes unstable. On long-context mathematical reasoning, S$^3$R achieves $1.39\times~1.35\times$ the end-to-end training throughput of autoregressive rollouts on Qwen3 model, with comparable task performance. + + + 2026-10-09T08:22:40Z + + + Yuhang He + + + Hongyu Ge + + + Zihan Lin + + + Siyi Liu + + + Yongqi Zhang + + + + http://arxiv.org/abs/2610.13060v1 + KV-Repurpose: A Testbed for Evaluating Non-Prefix KV-Cache Reuse + 2026-10-09T06:17:10Z + + + KV-cache reuse in large language model serving is commonly limited to exact prompt prefixes, preventing reuse when the same retrieved document appears after different system prompts, conversation histories, or dynamic metadata. We present KV-Repurpose, an open-source, vLLM-based system for developing and evaluating segment-wise KV-cache reuse beyond exact prefixes. The system combines cache-aware segment scheduling, prompt construction, capacity management, workload generation, and runtime monitoring. Experiments on long-context benchmarks show that naive segment reuse largely preserves output quality for single-document question answering and summarization, while exposing clear limitations in cross-document reasoning. Under a Zipfian RAG-style workload in which 20% of requests share a fixed prefix, KV-Repurpose achieves a substantially higher token-level cache hit rate than prefix caching at the same 30 GB cache capacity, 63.9% versus 3.3%, resulting in lower TTFT. Even with 1 TB of cache capacity, prefix caching reaches only a 17.9% hit rate in this workload. Source code is available under the Apache-2.0 license at https://github.com/taiga333/eval-kv-repurpose. + + 2026-10-09T06:17:10Z + + + Taiga Ikeda + + + Daisuke Miyashita + + + Jun Deguchi + + + + http://arxiv.org/abs/2610.13041v1 + RAMP: Recurrent Adaptive Mixed Precision for Efficient Prefill in Recurrent-Depth Language Models + 2026-10-09T05:57:33Z + + + Recurrent-depth language models improve inference-time reasoning by repeatedly applying a shared network to refine internal representations, but the additional recurrent computation also increases inference cost. This overhead is particularly pronounced during long-context prefill, where the full input sequence is repeatedly processed across recurrent depth. Weight-and-activation quantization offers a natural way to accelerate this computation through lower-precision arithmetic, yet repeatedly applying quantized computation introduces numerical perturbations that accumulate along the recurrent trajectory. We systematically analyze how such errors propagate across recurrent depth and show that quantization errors introduced earlier are attenuated by more subsequent recurrent steps and therefore have a smaller effect on the final representation. Matched-budget experiments strongly support this prediction, showing that placing quantized computation earlier in recurrent depth consistently yields the best fidelity. Based on this insight, we introduce RAMP (Recurrent Adaptive Mixed Precision), which performs early recurrent refinement using low-precision weight-and-activation computation and restores high precision for terminal refinement. Across context lengths up to 4K, RAMP preserves near-full-precision prefill quality while achieving up to 1.16x end-to-end first-prefill speedup on an NVIDIA H100, corresponding to a 13.9% latency reduction. + + 2026-10-09T05:57:33Z + 16 pages, 3 figures, 6 tables. Preprint + + + Ke Wan + + + Chen Chen + + + + http://arxiv.org/abs/2610.12338v1 + VFold: Symmetry-Aware Cross-Layer Value Cache Compression + 2026-10-08T17:14:28Z + + + While caching key-value (KV) states accelerates Large Language Model (LLM) decoding, this cache can dominate memory usage at long context lengths. One solution is to compress this memory by exploiting inter-layer cache similarities. However, most existing techniques necessitate architectural changes to LLMs and incur substantial overhead. In this work, we propose a symmetry-aware value cache merging strategy that reduces cache memory while avoiding both harmful performance degradation and architectural overhead during decoding. Furthermore, we show that this approach can be exploited alongside existing cache compression techniques, composing with high-ratio quantization or key cache pruning to reach compression ratios that neither method reaches alone, with minimal additional cost. Ultimately, our findings reveal a major source of underutilized capacity in the value cache, offering a simple yet highly effective direction for scaling context windows under memory constraints. + + + 2026-10-08T17:14:28Z + + + Neha Verma + + + Sungwon Kim + + + Kenton Murray + + + Kevin Duh + + + + http://arxiv.org/abs/2610.11592v1 + Probing for Long-Horizon Deductive Reasoning Capabilities in Language Models with Prolog + 2026-10-08T09:42:07Z + + + Current frontier LLMs can theoretically process long contexts with 1M tokens or more. But to what extent can they go beyond simple retrieval and perform deeper reasoning over such long contexts? We empirically investigate long-horizon reasoning capabilities of LLMs, focusing on deductive logic expressed in Prolog. We construct ProloNg, a synthetic testbed to probe Prolog Long Reasoning, which systematically varies the complexity (reasoning depth) of problems, where the hardest case has a reasoning depth of 22 and 62k context length. We study 8 reasoning models across 5 families of frontier LLMs, and find that performance degrades substantially as reasoning depth grows, with the majority of models approaching chance beyond depth 10. + + 2026-10-08T09:42:07Z + Findings of EMNLP 2026 + + + Hadeel Al-Negheimish + + + Jasna Ilieva + + + Yoon Kim + + + + http://arxiv.org/abs/2610.11430v1 + BioBigBird: A Sparse Attention Model for Long-Range Dependency Processing in Biomedical Text + 2026-10-08T07:54:12Z + + + While domain-specific Large Language Models (LLMs) have encoded vast biomedical knowledge, their limited context windows often hinder a deep understanding of nuanced relationships within and across texts. To address this limitation, we introduce BioBigBird, a bidirectional language model pre-trained on extensive biomedical literature and clinical data, specifically designed to handle long-range dependencies. BioBigBird leverages a sparse attention mechanism to process sequences up to 4096 tokens, and its training incorporates a multi-stage process to mitigate noise from the large-scale pre-training corpus. We further enhance its performance by employing a multi-task learning (MTL) framework that jointly optimizes for Named Entity Recognition and Relation Extraction. Comprehensive evaluations on the BLURB benchmark reveal that our MTL-enhanced BioBigBird achieves highly competitive results against state-of-the-art models. Our work contributes an effective methodology for developing powerful, long-context language models for specialized domains, demonstrating the value of extended sequence processing for complex text analysis. Our models are publicly available at https://huggingface.co/collections/bisectgroup/biobigbird. + + + 2026-10-08T07:54:12Z + + + Roshan Balaji + + + Pavan Kumar S + + + Vasudev Gupta + + + Sreejith N + + + Keerthana Sridhar + + + Nirav Bhatt + + + + http://arxiv.org/abs/2610.11245v1 + Read What Matters: Query-Adaptive Quantization for KV Caches + 2026-10-08T04:47:41Z + + + KV-cache entries are stored before their future queries are known, but each decoding query needs precision in different places. We study this mismatch using separate budgets for retained bits and bits fetched per query. ReadKV stores each key and value in a progressive code whose prefixes support different reconstruction precisions. For each query, it allocates key-channel prefixes using the query, computes attention from the reconstructed keys, and then allocates value-token prefixes using that attention. Stored entries remain unchanged. Each stage optimizes a calibrated distortion objective under a fixed budget; we prove exact allocation under diminishing refinement gains and relate these objectives to attention-output error. We also exhibit a finite-dimensional attention family where query-dependent access strictly outperforms every query-independent reader at the same read budget, even with unrestricted competing encoders and decoders. + Across six base models, reading four bits on average from an eight-bit cache increases C4 perplexity by at most 0.66%, using about one quarter of the logical reads and half the retained capacity of a 16-bit cache. It is consistently more accurate than storing and fully reading four bits at the same payload-read budget. Retaining more bits than each query fetches is aimed at long-context decoding, where the cache bytes moved per step, rather than the weights, dominate cost. Long-context question answering and retrieval on two instruction-tuned models provide additional quality evidence. On the tested 8K-token, batch-one, single-layer workload on an NVIDIA A10G, a restricted eight-bit ReadKV reader with a two-bit mean payload-read budget has 39% lower latency than the tested TurboQuant codec. + + + + 2026-10-08T04:47:41Z + 50 pages, 3 figures, 12 tables + + + Siddharth Bhandari + + + Lucas Gretta + + + Krishna Balasubramanian + + + Shiva Kasiviswanathan + + + + http://arxiv.org/abs/2610.10918v1 + Large Language Models for Machine Translation Quality Annotation: Humans and Models Are Both Challenged + 2026-10-07T21:17:26Z + + + Large Language Models (LLMs) are considered to be a more efficient and cost-effective alternative to human judgment for Machine Translation (MT) evaluation. With MT evaluation spanning a large number of language pairs, domains and levels of annotation granularity, LLMs must be thoroughly evaluated across these dimensions before being reliably used as alternatives to human evaluation. In this paper, we evaluate the performance of LLMs for two prominent MT quality evaluation schemes: Multidimensional Quality Metrics (MQM) and Error Span Annotation (ESA) by comparing their agreement with human annotators. We present results on a long-context test set of 70 language pairs and the publicly available WMT23 and WMT25 data, investigating both score and error span annotation agreement across a variety of language pairs and domains. Our results show that while LLM agreement with human annotators exceeds agreement between human annotators for some evaluation tasks, both vary substantially across annotation schemes, language pairs and domains and remain unreliable for most settings. Furthermore, we identify challenges facing both human and LLM annotators: humans are particularly challenged by fine-grained MQM annotations and low-resource language pairs, while LLMs struggle with minor errors, wrong language variants and error span annotation. Our results highlight the potential for improvement for both human and LLM annotation performance, possibly through human-LLM collaborative annotation pipelines that address the reliability issues identified in this work. + + 2026-10-07T21:17:26Z + Accepted at EMNLP 2026 + + + Hala Almaghout + + + Christian Federmann + + + Qin Gao + + + + http://arxiv.org/abs/2610.10845v1 + Real Long-Term Memory for AI: A 50-Million-Token Window That Is Faster and Cheaper Than Recompute + 2026-10-07T19:50:53Z + + + A large language model can only use the text that fits in its context window, and it recomputes its internal key-value (KV) state for a prompt every time the prompt is sent. We test a memory layer, the public package galahad-kv, that saves the KV state of each block of about 16,000 tokens to encrypted local NVMe disk and loads it back later, byte-exact, without recomputing it. We ran it on 50,000,000 tokens of real public text, served through vLLM on one NVIDIA H100, with Gemma 4 12B and Gemma 4 31B. Every block we probed was loaded back from the encrypted store with no recompute (100 of 100, at depths from 0 to 50M tokens) on both models. Loading a block was 2.8x to 4.3x faster than recomputing it and used 8.8x to 12.3x less GPU energy, and GPU memory stayed flat over the whole 50M-token stream. Asked about facts planted millions of tokens earlier, the 12B model gave the right answer 82 times out of 100 and the 31B model 98 times out of 100. Neither model made up an answer. The limits are as follows. This is reuse of stored state, not a wider attention window: one block is loaded at a time, and how well a question is answered depends on the model. Writing the memory is a one-time cost, and the store takes terabytes of local NVMe disk. We describe the test protocol, which is built to resist common ways of gaming long-context benchmarks, and give a single-GPU reproduction that uses public software and a free licence for the package. + + + + + 2026-10-07T19:50:53Z + + + Sietse Schelpe + + + + http://arxiv.org/abs/2610.10114v1 + Mechanics of Long-Context Hybrid Models Part 1.1: From Hybrid Attention to Hybrid Position + 2026-10-07T14:02:35Z + + + The architectural design of Large Language Models (LLMs) is shifting from traditional full-attention-only models to hybrid models, which combine different attention modules to improve long-context efficiency and performance in length extrapolation and context extension. To explain why hybrid models work and how to design them better, we propose Mechanics of Long-Context Hybrid Models. As Part 1.1 of this series, we begin with hybrids of full attention and either sliding-window attention (SWA) or gated variants of linear attention (LA), represented by GLA and GDN. We first observe a Seesaw Effect in Context Extension: LA hybrids benefit more from long-context continual pretraining, whereas SWA hybrids perform better under length extrapolation. We attribute this behavior to differences in the positional inductive biases induced by these attention mechanisms. We find that SWA hybrids suffer from a Short-Context Learning Trap, Short-Window Weariness, and Long-Window Laziness, and require extended windows to enhance performance in continual long-context pretraining. For LA hybrids, we summarize the Matthew Effect of Hybrid Position Extrapolation and propose Sliding-Window Linear Attention, achieving 16$\times$ training-free length extrapolation while maintaining 100\% accuracy on NIAH-SK1 in 64k context length. + + 2026-10-07T14:02:35Z + 60 pages, 36 figures, 25 tables, under review + + + Xiaoran Liu + + + Ziwei He + + + Xipeng Qiu + + + + http://arxiv.org/abs/2610.09193v1 + Bookkeeping, Composition, or Unreachable Gold? Reading MemoryAgentBench's Conflict-Resolution Scores Against a Frozen Last-Write Resolver + 2026-10-06T22:44:32Z + + + MemoryAgentBench's Conflict Resolution split is read as measuring "selective forgetting". We execute the benchmark's own rule - the newest statement about a fact wins - as a zero-learning resolver frozen on one of the four fact lists. Under the official metric the rule answers 80.25% of the questions (74.5% on the three held-out lists). Of the rest, 67 items have a released gold that the last-write graph cannot reach but overwritten statements would ("The capital of India is New Delhi." superseded by "The capital of India is Grosseto."; gold New Delhi); such items are a third of the multi-hop questions at 262K. Two long-context models and our pre-registered approximate re-implementation of the benchmark's BM25 agent, one retained run per item and outcomes only, score 84.7%, 82.6% and 41.6% on the items the rule solves against 10.4%, 11.9% and 6.0% on those 67. The failures are a reachability split plus a small parser-scope residual; the per-item split, not the aggregate, is the unit at which a score here can be read. + + + 2026-10-06T22:44:32Z + Accepted at the IAB Workshop (Interpreting Agent Behavior) at NeurIPS 2026 (non-archival). 19 pages + + + Egor Pakhomov + + + Erik Nijkamp + + + + http://arxiv.org/abs/2610.08463v1 + UNREAL: Unifying Retrieval and Long-Context with a Single Model + 2026-10-06T14:48:53Z + + + Long-context inference and Retrieval-Augmented Generation (RAG) handle evidence selection at vastly different scales, from a single long prompt to an entire corpus. We ask whether a single model-internal mechanism can select evidence across this range. We introduce UNifying REtrieval And Long-Context with a Single Model (UNREAL), a model-native evidence selection framework to span corpus retrieval and long-context inference. UNREAL encodes chunks and derives retrieval queries directly from the frozen LLM's internal representations. It adds fewer than 500K trainable parameters and leaves the backbone unchanged. On a 3B-token, 21M-chunk Wikipedia index, all four dense and hybrid UNREAL backbones outperform state-of-the-art retriever-reranker systems. The best model raises recall from 49.1% to 73.2% on HotpotQA, from 31.7% to 60.1% on 2WikiMultiHopQA, and from 8.8% to 14.4% on MuSiQue. Applied to long-context tasks, the same selection mechanism removes distractors before generation, raising NoLiMa accuracy from 1.0% to 24.83% at its maximum context length of 128K tokens, and LV-Eval's F1 score from 49.97% to 54.66% at 256K. UNREAL also reduces FLOPs and time-to-first-token relative to full-context inference from roughly 32K tokens onward, with larger gains as context grows. Together, these results establish model-internal evidence selection as a common foundation for corpus retrieval and evidence-sparse long-context inference. + + + + 2026-10-06T14:48:53Z + + + Edan Kinderman + + + Elad Hoffer + + + Yochai Blau + + + Brian Chmiel + + + Ron Banner + + + Daniel Soudry + + + Boris Ginsburg + + + + http://arxiv.org/abs/2610.07940v1 + Hybrid Latent Attention for Looped Language Models + 2026-10-06T08:14:07Z + + + Looped language models apply the same stack of layers T times to each token, which deepens the model without adding parameters but multiplies its key-value (KV) cache by T. The larger cache limits how many sequences a GPU can decode at once and slows each decoding step, which reads the whole cache. We propose Hybrid Latent Attention (HLA), which keeps exact keys and values within a sliding window of W recent tokens and stores each older token as a compact latent that the query of each loop reads directly, without reconstructing keys and values. We uptrain HLA on Ouro looped models (T=4) with 1.4B and 2.6B parameters, keeping the pretrained weights frozen and training only the added parameters to reproduce the original attention. The cache shrinks by 10.7x per token, fitting 4.0-8.8x as many concurrent sequences per GPU, and decoding throughput improves by 2.5x at 1K-token contexts and by up to 7.4x at 16K. HLA retains over 97% of the original accuracy on math, knowledge and reasoning benchmarks, and 96-100% on long-context retrieval up to 16K tokens. After supervised fine-tuning, it performs on par with the fine-tuned original model on competition-level math. + + + 2026-10-06T08:14:07Z + + + Yuhan Chen + + + Siyuan Zhang + + + Nan Wang + + + Feiyang Kang + + + Ruoxi Jia + + + + http://arxiv.org/abs/2610.07782v1 + Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell + 2026-10-06T05:17:44Z + + + Decomposing long-context inference across cooperating agents bounds the active KV cache per call rather than total evidence, which matters when KV-cache memory binds. Many such systems add a persistent tier storing and recalling reasoning traces, usually validated by an ablation reporting an accuracy gain. We measure both on one three-tier agent architecture. Decomposition delivers: peak KV working set of 14.3 MiB per query against 35.5 and 35.3 MiB for single-pass and retrieval-augmented baselines. The persistent tier does not: across eight controlled dataset pairs at n=100 per arm it costs +0.368 MiB [+0.167, +0.590] of peak cache and produces no detectable accuracy change (+0.015, 95% CI [-0.011, +0.046]). We argue the null is structural: single-question benchmarks supply each item with its own evidence and score it independently, and correctness requires resetting stored traces between conditions, so recall has nothing informative to retrieve. Reaching it took four measurement corrections -- three inflating the apparent benefit, the fourth making an effect that size look resolvable -- none visible in the results table. We give the conditions an agent-memory ablation must satisfy and detection procedures that need no knowledge of the specific defect. + + + + + 2026-10-06T05:17:44Z + 13 pages, 1 figure. Accepted as a poster at the Machine Learning for Systems Workshop, NeurIPS 2026 + + + Hochan Son + + + Kyungdoe Han + + + Jaehan Koh + + + Xiaowu Dai + + + Wenlu Xu + + + Guang Cheng + + + + http://arxiv.org/abs/2610.06750v1 + Balancing Memory Pathways: Analyzing and Improving Memory Utilization in Hybrid LMs + 2026-10-05T17:27:30Z + + + Recurrent-attention hybrid language models (LMs), which interleave attention and recurrent layers, are increasingly used to combine the efficiency of the recurrent layers with the strong performance of attention layers. Prior work suggests that attention and recurrent layers offer complementary pathways to use past information: attention supports precise memory recall from earlier tokens, while recurrent layers support consolidation of disparate information over long contexts. However, we observe that simply having access to both pathways does not mean that hybrid LMs are effectively using them. We find that they rely substantially more on attention than on the recurrent state. Standard supervised fine-tuning improves overall performance but does not improve how the two memory pathways are coordinated: the model becomes more reliant on information propagated by attention layers, while its use of information propagated by recurrent layers remains limited. To encourage better coordination between the two memory pathways, we add an auxiliary loss that limits attention's access to earlier context while the recurrent state propagates through the full sequence. This objective encourages the model to retain and use information through the recurrent pathway alongside attention. It improves overall performance, with particularly strong gains on tasks involving longer contexts or requiring information aggregation, consistent with the strengths of recurrent layers observed in analysis. Crucially, this imbalance and the benefit of our auxiliary loss generalize: they apply to multiple recurrent-attention LMs in question-answering and agentic tasks, as well as to attention-based LMs that combine different forms of memory. Together, our findings show that simply providing multiple memory pathways does not ensure their effective use, and that targeted supervision is needed to better coordinate them. + + + 2026-10-05T17:27:30Z + Code: https://github.com/amy-hyunji/Balancing-Memory-Pathways + + + Hyunji Lee + + + Joykirat Singh + + + Zaid Khan + + + Justin Chih-Yao Chen + + + Elias Stengel-Eskin + + + Alessandro Sordoni + + + Arman Cohan + + + Mohit Bansal + + + + http://arxiv.org/abs/2610.06479v1 + Behavior-Preserving KV Cache Compression + 2026-10-05T15:06:18Z + + + KV caches are a major bottleneck in long-context inference and long-form generation with large language models. Existing training-free eviction policies largely rely on proxy importance signals, such as attention mass, to decide which past tokens to retain. We argue that cache compression should instead preserve the predictive behavior of the full-cache model, retaining entries whose removal would substantially change the model's output distribution. We propose Behavior-Preserving KV Cache Compression, a training-free framework that scores candidate evictions by estimating the compressed-cache logits induced by their removal and evaluating the resulting KL to the full-cache next-token distribution. Using pre-eviction forward statistics, the method avoids running separate masked forward passes for each candidate. Across diverse architectures and both prefill-time and generation-time compression, our method delivers substantial gains in downstream task quality over lightweight attention-based heuristics at matched retained-KV budgets, with the largest gains under aggressive compression. It achieves these gains with additional compression-time computation while retaining an end-to-end speedup over full-cache inference in our evaluated settings. + + 2026-10-05T15:06:18Z + + EMNLP 2026 Main Conference Published + + Doo Hwan Hwang + + + Junyoung Jang + + + Junho Na + + + Hosung Lim + + + Kee-Eung Kim + + + + http://arxiv.org/abs/2610.06286v1 + DeferKV: Rethinking Eviction Timing for One-Shot KV Cache Compression + 2026-10-05T13:13:14Z + + + Long-context large language models (LLMs) have demonstrated strong capabilities across a wide range of tasks, but the growing KV cache introduces substantial memory and inference overhead. Existing one-shot KV cache compression methods typically commit to irreversible eviction immediately after prefill, before any signal from actual generation becomes available. Our quantitative analysis shows that early queries from the actual generation stage provide attention signals that are more consistent with subsequent decode attention, with the largest single-step gain occurring at the prefill-decode boundary. Based on this observation, we propose DeferKV, which moves the eviction decision from the end of prefill to the first real decoding step and temporally combines prompt-side and decode-side observations, thereby better aligning KV importance estimation with subsequent generation requirements. DeferKV requires no additional training, draft model, or future-query prediction module, making it simple and easy to deploy. Experiments on LongBench, RULER, and Needle-in-a-Haystack demonstrate that DeferKV consistently improves model performance under KV cache compression while maintaining low inference latency. + + 2026-10-05T13:13:14Z + + + Zhe Wang + + + Jiakai Li + + + Yujia Sun + + + Rongzheng Wang + + + Shuang Liang + + + + http://arxiv.org/abs/2610.06069v1 + Attention Tax, Handoff Tax: A Stylised Model of When Multi-Agent LLM Systems Help + 2026-10-05T10:04:20Z + + + Recent work on multi-agent LLM systems reaches sharply different conclusions: some results show that a single agent with the same information and compute should dominate a delegated system, others that multi-agent gains grow with task depth. We argue that much of the disagreement comes from modelling different bottlenecks, and introduce a stylised reliability model built around two trade-offs. Decomposition reduces the burden of long contexts but incurs a handoff tax when information is compressed or transferred between agents. Redundancy gains from multiple samples, but its benefit depends on how much their failures are shared. With reasoning budget, verification, and task structure added, the model yields two crossover conditions: decomposition becomes preferable once the attention cost avoided by resetting context exceeds the handoff cost, and parallel sampling at equal budget is eventually preferable when its shared-failure floor lies below the error floor of one agent thinking longer. We connect these regimes to recent theoretical and empirical results. On a ledger-reconciliation task we measure the context-degradation curve and the handoff tax from single-agent and handoff runs alone. From these the model places the crossover at depth 10 and predicts decomposition to win at depths 20, 50, and 100. It does, on step-level and final-balance accuracy, and the decomposed system's success, which the prediction never sees, lands within 9 percentage points of the predicted rate at every depth. + + + + + 2026-10-05T10:04:20Z + 23 pages, 6 figures. Code and data: https://github.com/akshitanchan/attention-handoff-tax + + + Akshit Anchan + + + Nayonika Sen + + + + http://arxiv.org/abs/2610.05842v1 + HLA: Expressive Hybrid Linear Attention via Chunk-Wise Dynamic Mixing + 2026-10-05T05:49:31Z + + + Linear attention enables efficient long-context autoregressive decoding by compressing history into recurrent states, but this compression can make selective access to sparse and distant information difficult. Existing chunk-based extensions increase memory capacity, yet learned chunk-mixing coefficients may remain fixed with respect to input content and therefore cannot adapt historical access to each query. We introduce \emph{Hybrid Linear Attention} (HLA), a query-dependent chunk-level attention mechanism for Gated DeltaNet (GDN). HLA represents each completed chunk as an exact affine state transition and computes content-dependent routing gates from compact, self-attentively pooled representatives. Each gate interpolates the corresponding historical transition with the identity map, controlling both the chunk's additive memory and its transformation of earlier states. Effective-support regularization further encourages concentrated routing for sparse inference. We evaluate HLA under both pretrained adaptation and from-scratch training. Across Qwen3.5 models from 0.8B to 9B, HLA consistently improves over native GDN and fixed chunk mixing, with gains of up to 5.57 percentage points on LongBench-V2 and 3.97 points on RULER. In a controlled from-scratch 1.3B setting trained for 100B tokens with a 4K context, HLA also improves RULER performance from 4K to 32K, with gains increasing from 0.83 points at 4K to 4.22 points at 32K. These results demonstrate that query-dependent composition of recurrent memory improves long-context modeling and remains effective beyond the training context while using compact per-chunk affine summaries. Project page: https://caesarhhh.github.io/hla/ + + 2026-10-05T05:49:31Z + + + Zhuokun Chen + + + Xi Lin + + + Xiyu Wu + + + Jiahao He + + + Jianfei Cai + + + Bohan Zhuang + + + + http://arxiv.org/abs/2610.04973v1 + TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training + 2026-10-04T05:42:22Z + + + LLM agents for coding, search, and workplace tasks increasingly rely on long-context capabilities to effectively aggregate and reason over extended interaction histories. Recent work has incorporated agent trajectories into mid-training stage, drawing on their naturally long and interaction-rich structure. Yet how to organize the information within these trajectories into effective mid-training supervision remains underexplored. In this work, we investigate the relationship between long-context and agent atomic capabilities and introduce TrajLong, a novel framework that compiles trajectories into long-context training tasks with dense supervision, targeting three representative atomic capabilities: evidence grounding, cross-evidence aggregation, and temporal state maintenance. We mid-train Qwen3-14B-Base and Qwen3-30B-A3B-Base with data compiled by TrajLong, followed by supervised fine-tuning. Experiments on 6 long-context and 12 agent benchmarks demonstrate broad performance gains, with controlled ablations showing improvements over raw and masked trajectory baselines. Capability-level analyses further reveal task-dependent associations between long-context and agent atomic capabilities. These findings suggest that the shared capability demands of long-context reasoning and agent execution provide a principled basis for designing mid-training data to develop downstream agent capabilities. + + 2026-10-04T05:42:22Z + + + Miao Peng + + + Qintong Zhang + + + Nuo Chen + + + Yuhan Li + + + Guochen Yan + + + Xinran Gu + + + Hongqiu Wu + + + Hai Wang + + + Lydell Huang + + + Wentao Zhang + + + Jia Li + + + + http://arxiv.org/abs/2610.04753v2 + More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding + 2026-10-06T03:33:53Z + + + Autoregressive generation in Large Language Models (LLMs) is constrained by the memory and computational demands of attention mechanisms. Sparse attention methods mitigate this cost by selecting only high-probability entries of the attention matrix. We observe that in many such methods, this renders the probability-value multiplication negligible, shifting the bottleneck to the query-key step. Key heads can therefore be reduced to accelerate inference, while retaining more value heads preserves capacity with limited additional decoding cost. We introduce Sparse Asymmetric Group-Query Attention (SAGA), which decouples key and value head counts to exploit this principle, and pair it with approximate top-N (Atop-N) attention, a simple sparse attention method designed to study the interaction between sparsity and head-count asymmetry. We formalize the benefits of this asymmetry theoretically and validate them empirically through latency measurements and quality evaluations on models up to 1.5B parameters. Together, SAGA and Atop-N achieve end-to-end decoding speedups exceeding $2\times$ over our full-attention GQA baseline at long contexts. Models trained from scratch with SAGA nearly match the quality of comparable GQA variants on the evaluated benchmarks. To facilitate adoption, we introduce an efficient fine-tuning method that converts pretrained models to the SAGA architecture, enabling practitioners to benefit from our approach without costly retraining. + + + 2026-10-03T20:38:43Z + Accepted to NeurIPS 2026 + + + Noam Elata + + + Itay Lamprecht + + + Mikey Shechter + + + Daniel Ohayon + + + Itay Hubara + + + Daniel Soudry + + + + http://arxiv.org/abs/2610.06963v1 + WavePrune: One period is often enough for RoPE + 2026-10-03T17:01:53Z + + + Rotary Position Embedding (RoPE) encodes token positions by rotating each two-dimensional channel of the query and key vectors at a channel-specific frequency, making the attention logits invariant to a common shift of positions. However, this rotation is periodic, and it leads to position aliasing where relative positions separated by a full rotation period become hard to tell apart. To address this, we propose WavePrune, which restricts each channel to its first rotation period. We show that it removes the distractions in attention maps created by position aliasing and improves overall long-context performance. Specifically, WavePrune raises the HELMET score on four of five models we test without any extra tuning (e.g., 35.7 -> 40.0 on Qwen3-8B). When pretraining models from scratch, WavePrune also achieves lower validation loss at extrapolated lengths than pretraining without it. Because WavePrune restricts each channel to a sliding window, it induces a fine-grained sparsity that our hardware-aligned CUDA kernels exploit for 1.15x prefill and 1.24x decoding speedups over FlashAttention-2 at 32K context. Together, these results show that RoPE's periodic structure, widely regarded as essential, is largely redundant beyond the first rotation period. + + + 2026-10-03T17:01:53Z + + + Guancheng Du + + + Luotian Huang + + + Shaowen Wang + + + Si Li + + + Kaifeng Lyu + + + + http://arxiv.org/abs/2610.04118v1 + LongSocialBench: Do Long-Context LLMs Understand Online Discussion Threads? + 2026-10-02T22:47:29Z + + + Long-context LLMs can now ingest entire online discussion threads, but understanding their social discourse requires more than reading a long document: models must track parent-reply relations, turning points, scoped subtrees, cross-branch contrasts, and participant trajectories. To test this structure-aware social reasoning, we introduce LongSocialBench, a benchmark of 1,462 verified human-authored multiple-choice items drawn from 94 complete Hacker News, Stack Exchange, and Reddit r/ChangeMyView episodes, with a median length of approximately 73K tokens. Each item pairs a complete serialized discussion and reply structure with a four-option question, requiring models to recover structured social evidence. Released items are verified for answerability, option uniqueness, and evidence grounding. Across 18 models and 29 evaluation settings, current long-context workflows remain far below human performance. The best individual result comes from Claude-Opus-4.7, which reaches 63.0% when prompted to eliminate incorrect options before answering, compared with 72.4% for independent human readers. Averaged across all 18 models, the full-context Baseline scores 43.9%. Supplying the gold evidence scope raises this to 55.0%, showing that substantial errors remain even after the relevant thread region is identified. LongSocialBench shows that the missing capability is not context access or prompting alone, but social understanding over structured reply trees. + + 2026-10-02T22:47:29Z + Accepted to EMNLP 2026 Main Conference + + + Xinyi Liu + + + Rinat Khaziev + + + Dilek Hakkani-Tür + + + Tarek F. Abdelzaher + + + + http://arxiv.org/abs/2610.03198v2 + KV$^2$: A Self-Refining KV Cache + 2026-10-15T11:16:05Z + + + The memory footprint of the key-value (KV) cache constrains the practical use of long-context models, and it dominates cost when one prefilled context must later serve many different queries. In this reusable setting, query-agnostic compression trades cost against quality: lightweight estimators are cheap but less accurate, whereas full-context reconstruction scoring is more accurate yet reprocesses the entire prompt. We introduce KV$^2$, a query-agnostic KV-cache compression method based on selective reconstruction. KV$^2$ first uses a lightweight proxy scorer to identify informative in-context tokens, then reprocesses only this subset to compute final eviction scores. On RULER, Needle-in-a-Haystack, and LongBench, KV$^2$'s margin over baselines widens as the budget tightens: on RULER 16K at a 2% KV-cache budget it improves the average score over the next-best baseline by more than 40 percentage points, and on LongBench it attains the highest average across 2%-10% budgets at lower compression-stage runtime and peak memory than full-context reconstruction. Reusable KV-cache compression thus does not require reprocessing the full context. Our code is available at https://anonymous.4open.science/r/KVsquared-0B97. + + + 2026-10-02T12:11:35Z + + + Johannes Wesch + + + Danni Liu + + + Jan Niehues + + + + http://arxiv.org/abs/2610.03027v1 + Tailoring the Quantization Space for 1-Bit KV Cache Compression + 2026-10-02T09:04:25Z + + + The key-value (KV) cache becomes a major memory bottleneck in long-context LLM inference, placing substantial pressure on memory capacity and bandwidth. To mitigate this bottleneck, vector quantization (VQ) has emerged as a promising approach for aggressive KV cache compression. However, existing VQ methods degrade substantially in the 1-bit regime. At such extreme compression, each codebook must represent a larger group of channels with a limited set of centroids, making effective use of its capacity increasingly challenging. To address this, we introduce $\textbf{TaSQ}$, which tailors the VQ target space by combining query-guided channel weighting, cross-head normalization, and covariance-aware channel grouping to better reflect the error sensitivity and statistical structure of cached activations. Since these transforms are RoPE-compatible and can be easily merged into projection weights and codebooks, TaSQ preserves the conventional VQ lookup structure and adds negligible serving overhead. Across general, long-chain-of-thought reasoning, and long-context retrieval benchmarks, TaSQ consistently outperforms existing low-bit KV cache VQ baselines while preserving reasoning stability. On a single RTX 6000 Ada GPU, its SGLang implementation supports up to $14\times$ larger batch sizes and achieves $1.87\times$ higher peak throughput compared to the BF16 baseline. + + + + 2026-10-02T09:04:25Z + + + Minsoo Cheong + + + Donghyun Son + + + Sungjoo Yoo + + + + http://arxiv.org/abs/2610.02472v1 + APDMem: Agent-Controlled Progressive Disclosure for Query-Adaptive Long-Term Memory + 2026-10-01T20:51:45Z + + + Personalized LLM assistants must recover sparse evidence from long conversation histories across queries of varying complexity. We introduce APDMem (Agent-controlled Progressive Disclosure Memory), a hierarchical long-term memory architecture that applies progressive disclosure to memory retrieval. Rather than relying on a flat memory store or fixed retrieval granularity, APDMem represents conversation history as four progressively detailed layers: thematic summaries, personalized key facts, turn-level evidence notes, and raw messages. At inference time, a controller applies progressive disclosure to the memory hierarchy: it first reads high-level summaries and drills into finer evidence only when needed. This creates an adaptive cost-fidelity trade-off: simple queries can terminate early, while complex temporal, multi-hop, or exact-evidence queries trigger deeper inspection. A note synthesizer converts retrieved evidence into a query-focused structure that consolidates facts, orders events, and flags contradictions before final answer generation. Experiments on LongMemEval show that APDMem achieves strong performance for long-context memory reasoning while accessing only 8% of the total conversations. + + + 2026-10-01T20:51:45Z + Accepted at EMNLP 2026 (Industry Track) + + + Chin-Lun Fu + + + Anagha Kulkarni + + + Hong Ni + + + Behrouz Madahian + + + + http://arxiv.org/abs/2610.02404v1 + Trained Agentic Context Management + 2026-10-01T19:32:12Z + + + We study long context language models. Instead of training long context natively, or designing a long context harness, we train a model over the simplest possible harness: a tool to call itself with any specified prompt and a tool to read tokens in a range from the input context. We finetune Qwen3.6-35B-A3B on a diverse synthetic dataset using this harness. With only 8,000 tokens of context, our small model is as strong as GPT-5.4 with 1M tokens of context on the OOLONG-synth benchmark when document length exceeds 40K tokens. + + + 2026-10-01T19:32:12Z + 17 pages, 6 figures, 4 tables. Code: https://github.com/brycesandlund/infinite-context. Under review + + + Bryce Sandlund + + + + http://arxiv.org/abs/2610.00969v1 + A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models + 2026-10-01T02:59:14Z + + + Large language models (LLMs) have been increasingly used for financial document analysis, including earnings call transcripts (ECTs). Beyond generating standalone claims, users increasingly prefer grounded analyses that pair claims with verifiable citations from source documents to enable independent validation. However, evaluating such analytical claims typically requires extensive expert annotation, which is costly and difficult to scale, and real-world financial analysis commonly involves long context-question-answer triplets, further increasing task complexity. To address these challenges and benchmark the current landscape of grounded analysis by LLMs, we propose a numeric evidence evaluation method that enables groundedness assessment without reliance on expert annotation. We also introduce an automated dataset construction pipeline and construct ECTs-100 from the top 100 constituents of the S&P 500 to support benchmark of both groundedness and correctness. In addition, we examine conscious incompetence, a practical failure mode in financial analysis in which LLMs must detect when available evidence is insufficient and refrain from producing unsupported hallucinations. Empirical results show that LLMs perform well in groundedness but face notable limitations in correctness, with informational insufficiency presenting an additional challenge. + + + 2026-10-01T02:59:14Z + + + Yingzhu Zhao + + + Vlad Pandelea + + + Han Yuan + + + Bo Hu + + + Wuqiong Luo + + + Li Zhang + + + Zheng Ma + + + + http://arxiv.org/abs/2610.00964v2 + RPTune: Learned Context Curation for LLM Catalog Search + 2026-10-02T21:04:32Z + + + For small merchant businesses (SMBs) whose catalogs fit within a long-context LLM, full-catalog prompting offers a compelling alternative to multi-stage retrieval designed primarily for large marketplaces with millions of items. However, fitting the full catalog into the context window does not ensure that the model can use it effectively, since LLMs do not exploit long contexts uniformly. We therefore study in-context catalog search through two complementary questions: (1) how to curate and present catalogs to the LLM, and (2) how to adapt the LLM for product selection on curated contexts. + We propose RPTune, an end-to-end framework that couples learned catalog curation with LLM post-training using automatically generated, catalog-grounded supervision. An encoder-reorganizer curator orders and prunes products guided by downstream LLM feedback, while the resulting curated catalogs in turn improve the effectiveness of LLM post-training with a context-relative reward. We evaluate RPTune on 7 real merchants spanning distinct retail verticals, using 100 complex conversational queries per merchant. RPTune consistently improves search accuracy across both proprietary and open-weight LLMs, with context curation yielding gains of up to 31.4 percentage points and post-training adding a further 10.3 points on average. + + + + 2026-10-01T02:52:24Z + 23 pages, 9 figures, 4 tables + + + Chuxuan Hu + + + Hejie Cui + + + Norman Huang + + + Shubham Kumar Bharti + + + Wang-Chiew Tan + + + Sercan Ö. Arık + + + + http://arxiv.org/abs/2610.00562v1 + Can LLMs Reason Over Long Horizons? An Empirical Evaluation of Context Strategies for Longitudinal Clinical Reasoning + 2026-09-30T18:36:19Z + + + Longitudinal clinical reasoning requires large language models (LLMs) to identify and integrate relevant evidence distributed across extended patient histories. Although long-context models can process increasingly large amounts of information, providing more history does not necessarily make relevant evidence more accessible or improve reasoning. We compare five context strategies (Full, Recent, Episodic, Semantic, and Hybrid) on MedLoCoMo across four open-weight LLMs, examining answer correctness, robustness to query-evidence distance, and abstention on questions with unsupported premises. Episodic and Hybrid generally achieve the strongest overall accuracy, while Recent Context degrades most as supporting evidence becomes more distant; Episodic and Hybrid maintain the highest accuracy at long distances. Analysis of adversarial questions further shows that strong performance on answerable questions does not necessarily translate to successful abstention when the available history does not support the requested conclusion. These findings show that reliable longitudinal reasoning depends not only on how much history an LLM can access, but critically on how relevant evidence is selected and presented for reasoning. + + + + 2026-09-30T18:36:19Z + + + Taye Akinrele + + + Noorbakhsh Amiri Golilarz + + + Subash Neupane + + + Sudip Mittal + + + Shahram Rahimi + + + + http://arxiv.org/abs/2609.39929v1 + RoPE at the End of Its Rope? Theory, Diagnosis, and Mitigation of Long-Context Failures + 2026-09-30T15:14:39Z + + + Long-context failures of RoPE-based language models can arise from RoPE's intrinsic tradeoff between maintaining stable token preferences and distinguishing nearby positions. Determining which weakness to address, and how, requires a more precise characterization of RoPE's behavior in trained models across context lengths. We address a key limitation of prior theory by allowing unequal query-key scales across RoPE frequencies, which aligns well with practical empirical observations. Our theory makes both vulnerabilities measurable for individual heads and inputs, and quantifies how high-frequency components support positional sensitivity while potentially disrupting semantic stability. We also derive a theoretical context-length bound beyond which, under specified conditions, a fixed attention-score comparison cannot jointly avoid semantic reversal and positional insensitivity. Guided by our fresh theoretical insights, we introduce RoPE Profiler, a lightweight, plug-and-play diagnostic toolkit that augments existing evaluations with zero additional forward passes by reusing cached query and key activations. Reusing activations collected during evaluation, the toolkit incurs little overhead. It supplements standard benchmark scores with two diagnostic scores that reveal semantic and positional weaknesses and help users prioritize which aspect to address. Crucially, our evaluations across 49 long-context task settings reveal a distinct pattern where reasoning tasks predominantly suffer from semantic reversal, whereas retrieval tasks are primarily vulnerable to positional insensitivity. Guided by our theory and diagnostic profiles, targeted high-frequency rescaling achieves immediate gains without additional training, improving task accuracy by up to 20 percentage points on Qwen3-8B and 25 percentage points on Llama-3.1-8B-Instruct. + + + 2026-09-30T15:14:39Z + + + Yuyang Wu + + + Yufeng Du + + + Hao Peng + + + + http://arxiv.org/abs/2609.39740v1 + LatentHarness: Learning Latent Actions for Memory and Reasoning via Counterfactual Policy Distillation + 2026-09-30T13:42:26Z + + + Long-context reasoning faces two complementary bottlenecks: retaining evidence across long inputs and sustaining computation across many reasoning steps. Existing approaches largely address them separately, with external memory extending access to distant evidence and latent reasoning compressing multi-step computation. We introduce LatentHarness, which unifies memory access and latent reasoning as sequential latent action selection. At each internal step, the model chooses THINK for further computation, RECALL from a fast-weight memory of input evidence and intermediate reasoning states, or EXIT to emit the next token. We train this policy with counterfactual policy distillation, which branches every action for one step and scores its effect on the emitted token. These gains teach the policy when memory is more useful than further reasoning, while gradients through counterfactual recall teach which intermediate states should be retained in memory for future use. Across six general and long-context reasoning benchmarks, LatentHarness at 1.4B improves on the strongest baselines by 2.8% and 10.0% relative, respectively, and runs 5.9x faster than the strongest long-context baseline. + + 2026-09-30T13:42:26Z + Work in progress + + + Xiaoqiang Wang + + + Suyuchen Wang + + + Bang Liu + + + + http://arxiv.org/abs/2609.38958v1 + Targeted Retrieval, Compact Representations: How CoT Reasoning Improves Long-Context Counting + 2026-09-30T04:27:00Z + + + Large language models (LLMs) have been rapidly improving in long-context tasks, powered by Chain-of-Thought (CoT) reasoning. However, the internal mechanisms underlying this improvement remain unclear. We investigate these mechanisms through a needle-in-a-haystack (NIAH) counting task, where an LLM is asked to count the number of records dispersed in a long text. Across twelve model comparison groups, Thinking (or reasoning) improves counting accuracy over Non-thinking, with pronounced gains at larger counts. This motivates our mechanistic analysis, which identifies two contrasting mechanisms: (i) broad retrieval, where Non-thinking models broadly attend to multiple needles; (ii) targeted retrieval, where Thinking models use enumeration in CoT traces to successively retrieve needles. Targeted retrieval concentrates attention on individual needles and is accompanied by more compact internal representations. Moreover, causal intervention analysis suggests that Thinking models use the CoT trace to maintain and update an internal counter as needles are successively retrieved, even without explicit numbering. In small controlled experiments, both retrieval mechanisms and counter states emerge under standard autoregressive training. Together, our results connect long-context retrieval with representation geometry of counting, supporting a state-tracking account of CoT reasoning. + + + + + 2026-09-30T04:27:00Z + 73 pages, including references and appendices + + + Liang Twist Shan + + + Tianyu Hu + + + Hao Yan + + + Yiqiao Zhong + + + + http://arxiv.org/abs/2609.38832v1 + Scaling Parameter and Context in Attention: Native Sparse Attention from Mixture-of-Head + 2026-09-30T02:53:17Z + + + Scaling attention parameters can improve language model quality, but retaining full token histories makes additional heads costly at long contexts. Furthermore, since attention retrieves and combines contextual information, parameter scaling should also support longer contexts. We therefore ask whether attention parameter scaling can directly enable efficient and effective context scaling. We introduce NAMOH, an architecture-native sparse attention mechanism that activates $K$ of $H$ heads per token. Each head retains only its assigned tokens and performs causal attention within this subsequence. Head selection thus jointly determines active parameters and available context without scanning the full history. Under balanced assignments, increasing $H$ at fixed $K$ shortens head histories and reduces per-token key-value (KV) access without increasing total KV storage. We further support head-relative rotary position embeddings to shorten positional spans within routed subsequences, aiming to mitigate position-induced attention noise. Experiments show that NAMOH can outperform fully activated models with the same total parameters, while enabling more efficient long-context inference than smaller dense models with matched active parameter counts. It remains compatible with GQA and existing sparse attention mechanisms. We hope this work offers a new path for scaling attention, with parameter scaling directly enabling context scaling. + + 2026-09-30T02:53:17Z + + + Zizhuo Fu + + + Runsheng Wang + + + Meng Li + + + + http://arxiv.org/abs/2609.38809v1 + StateTree: Enhancing Long-Term Dialogue Reasoning via Reinforcement Learning + 2026-09-30T02:38:52Z + + + Large language models deployed as personalized assistants must reason over long, evolving interaction histories. However, in long-term dialogue reasoning, relevant evidence is scattered across sessions, preferences may be revised over time, and standard long-context training fails to address these challenges under data scarcity and prohibitive computational costs. We propose StateTree, a data-driven RL method that constructs a challenging auxiliary task from scarce dialogues with verifiable ground truth. StateTree augments multi-session dialogues with a tree-structured path-tracing task: key-value records are embedded across sessions to form a binary tree. Solving the task requires the model to traverse from root to leaf by retrieving records across sessions and comparing timestamps to resolve branches, then recover the hidden target question among distractor leaves. We apply curriculum RL training progressively increasing tree depth and introduce a compositional variant whose edges carry step-level reasoning fragments, training the model to compose partial cues into coherent queries. Trained on 10K-token contexts, StateTree generalizes to 128K tokens without full-length RL costs and exhibits capabilities including cross-session retrieval, temporal reasoning, knowledge update, and compositional multi-hop reasoning. StateTree outperforms both SFT and RL-based baselines while preserving short-context general reasoning. StateTree-7B achieves gains up to +23.60% on LongMemEval (128k), and StateTree-14B reaches 59.00% accuracy on LongMemEval, surpassing QwenLong-L1-32B (45.20%). + + + 2026-09-30T02:38:52Z + NeurIPS 2026 + + + Naen Xu + + + Wanqing Cui + + + Yibo Hu + + + Shixin Hong + + + Hengyu An + + + Meiguang Jin + + + Junfeng Ma + + + Tianyu Du + + + + http://arxiv.org/abs/2609.38530v1 + Shifting Mechanisms: How Positional Encoding Choice Shapes In-Context Retrieval + 2026-09-29T20:50:00Z + + + Language models increasingly use architectures that vary attention span and positional encoding across layers, such as applying RoPE with sliding-window attention and NoPE with global attention (SWA NoPE). However, how these choices shape in-context retrieval remains unclear. To study this question, we take a mechanistic view, tracing how positional encoding (PE) choice shapes the internal mechanisms models use for in-context retrieval. Across 22 open-weight models spanning eight families, we find that standard RoPE models rely primarily on positional retrieval, while PE hybrids shift toward semantic retrieval. We further show on a controlled pre-training ablation that confining positional encoding to local layers produces this semantic shift, degrading representations of positional information. Finally, we show that the reported long-context gains of PE hybrids mask a retrieval trade-off: SWA NoPE improves over RoPE on multiple-target retrieval and QA, but degrades when distinguishing competing keys. We show that these behavioral differences better track the mechanism shift from positional toward semantic mechanisms than a uniform improvement in long-context retrieval. + + + 2026-09-29T20:50:00Z + + + Eric Enouen + + + Sainyam Galhotra + + + + http://arxiv.org/abs/2609.38137v1 + LongHarness Bench: Stress-Testing Language Model Harnesses for Long-Context Reasoning + 2026-09-29T17:55:07Z + + + Language-model (LM) harnesses enable LMs to operate effectively over long contexts using additional compute. However, existing long-context evaluations are insufficient for distinguishing modern harnesses, reflected by saturated accuracy across harnesses and largely similar evaluation costs. In this paper, we introduce a benchmark for evaluating both the effectiveness and efficiency of long-context harnesses. Our tasks require diverse retrieval strategies, including lexical search and semantic matching, together with strategic and adaptive reasoning over global and local context. Much of the context is semantically relevant but only a small subset is useful at each step, creating both a challenging search problem and different accuracy--cost tradeoffs across processing strategies. For example, one task requires identifying every person satisfying several conditions using evidence scattered across documents; strategically checking the most selective condition first can narrow the search before verifying the remaining conditions. We evaluate multiple families of frontier language models with four state-of-the-art harnesses. Our benchmarks remain challenging even for strong model--harness combinations: the best reaches 68\% macro-average accuracy across four evaluation suites. More importantly, we find that the same underlying model can exhibit markedly different efficiency under different harnesses. Our results establish efficiency as an important axis for long-context evaluation and provide a testbed for developing harnesses that process context strategically rather than exhaustively. + + 2026-09-29T17:55:07Z + + + Quang Hieu Pham + + + Thuy Duong Nguyen + + + Jocelyn Qiaochu Chen + + + Xi Ye + + + + http://arxiv.org/abs/2609.37782v1 + Selecting What Matters: Semantic Compression-Guided Selective Pooling for Long-Context Embeddings + 2026-09-29T15:16:48Z + + + Large language models (LLMs) have shown strong potential as training-free text encoders for long-context embeddings. Existing approaches primarily improve information flow under causal attention and typically construct embeddings by uniformly averaging all token representations. However, for long documents, such mean pooling can dilute salient semantic information with abundant redundant or weakly informative content. To this end, we propose SCSP, a training-free framework that leverages semantic compression for informative token selection in long-context embedding. Specifically, SCSP first partitions a document into sentence-aware chunks and appends a semantic compression prompt to each chunk. A prompt-isolated attention mask preserves information flow among document tokens while restricting each prompt to its corresponding local context. We then use the attention patterns elicited by these prompts to estimate token importance, select informative tokens, and aggregate their intermediate-layer representations into the final embedding. Extensive experiments on long-context embedding benchmarks demonstrate that SCSP can be integrated into both zero-shot and fine-tuned models in a plug-and-play manner, consistently improving their performance. + + 2026-09-29T15:16:48Z + + + Zifeng Cheng + + + Jie Zheng + + + Zhiwei Jiang + + + Shuwen Wang + + + Fei Shen + + + Shiping Ge + + + Qing Gu + + + + http://arxiv.org/abs/2609.36935v2 + CoEM: Empowering Long-Context Reasoning with Commit-on-Evidence Memory + 2026-09-30T09:18:33Z + + + Long-context reasoning is essential for complex and long-horizon tasks, yet the performance of large language models (LLMs) degrades as context length increases. Recent approaches address this by processing input chunk by chunk while maintaining a bounded textual memory in model context. However, premature information compression can discard critical details essential for subsequent reasoning. In this paper, we introduce Commit-on-Evidence Memory (CoEM), which learns when to convert source evidence into compact memory facts. Specifically, under a fixed context-memory budget, CoEM preserves potentially useful source excerpts verbatim in a pending set, allowing subsequent context to clarify their relevance before irreversible compression. As new context arrives, a learned policy revisits each pending excerpt and decides whether to promote it to the committed memory, retain it for further consideration, or discard it. A frozen verifier ensures proposed facts are accepted only if supported by retained excerpts and current context. To further guide effective memory management, we train this policy using reinforcement learning by combining fine-grained, step-level evidence rewards with final answer rewards. Extensive experiments demonstrate that CoEM consistently improves long-context reasoning. When evaluated on 6,400 documents long-context input, CoEM outperforms the strongest memory baseline by 10.4-11.4 F1 points on Qwen3.5-9B. Code repository: https://github.com/benmagnifico/CoEM. + + + 2026-09-29T07:48:18Z + 38 pages, 13 figures. Code repository: https://github.com/benmagnifico/CoEM + + + Jingguang Li + + + Yebo Wu + + + Zuyi Guo + + + Kailang Ma + + + Xianjie Dai + + + Han Zheng + + + Benwang Chen + + + Li Li + + + Can Rong + + + Heye Huang + + + + http://arxiv.org/abs/2609.36903v1 + MultiTalk: Scaling Full-Duplex Speech Models to Long, Multi-Party, Bilingual Conversation + 2026-09-29T07:25:29Z + + + End-to-end full-duplex speech models have brought open-source machine conversation closer to human-like interaction, yet existing systems remain limited in two intertwined dimensions: long-context robustness and multi-party interaction. Real-world scenarios such as meetings, group lessons, and social-robot reception require a single model to track, contextualize, and respond to multiple speakers over extended durations. Progress is constrained by both data and evaluation: open multi-party speech corpora remain small and are not designed for codec-frame-level full-duplex modeling, while existing long-audio benchmarks focus on passive listening and speech-to-speech benchmarks are mostly short and dyadic. We extend the Moshi paradigm jointly along the long-horizon and multi-party axes in English and Chinese. First, we release 57.6k hours of synthetic training data ($\href{https://huggingface.co/datasets/MultiTalk/MultiTalkPT}{MultiTalkPT}$ and $\href{https://huggingface.co/datasets/MultiTalk/MultiTalkFT}{MultiTalkFT}$) for long-form, multi-party, English-Chinese full-duplex dialogue, with controllable length, participant count, turn-taking, overlap, backchannels, interruptions, addressee shifts, and long-range coreference. Second, we introduce $\href{https://huggingface.co/datasets/MultiTalk/MultiTalkBench}{MultiTalkBench}$, built from real human recordings, for evaluating long-form, multi-party, bilingual full-duplex dialogue. Conversations average 32.6 minutes and include probes for long-range entity tracking, topic coherence, and addressee selection. Third, we train a bilingual Moshi-style model that sustains coherent multi-party English-Chinese conversations over extended durations and substantially outperforms open-source baselines including Moshi, MiniCPM-o-4.5, and Qwen3-Omni-30B-A3B-Instruct on MultiTalkBench. + + + + 2026-09-29T07:25:29Z + NeurIPS 2026 + + + Ke Wang + + + Houxing Ren + + + Zimu Lu + + + Yunqiao Yang + + + Zhuofan Zong + + + Mingjie Zhan + + + Hongsheng Li + + + + http://arxiv.org/abs/2609.36617v3 + Generating Edit-Inducing Questions for AI Research Manuscripts + 2026-10-09T11:46:03Z + + + We study the ability of LLMs to generate edit-inducing questions whose answer will improve a paper draft. On a dataset of paired submission and camera-ready papers from ICLR and NeurIPS, we compare the helpfulness of questions from GPT models with or without full paper context to that of human reviewers. GPT produces more edit-inducing questions and its questions are associated with more extensive edits and cover a broader range of edited content compared to questions from reviewers. However, a much smaller percentage of the GPT questions are edit-inducing. Our analyses confirm that automated questions can be beneficial to authors and highlight an example task where proper attending to long context deteriorates reasoning model ability to produce helpful output. + + 2026-09-29T03:29:57Z + Accepted at the DocInsights Workshop @ EMNLP 2026 + + + Sebastian Joseph + + + Zichao Wang + + + Jennifer Healey + + + Alexa Siu + + + Junyi Jessy Li + + + Ani Nenkova + + + + http://arxiv.org/abs/2609.36529v1 + Triadic Linear Attention: Three-Dimensional Recurrent States for Long-Context Sequence Modeling + 2026-09-29T02:20:45Z + + + Recurrent neural networks (RNNs) compress the historical context into a memory state of fixed size, thus allowing for constant-time inference. The memory state size is a crucial factor in their performance, as exemplified by the strong performance and resurgence of linear attention, which extends the vector-valued hidden states of ordinary RNNs to matrix-valued hidden states. Crucially, linear attention does so in a parameter-efficient way, in particular by using an outer product of the key and value vectors to write to the matrix-valued hidden state. We generalize this construction and propose triadic linear attention, which writes the triadic outer product of a key, a second key, and a value, into a third-order (i.e., 3D) tensor state, and reads from it by contracting both key axes with two queries. An $E$-dimensional second key thus yields an $E$-fold increase in state size while adding only two projections. Triadic linear attention is compatible with data-dependent forgetting, the delta rule, and chunkwise-parallel training. Applied to Gated DeltaNet and scalar-gated linear attention, triadic linear attention substantially improves long-context language modeling and recall, outperforming alternatives that enlarge the state. + + + 2026-09-29T02:20:45Z + Preprint + + + Oliver Sieberling + + + Bharat Runwal + + + David Jin + + + Ryan Chin + + + Rameswar Panda + + + Yoon Kim + + + + http://arxiv.org/abs/2609.36314v1 + Fractional State Space Transition for Long Sequence Modeling + 2026-09-28T21:48:14Z + + + State Space Models (SSMs) compress sequence history into a bounded recurrent state, making the resulting memory law a central architectural choice for long-context performance. Most modern SSMs rely on ODE-based dynamics that lead to exponential forgetting, limiting their ability to retain information over broad temporal ranges. We introduce FRAC, a selective SSM architecture derived from fractional dynamics that replaces this exponential decay with power-law long memory. To make fractional dynamics practical, FRAC approximates the heavy-tailed target kernel with a finite-state, log-spaced sum of exponential modes. This construction turns fractional memory into an efficient recurrent module with parallel training and prefill, while retaining bounded-state autoregressive decoding. Extensive experiments, including 1.3B-parameter language modeling, demonstrate that FRAC consistently improves long-context performance over state-of-the-art SSM baselines while staying competitive on short-context. These results show that fractional dynamics provide a practical and effective prior for long-context SSMs. + + + 2026-09-28T21:48:14Z + NeurIPS 2026 (Oral) + + + Ivan Kobyzev + + + Abbas Ghaddar + + + Ali Nasiri-Sarvi + + + Lifeng Shang + + + Yufei Cui + + + + http://arxiv.org/abs/2609.36218v1 + CineSubBench: Evaluating LLMs on Long-Form Narrative and Cultural Understanding from Multilingual Movie Subtitles + 2026-09-28T20:16:09Z + + + Large language models are increasingly evaluated in specialized domains such as law, medicine, software engineering, and cybersecurity, yet film remains comparatively underexplored despite requiring long-form narrative integration, multilingual interpretation, and culturally situated audience judgments. We introduce CineSubBench, a benchmark for evaluating long-context film understanding from multilingual movie subtitles. A subtitle track represents a film as thousands of short, temporally ordered utterances from which models must reconstruct characters, relationships, events, causal progression, and themes without explicit scene or event structure. CineSubBench contains 1,012 films with complete subtitle coverage in six languages, yielding 6,072 tracks and 8.13M timestamped subtitle entries. It provides a matched multi-task, multilingual, and multicultural (MultiX) evaluation setting: seven tasks span narrative reconstruction and abstraction, genre prediction, age suitability, country-specific motion-picture ratings across ten national classification systems, and subtitle-grounded language safety. Across nine LLMs, plot premises are recovered more reliably than event-complete synopses; cross-lingual consistency varies substantially across models and languages; national rating systems expose distinct calibration patterns; and strong profanity is far easier to ground than mild obscenity. CineSubBench establishes film as a long-context LLM evaluation domain and provides a unified benchmark for measuring narrative, multilingual, cultural, and evidence-grounding capabilities. + + + + + 2026-09-28T20:16:09Z + Preprint + + + Mir Tafseer Nayeem + + + Susmoy Chakraborty + + + Davood Rafiei + + + + http://arxiv.org/abs/2609.35664v2 + MS-GLA: Multi-Scale Gated Linear Attention for Addressing Representational Bottlenecks via Multi-Temporal Resolution + 2026-10-09T00:44:36Z + + + Gated Linear Attention (GLA) Transformers advance linear recurrent models through data-dependent gating, but face a core limitation: the fixed-capacity memory matrices across all heads operate at a single temporal resolution, where each token is processed individually, forcing them to simultaneously encode local syntactic patterns and long-range semantic structure, creating a representational bottleneck that gating alone is insufficient to resolve. We introduce Multi-Scale Gated Linear Attention (MS-GLA), which addresses this by distributing attention heads across multiple temporal resolutions. Coarser resolutions pool longer token spans naturally specializing toward long-range dependencies, while finer head groups retain sensitivity to local syntactic structure. A learnable, input-dependent fusion layer dynamically recombines head group outputs at each timestep, expanding effective memory capacity without increasing per-head state size. This multi-resolution decomposition draws on principles from Multi-Scale State-Space Models (MS-SSM), adapting them to the gated linear attention setting. We evaluate MS-GLA on language modeling, recall-intensive tasks, and long-context generalization. Across all settings, MS-GLA consistently achieves higher accuracy and lower perplexity than GLA at matched parameter counts, with up to 18.9% improvement on recall-intensive tasks and 9.5% lower average perplexity on language modeling benchmarks, validating multi-temporal resolution decomposition as a principled and effective extension of Gated Linear Attention. + + + 2026-09-28T17:23:45Z + + + Prasoon Dev + + + Anirudh Sankar + + + Vasudeva Varma + + + + http://arxiv.org/abs/2609.34385v1 + Just-In-Time Agent Memory with Runtime Agentic Research + 2026-09-28T06:01:09Z + + + Memory is critical for AI agents. Many existing agent-memory systems follow an Ahead-of-Time (AOT) design, constructing memory before a specific request arrives. While this reduces online serving cost, such request-agnostic memory construction can discard fine-grained information that later becomes important. To address this limitation, we propose Just-In-Time Agent Memory (JAM), a trainable framework for query-conditioned context construction at runtime. A Memorizer preserves complete raw histories in a hierarchical page-store with compact navigational summaries, while a Researcher iteratively retrieves, inspects, and integrates evidence for each request. To train these memory-use behaviors, we introduce Memory-Gym, an evidence-grounded data synthesis pipeline covering nine task types across six domains, and optimize the Researcher through verified-trajectory supervised fine-tuning followed by Hint-guided Group Relative Policy Optimization. We demonstrate the effectiveness of JAM across a variety of benchmarks on agent memory and long-context processing, where it achieves stronger task performance than AOT-style memory systems while remaining substantially more efficient than prior trained agentic memory approaches. To support reproducibility and future research, we release our anonymized source code at https://github.com/VectorSpaceLab/general-agentic-memory. + + + + + 2026-09-28T06:01:09Z + + + Bingyu Yan + + + Chaofan Li + + + Hongjin Qian + + + Shuqi Lu + + + Chaozhuo Li + + + Zheng Liu + + + + http://arxiv.org/abs/2609.33889v1 + Where Activation Sparsity and KV-Cache Sparsity Cross in LLM Decoding + 2026-09-27T20:11:05Z + + + At each step, decoding one sequence with a large language model rereads the projection weights, whose traffic is fixed, and the key-value (KV) cache, whose traffic grows with context. Activation sparsity trims the first term and KV-cache sparsity the second, yet their reported speedups are hard to compare because each depends on context length and on the dense attention kernel it is measured against. We derive a byte crossover, the context length at which the two savings are equal, together with ideal speedup bounds for each branch and for their composition, from model dimensions and keep ratios alone. We then time both branches and their composition from 2K to 128K tokens on two GPUs after a dense prefill of real text, with dense and sparse modes reading the cache through the same split-K attention kernel. The projection branch leads at short context and the KV branch at long context, with speedups that follow their byte bounds up to fixed kernel costs. Adding these costs, measured in separate sweeps, lets the byte account predict the measured crossings of three keep-ratio pairs, a second model, and a second GPU to within 4.1K tokens. Timing the dense baseline with masked instead of split-K attention inflates the apparent speedup of the same KV policy about fivefold. An attention-scored KV selection answers the same passkey and multi-key placements as dense decoding up to 127K tokens, whereas a KV window misses most of them. Under matched perplexity budgets, activation sparsity composed with this selection decodes 14 to 26% faster than the best single branch on both GPUs. Code is available at https://github.com/js-lee-AI/ByteCross. + + + + 2026-09-27T20:11:05Z + 22 pages, 6 figures, 17 tables + + + Jungseob Lee + + + Seungyoon Lee + + + Seongtae Hong + + + Sugyeong Eo + + + Heuiseok Lim + + + + http://arxiv.org/abs/2609.33642v1 + Learning to Learn from Context: Synthetic Training from Perturbed Public Documents + 2026-09-27T15:05:22Z + + + Real-world tasks often require large language models (LLMs) to learn from complex task-specific context rather than pretrained parametric knowledge. This capability remains a weakness of LLMs, while human annotation for such task contexts is expensive and difficult to scale. Public high-quality documents are an abundant alternative, but much of the public web has already been consumed during pretraining: training on such documents naively would reward memorization rather than context learning. In this work, we attempt to make use of high-quality public documents with small perturbations and empirically find that LLMs can successfully generate context-dependent reasoning traces and answers, which are then used to train a student model. Specifically, we construct a synthesis pipeline that (i) rewrites source documents to reduce memorization risk, (ii) generates questions and rubrics that require reasoning over the document, (iii) answers the questions with the document as context, and (iv) admits only samples that genuinely depend on the document. Without any human annotators, our pipeline generates about 10k samples from 3.5k documents, and the resulting student model substantially improves the performance on CL-bench. SFT raises a Qwen3.6-35B-A3B student from 13.7% to 22.8%, and a subsequent rubric-reward RL stage reaches 24.6%, on CL-bench comparable with a frontier model of over a trillion parameters, Qwen3.8-2.4T (23.9%). We also observe a broad transfer of improvements to long-context understanding, instruction following, and reasoning, while code generation and knowledge remain mostly flat. We hope this work provides a reproducible and scalable way to improve the ability of LLMs to learn from context, and to facilitate further research on context-grounded reasoning. + + + 2026-09-27T15:05:22Z + 18 pages, 3 figures, 10 tables + + + Haoyi Wu + + + Yang Xiao + + + Yusong Sun + + + Wenyang Hui + + + Zhaokai Luo + + + Chengyue Jiang + + + Mu Chuan + + + + http://arxiv.org/abs/2609.33485v1 + DISCO: Distributed Long Context Scaling with Grounding-Reasoning Disaggregation + 2026-09-27T11:52:58Z + + + While Large Language Models (LLMs) advertise million-token context windows, reasoning quality often collapses as inputs grow -- a phenomenon termed context rot. This failure stems from a structural entanglement in monolithic architectures, where the massive search burden of contextual grounding exhausts the representational capacity needed for complex reasoning. To resolve this, we propose Grounding-Reasoning Disaggregation via DIStributed long COntext scaling (DISCO). Inspired by distributed computing frameworks like Apache Spark, DISCO partitions long context across a fleet of Worker LLMs dedicated exclusively to parallel, localized grounding. A central Driver LLM, trained via Reinforcement Learning (GRPO) to optimize planning, orchestrates execution by dynamically mapping queries into atomic extraction tasks and reducing the gathered evidence to synthesize a final answer. By isolating reasoning from raw context noise, DISCO effectively eliminates context rot. On RULER-QA (1M tokens), it maintains 78.4% accuracy where standard baselines collapse. Furthermore, it outperforms full-context models by up to 9.8 points on LongBench v2 and matches frontier models like Gemini-3-Pro-Preview while reducing inference costs by over 80%, establishing a highly efficient paradigm for robust long-context inference. + + 2026-09-27T11:52:58Z + + + Guanzheng Chen + + + Viet Dac Lai + + + Subhojyoti Mukherjee + + + Branislav Kveton + + + Seunghyun Yoon + + + Franck Dernoncourt + + + Qizhe Xie + + + Trung Bui + + + + http://arxiv.org/abs/2609.33465v3 + GSM: Efficient Language Modeling with Shared Global State + 2026-10-15T03:28:02Z + + + Improving language model efficiency requires not only cheaper operations but also eliminating redundant computation. We argue that effective modeling requires information accessibility and computational depth, but not repeated historical retrieval across layers. Guided by this principle, we introduce the Global State Model (GSM), a causal encoder--decoder architecture that separates historical information acquisition from deep computation. The encoder progressively aggregates long-range information through multi-stage sparse retrieval into a fixed-size shared state, while decoder layers perform successive transformations over this state without repeated historical access. This design makes decoder attention and cache costs independent of history length, while dependency-aware pruning further reduces prefill computation. Experiments across multiple model scales show that GSM achieves downstream performance comparable to matched DeepSeek-V4.1-Flash-based baselines, with improvements at some scales, while preserving long-context retrieval capabilities. GSM also improves training and inference throughput and reduces cache overhead. These results demonstrate that eliminating architectural redundancy offers an effective path toward efficient language modeling without sacrificing information accessibility or computational depth. + + 2026-09-27T11:19:21Z + + + Yunao Zheng + + + Bin Wen + + + Xiaojie Wang + + + Kaiyu Jiang + + + Xuanyu Zheng + + + Changyi Liu + + + Hongyi Fu + + + Jianxiong Wang + + + Tianke Zhang + + + Haonan Fan + + + Yingxin Li + + + Jiankang Chen + + + Xu Wang + + + Tingting Gao + + + Han Li + + + + http://arxiv.org/abs/2609.32809v1 + Overwhelmed by Choice: Studying LLM Decision Making at Scale + 2026-09-26T17:33:04Z + + + Multiple-choice and candidate-selection evaluations are widely used to assess LLM reasoning and decision-making, yet most benchmarks contain relatively small candidate sets. It remains unclear whether conclusions drawn from these settings remain valid as the candidate space scales. We systematically evaluate LLMs as the number of competing candidates increases and find substantial accuracy degradation across tasks, prompting strategies, and model scales. Controlled analyses show that standard long-context retrieval explanations cannot fully account for this degradation. Instead, we identify two systematic failure patterns. First, gold-margin collapse: the score gap between the correct answer and the strongest distractor progressively shrinks, driven primarily by weakening confidence in the correct answer. Second, earlier candidate preferences become increasingly difficult to overturn, with later candidates exerting progressively weaker influence on the final prediction. Motivated by these findings, we evaluate hierarchical partitioning and permutation-based inference, which improve accuracy by roughly 20 percentage points at $N=160$ on both HotpotQA and MIMIC. Overall, our results identify candidate-set scale as an important evaluation-protocol variable and show that strong small-option performance does not necessarily imply robust large-scale candidate comparison. + + + 2026-09-26T17:33:04Z + Accepted at TAE (Trust-AI-Eval): Can We Trust AI Evaluation?, NeurIPS 2026 Workshop. 23 pages + + + Yu-Chi Lin + + + Aryan Seth + + + Anshul Aravind + + + Eugene Lee + + + Tanmay Parekh + + + Nanyun Peng + + + Kai-Wei Chang + + + + http://arxiv.org/abs/2609.32712v1 + MassAlloc Attention: Let Attention Allocate Its Own Compute + 2026-09-26T15:24:45Z + + + FullAttn often assigns negligible normalized mass to much of the causal score space, yet dense kernels execute the complete post-score path after forming each QK tile. We introduce MALA, a fused attention primitive that preserves score access to every legal causal interaction and uses normalized contribution to allocate post-score computation. Forward uses its evolving online-softmax normalizer, while backward reuses the finalized normalizer to derive nested retained support using only standard attention state. A common tolerance governs training and inference, allowing for adaptive retention of the work. MALA reduces low-contribution post-score computation. A matched-work study at 8K isolates the benefit of distribution-adaptive allocation: under exactly matched total post-score work, MALA approaches a per-instance reference-mass oracle, with mean omitted mass of 0.0188% versus 0.0182%. Across context lengths from 1K to 32K tokens, the same tolerance maintains low output and gradient errors relative to the reference. Across a broader controlled associative-recall comparison, MALA closely tracks FullAttn as context grows, reaching 89.67% accuracy at 8K compared with 89.97% for FullAttn. In an attention-operator benchmark at 128K tokens with tensor parallelism, MALA reduces forward and backward latency during training by 2.2x and 3.0x and decoding latency during inference by 1.6x relative to FullAttn. Across scaling-law training from 0.6B to 14B parameters, MALA closely tracks FullAttn in perplexity while reducing total training FLOPs. The resulting 14B models and 32B models from separate continued training achieve comparable knowledge, reasoning, and long-context retrieval scores to FullAttn. These results indicate that allocating post-score computation according to normalized attention contributions can retain the evaluated capabilities of FullAttn while reducing attention computation. + + + 2026-09-26T15:24:45Z + + + Jingze Shi + + + Zhangyang Peng + + + Xianduo Li + + + Yanlin Qi + + + Xiaotian Lin + + + Haoxian Chen + + + Liangdong Wang + + + Guang Liu + + + Yuyu Luo + + + + http://arxiv.org/abs/2609.32663v1 + Distance-KV: Exploiting Relative Distance for Efficient Long-Context Inference + 2026-09-26T14:20:58Z + + + The memory usage and decoding latency of LLM inference grow rapidly with context length. To reduce these costs, key-value (KV) cache compression methods selectively retain cached states based on token importance or differences in attention patterns across heads. However, we discover that retrieval capability varies substantially with relative distance, even within the same attention head. To exploit this structure, we introduce Distance-KV, which learns a static KV retention pattern over the joint space of layers, attention heads, and relative distances. The pattern is learned offline with the language model frozen and reused across inputs to prune and compact the KV cache without online importance scoring. Across three backbone models and four long-context benchmarks, Distance-KV consistently achieves the best overall performance among competing KV cache compression methods, exceeding the strongest compression baseline by up to 9.3 points on RULER at 128K. On Llama-3.1-8B-Instruct at 128K, Distance-KV reduces KV cache memory by 65.4% and achieves a $1.66\times$ decoding speedup relative to Dense. Together, these results identify relative distance as an important structural dimension for understanding how LLMs retrieve information over long contexts and for designing more efficient inference methods. + + + 2026-09-26T14:20:58Z + 19 pages, 7 figures, 10 tables + + + Xianpeng Shang + + + Canbin Huang + + + Jiang Li + + + Tian Lan + + + Qianyi Cai + + + Xiaojun Quan + + + Xiangdong Su + + + + http://arxiv.org/abs/2609.32474v1 + PC-SubMax: Efficient Prompt Compression via Regularized Submodular Maximization + 2026-09-26T11:07:23Z + + + While large language models (LLMs) are increasingly deployed in long-context scenarios, lengthy prompts can increase inference costs and latency and exacerbate the ``lost-in-the-middle'' phenomenon. Selective prompt compression offers a model-agnostic approach to alleviating these issues. However, methods based on fixed token- or sentence-level importance scores may overlook how content contributions change with the selected subset, limiting their ability to account for inter-sentence redundancy. Compression procedures that rely on autoregressive LLM scoring can also introduce substantial overhead. We propose PC-SubMax, a theoretically grounded framework that formulates selective prompt compression as regularized monotone submodular maximization under a knapsack constraint. The objective is $U(S)-\ell(S)$, where the monotone submodular utility $U$ combines information coverage, query relevance, and log-determinant diversity, and the non-negative modular penalty $\ell$ captures token cost. Through diminishing marginal returns, the objective evaluates each sentence's contribution relative to the selected content. To optimize this objective, we develop the Regularized Greedy+Max (RGM) algorithm, which deterministically returns a feasible set $Q$ satisfying $U(Q)-\ell(Q)\geq \frac{1}{2}U(O)-\ell(O)$, where $O$ is an optimal feasible solution to the regularized problem. RGM uses $O(nκ)$ value-oracle queries, where $n$ is the number of candidate sentences and $κ$ is the maximum feasible subset size. PC-SubMax uses encoder representations and avoids autoregressive LLM scoring during compression. Experiments across seven diverse benchmarks demonstrate competitive downstream performance with low compression overhead. + + 2026-09-26T11:07:23Z + + + Ziyi Zhang + + + Shuang Cui + + + Haotian Zhang + + + Xiaoyu Wang + + + + http://arxiv.org/abs/2609.31382v1 + Highlight-Then-Summarize: Learning to Compress Evidence for Long-Context Understanding + 2026-09-25T15:16:35Z + + + Long-context understanding requires large language models (LLMs) to reason over lengthy documents, conversations, and code, yet task-relevant evidence is often sparse and scattered amid substantial irrelevant and redundant content. We propose Highlight-Then-Summarize (H2S), a compress-then-reason paradigm that first identifies source-grounded, question-relevant evidence and then integrates it into a compact, question-conditioned summary before producing the final answer. To train this behavior, we construct H2S-Dataset, comprising 6,647 examples from 11 benchmark families with an average context length of 43.9K tokens, and introduce H2S-RL, which provides process-level rewards for evidence selection and summary construction in addition to final-answer correctness. We evaluate on H2S-Bench, a seven-task long-context suite. Under a shared 128K input and 4K output budget, H2S-14B achieves an average score of 32.60, outperforming Qwen3.8-27B by 10.17 points and obtaining the strongest overall result among the evaluated open-source models. H2S-14B also achieves the highest Evidence-Summary Quality score and retains 97.1% of its 16K-budget performance with only a 4K output budget. These results show that explicitly selecting and integrating evidence improves long-context reasoning while enabling more compact generation. + + + 2026-09-25T15:16:35Z + 23 pages, 13 figures. Zhaoyuan Xia and Qinghongbing Xie contributed equally. Corresponding authors: Dai Dai, Tong Mo, and Long Zeng. Code and data are available at https://github.com/X-Luffy/Highlight-Then-Summarize + + + Zhaoyuan Xia + Peking University + Baidu Inc + + + Qinghongbing Xie + Tsinghua University + + + Yung Xiang Hue + Tsinghua University + + + Jianguang Jiang + Baidu Inc + + + Gaofeng Lu + Baidu Inc + + + Zhenyu Jiao + Baidu Inc + + + Xing Yuan + Baidu Inc + + + Dai Dai + Baidu Inc + + + Tong Mo + Peking University + + + Long Zeng + Tsinghua University + + + + http://arxiv.org/abs/2609.31261v1 + MoSAR: Mixture of Semantic Attention Regimes for Learning Adaptive and Approximable Attention Geometries + 2026-09-25T13:38:28Z + + + The quadratic complexity of dense self-attention remains a central bottleneck for long-context language modeling. Many efficient alternatives address this cost by deciding in advance where attention should be sparse or local. We argue that attention approximation should instead be approached as a geometric problem, with the relevant interaction geometry learned from data: natural-language dependencies are input-dependent and difficult to prescribe in advance, so the model should learn where positional relevance can decay and where broader interactions must be preserved. We introduce Mixture of Semantic Attention Regimes (MoSAR), which learns such an adaptive, controlled-decay geometry over query--key interactions. Input-conditioned query and key routers, applied after positional encoding, select mixtures over short, medium, and global regimes, inducing a continuous distance-dependent attention field rather than a fixed sparsity pattern. This geometry is learned during training and can subsequently be discretized through top-1 routing. In controlled pre-training experiments with matched 500M-parameter models, MoSAR learns a substantially lower-reach attention geometry without degrading language-modeling quality, improving perplexity over dense RoPE at the training context length. Under length extrapolation, MoSAR achieves the best perplexity among all evaluated variants, including strong baselines such as ALiBi. Moreover, the learned geometry remains stable under deterministic top-1 discretization, suggesting that it is not only adaptive, but also amenable to low-cost approximation at inference time. + + + 2026-09-25T13:38:28Z + + + Michele Paolicelli + + + Alessandro Petruzzelli + + + Alessandro Franceso Maria Martina + + + Cataldo Musto + + + Giovanni Semeraro + + + + http://arxiv.org/abs/2609.29828v1 + ChunkRank: Model-Aware Text Chunking and Abstention-Aware Answer Selection for LLM Pipelines + 2026-09-24T13:59:51Z + + + We present ChunkRank, an open-source Python library that derives chunk boundaries from a target model's tokenizer and context window, and selects an answer among candidates produced independently per chunk. It ships a validated registry of 90 models across 15 providers and six answer-selection methods, and needs only three core dependencies. For chunking, ChunkRank avoids context-window overflow automatically from the model name, whereas character-based splitters overflow or waste the budget, and a fidelity study across 11 languages shows why token-exact budgets matter beyond English. For answer selection we report a negative result: on NaturalQuestions, TriviaQA and HotpotQA, with extractive and generative readers, no content-based ranker reliably beats taking the first non-empty answer. The reason is reader abstention on chunks that lack the answer, not answer position. A long-context baseline shows that chunking matches single-call reading on single-hop questions, so ChunkRank targets small-window and beyond-window settings. Code, registry and evaluation harness are released. + + 2026-09-24T13:59:51Z + 16 pages. Code: https://github.com/AmitoVrito/chunkrank + + + Amit Nautiyal + + + Ayush Bhatt + + + Gaurav Nautiyal + + + + http://arxiv.org/abs/2609.29370v1 + From Policy Documents to Structured Survey Responses: Evaluating Large Language Models for Policy Monitoring + 2026-09-24T10:49:37Z + + + Science, technology, and innovation policies are crucial for competitiveness, yet their diversity and scale make them difficult to map and monitor consistently. Existing approaches rely heavily on manual survey efforts, which are costly and challenging to scale across countries. Large language models (LLMs) enable new possibilities for extracting and structuring information from long and unstructured policy documents. This paper presents an application of LLMs as "AI respondents" for generating structured survey responses from policy texts. We develop a data extraction pipeline based on long-context in-context learning to map information from public web sources into predefined survey categories, including policy instruments, target groups, and thematic areas. The pipeline integrates a validation step using a secondary LLM to assess relevance and evidence, alongside comparisons with human-provided responses. Using a multi-country dataset, we evaluate the alignment between LLM-generated and human-generated outputs through overlap measures and cross-validation. Results show that LLMs achieve high agreement for structured indicators (84-95%), while differences remain in free-text fields, where models tend to provide more detailed procedural descriptions. These findings highlight the potential of hybrid human-AI workflows for policy monitoring, improving both efficiency and scalability while maintaining the need for human validation and contextual interpretation. + + + 2026-09-24T10:49:37Z + Accepted as a full paper to FLINS-ISKE 2026 + + + Carolyn Cole + + + Matthias Deschryvere + + + Toqeer Ehsan + + + Arash Hajikhani + + 10.1007/978-981-92-2480-7_20 + + + + http://arxiv.org/abs/2609.35831v1 + Beyond the Context Window: An Adaptive Entropy-Based Routing Framework for Hybrid Retrieval and Long-Context Language Models + 2026-09-23T16:09:36Z + + + Modern large language models now support context windows of more than one million tokens, which has raised the question of whether retrieval-augmented generation (RAG) is still necessary. Pure long-context (LC) processing is expensive and is known to under-attend to information placed in the middle of long inputs, while pure RAG is fast but bounded by retrieval quality and prone to errors when retrieved chunks are partially relevant or contradictory. We propose the Entropy-Driven Adaptive Router (EDAR), a framework that decides at inference time whether to answer a query from retrieved chunks or to escalate it to full long-context processing. The decision uses the predictive entropy of the token-level probability distribution computed over the first few generated tokens of the RAG response. The entropy threshold is selected on a held-out validation set by sweeping cost against accuracy. Experiments compare EDAR against pure-RAG and pure-LC baselines on LongBench v2 and Infinity-Bench. Predictive entropy correlates strongly with hallucination rate on a held-out set of 2,000 generations (Pearson r = 0.85, 95% CI [0.83, 0.87]). On the long-context benchmarks, EDAR retains 97.4% of the accuracy of the pure long-context baseline while reducing total token expenditure by 70.7%, escalating only 18.2% of incoming queries. The accuracy gap between EDAR and the pure long-context system is not statistically distinguishable from zero at standard sample sizes. Predictive entropy is a useful model-internal signal for routing between RAG and long-context inference, and a threshold-based hybrid system can recover most of the accuracy of long-context models at a small fraction of the cost. The framework does not depend on a specific retriever or LC backbone, and it does not require additional supervision beyond what is normally produced during decoding. + + 2026-09-23T16:09:36Z + 11 pages, 2 figures + + + Isaac Olufadewa + + + Miracle Adesina + + + Ezekiel Oladejo + + + Owen Adeniyi + + + Fadare Fadekemi + + + Olamide Oso + + + Uthman Babatunde + + + Matthew Olawoyin + + + + http://arxiv.org/abs/2609.27590v1 + MWE-ECL: Recoverable Long-Range Context Does Not Always Override Local Lexical Priors + 2026-09-23T09:09:04Z + + + Long-context evaluations often test whether a model can recover distant evidence, but recoverability does not guarantee behavioral influence. We test the prediction that a distant discourse anchor can remain explicitly recoverable yet fail to change the locally preferred reading of a familiar multiword expression; such failures should concentrate when the model's no-anchor default conflicts with the anchor, while prior-correct decisions remain largely preserved. We introduce Multiword Expression Effective Context Length (MWE-ECL), a bilingual diagnostic whose matched anchor-retrieval, no-anchor prior, and interpretation prompts measure explicit recoverability, model-observed defaults, and anchor-conditioned decisions, respectively. Across eight English deployment panels on a shared 0-128K grid, retrieval-control accuracy on prior-conflict items is 0.989-1.000, prior-conflict override spans 0.806-1.000 (0.809-1.000 after conditioning on correct retrieval), and preservation of prior-correct decisions remains 0.977-1.000. A same-call control querying retrieval and interpretation in one prompt reproduces the gap for DeepSeek V4 Pro (1.000 retrieval versus 0.900-0.920 interpretation), showing that separate invocations are not its sole explanation; smaller or absent gaps in the other two models bound its generality. For DeepSeek V4 Flash, separate prompt-fit tests retain perfect retrieval with lower interpretation at 512K and 1M, while foil-consistent cues shift the no-anchor prior far more than retrieval; cross-model cue effects are heterogeneous. A separately reported 10-family Chinese subset shows similar descriptive gaps, but imperfect retrieval for some models prevents an integration-only attribution. MWE-ECL therefore evaluates whether explicitly recoverable distant context changes a competing local semantic decision. + + 2026-09-23T09:09:04Z + + + Wei He + + + Aline Villavicencio + + + Rodrigo Wilkens + + + Zhenyun Deng + + + + http://arxiv.org/abs/2609.27470v1 + DeltaS: Reading the Gated Linear Attention State for KV Cache Eviction in Streaming Video + 2026-09-23T07:35:52Z + + + Recent video-language models increasingly adopt hybrid architectures that interleave linear and full attention layers for efficient long-context processing. While the recurrent state of linear attention remains fixed in size, the KV cache of full attention continues to grow with the video stream, making eviction necessary under a bounded memory budget. The key challenge in streaming is that eviction must occur before the question arrives, so what to retain has to be decided without the question. Existing eviction methods derive token scores from the KV cache itself, using position, attention, or key-value representations, and attention-based scores further require proxy queries or extra computation. Hybrid backbones offer another source of signal. In gated-delta linear attention, the recurrent state is updated by the residual between each input and what can already be retrieved from the state, so its change over a chunk of frames reflects how much new information the chunk brings. We propose DeltaS, a query-agnostic, training-free method that retains video chunks inducing larger normalized state change, or state drift. In a controlled comparison with the budget and retention policy held fixed, state drift outperforms position-, attention-, and key-value-based signals. With a signal costing only 1.9% of the forward pass, DeltaS surpasses the strongest query-agnostic bounded-memory baseline by 2.1 points on average across six long-video benchmarks and by 5.6 points on the longest benchmark. These results suggest that the two memories of hybrid architectures can work cooperatively. Code is available at https://github.com/MaumAI-Company/DeltaS. + + + + 2026-09-23T07:35:52Z + 15 pages, 8 figures, 6 tables. Code: https://github.com/MaumAI-Company/DeltaS + + + Taeyoun Kwon + + + Seungjin Kim + + + Hyeonyu Kim + + + Moon Hwan Kim + + + + http://arxiv.org/abs/2609.26976v1 + When Learned Context Planning Fails to Beat Strong Retrieval: A Controlled Study of Planning, Routing, and Reranking for Long-Context QA + 2026-09-22T19:12:16Z + + + Learned context planning selects evidence atoms before an answer model reasons over them. We test whether this learned selection improves long-context multiple-choice QA after strong retrieval, routing, budgeted-selector, and reranking controls. Our primary diagnostic uses all 503 LongBench-v2 MCQ questions with Qwen2.5-7B-Instruct. The planner is SFT-trained on outcome-selected traces from 140 training and 28 development questions; because the 503-question analysis includes those questions, it is partly transductive. At an 18k-character budget, anchored hybrid retrieval reaches 36.18% accuracy and BM25 reaches 35.98%, while the best direct planner-guided method reaches 34.19%. On the untouched 152-question test split, anchored hybrid remains higher (42.11% versus 36.84%). Leakage-safe routers cannot convert a large oracle gap. Under tight budgets, the best planner is ahead by only 0.40 points at 6k and loses at 9k; planner-guided reranking has a +1.79-point estimate at 6k with a paired interval crossing zero and ties the control at 9k. Packing-order and score-flatness analyses did not identify a stable mechanism. Under this setup, learned planning is a weak relevance signal rather than a replacement for strong retrieval. + + + 2026-09-22T19:12:16Z + 5 pages. Accepted at the Seventh Workshop on Insights from Negative Results in NLP (Insights 2026), co-located with EMNLP 2026 + + + Yingrui Li + + + Han Chen + + + + http://arxiv.org/abs/2609.26368v1 + HySparse2: Hybrid Sparse Attention with Two-Level KV Sharing + 2026-09-22T13:10:32Z + + + Long-horizon and multi-turn agents typically generate short actions and process long observations from tools and environments. This growing context demands efficient prefill, compact KV-cache storage, and accurate long-context retrieval. To meet these demands, we introduce HySparse2, a hybrid sparse attention architecture with two-level KV sharing. At the outer level, KV Bridging adopts a YOCO-style self-decoder and cross-decoder structure, but bridges only full-attention layers. The self-decoder uses hybrid sliding-window attention (SWA), while the cross-decoder uses hybrid sparse attention. The KV caches for full-attention layers in the cross-decoder are generated from the hidden states of full-attention layers in the self-decoder. At the inner level, HySparse2 retains HySparse's core KV Reuse design with two refinements. First, it replaces block-level sparsity with token-level sparsity for finer long-context retrieval. Second, it removes the separate SWA branch from sparse layers and instead forces a sliding window of recent tokens into the sparse selection. This two-level KV sharing allows all cross-decoder KV caches to be constructed from self-decoder hidden states. Prefill can therefore exit after the self-decoder, skipping all cross-decoder layers. On an 80B-A3B MoE model, HySparse2 outperforms HySparse and Hybrid SWA on long-context retrieval and multi-turn agentic tasks, while substantially reducing prefill computation and KV-cache storage. + + 2026-09-22T13:10:32Z + + + Jianyu Wei + + + Yizhao Gao + + + Qihao Zhang + + + Shimao Chen + + + Zhengju Tang + + + Yu Cheng + + + Shengjie Zhou + + + Zihan Jiang + + + Yifan Song + + + Hailin Zhang + + + Liang Zhao + + + Bo Yang + + + Gang Wang + + + Shijie Cao + + + Fuli Luo + + + + http://arxiv.org/abs/2609.25611v1 + Qwen3.8-Omni: Towards Native Omni-Modal Agents + 2026-09-22T03:07:59Z + + + We introduce Qwen3.8-Omni-Flash, a natively multimodal agentic model for real-world multimodal productivity. Compared with previous omni models, which primarily emphasized perception and interaction, Qwen3.8-Omni-Flash substantially improves multimodal understanding and reasoning, as well as performance on long-horizon agentic tasks. These capabilities are supported by a native multimodal co-training strategy that preserves strong text-domain capabilities while facilitating the transfer of agentic capabilities from text to audio and video tasks. The model inherits the sparse mixture-of-experts (MoE) architecture of Qwen3.8-Next and extends the context window to one million tokens, supporting long-context multimodal reasoning and long-horizon planning. These advances enable integration into production workflows as a primary agent or a specialized sub-agent, supporting video editing, long-form audio and video translation, music-conditioned music video or movie generation, and video-based note or omni-skill creation. To address the lack of native audio and video support in existing agent harnesses, we release Qwen-MM-Plugins, a lightweight open-source plugin framework for multimodal productivity. We further frame real-time multimodal interaction as a system-level challenge requiring orchestration of context and memory management, tool use, and sub-agent delegation. Accordingly, we release Qwen-Live-Harness, an open-source framework for building responsive, real-time multimodal agents based on Qwen3.8-Omni-Flash. Extensive evaluations demonstrate that Qwen3.8-Omni-Flash achieves strong performance across multimodal understanding, reasoning, long-horizon agentic execution, and video productivity tasks. These results and the accompanying open-source tools support Qwen3.8-Omni-Flash as a practical foundation for deploying natively multimodal agents in research and production. + + + + 2026-09-22T03:07:59Z + + + Qwen Team + + + diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc2.xml b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc2.xml new file mode 100644 index 0000000..390aa8a --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-lc2.xml @@ -0,0 +1,2420 @@ + + + https://arxiv.org/api/dVJ2JBIXa4ZoQ0eGZ5JYVXf5oBw + arXiv Query: search_query=abs:"long context" AND abs:"benchmark"&id_list=&start=0&max_results=60 + 2026-10-26T11:17:15Z + + 60 + 1263 + 0 + + http://arxiv.org/abs/2610.32483v1 + When Agents Fail: Model or Harness--Who's to Blame? + 2026-10-23T10:57:54Z + + + LLM agents combine models with execution harnesses, so agentic benchmark performance reflects their joint behavior. We argue that harnesses should therefore be evaluated through their interactions with underlying models. We develop a framework combining five complementary measures: (i) Valid Completion Rate (VCR), how reliably agents finish normally and deliver evaluable results, irrespective of task correctness; (ii) Model-Harness Fit, how well a harness supports task achievement through valid completion for a given model; (iii) Cross-Model Fit, a harness's overall suitability across evaluated models; (iv) Interaction Residuals, pairing-specific execution strengths and weaknesses hidden by component-level summaries; and (v) Token Load, the token demands of agent execution, including failed attempts. We evaluate four general-purpose harnesses (OpenCode, Codex CLI, Pi CLI, and DeepAgents) with four core models, plus two fixed native model-harness systems, on six benchmarks covering context management, tool use, long-context planning, multimodal interaction, and artifact handoff. Including native references and stress conditions, 111 evaluation settings yield 52,168 trajectories. Harness rankings vary across models and benchmarks; task performance and valid completion can favor different pairings, and similar task scores can accompany distinct execution profiles. OpenCode ranks first in cross-model performance, while DeepSeek V4 Flash Preview maintains consistently high Mean VCR across harnesses on the shared four-benchmark panel. These findings support evaluating model-harness interactions, training transferable harness-use capabilities in models, and harness designs adapted to the model and task. + + + + 2026-10-23T10:57:54Z + Preprint under review + + + Shao Zhang + + + Hangfan Zhang + + + Yuanyuan Shi + + + Hao Li + + + Min-Le Su + + + Kangcong Li + + + Jingping Wang + + + Chunjiang Mu + + + Chen Zhang + + + Yang Chen + + + Bo Zhang + + + Shuyue Hu + + + + http://arxiv.org/abs/2610.30132v1 + LongZero: Enhancing Long-Context Reasoning in LLMs from Zero Data + 2026-10-21T17:59:14Z + + + Reinforcement learning (RL) is an effective way to strengthen the long-context reasoning of large language models (LLMs), but it needs training data that are long, diverse, challenging, and verifiable. Human annotation of such data is expensive, naturally occurring data are too scarce to sustain RL, and existing synthesis methods depend on external corpora or stronger teacher models, which become harder to obtain as the trained models get stronger. Recently, RL from zero data, in which a model learns from tasks it proposes itself, has achieved excellent performance, but existing methods target short-context tasks. Therefore, we propose $\textbf{LongZero}$, a method that lets an LLM improve its own long-context reasoning without any external data. Instead of writing questions and answers over existing documents, LongZero first has the model synthesize the question and answer with its supporting evidence in a compact structured form, and only then separately expands the evidence into a long multi-document context. LongZero combines these self-written multi-hop reasoning tasks with self-written multi-round retrieval tasks and trains the model with GRPO. We evaluate LongZero on two LLMs across five long-context reasoning benchmarks and compare it with RL on data synthesized from external corpora. Experimental results show that LongZero can generalize to real tasks, and outperforms both baselines, suggesting a viable and promising path to improving long-context reasoning of LLMs. + + + 2026-10-21T17:59:14Z + Code and data are available at https://github.com/zhennan1/LongZero + + + Zhennan Wan + + + Jianfei Chen + + + + http://arxiv.org/abs/2610.30206v1 + MoEZip: Routing-Aware KV Cache Compression for Sparse Mixture-of-Experts LLMs + 2026-10-21T13:06:30Z + + + Mixture-of-Experts (MoE) language models scale model capacity efficiently by activating a small subset of parameters per token. However, in long-context inference, memory remains a major bottleneck because the KV cache grows linearly with sequence length. Existing KV cache compression methods reduce this cost for dense transformers, but overlook a problem specific to MoE: KV eviction can change which experts are selected during answer generation, degrading the generation quality. We propose MoEZip, a routing-aware KV cache compression for sparse MoE language models. To estimate the sensitivity of expert routing to perturbation, we propose a novel metric based on the Fisher information matrix of routing distributions. MoEZip combines this metric with attention weights for routing-aware scoring of contexts. Finally, we compose a complementary scoring system that combines eviction methods for dense and sparse-MoE architectures. Experiments show that MoEZip achieves robust performance under aggressive cache compression on various benchmarks. At a KV retention ratio of 10\%, MoEZip improves over the SoTA baseline by +24 and +20 points on average on LongBench and RULER, corresponding to 2.3$\times$ and 4.9$\times$ higher scores, respectively. + + + 2026-10-21T13:06:30Z + Annual Conference on Neural Information Processing Systems (NeurIPS) 2026, Accepted + + + Minsang Kim + + + Seungjun Baek + + + + http://arxiv.org/abs/2610.28393v1 + When Copying Is Hard: Copy-Constrained Decoding for Exact Span Reproduction + 2026-10-20T15:40:54Z + + + Precisely reproducing a target span verbatim within a long context is a fundamental capability test for LLMs: even when the target string is present in context, models often still drift within the span or fail to stop correctly, revealing limitations in source grounding and boundary control. This capability has broad practical relevance. For instance, code generation often requires embedding sensitive strings such as API keys exactly as they appear in context. In this work, we construct a benchmark to test exact span reproduction ability across contracts, scientific literature, code, and random sequences, and find that current models still make surprisingly frequent errors. To address this, we propose CopyGen, a lightweight copy-constrained plugin for frozen LLMs that turns copying from a byproduct of next-token prediction into a controlled process. Our key idea is to decompose copying into three distinct decisions: when to copy, how far to copy, and when to stop. Concretely, CopyGen first determines whether to enter copy mode, then predicts a tentative copy length, and finally verifies the generated span token by token. During verification, we adaptively adjust the logits of copy continuation tokens to incentivize or suppress continuation, and emit only the longest valid prefix. Across three LLM backbones and four benchmark tasks, CopyGen improves average exact match by 35% relative without model finetuning, and integrates seamlessly with SFT to further improve it by 4%, while substantially accelerating generation. These results suggest that reliable exact copying is not something LLMs obtain for free, but a decoding-time control problem that requires explicit modeling. Code is available at https://github.com/mbzuai-nlp/CopyGen. + + 2026-10-20T15:40:54Z + NeurIPS 2026 + + + Jinghui Zhang + + + Lang Gao + + + Zongfang Liu + + + Ruihong Zeng + + + Zirui Song + + + Rui Yan + + + Kentaro Inui + + + Xiuying Chen + + + + http://arxiv.org/abs/2610.27234v1 + EGI-BENCH: An Enterprise General Intelligence Benchmark Suite + 2026-10-19T20:02:07Z + + + Enterprise adoption of LLMs in agentic workflows is gated by evaluations that span a wide arc of abilities: CRM operations, heterogeneous-document retrieval, personal data understanding, multi-turn planning, tool use, function calling, long-horizon research, and long-context software engineering. These evaluations live today in separate repositories with divergent runners, dependencies, and scoring conventions, which makes cross-benchmark comparison difficult and obscures what a single aggregate number actually represents. We release EGI-BENCH, a unified LLM agent benchmark suite that consolidates eight enterprise facing agent benchmarks (CRMARENA, HERB, PERSONABENCH, USERBENCH, MCP-UNIVERSE, MCPEVAL, BENCHFORCE, LOCOBENCH) behind a single command-line interface with two runtime-budgeted execution modes. On top of the suite we define the Enterprise General Intelligence (EGI) Score, a six-dimensional framework (M1-M6) whose buckets are populated by fine-grained sub-metrics routed from each benchmark rather than by benchmark-level averages. We describe the suite, the sub-metric routing, and the quick/deep budgets, and report results for fourteen frontier and cost-efficient LLMs spanning the GPT, Claude, and Gemini families under quick mode. Top-line EGI ranges from 39.6 (GPT-4o mini) to 65.6 (gpt-5.5), and no single model dominates every capability axis: gpt-5.5 leads task outcome, planning, and retrieval grounding; Claude Sonnet 4.5 leads tool actioning and safety/abstention; and Claude Haiku 4.5 leads engineering quality. Code is available at https://github.com/SalesforceAIResearch/egi-bench. + + 2026-10-19T20:02:07Z + + + Zhiwei Liu + + + Zhujun Lan + + + Jielin Qiu + + + Zixiang Chen + + + Liangwei Yang + + + Ming Zhu + + + Akshara Prabhakar + + + Wenting Zhao + + + John Emmons + + + Jason Wu + + + Shafiq Rayhan Joty + + + Junnan Li + + + Shelby Heinecke + + + Silvio Savarese + + + Huan Wang + + + + http://arxiv.org/abs/2610.26834v1 + Kronecker Delta Rule for Long Context Linear Attention + 2026-10-19T17:56:52Z + + + We propose KronLSTM, a linear attention architecture based on the Kronecker Delta Rule, a novel update rule for associative matrix memories. KronLSTM extends the xLSTM family with a memory-revision mechanism that corrects targeted associations while modifying the memory only along a single direction in matrix space. This minimally invasive memory revision reduces interference with previously stored information compared with delta-rule updates, making it particularly well suited for long-context language modeling. The resulting memory dynamics can be mathematically described as a Markov chain that converges to a steady-state distribution, while the expected norm of the memory matrix remains uniformly bounded throughout the entire input sequence. Hence, KronLSTM ensures stable memory dynamics without requiring additional normalization and stabilization mechanisms for the memory state. Experiments show that KronLSTM is competitive with, and often outperforms, existing linear attention architectures, including models of the (Gated) DeltaNet family, with particularly strong performance on long context benchmarks. These results establish the Kronecker Delta Rule as an effective and analytically tractable foundation for stable associative memory in recurrent linear attention architectures. Our code (https://github.com/NX-AI/KronLSTM) and models (https://huggingface.co/collections/NX-AI/kronlstm) are open-source. + + + 2026-10-19T17:56:52Z + + + Anamaria-Roberta Hartl + + + Levente Zólyomi + + + Michael List + + + Günter Klambauer + + + Sebastian Böck + + + Sepp Hochreiter + + + + http://arxiv.org/abs/2610.26827v1 + KEEP-Bench: Evaluating Evidence Preservation in Context Compression + 2026-10-19T17:55:18Z + + + Context compression improves long-context efficiency but may introduce faithfulness issues through an information bottleneck. Existing evaluations rely on QA metrics, but a reader can still answer correctly from an unfaithful compression, so these metrics underestimate such loss. To bridge this gap, we introduce KEEP-Bench, a diagnostic benchmark that directly assesses compression faithfulness with 4,102 cases across three challenging settings that require keeping evidence for plausible reference resolutions, explicit qualifiers, and minority perspectives. Experiments show that even with tailored prompting, the strongest models remain unreliable: despite context windows exceeding 100K tokens and inputs averaging only 3.1K tokens, the best open-weight model (31B) preserves all required evidence in only 66.8% of cases, and the best proprietary model in only 61.6%. Performance also varies sharply across evidence structures, so conclusions from limited structures may be biased. We further introduce a metric, Evidence Preservation Return (EPR), to relate evidence recall to inference FLOPs, and find that it peaks at moderate scales (4B-8B), where recall remains low. Additional output budget mainly benefits already strong models and widens capability gaps, yet the stronger preservation of these models comes at a steep computational cost. These findings highlight the importance for future work to investigate compressors with strong information preservation under a small computation budget, rather than relying on a large output budget or model scaling. + + 2026-10-19T17:55:18Z + Code: https://github.com/PlusLabNLP/KEEP-Bench Project: https://pluslabnlp.github.io/KEEP-Bench/ + + + Ziqing Man + + + Di Wu + + + Jia-Chen Gu + + + Junyi Zhang + + + Kai-Wei Chang + + + Nanyun Peng + + + + http://arxiv.org/abs/2610.26431v1 + Long-form Video-to-Text Summarization using Recursive Language Models + 2026-10-19T13:56:33Z + + + While VideoLLMs have made significant progress in understanding short video benchmarks, they often struggle to summarize long-form ones. This is mainly due to performance degradation caused by long-context prompts, the inherent difficulty of preserving temporal continuity and a lack of semantically rich concepts in event descriptions. To tackle these issues, this paper introduces the first recursive Video Language Summarization Model (RVLSM) designed for video processing and tailored to long-form video-to-text summarization. RVLSM recursively decomposes videos into semantically coherent segments and delegates chunk-level reasoning to VideoLLM sub-models and external tools. It employs (1) Semantic Temporal Decomposition (STD), which preserves temporal coherence and continuity through a scene-aware chunking strategy that dynamically partitions videos according to semantic boundaries, and (2) Adaptive Multimodal Tool Calling (AMTC), which ensures semantic richness of the summary via a routing mechanism that selectively invokes auxiliary modules such as action recognition, optical character recognition, automatic speech recognition, and object detection. Experiments on the VideoXum and MixTyVSum benchmarks show that RVLSM consistently improves over zero-shot VideoLLM baselines across multiple model settings and performance metrics, and is competitive with a state-of-the-art fine-tuned model for video-to-text summarization. Importantly, the named entities in the RVLSM's summaries align more closely with those detected in the ground-truth summaries than those detected by baseline and state-of-the-art methods, confirming the saliency of the event descriptions it generates. + + 2026-10-19T13:56:33Z + Paper currently under review + + + Alessia Intini + + + Lorenzo Vaiani + + + Enrico Chen + + + Luca Cagliero + + + + http://arxiv.org/abs/2610.25919v1 + LEAPS: Long-context Evaluation of Adaptive Pattern Learning and State Tracking + 2026-10-19T07:19:45Z + + + Long-context language models (LCLMs) power agents that act over long trajectories, from improving a codebase to running research experiments to forecasters that condition on lengthy histories. These applications draw on three distinct long-context capabilities: recall, where the answer is a fact present in the context; state tracking, where the outcome can be computed by performing a series of transformations to a specified state; and pattern learning, where the goal is to make a prediction by sampling from a distribution inferred from many observations. Existing benchmarks primarily focus on the first capability. In this work, we introduce LEAPS (Long-context Evaluation of Adaptive Pattern learning and State tracking), a collection of 12 novel datasets, spanning agentic workflows, behavioral modeling, and forecasting of market and world events. By construction, LEAPS is resistant to data contamination, extends to millions of input tokens, and uses reliable metrics. We evaluate 30 API and open models from 8K to 512K input tokens. LEAPS distinguishes models that perform near perfectly on recall tasks, finding that such models' state tracking and pattern learning abilities can vary significantly and degrade much more dramatically with increasing input lengths--even for pattern learning, where more observations should make learning a theoretically easier task. Moreover, thinking models often underperform their base counterparts, exhausting their generation budget or oversimplifying the task. We hope LEAPS can guide the development of the next generation of LCLMs. + + 2026-10-19T07:19:45Z + Code and data available at https://github.com/howard-yen/LEAPS + + + Howard Yen + + + Nitya Mani + + + Alex Renda + + + Christopher S. Hardin + + + + http://arxiv.org/abs/2610.25463v2 + DiaLong: Benchmarking Reminiscence in Long-Context Dialogues + 2026-10-20T19:55:41Z + + + How well can transformer-based Large Language Models (LLMs) retain and recall memories in long contexts of dialogue? LLMs are known to forget long-range factual information in their context, yet the field lacks a comprehensive benchmark to quantitatively assess these shortcomings. We present DiaLong, a long-context dialogue dataset and accompanying memory task that standardizes evaluation in this space. It consists of 100 unique conversations created by humans and then augmented with LLMs, extending beyond lengths found in existing datasets. Our selected memory task is fact recall: classify 40 candidate facts about a dialogue as true or false. This task directly probes the model's ability to actively retain and retrieve information, serving as a critical measure of memory within extended conversational contexts. In testing both the latest LLMs and proposed memory enhancements on DiaLong, we demonstrate that more work needs to be done to enable LLMs with better memory performance. By enhancing memory capabilities, LLMs can improve in maintaining coherence, relevance, and human-like interaction over extended conversation. Improving these capabilities will help LLMs fulfill diverse user needs and expectations in various conversational scenarios. + + + 2026-10-18T18:47:42Z + Equal contribution. Work conducted in 2023 at Johns Hopkins University + + + Owen Bianchi + + + Samer Aslan + + + Ryunosuke Saito + + + + http://arxiv.org/abs/2610.26951v1 + The Bottleneck Is Retrieval, Not Reading: Diagnosing Evidence-Based Generation with RAG for Long Context Question Answering + 2026-10-18T09:10:42Z + + + Retrieval-augmented generation (RAG) is the dominant paradigm for grounding large language models in external corpora, but its similarity-driven, chunked pipeline has structural blind spots: it cannot anticipate which passages a question requires and discards document-level context that resolves cross-passage references. We introduce evidence-based generation (EBG), requiring models to return an answer with line-level citations, and a joint Ans+Evid metric that scores correctness and grounding simultaneously. We reformulate two corpora into evidence-grounded multi-document QA benchmarks- MultiHop-RAG and QASPER-MP, a multi-paper adaptation of QASPER with realistic short paper cues, and pair them with a controlled synthetic two-hop haystack and an evidence-augmented NoLiMa spanning 10K-1M characters. Across ten proprietary frontier and three open-weight LLMs, EBG isolates two RAG limitations that long-context models avoid: similarity retrieval surfaces any relevant chunk far more reliably than all required chunks for multi-fact queries, and chunking destroys document meta-information needed to resolve identity-bearing queries. EBG also exposes grounding failures invisible to answer-only evaluation, including incomplete citations in two-needle settings and a widening gap between Ans and Ans+Evid when context contradicts parametric knowledge. Data and code are available at https://github.com/debobanerjee/LC-EBG. + + + 2026-10-18T09:10:42Z + + + Debopriyo Banerjee + + + Owais Aijaz + + + Ahmer Tabassum + + + Zhuohan Xie + + + Preslav Nakov + + + Veselin Stoyanov + + + + http://arxiv.org/abs/2610.23250v1 + LonGaussian: Tracking Foundation Priors for Long-Context Feedforward Gaussian Reconstruction + 2026-10-16T10:24:17Z + + + Reconstructing high-quality, renderable 3D scenes from long videos is essential for robotic perception and embodied intelligence. Many feed-forward Gaussian reconstruction methods rapidly predict 3D scenes from a small set of images, but extending them to longer sequences presents two bottlenecks: jointly processing all views increases GPU memory requirements, while accumulating pixel-aligned predictions redundantly represents the same surfaces and increases storage and rendering costs. We present LonGaussian, a streaming feed-forward framework that reconstructs compact, globally renderable Gaussian scenes from long image sequences with known intrinsics and unknown camera poses. Built on a pretrained streaming 3D reconstruction backbone, LonGaussian decodes long-context geometric features into dense Gaussians. Within each chunk, multi-frame point tracks link repeated observations of the same surface and guide a learned merger to consolidate the corresponding Gaussian predictions. Rendered-depth consistency filtering further suppresses Gaussians from other chunks that incorrectly occlude locally reconstructed surfaces. On DL3DV and RealEstate10K benchmarks, LonGaussian improves novel-view rendering quality while using substantially fewer Gaussians than the evaluated feed-forward baselines. + + 2026-10-16T10:24:17Z + + + Zhoufeng Xie + + + Guanjun Wu + + + Shuai Zhang + + + Xinggang Wang + + + Wenyu Liu + + + + http://arxiv.org/abs/2610.23167v1 + LongForge: Measuring and Improving Long-Context Instruction Data via Evidence-Assertion Reasoning Graphs + 2026-10-16T09:05:30Z + + + Existing quality control for long-context instruction-tuning data is a one-shot judgment inside the generation pipeline that leaves only a scalar, revealing neither which document parts an answer uses nor how many reasoning steps it writes down; the data can thus be neither audited nor controlled. We formalize data quality as a property of the alignment structure among document, question, and answer, and build LongForge, which pairs an analyzer that measures long-context data with a synthesizer that generates it. The analyzer reverse-reconstructs each sample into an evidence-assertion reasoning graph and programmatically computes four dimensions on it: breadth, depth, correctness, and completeness. Every reading traces back to specific evidence spans and reasoning steps, making data auditable. Measuring seven mainstream datasets reveals two previously unquantified defects: breadth barely grows with document length, and depth is generally low, the two being nearly orthogonal. The synthesizer then embeds the analyzer into generation, gating on correctness and completeness and deferring breadth and depth to a training-time mixture over measured values, which makes the training distribution controllable. On two backbones, its two mixtures, LongForge-1 and LongForge-N, outperform the strongest baseline by 2.2-4.7 points on average over six long-context benchmarks, and in a controlled comparison that holds the gate and the candidate pool fixed, raising breadth and depth alone is worth a further 1.16 points, making the structural distribution of training data a lever on downstream quality rather than only a description of it. + + 2026-10-16T09:05:30Z + Work in progress + + + Ziyang Chen + + + Junlong Jia + + + Xing Wu + + + Tinghao Yu + + + Songlin Hu + + + + http://arxiv.org/abs/2610.22985v1 + Prism Attention: Proposal-Refined Index Sharing Mechanism for Efficient LLMs Inference + 2026-10-16T06:11:20Z + + + Long-context decoding in large language models (LLMs) is increasingly bottlenecked by the memory and computation required to attend over an ever-growing Key-Value (KV) cache at each autoregressive step. Although token-level sparse attention reduces this burden by restricting computation to a small subset of relevant past tokens, its practical gains are often offset by repeatedly recomputing layer-wise sparse indices as the context grows. A common remedy is to share sparse indices across layers by computing them only at designated anchor layers, but such static reuse ignores the layer-wise evolution of attention patterns, causing the reused indices to progressively deviate from the layer-specific optima and incur substantial attention loss. By revisiting cross-layer sparsity from the perspective of attention dynamics, we find that inter-layer salient token shift is highly localized: although the exact top-$κ$ indices differ across layers, the core high-attention tokens remain stable, with changes concentrated near the expanded boundary of previously selected regions. Motivated by this, we propose Prism Attention, a proposal-refined sparse attention framework. It replaces rigid cross-layer index reuse with a coarse-to-fine strategy, preserving layer-wise adaptability while retaining the efficiency benefits of cross-layer sharing. Extensive experiments show that Prism Attention achieves state-of-the-art performance among mainstream sparse attention methods on both reasoning and long-context benchmarks, while attaining a $3.4\times$ end-to-end decoding speedup over FlashAttention at 128K context length. + + + 2026-10-16T06:11:20Z + Published as a main conference paper at NeurIPS 2026 + + + Zhenxu Tian + + + Kebin Liu + + + Zhengwu Yang + + + Yi Su + + + Qingqing Dang + + + Yanlin Sha + + + Kaipeng Deng + + + Dianhai Yu + + + Yanjun Ma + + + Juntao Li + + + Min Zhang + + + + http://arxiv.org/abs/2610.22130v1 + DropKV: Decoupling Residual-Output Perturbation for Near-Optimal KV-Cache Eviction + 2026-10-15T16:05:17Z + + + Key-value (KV) cache management has become a critical bottleneck for scaling Large Language Models (LLMs) to long-context scenarios due to linear memory growth. While recent eviction methods have moved beyond simple attention-score heuristics to incorporate value representations, they typically face a fundamental trade-off: the underlying optimization for minimizing output perturbation is an NP-hard combinatorial problem, leading to mathematically suboptimal heuristics or implementations that are difficult to kernelize. In this work, we propose DropKV, a simple principled eviction framework based on Decoupled Residual-Output Perturbation. By decoupling the joint eviction decision into independent per-token scoring, DropKV circumvents combinatorial intractability and admits a provable constant-factor approximation guarantee under a cone condition that we empirically verify on three long-context LLMs. To ensure practical viability, we provide a high-performance implementation using fused Triton kernels that avoid materializing the full attention matrix, delivering a 19.8x scoring-kernel speedup that translates to up to a 9.9% matched-batch end-to-end prefill speedup. Extensive evaluations on the RULER and LongBench benchmarks demonstrate that DropKV consistently outperforms state-of-the-art baselines at equivalent cache budgets, achieving the lowest inference latency among eviction methods while also remaining faster than the dynamic cache baseline. + + 2026-10-15T16:05:17Z + Accepted by NeurIPS 2026 + + + Aozhong Zhang + + + Selcuk Gurses + + + Yanxia Deng + + + Naigang Wang + + + Chi-Chun Liu + + + Davis Wertheimer + + + Derrick Liu + + + Xin Li + + + Zi Yang + + + Felix X. -F. Ye + + + Penghang Yin + + + + http://arxiv.org/abs/2610.22067v1 + Beyond Context Length: Characterising the Difficulty of Long-Context Reasoning + 2026-10-15T15:28:33Z + + + Long-context language models support ever longer context windows, and evaluations typically treat context length as the main indicator of difficulty. However, context length alone cannot explain why models fail on long-context tasks that require reasoning over complex information. Contexts of equal length can pose very different challenges: a task may be solvable from a single local passage, or it may require integrating evidence distributed across the full context. We quantitatively characterise this difficulty through three properties: evidence scope, how much necessary information must be found; evidence dispersion, how widely that information is scattered within the context; and reasoning depth, how many dependent steps are needed to derive an answer from it. We construct LURCH, a multi-domain question-answering benchmark of 6,550 instances with supporting evidence and reasoning graphs, enabling all three properties to be quantified. Evaluations of proprietary and open-weight models show that: (1) at fixed context length, all our three properties are strongly negatively correlated with model performance; (2) as context length increases, performance degrades sharply on samples with dispersed evidence, whereas it remains relatively stable on samples with localised evidence; and (3) difficulty compounds across properties, as questions with moderately high values on all three are harder than those with an extreme value on just one. These findings establish evidence scope, dispersion and reasoning depth as measures of long-context reasoning difficulty that complement context length. + + 2026-10-15T15:28:33Z + + + Shiwen Qin + + + Cameron Barker + + + Henry Gouk + + + Elliot J. Crowley + + + Shay B. Cohen + + + Mirella Lapata + + + Miao Li + + + + http://arxiv.org/abs/2610.21375v1 + Memorilla: Latent Semantic Memory for LLMs + 2026-10-15T06:55:55Z + + + Memory enables large language models (LLMs) to use information beyond their parameters, such as past user conversations, long documents, or an agent's earlier actions. For a frozen LLM, access to this accumulated knowledge is limited to what a memory system places in its context window. However, gathering and combining relevant information needed for each query while keeping the model's context short remains challenging for existing systems. Here we introduce Memorilla, a memory system that gathers information from an entire document collection into a fixed number of query-dependent 'memory tokens' for a frozen LLM. Memorilla encodes documents (such as user chats, book chapters) once into reusable embeddings, then learns to retrieve and place query-specific information in the LLM's input embedding space. Using only 16 memory tokens, Memorilla achieves the best performance against baselines including Mem0 and MemoRAG on five of eight benchmarks spanning personalization, long-document and knowledge-intensive question answering. Notably, on FactKG, it reaches 84.33% accuracy versus 80.43% with full-context inference, while using 108x fewer tokens to represent the source documents. Furthermore, Memorilla can facilitate continual learning in agentic systems where the document count (the agent's past turns) increases throughout the trajectory. In a TextWorld environment, we show that Memorilla reduces the agent's tendency to wander between rooms it has already explored, and improves its average success rate from 18.6% with full-history in-context learning to 24.2%. Overall, Memorilla aids frozen LLMs in accumulating and using knowledge effectively across long-context interactions and takes a step towards building continually learning AI systems. + + + 2026-10-15T06:55:55Z + Website: https://memory.stanford.edu/ + + + Adibvafa Fallahpour + + + Parsa Idehpour + + + Vignesh Kothapalli + + + Nikita Mounier + + + Shirley Wu + + + Shayan Pardis + + + Jure Leskovec + + + + http://arxiv.org/abs/2610.21165v1 + From Long Context to Selective Memory:A Survey of Memory-Centric Compression for Large Language Models + 2026-10-15T03:24:36Z + + + Long-context capability has become essential for large language models (LLMs) to handle complex tasks, yet continuously expanding the context window does not remove the computational, storage, and information-selection pressures incurred at inference time. Existing work on prompt compression, KV-cache management, efficient serving, retrieval augmentation, and agent memory is usually discussed in isolation, leaving the flow of information between storage and computation insufficiently understood. This survey reframes long-context compression as a memory-management problem for allocating inference-time resources. We distinguish compute-active memory, which directly participates in model computation, from compute-inactive memory, which lies outside the computation path but can be stored, retrieved, updated, or forgotten, and we characterize offloaded KV caches, persistent prefix caches, and precomputed KV states as intermediate states on the activation path. On this basis, we formulate writing, offloading, recall, retrieval-and-injection, materialization, eviction, consolidation, and forgetting as state transitions within an information lifecycle, and introduce a budgeted cost model that places these operations in a single cost account. The resulting framework unifies short-term context compression, long-term memory management, and the transitions between them, and shows that the central challenge is not merely reducing information volume but deciding which information should participate in costly inference, when, and in what form. We further summarize evaluation dimensions, benchmark gaps, and open challenges, and argue that future research should move from static, pointwise compression toward dynamic, governable, lifecycle-aware memory management. + + 2026-10-15T03:24:36Z + + + Chaogui Gou + + + + http://arxiv.org/abs/2610.21147v2 + All-in-One Memory: Process-Rewarded Reinforcement Learning for Memory Agents + 2026-10-16T05:35:53Z + + + Large language models increasingly rely on external memory to answer queries grounded in long-horizon histories such as multi-session dialogues and lengthy documents. However, existing memory methods often optimize retrieval and memory construction separately, without a shared reward space for evaluating search, writing, and stopping decisions. To address this, we propose All-in-One Memory (AiO-Mem), which organizes these operations as transitions over a shared evidence state and directly evaluates the semantic quality of each action in a unified reward space. AiO-Mem compiles heterogeneous histories into source-traceable multi-view events, providing a shared substrate for retrieval and memory writing. A unified memory policy actor then rolls out complete interaction trajectories over this shared evidence state. A separate trajectory-conditioned process reward model is trained through evidence-grounded supervised fine-tuning and trajectory-level DPO to assign process scores to the collected trajectories. These scores are aggregated into an action-balanced trajectory reward and used by Process-Aligned DAPO (PA-DAPO) to optimize the memory policy. Across long-context memory benchmarks, AiO-Mem consistently improves answer accuracy over both static memory systems and RL-trained memory agents. + + 2026-10-15T03:02:24Z + 9 pages, 5 figures + + + Bingbing Wang + + + Jingjie Lin + + + Weiming Qiao + + + Jing Li + + + Ruifeng Xu + + + + http://arxiv.org/abs/2610.20686v1 + RoLaQ: Joint Rotation and Range Calibration for 2-Bit KV Caches in Multi-Head Latent Attention + 2026-10-14T16:46:48Z + + + Multi-head latent attention (MLA) compresses the content of a key-value cache into a shared latent per token, making low-bit storage attractive for long-context inference. At two bits, errors in this representation perturb both attention matching and value readout, with effects that depend on error direction and reconstruction scale. We introduce RoLaQ (Rotation-calibrated Latent Quantization), an offline method for joint rotation and range calibration. RoLaQ refines a shared rotation within subspaces defined by the frozen key and value projections, and jointly learns quantization ranges whose thresholds and reconstruction gains are coupled to control the shared signal's response. Prediction matching and attention-output supervision guide calibration with model weights frozen. Across three MLA models and six benchmarks, RoLaQ achieves the highest average accuracy among the compared 2-bit methods both without and with token protection. On DeepSeek-V2-Lite, an SGLang implementation provides 3.96 times the BF16 KV capacity under the same memory budget and 2.51 times its decode throughput with 256K input tokens. + + + 2026-10-14T16:46:48Z + + + Shiyu Ji + + + Peng Ling + + + Chen Lin + + + Shupeng Li + + + Yixuan Wang + + + Qingfu Zhu + + + Wanxiang Che + + + + http://arxiv.org/abs/2610.20392v1 + FOLD: Position-Free Far Memory with Local Order for Long-Context Speculative Decoding + 2026-10-14T15:55:10Z + + + Speculative decoding accelerates LLM generation through lightweight drafting and parallel verification. It is particularly promising for long inputs, where KV-cache access costs can be amortized over multiple accepted tokens. Yet most drafters are trained on short sequences and degrade on long inputs, while long-context training is costly. Existing training-free approaches restrict the context window, rescale positions, or augment recent context with retrieved distant entries. Drafters, however, read target hidden states that already encode contextual and positional information, and their lightweight architecture makes full-history attention affordable. We propose FOLD, a training-free method that preserves exact local positions and treats all distant entries as far memory at a shared position. To counter attention dilution as the memory grows, we sharpen attention within it to emphasize relevant entries while separately controlling its total weight relative to the local window. Across six target-drafter pairs and diverse benchmarks of up to 256K tokens, FOLD predominantly delivers the highest speedup, with the best case more than doubling the speedup over autoregressive decoding, from 2.08$\times$ to 4.22$\times$. + + + 2026-10-14T15:55:10Z + + + Shuxuan Li + + + Jialiang Kang + + + Yanghao Zhou + + + Ziye Zhu + + + Xiao Yang + + + + http://arxiv.org/abs/2610.19928v1 + MemDuet: Learning Dual-Process Memory for Long-Context Reasoning + 2026-10-14T10:16:13Z + + + Reasoning over infinitely long documents is becoming a reality with recurrent memory agents. However, increasing context length exacerbates the trade-off between reasoning performance and inference efficiency. Inspired by Kahneman's account of fast and slow thinking, we propose MemDuet, a dual-process memory framework that learns to coordinate a small language model for fast, parallel evidence selection from raw context chunks (System 1) with a large language model for memory-update verification and memory updates in document order (System 2). We train MemDuet in three stages: supervised fine-tuning of System 1 for evidence selection, Group Relative Policy Optimization (GRPO) of System 2 for verification and memory rewriting, and joint optimization of both policies to coordinate selection and updating for long-context reasoning. Experiments on diverse long-context reasoning benchmarks (RULER-HQA, LongBench v2, and 2WikiMultiHopQA) demonstrate a favorable accuracy-efficiency trade-off as context length grows. Averaged across evaluation settings on the three datasets, MemDuet achieves an end-to-end inference speedup of 9.74x and an output-token reduction of 73.91% relative to RL-MemAgent. + + 2026-10-14T10:16:13Z + + + Jiangcheng Song + + + Haodong Jing + + + Yulin Mu + + + Lesong Tao + + + Jixin Wang + + + Jin Cui + + + Tianjing Ren + + + Runxuan Xie + + + Yongqiang Ma + + + Nanning Zheng + + + + http://arxiv.org/abs/2610.19210v1 + Titan-Llama: Retrofitting Pre-trained LLMs with External Neural Memory Modules + 2026-10-13T21:23:58Z + + + Transformers are efficient to pre-train at scale because attention permits parallel computation across sequence positions, but long-context inference requires increasingly large KV caches. Efficient recurrent alternatives reduce the asymptotic complexity of inference, but their sequential dependence limits token-wise parallelism during training, making them harder to scale. Further, the current paradigm of extending long context tasks creates competing notions of retaining information precisely and keeping long-context inference efficient. To address this gap, we introduce Titan-Llama, a post-training method for retrofitting attention-based language models with a hierarchical memory architecture that updates parameters at test-time. Titan-Llama applies a blockwise attention mask and preserves full-fidelity attention over recent tokens while compressing historical context into recurrent, fixed-size neural memory modules (NMMs). Our formulation allows pre-trained attention layers to be replaced without training a new language model from scratch. On Llama-3.2-1B-Instruct, Titan-Llama raises accuracy over segmented attention windows from 23.87\% to 40.51\% on QuALITY and from 14.50\% to 40.75\% on LongHealth. Inference benchmarks show more than 20\% faster prefill, 37\% faster decode at medium context lengths, and 24\% lower steady-state decode memory usage in the evaluated configurations. Together, these results demonstrate that incorporating memory architecture mechanisms that utilize test-time training effectively modulates long-context behavior of pre-trained models, offering a practical route to adapting pre-trained transformers for efficient long-context inference. Our code is released on Github \href{https://github.com/sarahpannn/titans-pytorch/tree/main}{GitHub} + + + 2026-10-13T21:23:58Z + + + Sarah Pan + + + Ali Behrouz + + + + http://arxiv.org/abs/2610.18642v1 + MultiAlloc: Budget-Aware Precision Allocation for KV Cache Quantization + 2026-10-13T16:10:45Z + + + The Key-Value (KV) cache constitutes a dominant source of memory consumption during large language model (LLM) inference, particularly in long-context and complex reasoning scenarios. Existing KV cache quantization methods have explored different compression granularities, including layer-wise precision adjustment and token-level information preservation. In practical deployment, however, the key challenge is not merely compression, but how to allocate limited quantization resources among heterogeneous precision preservation strategies under a fixed KV cache memory budget. We propose MultiAlloc, a profiling-guided precision allocation framework for KV cache quantization that adaptively distributes limited quantization resources between layer-wise precision enhancement and token-wise preservation. MultiAlloc employs lightweight offline profiling to characterize layer sensitivity and token importance, enabling adaptive precision allocation under a fixed memory constraint. Guided by the profiled memory--accuracy trade-off, it automatically derives an effective precision allocation strategy without online allocation search, and applies the resulting policy during inference. Extensive experiments on reasoning and long-context benchmarks demonstrate that MultiAlloc consistently improves over layer-wise, token-wise, and recent multi-granularity KV cache quantization methods under matched memory budgets across diverse models, including Mistral, Llama, DeepSeek-Qwen, and QwQ. + + 2026-10-13T16:10:45Z + Code: https://github.com/RL-MIND/MultiAlloc + + + Yangchengyu Zhou + + + Zhiping Wu + + + Runchang Jiang + + + Dongdong Ren + + + Youfang Han + + + Wei Zhao + + + Dongqi Cai + + + Wenbin Li + + + + http://arxiv.org/abs/2610.17966v1 + BELT : BEhavior-Aligned Low-Rank KV Cache Compression with Learned Top-k Rank Allocation + 2026-10-13T08:42:38Z + + + Long-context inference makes the key-value (KV) cache a major memory bottleneck for large language models. We propose BELT, a low-rank KV cache compression framework. Its key-side objective targets attention distributions rather than raw keys or pre-softmax logits, yielding a quadratic surrogate with a closed-form low-rank solution. A learned global rank allocator uses differentiable soft selection during training and hard selection at deployment to meet a user-specified component budget. Experiments demonstrate improved model quality under aggressive compression and increased decoding throughput at comparable accuracy. Evaluated across three LLMs and multiple benchmarks, BELT achieves up to 70% low-rank KV cache compression while outperforming the strongest baseline by up to 23.3 points on LongBench, and up to 17.8x overall KV cache reduction when combined with quantization. With Triton-based GPU kernels and a quantized cache, BELT delivers up to 2.7x speedup for the attention module and 3.3x end-to-end decoding throughput. + + + 2026-10-13T08:42:38Z + + + Yaoyang Liu + + + Shuwei Shen + + + Jincheng Tang + + + Jinguang Liu + + + Jinbao Xue + + + Hailong Yang + + + Ke Zhang + + + Yinjun Wu + + + + http://arxiv.org/abs/2610.17959v1 + Virtual Head Attention + 2026-10-13T08:39:20Z + + + The design of attention mechanisms in long-context large language models faces an ``impossible triangle'' among KV cache size, training and prefill FLOPs, and model quality. GQA achieves strong quality but incurs high KV cache overhead; alternative approaches such as MLA and MFA can compress the cache, but MLA suffers from quality loss while MFA substantially increases training and prefill compute. We propose Virtual Head Attention (VHA), which simultaneously improves all three vertices through two lightweight linear operations: Q Premix applies a near-identity transformation to queries within each KV group to recover virtual head diversity from halved physical query heads, and Linear Postmix fuses inter-head features via a low-rank $I + AB^\top$ residual structure. Since VHA introduces no nonlinear operations, Premix can be folded into the query projection and Postmix into the output projection at inference time, reducing the model to a standard GQA-2 architecture that directly reuses all existing GQA inference optimizations. With only two KV heads, the group size in large models readily reaches 64, fully exploiting Tensor Core parallelism during decoding. Across four scales with 4K-context 50B-token pretraining, VHA consistently surpasses the standard GQA baseline at every scale ($+$0.05\% to $+$0.81\%), while reducing KV cache by $4\times$ vs.\ GQA-8 at dense scales and $2\times$ vs.\ GQA-4 at the MoE scale, and lowering training and prefill FLOPs by 7.9\% (1.7B, $S{=}4096$). On an industrial 30B-A3B MoE model trained on 500B tokens at 8K context, VHA outperforms both MLA and GQA-4 by $+$0.70\,/\,$+$2.60\,\% on a 12-benchmark base-model evaluation suite; in a separate matched 10B-A1B MoE comparison after long-context mid-training, VHA attains an average RULER score of 84.4 over 8K--128K versus 73.0 for GQA, while using two rather than four KV heads in the full-attention layers. + + + 2026-10-13T08:39:20Z + Published as a main conference paper at NeurIPS 2026 + + + Xibo Ding + + + Guoxia Wang + + + Jinle Zeng + + + Jiabin Yang + + + Sirui Tao + + + Chao Yang + + + Dianhai Yu + + + + http://arxiv.org/abs/2610.17202v1 + MLAfication: Efficiently Enabling High-Fidelity MLA for Modern LLMs + 2026-10-12T17:59:10Z + + + Multi-Head Latent Attention (MLA) compresses the KV cache into a latent representation, reducing inference memory and bandwidth. Existing MHA2MLA/TransMLA methods do not support QKNorm and require costly recovery on modern LLMs, especially MoE. We present MLAfication, a QKNorm-compatible, parameter-efficient extension of MHA2MLA. It combines calibrated KNorm, parameter-efficient distillation, contribution-aware Partial-RoPE, and activation-aware joint KV initialization. Across MHA and GQA models, including QKNorm- and MoE-equipped variants, MLAfication preserves performance under substantial KV-cache compression, surpasses the current SOTA on commonsense and long-context benchmarks, and extends MLA conversion to modern architectures. On Qwen3-30B-A3B, MLAfication delivers up to $5.35\times$ the serving throughput of BF16 GQA and, combined with 4-bit KV quantization, reduces the KV-cache footprint by $94.73\%$. Our code is available at https://github.com/JT-Ushio/MLAfication. + + + 2026-10-12T17:59:10Z + + + Zile Wang + + + Zhide Xie + + + Tao Ji + + + + http://arxiv.org/abs/2610.15542v1 + Apertus 1.5: From Open Text Models to Open Multimodal Reasoners + 2026-10-11T11:34:43Z + + + Language models are becoming infrastructure, and infrastructure built in the open, by public institutions, on documented data, is the alternative to dependence on a few providers; Apertus shows this is viable at scale. Apertus 1.5 extends the fully open Apertus family from text to multimodal reasoning. Continued pretraining of the Apertus 1.0 models, on 4T additional tokens for the 8B and 2T for the 70B, adds image and audio understanding and extends the context window fourfold to 262,144 tokens; multimodality enters through the tokenizer, the language-model head remains restricted to text, and the architecture is unchanged. Supervised finetuning, long-context finetuning, reinforcement learning with verifiable rewards, and preference alignment complete the released models. Thinking is a flag of the chat template rather than a separate model, and lifts mathematical reasoning by up to 20 points on the 8B model. The released models improve over their predecessors on nearly every benchmark; among fully open models of its class, the 8B leads on knowledge, instruction following, and cultural benchmarks, and its instruction following surpasses all compared models, including open-weight ones. On image and audio understanding, a first for the family, the models are competitive with fully open multimodal models, strongest on document understanding and long-form and lower-resource speech recognition, while specialized vision and audio models remain ahead on perception and transcription of English and other high-resource languages. As in Apertus 1.0, we train only on openly available data, respect crawler opt-outs retroactively, and exclude restrictively licensed material. We release the model weights, data preparation and training recipes, and evaluation suites under permissive licenses; openness extends to values, with the Apertus charter guiding alignment stages published alongside the models. + + 2026-10-11T11:34:43Z + + + Project Apertus + ETH Zurich + + + : + ETH Zurich + + + Yixuan Xu + ETH Zurich + + + Yassine Turki + EPFL + + + Vinko Sabolčec + EPFL + + + Valentina Pyatkin + ETH Zurich + + + Tommy Chu + EPFL + + + Sven Najem-Meyer + EPFL + + + Sean F. Carroll + EPFL + + + Robert Smith + ETH Zurich + + + Raphael Kreft + ETH Zurich + + + Oscar Alessandro Tazza + ETH Zurich + + + Oleg Lavrovsky + EPFL + + + Nicola Irmiger + ETH Zurich + + + Matteo Santelmo + EPFL + + + Marian Schneider + ETH Zurich + + + Juan García Giraldo + EPFL + + + Hanna Yukhymenko + ETH Zurich + + + Eduard Ďurech + ETH Zurich + + + Davit Melikidze + ETH Zurich + + + Dani Tamayo + EPFL + + + Bettina Messmer + EPFL + + + Aryan Ahadinia + EPFL + + + Anunay Yadav + EPFL + + + Allen Huang + EPFL + + + Ahmad Fraij + ETH Zurich + + + Alessandro Bombarda + EPFL + + + Alex Padula + ETH Zurich + + + Alexander Hägele + EPFL + + + Alexander Sternfeld + HES-SO Valais-Wallis + + + Anna Hedström + ETH Zurich + + + Anna Kosovskaia + ETH Zurich + + + Arthur Wuhrmann + EPFL + + + Arundhati Balasubramaniam + ETH Zurich + + + Badr Al Mahouri + EPFL + + + Barna Pasztor + ETH Zurich + + + Bartosz Szostakiewicz + ETH Zurich + + + Bich Ngoc Doan + EPFL + + + Bryan Schmid + FHNW + + + Burak Sezen + ETH Zurich + + + Camille Challier + EPFL + + + Clément Charmillot + EPFL + + + Dana Shayakhmetova + EPFL + + + Daniel Perruchoud + FHNW + + + David Brüggemann + SDSC + + + David Isztl + CSCS + + + Elia Palme + CSCS + + + Emma Anastassova + EPFL + + + Fabian Bösch + CSCS + + + Faruk Zahiragić + EPFL + + + Fawzi Roberto Mohamed + CSCS + + + Fiona Panicali + FHNW + + + Florian Kolly + EPFL + + + Flynn Guerra + FHNW + + + Francesco Monti + EPFL + + + Frederike Lübeck + ETH Zurich + + + Gennaro Oliva + CSCS + + + Haofeng Yang + ETH Zurich + + + Haoliang Shang + ETH Zurich + + + Helen El Khoury + EPFL + + + Henrique Mendonça + CSCS + + + Jannis Vamvas + University of Zurich + + + Jérome Landolt + FHNW + + + Jessica Lam + ETH Zurich + + + Jingchun Xiao + ETH Zurich + + + Jonathan Coles + CSCS + + + Joshua Oyebanji + EPFL + + + Khanh Nguyen + EPFL + + + Konstantinos Pitas + ETH Zurich + + + Lasse B. Strand + ETH Zurich + + + Li Mi + ETH Zurich + + + Loïc Deslarzes + EPFL + + + Lorenzo Baggi + ETH Zurich + + + Lorenzo Noci + ETH Zurich + + + Luca Baumann + ETH Zurich + + + Luca Sartori + ETH Zurich + + + Lukas Drescher + CSCS + + + Marco De Negri + ETH Zurich + + + Marco Passerini + CSCS + + + Mark Klein + CSCS + + + Marko Stojanovic + EPFL + + + Martin Majsec + EPFL + + + Matin Ansaripour + EPFL + + + Mattea Busato + EPFL + + + Mauro Pellonara + EPFL + + + Max Neuwinger + ETH Zurich + + + Michael Graber + FHNW + + + Michal Tešnar + ETH Zurich + + + Michelle Wastl + University of Zurich + + + Miguel Gila + CSCS + + + Mikolaj Boronski + EPFL + + + Morgane Magnin + EPFL + + + Moritz Reihs + ETH Zurich + + + Mukhammadali Sayfiddinov + ETH Zurich + + + Nathan Ranchin + ETH Zurich + EPFL + + + Nicolas Cuveillier + EPFL + + + Oscar Wohlfahrt + EPFL + + + Qianqian Zou + SDSC + + + Rada Kamysheva + ETH Zurich + + + Rita Sevastjanova + ETH Zurich + + + Roman Machacek + University of Bern + + + Sebastian Keller + CSCS + + + Simon Matrenok + EPFL + + + Simon Pierre + EPFL + + + Stefano Schuppli + CSCS + + + Suei-Wen Chen + ETH Zurich + + + Szabina Horváth-Mikulas + EPFL + + + Taliesin Perez + EPFL + + + Thilo Spinner + ETH Zurich + + + Thomas Kleine Buening + ETH Zurich + + + Tim Robinson + CSCS + + + Tymoteusz Kwiecinski + ETH Zurich + + + Vilém Zouhar + ETH Zurich + + + Vinzenz Thoma + ETH Zurich + + + Xiaozhe Yao + ETH Zurich + + + Yannick Metz + ETH Zurich + + + Yuhei Fukuhara + EPFL + + + Yusif Askari + EPFL + + + Zixuan Chen + ETH Zurich + + + Alexander Ilic + ETH Zurich + + + Ana Klimovic + ETH Zurich + + + Andreas Krause + ETH Zurich + + + Andrei Kucharavy + HES-SO Valais-Wallis + + + Elliott Ash + ETH Zurich + + + Joost VandeVondele + CSCS + + + Martin Rajman + EPFL + + + Mennatallah El-Assady + ETH Zurich + + + Thomas Schulthess + CSCS + + + Timo Kehrer + University of Bern + + + Torsten Hoefler + ETH Zurich + + + Antoine Bosselut + EPFL + + + Martin Jaggi + EPFL + + + Imanol Schlag + ETH Zurich + + + + http://arxiv.org/abs/2610.15373v1 + In-Place Indic Tokenizer Expansion and Continual Pretraining of Nemotron-3-Nano-30B-A3B + 2026-10-11T05:53:00Z + + + We adapted Nemotron-3-Nano-30B-A3B for eight Indian languages without changing its backbone architecture. We expanded the vocabulary in place from 131,072 to 163,072 entries using continued byte-pair encoding and AdaptMix rebalancing, reducing tokens per word by 38.6%. We initialized new input and output rows by averaging their original constituent rows, then trained them on 90% Indic and 10% English text before updating the backbone. Continual pretraining then progressed through broad training, high-quality annealing, and long-context training over approximately 1.27 trillion tokens. The annealed checkpoint gained 12.9 points on the Indic MILU benchmark but lost 3.4 on English MMLU. We also report practical negative results. Direct token addition underperformed continued byte-pair encoding. AdamW weight decay changed rows intended to stay fixed. Perplexity on an Indic-heavy holdout did not select the learning rate that best preserved English performance. + + + 2026-10-11T05:53:00Z + Accepted at the GlobalSouthAI Workshop, NeurIPS 2026 + + + Avinash Benki + + + Prasanjith Pasunuti + + + Sutanshu Saksena Raj + + + Parijat Chatterjee + + + Nayanjit Sarkar + + + Daksh Maan + + + + http://arxiv.org/abs/2610.15371v1 + A Sovereign, Indic-First, Reasoning Model + 2026-10-11T05:52:29Z + + + Gnani-Evon-v3.3-30B-A3B is a long-context hybrid Mamba-Transformer mixture-of-experts model for reasoning, instruction following, and tool use in English and eight Indian languages. Starting from NVIDIA's Nemotron-3-Nano-30B-A3B checkpoint, it retains the 52-layer backbone and changes the vocabulary, training data, and post-training objectives. An in-place expansion from 131,072 to 163,072 tokens reduces mean Indian-language fertility by 38.6%. The new embedding rows are initialized from their upstream decompositions and warmed before the backbone is updated. Continual pretraining then adds broad English-Indic data, high-quality annealing, and direct training at a 131,072-token sequence length. + The central result appears after post-training. Reinforcement learning across four verifiable task environments improves mathematics, graduate-level science, and instruction following, but degrades Indic extractive question answering because the rewards do not require an answer in the requested language. The share of Indic extraction items answered in English rises from 8.7% to 91.7%. Accuracy conditional on answering in the target script roughly doubles, which is consistent with preserved reading ability but is measured on a self-selected subset. + Two unreleased studies test repairs. A scoped Indic reward restores the language convention. A 26B-A4B generative judge outperforms a 235B-parameter model on RM-Bench, and distillation restores 81% of the capabilities displaced by optimizing against it. + Relative to the architecture-identical starting checkpoint, the released model gains 5.2 points on an Indic aggregate while giving up 1.7 points of English retention. The unreleased Indic-aware branch trades further, gaining 14.6 Indic points at a cost of 5.4 in English. A planned FP8 release reduces the artifact to 32GB with near-zero mean change across 32 paired benchmarks. + + + 2026-10-11T05:52:29Z + 69 pages, 24 figures, 49 tables. Technical Report + + + Sutanshu Saksena Raj + + + Prasanjith Pasunuti + + + Parijat Chatterjee + + + Daksh Maan + + + Purusharth Malik + + + Nayanjit Sarkar + + + Avinash Benki + + + + http://arxiv.org/abs/2610.14219v1 + Learnable Low-Rank Polynomial Sketch for Effective Linear Attention + 2026-10-09T18:30:52Z + + + Softmax attention in Transformers suffers from quadratic complexity in sequence length, making it impractical for long-context applications. Linear attention alleviates this issue by replacing the exponential kernel with alternative functions that enable linear-time computation. Among existing linear attention approaches, recent studies have shown that polynomial kernels are particularly effective, as they exhibit sparse and spiky behavior similar to softmax attention, which emphasizes large dot products while suppressing irrelevant interactions. However, the exact computation of high-degree polynomial kernels is infeasible for high-dimensional representations. As a result, prior work relies on approximate polynomial kernels. This introduces a non-negligible approximation error. In this paper, we show that, from the perspective of polynomial kernel approximation, existing linear attention methods are still suboptimal. We propose \textbf{L}earnable \textbf{Lo}w-Rank \textbf{P}olynomial \textbf{S}ketch (LLoPS), a principled and flexible framework for approximating polynomial kernels with linear attention. Our method learns a low-rank polynomial sketch that provably achieves a strictly smaller approximation error than existing approaches. Experiment results show that LLoPS achieves the highest performance across extensive benchmarks, comparing with various linear attention baselines. + + + + 2026-10-09T18:30:52Z + Neurips 2026 + + + Zongyue Qin + + + Haoran Deng + + + Jason Cong + + + Yizhou Sun + + + + http://arxiv.org/abs/2610.13325v1 + Taking Tokenization off the Host for Agentic LLM Serving + 2026-10-09T10:05:09Z + + + Agentic workloads resend long contexts that barely change between calls. Prefix caching now skips most of their prefill, yet every request must still be tokenized in full before the cache can even be consulted. Tokenization, a CPU stage long treated as negligible, becomes the largest part of time-to-first-token (TTFT), and a frontend that tokenizes for a whole GPU fleet limits how many GPUs it can feed. We present GraphTok, a GPU tokenizer that runs the entire encoding pipeline, from pre-tokenization through byte-pair encoding (BPE) merging to token-ID assembly, as one replayable CUDA graph. GraphTok reproduces the reference token IDs bit-for-bit on GPT-2, Llama 3, Qwen 2.5, DeepSeek-V3, and Gemma 3, hands short inputs to a CPU engine where the GPU cannot win, and plugs into unmodified vLLM and NVIDIA Dynamo. GraphTok encodes one million GPT-2 tokens in 1.7-3.2 ms including data transfers, and on Llama 3 it is 4.7-6.0x faster than gigatoken, the strongest CPU tokenizer. On TokTier's own single-request benchmark, it is 2.6-3.9x faster than gigatoken and up to 18.1x faster than TokTier. In vLLM with a cached prefix, it lowers mean TTFT by 2.1-2.4x. The largest gain is capacity. Within a 2 s P99 target, one Dynamo frontend with GraphTok sustains 518 requests/s of 121k-token traffic, the busiest-hour load of 56 GPUs, against 296 with gigatoken and 18.5 with the default tokenizer. Across 121k to one million tokens, this is 1.75-2.5x the load gigatoken sustains, with a P99 up to 64x lower where gigatoken's tail breaks. + + + + + 2026-10-09T10:05:09Z + + + Mohammad Siavashi + + + Pascal Schwinte + + + Ali Banaei + + + Gerald Q. Maguire + + + Marco Chiesa + + + Dejan Kostić + + + + http://arxiv.org/abs/2610.13314v1 + NEAR: Neighborhood-Aware Residuals for Memory Retrieval + 2026-10-09T09:57:27Z + + + Memory retrieval aims to identify evidence from stored records to answer a query. Stored records with different factual details may share topics, entities, or events. Such shared contents would make records without the required evidence more likely to receive high similarity scores and outrank the correct evidence. In this paper, we use the information shared by these records to construct local references for query-memory matching. We propose NEighborhood-Aware Residuals (NEAR), a training-free framework that uses these references to construct residual representations that complement the original embeddings. Specifically, each memory derives a reference direction from its neighbors, and each query obtains its reference from a precomputed table. Using these references, NEAR constructs projection residuals for both queries and memories. These residuals are combined with the original embeddings for a single approximate nearest-neighbor search over a fixed memory index. Experiments on eight long-context retrieval benchmarks show consistent improvements across nine embedding models. Downstream evaluations show that NEAR improves question-answering performance. + + 2026-10-09T09:57:27Z + + + Han Luo + + + Zhan Zhuang + + + Xu He + + + Jujia Zhao + + + Yu Li + + + Suqin Yuan + + + Dong Li + + + Lei Feng + + + + http://arxiv.org/abs/2610.13132v1 + DP-MIND: Differentially private memory-guided Long context Inference + 2026-10-09T07:25:17Z + + + LLM-as-a-Service has become a dominant paradigm for accessing large language models without requiring local deployment. However, the process raises severe privacy concerns when user queries may include sensitive or confidential contexts. Differential privacy (DP) provides a principled approach to protecting such inputs, but existing DP inference methods are primarily designed for short- or moderate-context settings and struggle with million-token-scale inputs due to limited context capacity and severe utility degradation under DP perturbation. + In this paper, we propose DP-MIND, a memory-guided framework that scales differentially private inference to million-token contexts. DP-MIND enables private long-context inference by locally perturbing the input and processing it chunk by chunk with a compact memory that preserves task-relevant information across the sequence. To make this memory robust to DP noise, we optimize the memory construction policy directly on perturbed inputs using reinforcement learning, guided by both final answer correctness and memory consistency. We further recover perturbation-corrupted answer spans through a local denoising module without exposing the original context to the external model. We provide theoretical privacy analysis of DP-MIND and further conduct extensive empirical analysis across multiple long-context benchmarks with context lengths up to the million-token scale, demonstrating that DP-MIND consistently outperforms existing DP and long-context inference baselines in both scalability and utility. + + 2026-10-09T07:25:17Z + + + Zhihao Liu + + + Yitian Cheng + + + Shuang Liu + + + Rui Wen + + + Yuke Hu + + + Zhan Qin + + + + http://arxiv.org/abs/2610.13060v1 + KV-Repurpose: A Testbed for Evaluating Non-Prefix KV-Cache Reuse + 2026-10-09T06:17:10Z + + + KV-cache reuse in large language model serving is commonly limited to exact prompt prefixes, preventing reuse when the same retrieved document appears after different system prompts, conversation histories, or dynamic metadata. We present KV-Repurpose, an open-source, vLLM-based system for developing and evaluating segment-wise KV-cache reuse beyond exact prefixes. The system combines cache-aware segment scheduling, prompt construction, capacity management, workload generation, and runtime monitoring. Experiments on long-context benchmarks show that naive segment reuse largely preserves output quality for single-document question answering and summarization, while exposing clear limitations in cross-document reasoning. Under a Zipfian RAG-style workload in which 20% of requests share a fixed prefix, KV-Repurpose achieves a substantially higher token-level cache hit rate than prefix caching at the same 30 GB cache capacity, 63.9% versus 3.3%, resulting in lower TTFT. Even with 1 TB of cache capacity, prefix caching reaches only a 17.9% hit rate in this workload. Source code is available under the Apache-2.0 license at https://github.com/taiga333/eval-kv-repurpose. + + 2026-10-09T06:17:10Z + + + Taiga Ikeda + + + Daisuke Miyashita + + + Jun Deguchi + + + + http://arxiv.org/abs/2610.11430v1 + BioBigBird: A Sparse Attention Model for Long-Range Dependency Processing in Biomedical Text + 2026-10-08T07:54:12Z + + + While domain-specific Large Language Models (LLMs) have encoded vast biomedical knowledge, their limited context windows often hinder a deep understanding of nuanced relationships within and across texts. To address this limitation, we introduce BioBigBird, a bidirectional language model pre-trained on extensive biomedical literature and clinical data, specifically designed to handle long-range dependencies. BioBigBird leverages a sparse attention mechanism to process sequences up to 4096 tokens, and its training incorporates a multi-stage process to mitigate noise from the large-scale pre-training corpus. We further enhance its performance by employing a multi-task learning (MTL) framework that jointly optimizes for Named Entity Recognition and Relation Extraction. Comprehensive evaluations on the BLURB benchmark reveal that our MTL-enhanced BioBigBird achieves highly competitive results against state-of-the-art models. Our work contributes an effective methodology for developing powerful, long-context language models for specialized domains, demonstrating the value of extended sequence processing for complex text analysis. Our models are publicly available at https://huggingface.co/collections/bisectgroup/biobigbird. + + + 2026-10-08T07:54:12Z + + + Roshan Balaji + + + Pavan Kumar S + + + Vasudev Gupta + + + Sreejith N + + + Keerthana Sridhar + + + Nirav Bhatt + + + + http://arxiv.org/abs/2610.10845v1 + Real Long-Term Memory for AI: A 50-Million-Token Window That Is Faster and Cheaper Than Recompute + 2026-10-07T19:50:53Z + + + A large language model can only use the text that fits in its context window, and it recomputes its internal key-value (KV) state for a prompt every time the prompt is sent. We test a memory layer, the public package galahad-kv, that saves the KV state of each block of about 16,000 tokens to encrypted local NVMe disk and loads it back later, byte-exact, without recomputing it. We ran it on 50,000,000 tokens of real public text, served through vLLM on one NVIDIA H100, with Gemma 4 12B and Gemma 4 31B. Every block we probed was loaded back from the encrypted store with no recompute (100 of 100, at depths from 0 to 50M tokens) on both models. Loading a block was 2.8x to 4.3x faster than recomputing it and used 8.8x to 12.3x less GPU energy, and GPU memory stayed flat over the whole 50M-token stream. Asked about facts planted millions of tokens earlier, the 12B model gave the right answer 82 times out of 100 and the 31B model 98 times out of 100. Neither model made up an answer. The limits are as follows. This is reuse of stored state, not a wider attention window: one block is loaded at a time, and how well a question is answered depends on the model. Writing the memory is a one-time cost, and the store takes terabytes of local NVMe disk. We describe the test protocol, which is built to resist common ways of gaming long-context benchmarks, and give a single-GPU reproduction that uses public software and a free licence for the package. + + + + + 2026-10-07T19:50:53Z + + + Sietse Schelpe + + + + http://arxiv.org/abs/2610.10156v1 + HeiCo-FOCUS: A Clinically Grounded Dataset for Long-Context Video Understanding + 2026-10-07T14:33:47Z + + + Recent advances in Vision-Language Models (VLMs) have led to rapid progress in video understanding across a wide range of benchmark tasks. However, existing evaluations largely focus on short-term reasoning, failing to assess a critical capability: maintaining cumulative temporal consistency over extended time horizons. To close this evaluation gap, we introduce HeiCo-FOCUS, a clinically grounded dataset for evaluating long-context video understanding through the task of Foreign Object Contextual Understanding in Surgery. Built on a dataset of Heidelberg Colorectal surgeries, this task requires models to continuously track multiple objects as they are inserted, manipulated, occluded, and removed over procedures lasting up to hours. HeiCo-FOCUS comprises 30,000 visual question answering (VQA) pairs covering five core capabilities: object recognition, temporal grounding, aggregation, event and procedural understanding, and complex reasoning. The dataset was constructed through a rigorous multi-stage annotation pipeline involving large-scale crowd annotation and 39 surgical domain experts to ensure high quality and clinical relevance. To systematically probe model behavior, we introduce a multi-track evaluation framework that progressively increases temporal and contextual demands from single frames to full procedures. Experiments with ten frontier VLMs show that HeiCo-FOCUS tasks are far from solved: only around half of the models clearly outperform a text-only baseline. Across the video tracks, models perform best on event and procedural understanding (mean Accuracy: 56.5% across all models), while temporal grounding remains particularly challenging for all evaluated models (mean Accuracy: 19.7%). We therefore expect HeiCo-FOCUS to serve as a catalyst for the development of models capable of reliable, temporally consistent reasoning over hours-long videos. + + 2026-10-07T14:33:47Z + 28 pages, 9 figures, 5 tables. Code: https://github.com/IMSY-DKFZ/orena-focus + + + Leon Mayer + + + Lucas Luttner + + + Patrick Godau + + + Kai Fritzsche + + + Annika Reinke + + + Leonie Boland + + + Jule Brandt + + + Janne Heinecke + + + Chloe K. Nobuhara + + + Niklas Holzwarth + + + Evangelia Christodoulou + + + Marcel Knopp + + + Dominik Michael + + + Pascale Piermarco + + + Saliq Neyaz + + + Korhan Derin Özarslan + + + Jakob Hennighausen + + + Carlos Aumente-Maestro + + + Tim Rädsch + + + Dheeraj Baji + + + Peter Maximilian Full + + + Finn Aichholz + + + Justus Veit Erpenbeck + + + Linus Finn Schott + + + Bastian Winkelhausen + + + Claas de Boer + + + Bianca Güttner + + + Anneli Hummel + + + Gregor Just + + + Max Kirchner + + + Chenyang Li + + + Rozenn Raffaut + + + Ariel Rodriguez + + + Danush Kumar Venkatesh + + + Kevin Wang + + + Jinjing Xu + + + Mona Sheikh Zeinoddin + + + Salman Khan + + + Thomas M. Pausch + + + Stefanie Speidel + + + Danail Stoyanov + + + Daniel A. Hashimoto + + + Fiona R. Kolbinger + + + Thomas G. Weiser + + + Lena Maier-Hein + + + + http://arxiv.org/abs/2610.09827v1 + Dual-QK: Sharp Queries and Flat Keys for Prunable 2-bit KV Caches + 2026-10-07T10:50:06Z + + + Long inputs and extended generation increase the storage and access costs of the key-value (KV) cache. Low-bit quantization reduces storage and memory traffic, while query-channel pruning can further reduce key-cache reads. Rotation-based quantization redistributes the energy of key outliers across channels. To maintain computational invariance, the same orthogonal transform must be applied to queries, preserving query-key dot products. However, this rotation can disperse query energy, weakening the separation between a few large components to retain and many small ones to prune. We introduce Dual-QK, which uses paired non-orthogonal query and key transforms to address this conflict. Using calibrated query and key statistics, Dual-QK combines partial key whitening with a query-aligned basis to balance key scales for INT2 quantization and concentrate query energy for dynamic channel pruning. Channel-0 protection and bucket-relative RoPE support low-bit accuracy over long contexts. Experiments on four models across five generative benchmarks and long-context retrieval tasks show improved accuracy over OSCAR on most tasks at 40% query-channel sparsity. At a 128K context, Dual-QK provides $6.8\times$ KV-cache compression and an estimated $8.3\times$ reduction in KV read volume relative to unpruned BF16. Under the evaluated configurations, our SGLang implementation achieves up to $3.75\times$ the decoding throughput of unpruned BF16. + + 2026-10-07T10:50:06Z + + + Sunjoo Whang + + + Jungjun Oh + + + Minsung Kim + + + Dongho Seo + + + Jisu Shin + + + Gregory Kielian + + + Hoi-Jun Yoo + + + Sangjin Kim + + + + http://arxiv.org/abs/2610.09193v1 + Bookkeeping, Composition, or Unreachable Gold? Reading MemoryAgentBench's Conflict-Resolution Scores Against a Frozen Last-Write Resolver + 2026-10-06T22:44:32Z + + + MemoryAgentBench's Conflict Resolution split is read as measuring "selective forgetting". We execute the benchmark's own rule - the newest statement about a fact wins - as a zero-learning resolver frozen on one of the four fact lists. Under the official metric the rule answers 80.25% of the questions (74.5% on the three held-out lists). Of the rest, 67 items have a released gold that the last-write graph cannot reach but overwritten statements would ("The capital of India is New Delhi." superseded by "The capital of India is Grosseto."; gold New Delhi); such items are a third of the multi-hop questions at 262K. Two long-context models and our pre-registered approximate re-implementation of the benchmark's BM25 agent, one retained run per item and outcomes only, score 84.7%, 82.6% and 41.6% on the items the rule solves against 10.4%, 11.9% and 6.0% on those 67. The failures are a reachability split plus a small parser-scope residual; the per-item split, not the aggregate, is the unit at which a score here can be read. + + + 2026-10-06T22:44:32Z + Accepted at the IAB Workshop (Interpreting Agent Behavior) at NeurIPS 2026 (non-archival). 19 pages + + + Egor Pakhomov + + + Erik Nijkamp + + + + http://arxiv.org/abs/2610.09025v2 + SPIN: Shadow Predictive Indexer for Sparse Attention + 2026-10-08T14:38:08Z + + + Indexer-based sparse attention reduces the cost of core attention by passing only a fixed, small number of important tokens to it. However, the indexer must still score the entire KV cache at every decoding step. This scoring overhead becomes a major bottleneck as the context length grows. We propose SPIN (Shadow Predictive Indexer) to reduce this indexer overhead. SPIN uses lightweight, history-based prediction to identify important KV blocks, avoiding the need to score the full KV cache at every decoding step. SPIN treats KV blocks and speculative decoding as first-class design and implementation considerations. Across extensive evaluations on long-context and agentic benchmarks, SPIN achieves 30-40% sparsity while preserving task quality. In end-to-end vLLM serving, SPIN improves output throughput by up to 14.9% and reduces median inter-token latency by up to 13.2%. + + 2026-10-06T19:23:10Z + 12 pages, 4 figures; corrected an author's name + + + Yao Fu + + + Jiahan Chang + + + Ritchie Zhao + + + Bryce Long + + + Yueying Li + + + Mahdi Kamani + + + Samkit Jain + + + Rahul Raman + + + Tara Safavi + + + Shreya Gupta + + + Parsa Ashrafi Fashi + + + Minseok Lee + + + Julien Demouth + + + Bita Darvish Rouhani + + + + http://arxiv.org/abs/2610.07940v1 + Hybrid Latent Attention for Looped Language Models + 2026-10-06T08:14:07Z + + + Looped language models apply the same stack of layers T times to each token, which deepens the model without adding parameters but multiplies its key-value (KV) cache by T. The larger cache limits how many sequences a GPU can decode at once and slows each decoding step, which reads the whole cache. We propose Hybrid Latent Attention (HLA), which keeps exact keys and values within a sliding window of W recent tokens and stores each older token as a compact latent that the query of each loop reads directly, without reconstructing keys and values. We uptrain HLA on Ouro looped models (T=4) with 1.4B and 2.6B parameters, keeping the pretrained weights frozen and training only the added parameters to reproduce the original attention. The cache shrinks by 10.7x per token, fitting 4.0-8.8x as many concurrent sequences per GPU, and decoding throughput improves by 2.5x at 1K-token contexts and by up to 7.4x at 16K. HLA retains over 97% of the original accuracy on math, knowledge and reasoning benchmarks, and 96-100% on long-context retrieval up to 16K tokens. After supervised fine-tuning, it performs on par with the fine-tuned original model on competition-level math. + + + 2026-10-06T08:14:07Z + + + Yuhan Chen + + + Siyuan Zhang + + + Nan Wang + + + Feiyang Kang + + + Ruoxi Jia + + + + http://arxiv.org/abs/2610.07782v1 + Persistent Memory in Multi-Agent LLM Inference: What It Costs, What It Buys, and When You Can Tell + 2026-10-06T05:17:44Z + + + Decomposing long-context inference across cooperating agents bounds the active KV cache per call rather than total evidence, which matters when KV-cache memory binds. Many such systems add a persistent tier storing and recalling reasoning traces, usually validated by an ablation reporting an accuracy gain. We measure both on one three-tier agent architecture. Decomposition delivers: peak KV working set of 14.3 MiB per query against 35.5 and 35.3 MiB for single-pass and retrieval-augmented baselines. The persistent tier does not: across eight controlled dataset pairs at n=100 per arm it costs +0.368 MiB [+0.167, +0.590] of peak cache and produces no detectable accuracy change (+0.015, 95% CI [-0.011, +0.046]). We argue the null is structural: single-question benchmarks supply each item with its own evidence and score it independently, and correctness requires resetting stored traces between conditions, so recall has nothing informative to retrieve. Reaching it took four measurement corrections -- three inflating the apparent benefit, the fourth making an effect that size look resolvable -- none visible in the results table. We give the conditions an agent-memory ablation must satisfy and detection procedures that need no knowledge of the specific defect. + + + + + 2026-10-06T05:17:44Z + 13 pages, 1 figure. Accepted as a poster at the Machine Learning for Systems Workshop, NeurIPS 2026 + + + Hochan Son + + + Kyungdoe Han + + + Jaehan Koh + + + Xiaowu Dai + + + Wenlu Xu + + + Guang Cheng + + + + http://arxiv.org/abs/2610.07261v1 + Verifying Coordination in Parallel Coding Agents: NP-Bench and a Scheduling Planner + 2026-10-05T19:02:27Z + + + A team of coding agents can look fine agent by agent yet fail as a team: each passes its own tests while the merged result is broken, and single-agent evaluation never catches it. As teams run several LLM coding agents in parallel on one codebase, the agents collide: two rewrite the same function, one codes against a contract a teammate just changed, and integration fails after the work is done. Most coordination tools react (watch for a conflict, then warn), but at agent speed the warning arrives after the wasted edit. We recast the problem as scheduling: take each work item's declared scope, partition the work into disjoint scopes, and order merges along the producer->consumer graph, all up front. We build this planner into Nerveplane and evaluate it with NP-Bench, an environment-grounded three-arm benchmark (no coordination; reactive detection; proactive planning) that verifies integration off a real git merge, both in a deterministic simulation and with live agents. The planner lifts clean-integration from 1/9 to 9/9 scenarios and cuts merge conflicts from 13 to 0, with a gap that grows in the number of agents. On a live breaking contract change it rescues an outcome both baselines miss on every seed: the clean-integration rate rises from 0 (no coordination and reactive detection) to 1.0 on a frontier model and 0.6 on a small one, while agents respect assigned scopes (0/5 leakage). A cross-session memory drops the repeated-mistake rate from 1.00 to 0.00 on strong and weak models alike. We also report a negative result: routing facts to agents does not rescue long-context accuracy at window-fitting scales; its value is cost and capacity, not attention. Across two capability tiers and two vendors, the benefit did not shrink as models got stronger, because it comes from how work is allocated, not model reasoning. + + 2026-10-05T19:02:27Z + + + Sumanyu Muku + + + + http://arxiv.org/abs/2610.06686v1 + OVAL: Output-Aware Local Page Bases for KV Cache Retrieval + 2026-10-05T16:51:21Z + + + Long context inference with large language models becomes increasingly expensive as attention must operate over an ever growing KV cache. Page sparse attention reduces this cost by representing each KV page compactly and retrieving only a subset for each query. Existing retrieval methods are designed to estimate attention scores or page relevance, but their objectives do not directly account for how approximation errors affect the resulting value weighted attention output. We introduce \method{}, an output aware page encoding derived from the joint structure of keys and values while preserving the key information needed for accurate retrieval. \method{} is training free and requires no additional value dependent statistics at inference time. Once constructed, its stored representation has the same size and decode time scoring cost as a key only spectral representation. Across long reasoning, long context understanding, and long generation benchmarks, \method{} consistently improves over the key only spectral baseline and performs competitively with recent KV cache compression and retrieval methods. On long reasoning benchmarks, it achieves strong avg@\(k\) performance across model benchmark pairs, while matching or surpassing leading baselines on several long context understanding and generation settings with modest decoding overhead. Code is available at \url{https://github.com/Ashkan13776/oval-kv}. + + 2026-10-05T16:51:21Z + + + Ashkan Shahbazi + + + Chayne Thrash + + + Soheil Kolouri + + + + http://arxiv.org/abs/2610.05940v1 + ReMem: Streaming Video Understanding With Long Context Retention + 2026-10-05T07:56:41Z + + + Despite their impressive performance on a wide range of video understanding tasks, current Vision Language Models (VLMs) are predominantly designed for offline scenarios and struggle to handle online streaming videos that demand low latency response. Several studies have explored memory and token compression strategies in an attempt to adapt offline VLMs for streaming video understanding tasks. However, through our probing experiment, we identify that most existing works tend to progressively lose long context information as length of input stream increases. To address this, we propose ReMem, a novel training-free adaptation technique that enables VLMs to process streaming videos of arbitrary lengths while improving their long context information retention capability. ReMem exploits memory from two perspectives, implemented as two core components. The Streaming Context Memory (SCM) continuously compresses historical context with query-independent attention. The Retrieved Vision Memory (RVM) then retrieves the most salient, query-relevant context from memory to augment the VLM's input. Comprehensive experiments demonstrate that the proposed ReMem achieves state-of-the-art (SOTA) performance across a variety of widely used benchmarks, spanning both streaming video and general long video understanding tasks. + + + 2026-10-05T07:56:41Z + + + Li Yiheng + + + He Xu + + + Wang Shaobo + + + Shao Ling + + + Lu Shijian + + + + http://arxiv.org/abs/2610.04973v1 + TrajLong: Co-Designing Agentic and Long-Context Supervision for Mid-Training + 2026-10-04T05:42:22Z + + + LLM agents for coding, search, and workplace tasks increasingly rely on long-context capabilities to effectively aggregate and reason over extended interaction histories. Recent work has incorporated agent trajectories into mid-training stage, drawing on their naturally long and interaction-rich structure. Yet how to organize the information within these trajectories into effective mid-training supervision remains underexplored. In this work, we investigate the relationship between long-context and agent atomic capabilities and introduce TrajLong, a novel framework that compiles trajectories into long-context training tasks with dense supervision, targeting three representative atomic capabilities: evidence grounding, cross-evidence aggregation, and temporal state maintenance. We mid-train Qwen3-14B-Base and Qwen3-30B-A3B-Base with data compiled by TrajLong, followed by supervised fine-tuning. Experiments on 6 long-context and 12 agent benchmarks demonstrate broad performance gains, with controlled ablations showing improvements over raw and masked trajectory baselines. Capability-level analyses further reveal task-dependent associations between long-context and agent atomic capabilities. These findings suggest that the shared capability demands of long-context reasoning and agent execution provide a principled basis for designing mid-training data to develop downstream agent capabilities. + + 2026-10-04T05:42:22Z + + + Miao Peng + + + Qintong Zhang + + + Nuo Chen + + + Yuhan Li + + + Guochen Yan + + + Xinran Gu + + + Hongqiu Wu + + + Hai Wang + + + Lydell Huang + + + Wentao Zhang + + + Jia Li + + + + http://arxiv.org/abs/2610.04753v2 + More Value per Key: Asymmetric Sparse Attention for Faster LLM Decoding + 2026-10-06T03:33:53Z + + + Autoregressive generation in Large Language Models (LLMs) is constrained by the memory and computational demands of attention mechanisms. Sparse attention methods mitigate this cost by selecting only high-probability entries of the attention matrix. We observe that in many such methods, this renders the probability-value multiplication negligible, shifting the bottleneck to the query-key step. Key heads can therefore be reduced to accelerate inference, while retaining more value heads preserves capacity with limited additional decoding cost. We introduce Sparse Asymmetric Group-Query Attention (SAGA), which decouples key and value head counts to exploit this principle, and pair it with approximate top-N (Atop-N) attention, a simple sparse attention method designed to study the interaction between sparsity and head-count asymmetry. We formalize the benefits of this asymmetry theoretically and validate them empirically through latency measurements and quality evaluations on models up to 1.5B parameters. Together, SAGA and Atop-N achieve end-to-end decoding speedups exceeding $2\times$ over our full-attention GQA baseline at long contexts. Models trained from scratch with SAGA nearly match the quality of comparable GQA variants on the evaluated benchmarks. To facilitate adoption, we introduce an efficient fine-tuning method that converts pretrained models to the SAGA architecture, enabling practitioners to benefit from our approach without costly retraining. + + + 2026-10-03T20:38:43Z + Accepted to NeurIPS 2026 + + + Noam Elata + + + Itay Lamprecht + + + Mikey Shechter + + + Daniel Ohayon + + + Itay Hubara + + + Daniel Soudry + + + + http://arxiv.org/abs/2610.06927v1 + AttSVD:Prompt-Adaptive Low-Rank KV Cache Compression via Attention-Guided SVD + 2026-10-03T00:33:53Z + + + The key-value (KV) cache of autoregressive transformers grows linearly with context length and dominates memory at long context. Most training-free remedies evict low-importance tokens, an irreversible choice along the sequence axis. We instead keep every token and store it more cheaply along the "feature" axis. We therefore propose AttSVD, a new "interpretable" low-rank compression whose basis is derived from each prompt's own attention geometry: an online, per-prompt truncated SVD that keeps only the directions attention actually reads, cutting persistent per-head KV memory in proportion to the retained rank. We propose two decode-time caching strategies, accumulating and streaming, for short and long generation regimes. Furthermore, we propose two refinements that make compression adaptive. A per-matrix energy rule sizes the logit space and the attention mass independently. An attention-aware basis truncates only in the spaces attention actually reads, preserving both the attention logits and the attention output. The same factors also provide free, per-head interpretability insights into the effective rank and the geometry attention consumes. Across multiple models, on both an agentic benchmark and the full LongBench suite AttSVD stays on par with the dense cache while using up to 50% of the KV-cache memory. + + + 2026-10-03T00:33:53Z + + + Sara Abdali + + + Jongwoo Ko + + + Pashmina Cameron + + + + http://arxiv.org/abs/2610.04118v1 + LongSocialBench: Do Long-Context LLMs Understand Online Discussion Threads? + 2026-10-02T22:47:29Z + + + Long-context LLMs can now ingest entire online discussion threads, but understanding their social discourse requires more than reading a long document: models must track parent-reply relations, turning points, scoped subtrees, cross-branch contrasts, and participant trajectories. To test this structure-aware social reasoning, we introduce LongSocialBench, a benchmark of 1,462 verified human-authored multiple-choice items drawn from 94 complete Hacker News, Stack Exchange, and Reddit r/ChangeMyView episodes, with a median length of approximately 73K tokens. Each item pairs a complete serialized discussion and reply structure with a four-option question, requiring models to recover structured social evidence. Released items are verified for answerability, option uniqueness, and evidence grounding. Across 18 models and 29 evaluation settings, current long-context workflows remain far below human performance. The best individual result comes from Claude-Opus-4.7, which reaches 63.0% when prompted to eliminate incorrect options before answering, compared with 72.4% for independent human readers. Averaged across all 18 models, the full-context Baseline scores 43.9%. Supplying the gold evidence scope raises this to 55.0%, showing that substantial errors remain even after the relevant thread region is identified. LongSocialBench shows that the missing capability is not context access or prompting alone, but social understanding over structured reply trees. + + 2026-10-02T22:47:29Z + Accepted to EMNLP 2026 Main Conference + + + Xinyi Liu + + + Rinat Khaziev + + + Dilek Hakkani-Tür + + + Tarek F. Abdelzaher + + + + http://arxiv.org/abs/2610.03027v1 + Tailoring the Quantization Space for 1-Bit KV Cache Compression + 2026-10-02T09:04:25Z + + + The key-value (KV) cache becomes a major memory bottleneck in long-context LLM inference, placing substantial pressure on memory capacity and bandwidth. To mitigate this bottleneck, vector quantization (VQ) has emerged as a promising approach for aggressive KV cache compression. However, existing VQ methods degrade substantially in the 1-bit regime. At such extreme compression, each codebook must represent a larger group of channels with a limited set of centroids, making effective use of its capacity increasingly challenging. To address this, we introduce $\textbf{TaSQ}$, which tailors the VQ target space by combining query-guided channel weighting, cross-head normalization, and covariance-aware channel grouping to better reflect the error sensitivity and statistical structure of cached activations. Since these transforms are RoPE-compatible and can be easily merged into projection weights and codebooks, TaSQ preserves the conventional VQ lookup structure and adds negligible serving overhead. Across general, long-chain-of-thought reasoning, and long-context retrieval benchmarks, TaSQ consistently outperforms existing low-bit KV cache VQ baselines while preserving reasoning stability. On a single RTX 6000 Ada GPU, its SGLang implementation supports up to $14\times$ larger batch sizes and achieves $1.87\times$ higher peak throughput compared to the BF16 baseline. + + + + 2026-10-02T09:04:25Z + + + Minsoo Cheong + + + Donghyun Son + + + Sungjoo Yoo + + + + http://arxiv.org/abs/2610.02404v1 + Trained Agentic Context Management + 2026-10-01T19:32:12Z + + + We study long context language models. Instead of training long context natively, or designing a long context harness, we train a model over the simplest possible harness: a tool to call itself with any specified prompt and a tool to read tokens in a range from the input context. We finetune Qwen3.6-35B-A3B on a diverse synthetic dataset using this harness. With only 8,000 tokens of context, our small model is as strong as GPT-5.4 with 1M tokens of context on the OOLONG-synth benchmark when document length exceeds 40K tokens. + + + 2026-10-01T19:32:12Z + 17 pages, 6 figures, 4 tables. Code: https://github.com/brycesandlund/infinite-context. Under review + + + Bryce Sandlund + + + + http://arxiv.org/abs/2610.02181v1 + OmniSeek: Native Tool Integration for Multi-turn Audio-Visual Reasoning + 2026-10-01T17:58:16Z + + + We present OmniSeek, an agentic framework that transforms an Omni Large Language Model (Omni-LLM) into an active, multi-turn reasoning agent with native tool use. Rather than passively processing an entire audio-visual sequence in a single forward pass, OmniSeek makes evidence acquisition part of the reasoning process: it dynamically decides whether to look or listen, and over which temporal window, to retrieve sparse but critical evidence across different modalities within long contexts. Through an iterative multi-turn protocol, the retrieved raw audio or visual segments are appended back into the context to support subsequent reasoning. To cold-start this capability, we build a data engine that synthesizes OmniTraj-170K, a corpus of multi-hop Chain-of-Thought trajectories with interleaved audio and visual evidence. We first supervise the model on these trajectories to instill multi-turn tool-use behavior, and then further optimize the policy via a two-stage reinforcement learning with verifiable rewards. Moreover, we introduce an Audio-Visual Necessity objective that explicitly rewards successful trajectories whose reasoning depends on both modalities, discouraging single-modality shortcuts. Extensive experiments across a wide range of benchmarks demonstrate that OmniSeek learns adaptive cross-modal evidence seeking and consistently improves audio-visual reasoning performance. + + 2026-10-01T17:58:16Z + + + Haibo Wang + + + Jiteng Mu + + + Jialu Li + + + Jingru Yi + + + Yuanjun Xiong + + + Jianming Zhang + + + Lifu Huang + + + Mingze Xu + + + + http://arxiv.org/abs/2610.01230v2 + HHR: Hierarchical Hash Retrieval for Efficient LLM Generation + 2026-10-11T08:33:58Z + + + Efficient long-context inference is essential for large language models (LLMs), yet it poses a severe computational bottleneck. Hash-based retrieval offers an efficient alternative by encoding queries and keys into binary codes and using Hamming distance for key selection. However, this leads to a critical mismatch between Hamming distance and attention relevance. Query-Key logits depend jointly on directional similarity and feature magnitudes, whereas hash binarization discards magnitude information, causing both false-positive retrieval of low-logit keys and false-negative omission of high-logit keys. To address these failures, we propose Hierarchical Hash Retrieval (HHR), a coarse-to-fine framework that progressively improves retrieval accuracy through Geometry-Aware Key Routing (GKR) and Learned Hash Projection (LHP). GKR learns a head-wise orthogonal transformation to redistribute feature magnitudes and derive more discriminative page-level logit bounds, enabling effective pruning of low-logit keys while preserving important candidates. LHP then learns a head-wise projection space that aligns Hamming distance with the true Query-Key relevance ranking for fine-grained retrieval. By combining GKR and LHP, HHR suppresses false positives and recovers false negatives, substantially improving the fidelity of hash-based sparse attention. Extensive experiments across diverse LLMs and benchmarks demonstrate that HHR achieves superior performance over existing methods. For example, on LongBench, HHR improves the average score by 1.10 points and, at a context length of 128K, achieves up to a 3.30x decoding speedup and a 2.83x end-to-end speedup for Llama-3.1-8B-Instruct. The code is publicly available at https://github.com/lianjunl13-sudo/HHR. + + 2026-10-01T07:31:44Z + + + Lianjun Liu + + + Tiantian Zheng + + + You Huang + + + Weiqi Yan + + + Mingte Qiu + + + Huazhong Liu + + + Xiaofeng Zhu + + + Yunshan Zhong + + + + http://arxiv.org/abs/2610.00982v1 + Divide-and-Remember: Recursive Action-Relevant Memory for Long-Horizon VLA Policies + 2026-10-01T03:18:25Z + + + Vision-language-action (VLA) models struggle on history-dependent manipulation tasks, where the current observation alone does not determine the action, and the policy needs a memory of the history. Existing memory methods decide what to remember by design, for example, keeping frames with large pixel changes, and show inconsistent gains across tasks. We view what to remember as an optimisation problem. From the POMDP formulation of imitation learning, we show that the optimal memory maximises the conditional mutual information $I(a_t; m_t \mid o_t)$ between the action and the memory given the current observation. Intuitively, this means preserving the action-relevant information in the history that is not already contained in the current observation. Based on our analysis, we propose Divide-and-Remember (D&R), a recursive memory method that learns a memory function $m_t = M(h_t)$ and scales to long contexts while staying compute-light. It involves two strategies: (1) the selection over the full history is divided recursively into subproblems of top-$K$ selection over $2K$ tokens, so that fixed-size, lightweight selectors learned end-to-end support an unbounded history; (2) all recursion blocks share one selector, which captures the selection rule common to every block and keeps the method efficient. On RoboMME, a benchmark of 16 long-horizon manipulation tasks that require remembering when, where, what, and how to act, D&R achieves a state-of-the-art average success rate with consistent gains across all four suites under a budget of only 64 tokens; real-robot experiments show the same gain. Code, checkpoints and more results are at https://dnr-memory.github.io/ + + + 2026-10-01T03:18:25Z + + + Xuehui Yu + + + Eason Yu + + + Meiyi Wang + + + Haozhe Du + + + Stefano V. Albrecht + + + Harold Soh + + + + http://arxiv.org/abs/2610.00969v1 + A Citation-Grounded Benchmark for Trustworthy Earnings Call Transcript Analysis with Large Language Models + 2026-10-01T02:59:14Z + + + Large language models (LLMs) have been increasingly used for financial document analysis, including earnings call transcripts (ECTs). Beyond generating standalone claims, users increasingly prefer grounded analyses that pair claims with verifiable citations from source documents to enable independent validation. However, evaluating such analytical claims typically requires extensive expert annotation, which is costly and difficult to scale, and real-world financial analysis commonly involves long context-question-answer triplets, further increasing task complexity. To address these challenges and benchmark the current landscape of grounded analysis by LLMs, we propose a numeric evidence evaluation method that enables groundedness assessment without reliance on expert annotation. We also introduce an automated dataset construction pipeline and construct ECTs-100 from the top 100 constituents of the S&P 500 to support benchmark of both groundedness and correctness. In addition, we examine conscious incompetence, a practical failure mode in financial analysis in which LLMs must detect when available evidence is insufficient and refrain from producing unsupported hallucinations. Empirical results show that LLMs perform well in groundedness but face notable limitations in correctness, with informational insufficiency presenting an additional challenge. + + + 2026-10-01T02:59:14Z + + + Yingzhu Zhao + + + Vlad Pandelea + + + Han Yuan + + + Bo Hu + + + Wuqiong Luo + + + Li Zhang + + + Zheng Ma + + + + http://arxiv.org/abs/2609.39929v1 + RoPE at the End of Its Rope? Theory, Diagnosis, and Mitigation of Long-Context Failures + 2026-09-30T15:14:39Z + + + Long-context failures of RoPE-based language models can arise from RoPE's intrinsic tradeoff between maintaining stable token preferences and distinguishing nearby positions. Determining which weakness to address, and how, requires a more precise characterization of RoPE's behavior in trained models across context lengths. We address a key limitation of prior theory by allowing unequal query-key scales across RoPE frequencies, which aligns well with practical empirical observations. Our theory makes both vulnerabilities measurable for individual heads and inputs, and quantifies how high-frequency components support positional sensitivity while potentially disrupting semantic stability. We also derive a theoretical context-length bound beyond which, under specified conditions, a fixed attention-score comparison cannot jointly avoid semantic reversal and positional insensitivity. Guided by our fresh theoretical insights, we introduce RoPE Profiler, a lightweight, plug-and-play diagnostic toolkit that augments existing evaluations with zero additional forward passes by reusing cached query and key activations. Reusing activations collected during evaluation, the toolkit incurs little overhead. It supplements standard benchmark scores with two diagnostic scores that reveal semantic and positional weaknesses and help users prioritize which aspect to address. Crucially, our evaluations across 49 long-context task settings reveal a distinct pattern where reasoning tasks predominantly suffer from semantic reversal, whereas retrieval tasks are primarily vulnerable to positional insensitivity. Guided by our theory and diagnostic profiles, targeted high-frequency rescaling achieves immediate gains without additional training, improving task accuracy by up to 20 percentage points on Qwen3-8B and 25 percentage points on Llama-3.1-8B-Instruct. + + + 2026-09-30T15:14:39Z + + + Yuyang Wu + + + Yufeng Du + + + Hao Peng + + + + http://arxiv.org/abs/2610.00418v1 + CommunityKV: Efficient Long-Context Decoding via Graph Partitioning + 2026-09-30T14:36:50Z + + + Scaling Transformers to long contexts is constrained by the quadratic cost of self-attention and the linear growth of key-value cache memory transfer. Sparse attention mitigates this by retrieving only relevant tokens, but current approaches either require large-scale training or, within the training-free regime, rely on semantically coarse heuristics or expensive clustering that is difficult to update efficiently during decoding. We introduce CommunityKV, a framework that formulates sparse attention as a community detection problem. CommunityKV constructs a token graph from the $QK^T$ scores already computed during standard prefill, and partitions the graph into communities to enable retrieval of semantically coherent token groups. A local update rule assigns newly generated tokens to communities in constant time, enabling sparse retrieval throughout streaming decoding without global re-partitioning. We evaluate CommunityKV on Qwen3 and Llama-3.1 models across three long-context benchmarks. With one graph per query head, CommunityKV delivers up to $1.25\times$ the end-to-end generation throughput of dense attention, while query-group graph aggregation yields up to $1.71\times$ with comparable accuracy. + + 2026-09-30T14:36:50Z + + + Joe McKenna + + + Anastasios Alexandridis + + + Nathan Susanj + + + Jing Liu + + + + http://arxiv.org/abs/2609.39819v1 + Capture the lifecycle: KV Cache management in ReAct Agents with KVTether + 2026-09-30T14:22:14Z + + + Efficient serving of long-context reasoning-and-acting (ReAct) agents relies on KV cache reuse to reduce large language model (LLM) prefill latency and monetary cost. However, a semantic gap exists between agent harnesses and the underlying serving stack. Through context mutation, tool execution, and subagent coordination, context messages may become actively engaged, permanently discarded, and temporarily unused, while the serving stack only observes accesses to the corresponding KV cache. This lifecycle blindness prevents recency-only policies such as LRU from reclaiming dead KV promptly and from preserving older KV that will be reused sooner than newer entries. + We present KVTether, a lifecycle-aware KV cache management framework for ReAct agents. By tracing semantic primitives embedded in agent harnesses, KVTether captures runtime lifecycle semantics during highly dynamic execution. KVTether then translates message-level semantics into KV-level lifecycle states and uses these states to drive state-prioritized cache management without exposing physical complexities to agent harnesses. After reclaiming dead KV, KVTether preferentially preserves live-but-idle KV that is waiting for reuse, reducing premature eviction before reuse. Across agent benchmarks and production workloads, KVTether reduces end-to-end request latency by up to 26.3% and 17.4% relative to LMCache and MORI, respectively, and lowers estimated task cost by 40.0% and 33.2% on average. + + 2026-09-30T14:22:14Z + + + Kaihua Fu + + + Yukun Zhou + + + Chaokun Chang + + + Yinghao Yu + + + Luping Wang + + + Guodong Yang + + + Jiuchen Shi + + + Quan Chen + + + Wei Wang + + + + http://arxiv.org/abs/2609.39740v1 + LatentHarness: Learning Latent Actions for Memory and Reasoning via Counterfactual Policy Distillation + 2026-09-30T13:42:26Z + + + Long-context reasoning faces two complementary bottlenecks: retaining evidence across long inputs and sustaining computation across many reasoning steps. Existing approaches largely address them separately, with external memory extending access to distant evidence and latent reasoning compressing multi-step computation. We introduce LatentHarness, which unifies memory access and latent reasoning as sequential latent action selection. At each internal step, the model chooses THINK for further computation, RECALL from a fast-weight memory of input evidence and intermediate reasoning states, or EXIT to emit the next token. We train this policy with counterfactual policy distillation, which branches every action for one step and scores its effect on the emitted token. These gains teach the policy when memory is more useful than further reasoning, while gradients through counterfactual recall teach which intermediate states should be retained in memory for future use. Across six general and long-context reasoning benchmarks, LatentHarness at 1.4B improves on the strongest baselines by 2.8% and 10.0% relative, respectively, and runs 5.9x faster than the strongest long-context baseline. + + 2026-09-30T13:42:26Z + Work in progress + + + Xiaoqiang Wang + + + Suyuchen Wang + + + Bang Liu + + + diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm.xml b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm.xml new file mode 100644 index 0000000..f9f026c --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm.xml @@ -0,0 +1,3430 @@ + + + https://arxiv.org/api/q9+bY9p6TH8WvNb56StdPeZgA0Y + arXiv Query: search_query=cat:cs.CV AND abs:"multimodal"&id_list=&start=0&max_results=100 + 2026-10-26T11:17:13Z + + 100 + 15764 + 0 + + http://arxiv.org/abs/2610.32967v1 + MiD-VLM: Detecting and Grounding Global Semantic Misinformation in Image-Caption Pairs + 2026-10-23T17:55:02Z + + + Semantic misinformation can arise when an authentic image is paired with a caption that changes or distorts its narrative. Because the image itself may contain no visible signs of manipulation, methods designed to detect pixel-level artifacts can miss these misleading image-caption pairs. We study this problem using DGM4+, a dataset designed to evaluate the detection of global scene and semantic inconsistencies. We propose a multimodal model that combines image-text representations from SigLIP with visual scene features from DINOv2 through a projection MLP, and adapts Qwen2-VL-7B using LoRA. The model jointly predicts whether an image-caption pair is authentic, identifies the manipulation type, and grounds the misleading caption tokens. On the DGM4+ validation split, the model achieves an F1 score of $0.9679$ for binary authenticity classification. These results suggest that parameter-efficient adaptation of vision-language models is promising for detecting semantic inconsistencies, while also motivating further work on precise token-level grounding. + + 2026-10-23T17:55:02Z + + + Tarunya Prasad + + + Bharatesh Chakravarthi + + + + http://arxiv.org/abs/2610.32894v1 + LoCA: Enabling Multi-Modality in Geospatial Location Encoders + 2026-10-23T17:01:04Z + + + Location encoders map geographic coordinates to high-dimensional descriptors through contrastive alignment with paired Earth Observation imagery. We prove that this construction is structurally limited: any Lipschitz location encoder produces an output of intrinsic dimension at most 2, regardless of architecture or bandwidth, which forces the contrastive loss to strictly exceed its asymptotic optimum. Empirically, joint training also collapses the encoder's embedding covariance to low rank. Although dimension-limited, current location encoders sidestep this spectral collapse by training against a frozen image encoder, which we reinterpret as a covariance regularizer that supplies a high-rank target for the location encoder to fold onto. However, extending this approach to multimodal inputs is challenging, as location encoders should simultaneously map a single location to multiple, potentially incompatible, descriptors. We identify two requirements a regularizer must satisfy for location encoding in multimodal regimes: co-alignment across modalities, since adapters alone cannot align independently pretrained encoders; and high effective rank, since the location encoder inherits its target's spectrum. We propose LoCA (Location Contrastive Alignment), a two-stage pipeline that satisfies both. Stage 1 jointly trains Sentinel-1 and Sentinel-2 encoders with contrastive learning, producing a co-aligned, high-rank multimodal target. Stage 2 freezes the image encoders and trains a location and a tabular metadata encoder as projection adapters with multi-view contrastive learning. Against five state-of-the-art encoders on 17 tasks ranging from land cover and wildfire forecasting to geophysical, socio-economic, biodiversity and climate applications, LoCA achieves the most task wins, is the only model to outperform every other on a majority of tasks, and wins 68.8% of all per-task comparisons. + + + 2026-10-23T17:01:04Z + + + Panagiotis Koromilas + + + Eleanna Vali + + + Diogenis Antonopoulos + + + Eleni Saka + + + Dimitris Christofis + + + Nikolaos Ioannis Bountos + + + Konstantin Klemmer + + + Ioannis Papoutsis + + + Yannis Panagakis + + + Mihalis A. Nicolaou + + + + http://arxiv.org/abs/2610.32890v1 + Closing the Modality Gap via Simplex-Constrained Representations + 2026-10-23T16:57:48Z + + + While multimodal contrastive models like CLIP and CLAP successfully learn shared representations, their embeddings typically exhibit a persistent \emph{modality gap}. We propose addressing this separation through a purely geometric approach: changing the embedding domain from the unit sphere, $S^{d-1}$, to the probability simplex, $Δ^{d-1}$. Although both manifolds share the same intrinsic dimension, the simplex acts as a structural prior; its nonnegative, unit-mass constraints serve as a cross-modal calibration that forces both modalities to ground themselves in the same coordinate system. By attaching lightweight softmax adapters and using Total Variation similarity, we reduce the centroid $\ell_2$ gap by 97--99\% across five multimodal retrieval benchmarks. This confirms that simplicial geometry induces genuine semantic alignment, matching or exceeding the retrieval performance of standard unconstrained models. + + + 2026-10-23T16:57:48Z + + + Shubham Gupta + + + Siva Reddy + + + Perouz Taslakian + + + Valentina Zantedeschi + + + Cem Subakan + + + + http://arxiv.org/abs/2610.32880v1 + Multimodal Generative AI Assists Comprehensive Echocardiographic Interpretation + 2026-10-23T16:47:01Z + + + Echocardiography is the cornerstone of cardiovascular diagnostics, yet its global utility is constrained by a critical shortage of experienced interpreters. Current artificial intelligence (AI) solutions remain limited, typically operating as opaque "black boxes" or focusing on narrow tasks that fail to capture the holistic, guideline-driven reasoning of a clinician. Here we introduce EchoChat, a generative multimodal vision-language model that performs comprehensive echocardiographic analysis to support clinician interpretation. By emulating the cognitive workflow of a cardiologist, EchoChat integrates vast medical knowledge with a chain-of-thought reasoning mechanism to explicitly ground its conclusions in visual evidence. Trained on echocardiography-instruction pairs from 46,358 examinations, our model establishes a new state-of-the-art across diverse cohorts from six international medical centers. It supports the broadest diagnostic scope of 33 cardiac conditions and findings, including 15 newly added conditions for which it achieves an average F1 of 73.7% across available external evaluations. It surpasses existing best-performing foundation models in cardiac condition recognition (improving average recall by 13.54% on shared tasks) and quantification (average R2 score increase of 0.275 on shared tasks). Furthermore, in a source-blinded echocardiographer reader study, echocardiography reports co-generated with EchoChat were rated higher in diagnostic accuracy and completeness by two senior echocardiographers, and improved diagnostic performance from 72.78% to 82.75% in terms of F1 score over routine-reader only reports. These results demonstrate that integrating clinical reasoning into multimodal AI can democratize specialist expertise and transform the standard of cardiovascular care. + + 2026-10-23T16:47:01Z + + + Yi Qin + + + Marawan Elbatel + + + Shanshan Song + + + Taoran Huang + + + Jiarong Guo + + + Ningshu Li + + + Lehan Wang + + + Chenxu Zhao + + + Jiexin He + + + Machteld J. Boonstra + + + Stephan van der Zwaard + + + Marielle C. van de Veerdonk + + + Pere Lopez-Gutierrez + + + Lydia Dux-Santoy + + + Andrea Guala + + + Enrique Almar-Munoz + + + Sebastian Johannes Reinstadler + + + Radek Debiec + + + Yi-Hang Zhu + + + Huiyu Zhou + + + Adrian P Cheong + + + Yike Guo + + + Agnes Mayr + + + Karim Lekadir + + + Yong Jiang + + + Nilesh J. Samani + + + Dacheng Tao + + + Folkert W. Asselbergs + + + Hongwen Fei + + + Alex PW Lee + + + Xiaomeng Li + + + + http://arxiv.org/abs/2610.32835v1 + SPOOK: Sparse Pixel Optimization for Off-Manifold Knowledge in Vision Encoders + 2026-10-23T16:09:57Z + + + Modern vision encoders are widely used as semantic representations, but the relationship between embedding similarity and human-visible semantics can become unclear far from the natural-image manifold. We probe this regime in a black-box setting by applying sparse pixel edits to blank canvases with a simple pixel-level hill-climbing procedure. Across ImageNet and Flickr30k, we evaluate whether these edited blank canvases can retrieve chosen targets in multimodal contrastive encoders and self-supervised visual encoders. On OpenCLIP, inputs optimized toward class prompts achieve strong top-1 and top-5 targeted retrieval performance; on DINOv3, inputs optimized toward class prototypes achieve high target alignment and near-top prototype ranks. These results show that sparse edits on otherwise blank, visually non-semantic inputs can enter target semantic basins in both language-aligned and self-supervised visual representation spaces. Our findings identify a shared off-manifold failure mode of modern vision encoders and suggest sparse blank-canvas optimization as a simple probe of representation geometry. + + + + 2026-10-23T16:09:57Z + 12 pages, 3 figures, 3 tables, and 14 pages of Supplementary Material with 8 figures + + + Ankit Gupta + + + Akshat Pandya + + + Christoph Adami + + + Emily Dolson + + + + http://arxiv.org/abs/2610.32784v1 + Video-MemComp: Taylor-Guided Sensitivity-Aware Memory Management for Streaming Video Understanding + 2026-10-23T15:32:41Z + + + The rapid growth of video data has created an urgent need for efficient video understanding systems that can handle long and continuous visual inputs, posing significant challenges for Multimodal Large Language Models (MLLMs) due to severe memory bottlenecks. Moreover, existing compression methods often overlook the explosive accumulation of approximation errors. To address this issue, we propose Video-MemComp, a training-free and sensitivity-aware context management framework for memory-constrained streaming video understanding. Our method theoretically decomposes compression error into orthogonal local approximation error and layer-wise structural sensitivity via a first-order Taylor expansion. To minimize local approximation error, we perform token aggregation in a pre-RoPE safe zone with an attention-conserving logit bias, mitigating geometric distortions caused by RoPE rotations. To manage layer-wise structural sensitivity, we dynamically allocate the KV cache budget based on offline gradient priors and online context entropy, prioritizing high-sensitivity layers. Video-MemComp outperforms or achieves performance comparable to full-cache and state-of-the-art compression methods on benchmarks including MLVU, VideoMME, and EgoSchema. Notably, it improves the overall accuracy of Qwen2.5-VL-3B from 62.3% to 64.1% while reducing the KV cache to an equivalent of 6,000 tokens per layer, saving over 90% of KV memory. + + 2026-10-23T15:32:41Z + Accepted by ACM MM 2026. Project Page: https://hhnk666.github.io/Video-MemComp.github.io + + + Yonghui Niu + + + Yuhao Ji + + + Chang Nie + + + Jiao Zhang + + + Yilong Li + + + Junlan Feng + + + Ran He + + + Caifeng Shan + + + Chaoyou Fu + + + + http://arxiv.org/abs/2610.32664v1 + The Answer Knows Where to Look: Zooming before MLLMs Answer under Visual-Token Budgets + 2026-10-23T14:07:26Z + + + Multimodal large language models (MLLMs) read images through visual tokens, and under the small per-image budgets that efficient deployment requires, the fine text of documents, charts and infographics becomes illegible. Zooming in recovers the evidence, but the region must be chosen before the model answers. We find that MLLMs know where the evidence is, but not in a form that can be read before they answer: the answer tokens localize it from the middle layers on, whereas the attention available before answering does so only in the top layers, at a depth that varies across models, and diffusely. Supervising the pre-answer attention to point degrades reading, and the benefit of zooming is governed by each image's information gap. Building on these findings, we introduce ours, which lets an MLLM look where its answer would. A dedicated look token, processed in a single prefill and kept out of the answering pass, learns in hindsight to attend as the model's own correct answers do, extracting this knowledge into a concentrated pointer before any answer exists. Its hidden state then selects how to look, from no zoom to crops, square windows, windows that adapt to the pointer and foveated warps, supervised by the counterfactual outcome of every view. ours needs no box annotations, per-model layer search, external localizers or generation before the answer. On Qwen3-VL at three scales and five text-rich benchmarks, it surpasses the strongest baseline by 4.8-9.1 points at 98 visual tokens per view and attention-guided zooming by 11.1-17.0 points, while running faster than attention-guided and grounding-based zooming. + + 2026-10-23T14:07:26Z + + + Zhensheng Hu + + + Guanglong Xu + + + Guanqiang Hu + + + + http://arxiv.org/abs/2610.32612v1 + DriveOSS: Dataset and Benchmark for 3D Anomaly Segmentation and Open-set Semantic Segmentation in Autonomous Driving + 2026-10-23T13:33:39Z + + + Recent advances in 3D semantic segmentation have significantly improved scene understanding in autonomous driving. However, existing methods are typically developed under a closed-set assumption and evaluated under standard driving conditions, where all categories are known in advance. In real-world driving, autonomous vehicles inevitably encounter previously unseen objects, making closed-set perception insufficient for safe deployment. To address this challenge, we introduce DriveOSS, which, to the best of our knowledge, is the first real-world multimodal dataset and benchmark specifically designed for 3D anomaly segmentation and open-set semantic segmentation. It contains 12,661 synchronized and annotated frames captured using six surround-view RGB cameras, a 128-beam LiDAR, and a GPS/IMU unit. The dataset comprises 52 real-world driving scenes collected under clear, nighttime, cloudy, rainy, and snowy conditions and is organized into ID (in-distribution) and OOD (out-of-distribution) subsets. The ID scenes contain only known classes and are used for training, whereas the OOD scenes additionally contain unknown objects annotated as the outlier class and are used for validation and testing. Extensive experiments show that unseen objects remain a major challenge for current 3D perception systems. The dataset, benchmark protocols, and code are available at https://github.com/chrisyan/DriveOSS. + + 2026-10-23T13:33:39Z + Accepted to WACV 2027 + + + Zhiran Yan + + + Savankumar Bhanderi + + + Sourabh Lolge + + + Rui Song + + + Girdharbhai Paneliya + + + Shiva Agrawal + + + Gordon Elger + + + + http://arxiv.org/abs/2610.32442v1 + Learning Fine-Grained Visual Classification with Text as Privileged Information via Multimodal Distillation + 2026-10-23T10:07:27Z + + + Fine-grained visual classification (FGVC) requires distinguishing between highly similar categories by focusing on subtle, localized visual differences. Recent multimodal methods have demonstrated that textual attribute descriptions can provide valuable semantic supervision by explicitly describing discriminative object characteristics. However, these descriptions are typically unavailable at test time, limiting their direct use in deployment. We propose FG-LUPI, a Learning Using Privileged Information (LUPI)-based framework that leverages attribute descriptions during training. We train a multimodal teacher that integrates image patches and textual attributes via gated cross-attention, allowing semantic attributes to condition visual representations. We distill this knowledge into an image-only student using multi-level distillation at the prediction, patch, and attention levels, aligning global predictions, patch representations, and attention patterns with the teacher. This encourages the student to inherit attention structure learned from multimodal supervision while maintaining image-only inference. Experiments on multiple FGVC benchmarks show consistent improvements in classification accuracy over strong ViT-based baselines. Furthermore, evaluation using Expected Calibration Error (ECE) shows that FG-LUPI also produces better-calibrated predictions across all six benchmarks. These results suggest that textual attribute supervision can benefit not only fine-grained recognition performance but also the reliability of model confidence, while preserving the efficiency and practicality of image-only inference. + + 2026-10-23T10:07:27Z + 16 pages + + + Aishwarya Venkataramanan + + + Christian Ickler + + + Joachim Denzler + + + + http://arxiv.org/abs/2610.32332v1 + 4DMemory: Benchmarking Long-Horizon Spatiotemporal Memory with Harness-Augmented Agents + 2026-10-23T08:28:29Z + + + Humans efficiently process multimodal streams spanning hours to years, building persistent, fine-grained spatiotemporal memories that support reasoning about and predicting long-horizon events. In contrast, existing benchmarks focus on short- and medium-context tasks, and most foundation models struggle to preserve fine-grained information over long horizons. To evaluate and improve long-horizon spatiotemporal reasoning, we introduce the LongVideo dataset and the 4DMemoryBench. LongVideo comprises about 900 hours of video and over 5,000 manually reviewed questions covering visual, textual, and spatiotemporal reasoning across diverse context lengths. We further develop the 4DMemory Harness, which integrates four complementary skills, 22+ specialized tool models, and a model-specific retrieval-augmented generation system. Evaluating 13 leading models, we find that standalone foundation models struggle with long-horizon tasks, while the 4DMemory Harness improves all of them by over 50\%. Compared to previous benchmark, the same models exhibit a performance drop of more than 10\% on 4DMemoryBench. We hope 4DMemory will facilitate the development of spatiotemporal agents capable of addressing complex, long-horizon tasks. + + + + + 2026-10-23T08:28:29Z + 22 pages, 5 figures + + + Yanhao Jia + + + Yi Zhu + + + Yiran Zhong + + + Weigao Sun + + + Feida Zhu + + + Pengkun Jiao + + + Sihan Yang + + + Ming Ma + + + Steven Hoi + + + Erik Cambria + + + + http://arxiv.org/abs/2610.32311v1 + GeoLEON-CLIP: Graph-Anchored Multimodal Contrastive Learning for Geographic Region Representation + 2026-10-23T08:11:23Z + + + Geographic regions are multimodal: satellite imagery captures visual morphology, text conveys human-interpretable semantics, and map structures describe urban context. Existing geospatial contrastive methods typically align image-text or image-location pairs, underusing structured map data. We introduce GeoLEON-CLIP, a graph-anchored contrastive framework that aligns three views of each H3-indexed region: an OpenStreetMap-derived graph embedding, a satellite image crop, and a textual description. Frozen pretrained LEON graph embeddings provide a semantic anchor between vision and language. Frozen graph, image, and text encoders are connected by trainable residual projection heads and trained with a symmetric tri-modal contrastive objective. Experiments show strong graph-image and graph-text alignment; graph-image retrieval achieves the best cross-modal performance in a mixed-resolution pool. To evaluate the anchoring hypothesis, we propose chained cross-modal recall $\mathrm{R}@A@B$, which routes retrieval through the graph modality and compares it with direct retrieval under a matched candidate budget. At $\mathrm{R}@1@1$, image$\rightarrow$graph$\rightarrow$text and text$\rightarrow$graph$\rightarrow$image outperform direct image-text retrieval by 4.8 and 4.4 points, respectively, despite using a single intermediate cell. Downstream probes show task-dependent gains, with the largest improvements on Airbnb and Beijing housing. These results indicate that OpenStreetMap graph structure can anchor multimodal representations combining maps, imagery, and language. + + + 2026-10-23T08:11:23Z + Accepted at the 9th International Workshop on AI for Geographic Knowledge Discovery (GeoAI 2026), co-located with the 34th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL 2026) + + + Radoslaw Malek + + + Szymon Soltysiak + + + Aleksandra Kawala-Sterniuk + + + Piotr Szymanski + + 10.1145/3849726.3856091 + + + + http://arxiv.org/abs/2610.32294v1 + OlmoEarth v1.3: Embeddings + 2026-10-23T07:53:00Z + + + We make some OlmoEarth embeddings. To do this, we train a new model: OlmoEarth v1.3. OlmoEarth v1.3 is designed to condense multimodal, multitemporal remote sensing data into a single digestible 64 or 128-dimensional vector. OlmoEarth v1.3 produces state-of-the-art embeddings. In addition, OlmoEarth v1.3 is a strong encoder backbone -- competitive with OlmoEarth v1 and v1.2 -- while requiring 18% and 53% of the GPU hours to train, respectively. We use OlmoEarth v1.3 to compute global, annualized 10m embeddings, which we release under the OlmoEarth artifact license. + + 2026-10-23T07:53:00Z + + + Gabriel Tseng + + + Favyen Bastani + + + Patrick Alan Johnson + + + Yawen Zhang + + + Piper Wolters + + + Ando Shah + + + Hadrien Sablon + + + Joseph Redmon + + + Heather DeHaven + + + Rachel Ratner + + + Sasha Levy + + + Jordan Steward + + + Katrina Midgley + + + Andrew Howe + + + Hunter Pitelka + + + Ted Schmitt + + + + http://arxiv.org/abs/2610.32263v1 + LapaFM: A Laparoscopic Foundation Model via Multi-Stage Continual Learning + 2026-10-23T07:17:28Z + + + Artificial intelligence-based analysis of intraoperative laparoscopic videos has the potential to improve surgical decision-making and precision. However, effective surgical assistance requires models that can generalize across diverse intraoperative tasks. Here we present LapaFM, a foundation model for laparoscopic surgery trained on more than 20,000 minutes of surgical videos using a multi-stage continual learning strategy that mitigates catastrophic forgetting and inter-task interference. LapaFM learns multimodal visual representations and supports multiple tasks, including smoke removal, surgical phase recognition, instrument and polyp segmentation, and lesion identification. The model was evaluated on 13 retrospective and two prospective cohorts collected from different imaging devices. LapaFM consistently outperformed task-specific models and existing foundation models across datasets, and also generalized to gastrointestinal endoscopy tasks, including polyp detection and classification. Notably, it recovered over 90% of smoke-obscured frames and achieved clinician-level or superior performance in lymph node metastasis prediction and prospective polyp classification. + + 2026-10-23T07:17:28Z + + + Xiaobo Zhu + + + Shiwei Wu + + + Yu An + + + Yuechen Tao + + + He Sun + + + Song Zhang + + + Jianbo Wang + + + Xiaojing Wang + + + Junwei Liu + + + Wei Guo + + + Yanfei Shao + + + Xuan Zhao + + + Jiangwei Xiao + + + Wenbo Niu + + + Bo Wei + + + Yuhan Wang + + + Gang Hu + + + Fei Liu + + + Kunshan He + + + Chongwei Chi + + + Jianqiang Tang + + + Kang Zhang + + + Jie Tian + + + Zhenyu Liu + + + + http://arxiv.org/abs/2610.32146v1 + Separating Angular Alignment from Radial Ordering in Hyperbolic Vision-Language Models + 2026-10-23T04:25:17Z + + + Hyperbolic vision-language models are well suited to modeling the hierarchical structure of multimodal data, because hyperbolic volume grows exponentially with radius, enabling low-distortion representations of tree-like taxonomies from general to specific concepts. However, existing pretraining objectives for hyperbolic vision-language models entangle semantic alignment with entailment modeling, forcing radial coordinates to simultaneously encode semantic matching and hierarchical structure, leading to conflicting geometric constraints. In this paper, we introduce AURORA, a hyperbolic vision-language framework that decouples the objectives through angular alignment and a novel Radial-Angular Order Cone (RAOC) for entailment modeling. Angular alignment captures semantic similarity while preserving the radial structure for representing hierarchies. Unlike conventional entailment cones, RAOC determines angular allowance from relative parent-child radial gaps. It is incorporated into hierarchical entailment contrastive training to capture partial-order relations. We further introduce a norm regularization term that prevents undesirable radial degeneration for stable training. We train models on millions of image-text pairs and evaluate them across zero-shot classification, image-text retrieval, hierarchical reasoning, and compositional understanding. Our model consistently outperforms strong Euclidean and hyperbolic vision-language baselines, demonstrating the effectiveness of decoupling semantic alignment from hierarchical entailment modeling. + + 2026-10-23T04:25:17Z + 34 pages, 12 figures + + + Mingyang Gao + + + Yuwei Wu + + + Shiyu Luo + + + Wei Wu + + + Xiaomeng Fan + + + Qihao Lv + + + Haoyu Zhang + + + Rui Gao + + + Bingzhen Liu + + + Zhi Gao + + + Che Sun + + + + http://arxiv.org/abs/2610.32073v1 + Guided Zero-Shot Anomaly Explanation for Anonymized Crowd Video Monitoring: Context, Categorization, and Spatial Localization + 2026-10-23T02:19:42Z + + + Despite the promising development of deep learning for video anomaly detection (VAD), explainability (XAI) of these models remains a challenge. Explainable and privacy-protecting VAD builds transparency and trust that facilitates adoption of computer vision systems, including safety and security monitoring. However, anomaly explainability in privacy-preserving VAD systems is underexplored. In this study, we present the XAVAD approach, a unified descriptive anomaly XAI for an anonymized VAD, that integrates flexible zero-shot anonymization, anomaly type categorization, visual localization, and scene context description. We provide empirical and qualitative assessments of multifaceted explanations integrated with full-body visual anonymization for privacy protection. We adopt a multimodal CLIP embedding for videos, using improved LLM-assisted prompting and pool-scoring mechanisms for anomaly-type identification. We enhance Grad-ECLIP for spatial anomaly heatmap localization, leveraging computation and accuracy through our novel prompt-guided patching autofocus mechanism. We employ VLMs to generate context and reasoning descriptions of detected anomalies through curated prompt engineering. We have evaluated the accuracy and computational cost of XAVAD on several publicly available CCTV and video datasets. Our experiments demonstrate substantial gains of our XAVAD over state-of-the-art benchmark approaches and provide insights into privacy protection trade-offs in XAI for VAD. We further present ablation studies and assessments across diverse configurations and modeling alternatives to demonstrate the efficacy of our proposed methods. Code: https://github.com/muleina/XAVAD}{https://github.com/muleina/XAVAD . + + + 2026-10-23T02:19:42Z + 21 pages, 12 figures, 13 tables, preprint + + + Mulugeta Weldezgina Asres + + + Lei Jiao + + + Christian Walter Omlin + + + + http://arxiv.org/abs/2610.31803v1 + StackGen3D: Stable 3D Block Stack Generation from Multiview Silhouettes + 2026-10-22T18:41:21Z + + + Generating physically stable 3D structures from visual specifications requires resolving geometric ambiguity while accounting for physical interactions among objects. We present StackGen3D, a framework for generating stable block assemblies conditioned on a given block inventory and three orthographic silhouettes. Our approach consists of two stages. First, we develop a physics-informed graph neural network (PI-GNN) that models support relations between blocks and serves as a fast stability predictor for curating a diverse dataset of stable structures. Second, we train a conditional flow-matching model on this dataset to capture the multimodal distribution of block configurations consistent with the target silhouettes. At inference time, lightweight geometric selection and refinement reduce inter-block penetration without physics simulation. Preliminary experiments show that the PI-GNN generalizes from simple stacks to complex structures substantially better than a parameter-matched multilayer perceptron. For structure generation, Best-of-10 selection improves physical stability from 45.3% to 72.4% while achieving a silhouette IoU of 0.970. These results highlight the potential of combining relational physical reasoning, scalable data curation, and conditional generative modeling for creative 3D assembly. + Project website: [https://ripl.github.io/StackGen3D-web/](https://ripl.github.io/StackGen3D-web/) + + + 2026-10-22T18:41:21Z + A poster of this work is publicly available on the website of the Creativity in Assembly Workshop at IROS 2026 (non-archival) + + + Xiaopeng Zhang + + + Luzhe Sun + + + Yiqing Xu + + + Matthew R. Walter + + + + http://arxiv.org/abs/2610.31538v1 + LACToS: Local Anomaly Detection via Conditional Typicality of Superpixels + 2026-10-22T16:46:09Z + + + Local anomaly detection is the task of identifying spatially confined anomalous or out-of-distribution (OOD) regions within an otherwise in-distribution (ID) image. Most existing methods are designed for a specific context, with a strong focus on industrial defect detection, where they achieve excellent performance on well-established benchmarks. However, we observe that these methods can exhibit significant performance drops in other contexts, especially when the inlier distribution is multimodal. To account for this inlier complexity, we propose LACToS, a principled local OOD detection method based on statistical typicality and made tractable through two innovations: (i) grouping pixels into superpixels and (ii) using a computationally efficient proxy to estimate typicality. We evaluate LACToS across three diverse applications spanning medical imaging, human faces, and X-ray security screening. LACToS performs more robustly than prior methods across these benchmarks. The code is released here: https://github.com/voilalab/LACToS. + + + 2026-10-22T16:46:09Z + + + Jihoon Hong + + + Alireza Kheirandish + + + Rohan Sanda + + + Sara Fridovich-Keil + + + + http://arxiv.org/abs/2610.31385v1 + A Task-Centric Survey of Long-Document Visual Question Answering: Taxonomy, Evolution, and Future Directions + 2026-10-22T14:52:47Z + + + Visual document understanding is essential for acquiring knowledge from visually rich documents and is attracting growing research interest. Existing surveys emphasize architectures or technical approaches, with limited attention to how task bottlenecks shape technical choices and research priorities. We present a task-centric survey that decomposes long-document visual question answering (VQA) into four components: document parsing, evidence organization and retrieval, generator organization and learning, and evaluation. For each, we develop a fine-grained taxonomy and trace motivations, technical responses, and cross-component connections. We focus on explicit retrieval while covering direct reading. Our temporal analysis traces expanding priorities from multimodal content understanding to sufficient, high-fidelity evidence acquisition and sustained evidence management. We outline future directions in evidence sufficiency, verifiable and correctable understanding, and budget-aware coordination, with an outlook on continual document understanding. + + + + 2026-10-22T14:52:47Z + 26 pages, 9 figures, 6 tables + + + Yufei Tong + + + Guanjie Cheng + + + Tianle Wu + + + Leilei Zhang + + + Hang Zheng + + + Peihan Wu + + + Jianwei Yin + + + Shuiguang Deng + + + + http://arxiv.org/abs/2610.31284v1 + Retrieval-Augmented Online Textual Memory for Episodic Memory Video Question Answering + 2026-10-22T13:49:30Z + + + Long egocentric videos pose a central challenge for multimodal language models: the visual stream must be compressed into a memory representation that can be searched efficiently while still preserving the evidence needed for question answering. Building on an online textual-memory framework in which first-person videos are converted into temporally grounded captions, this work systematically studies the role of retrieval in episodic-memory video question answering. We evaluate how different retrieval units, query formulations, context budgets, and reranking strategies affect multiple-choice answering on QAEgo4D-Closed, isolating retrieval as the main variable while keeping the underlying generated memory fixed. + Our best configuration, Parent, matches fine-grained caption subchunks, then provides their full parent captions to the reasoner. It achieves 56.4 % accuracy, matching strong full-memory and retrieval baselines while exposing only a small fraction of the textual memory at question time. More importantly, our analysis shows that better temporal coverage does not necessarily translate into better answers: increasing the retrieval budget improves temporal Hit@K and Recall@K, but can reduce accuracy by introducing visually plausible distractors and uncertain caption evidence. These findings suggest that retrieval-augmented egocentric memory should not be optimized only for evidence recall, but also for the reliability, specificity, and answer-discriminative value of the retrieved context. The study motivates more structured episodic memories that move beyond raw caption retrieval toward evidence-aware representations for long-form egocentric reasoning. + + 2026-10-22T13:49:30Z + + + Raffaele Cali + + + Giuseppe Lando + + + Rosario Forte + + + Antonino Furnari + + + + http://arxiv.org/abs/2610.31205v1 + A Visual Grounding Benchmark for Retinal OCT with Multimodal Large Language Models + 2026-10-22T12:54:19Z + + + Multimodal large language models (MLLMs) can answer clinical questions about medical images, but trustworthy use requires visual grounding: models should localize the pathology they report rather than rely on spurious shortcuts. Whether MLLMs can visually ground clinical findings in retinal optical coherence tomography (OCT), the most widely used imaging modality in ophthalmology, remains largely unexplored. To address this gap, we introduce RetinaGroundBench, the first benchmark for biomarker visual grounding in retinal OCT. It comprises 815 B-scans exhaustively annotated by ophthalmologists with 4,537 bounding boxes covering 13 biomarkers across 8 diseases. Because MLLMs often fragment a single lesion into multiple partial predictions, we propose AggIoU, a metric that evaluates whether the union of overlapping predicted boxes covers the annotated region. Across 27 open-source MLLMs (0.8-38B parameters), we find that visual grounding remains largely unsolved: the best general-purpose model achieves a macro F1 of just 23.7%, with consistently low recall, despite reaching up to 73% balanced accuracy on biomarker presence questions. To narrow this gap, we developed RetGrounder, an MLLM fine-tuned using an OCT-specific strategy integrating grounding and textual information. Despite its relatively small size (8B), RetGrounder improves grounding F1 to 33.9%, a 43% relative improvement. Our benchmark provides a reference point for measuring progress in the field of OCT diagnosis with MLLMs. + + 2026-10-22T12:54:19Z + Under review at npj digital medicine + + + Ronald Fecso + + + José Morano + + + Botond Fazekas + + + Paul Widmann-Sedlnitzky + + + Dorota Himel + + + Laetita Hinterhuber + + + Virginia Mares + + + Andreas Pollreisz + + + Hrvoje Bogunović + + + + http://arxiv.org/abs/2610.31158v1 + Beyond Watching and Searching: Benchmarking Agents for Video-centered Deep Research Reports + 2026-10-22T12:15:30Z + + + Deep research agents synthesize open-web evidence into long reports, but current benchmarks do not evaluate research centered on a source video. We introduce Video-Centered Deep Research Report Generation. Given a video and user request, an agent identifies research questions, retrieves external multimodal evidence, and produces an interactive report linked to relevant video moments. This task has direct practical value because it helps users locate relevant moments, verify claims, reproduce demonstrated procedures, and make informed decisions from video content. We present a skill-based workflow and OmniDR-Bench for this task. For evaluation, we propose Omni Atomic Rubric Trees (Omni-ARTs). Each tree contains three dimensions, 23 shared directions, and task-specific atomic binary criteria. The directions test audiovisual grounding, multimodal evidence use, and interactive presentation. Audited Rubric Construction (ARC) builds these trees through independent evidence collection, automated checks, behavioral calibration, and iterative human review. OmniDR-Bench contains 50 Chinese and English tasks across 19 realworld subcategories. It includes 6,414 criteria. Across 18 agent configurations, the best system scores 63.3 out of 100. Current agents still need broader content coverage, stronger causal and logical analysis across modalities, and more accurate citation support. We further analyze models, harnesses, skill configurations, video categories, and research trajectories. The code and data are released at https://github.com/marinero4972/OmniDR-Bench. + + + 2026-10-22T12:15:30Z + + + Jiahao Meng + + + Qize Yang + + + Yuxuan Wang + + + Yunfei Chu + + + Wensi Dai + + + Jin Xu + + + Yunhai Tong + + + + http://arxiv.org/abs/2610.31087v1 + I$^2$-KAN: Interpretable Intra- and Inter-Modal Multi-Pathway Representation Learning for Multimodal Sentiment Analysis + 2026-10-22T10:57:20Z + + + Multimodal sentiment analysis (MSA) aims to infer sentiment by integrating linguistic, acoustic, and visual information. However, many fusion methods integrate modality-specific representations and cross-modal interactions into joint representations, making it difficult to determine whether predictive utility arises from a modality itself or from its interactions with others. More fundamentally, a modality's standalone predictive utility may not faithfully reflect its interaction-conditioned predictive utility. To address this issue, we propose I$^2$-KAN, an interpretable multi-pathway framework that explicitly maintains intra-modal and pairwise inter-modal information in separate structural pathways. Each pathway is refined by a Task-Decoupled Linear-Gated Denoising Bottleneck (TDL-GDB) to learn compact and task-relevant representations, followed by structured Kolmogorov-Arnold Network fusion that retains explicit pathway associations and supports multi-level interpretation. Extensive experiments on CMU-MOSI, CMU-MOSEI, and CH-SIMS v2 demonstrate strong overall performance. Ablation and interpretability analyses consistently show across the three benchmarks that low standalone predictive utility does not necessarily imply low interaction-conditioned predictive utility: a modality that appears weak in isolation can remain informative through pairwise interactions. These findings highlight the interaction-dependent nature of multimodal utility and suggest that modality utility should be characterized from both standalone and interaction-conditioned perspectives. + + 2026-10-22T10:57:20Z + + + Xiaoting Xie + + + Feng Qiao + + + Xianwei Zhang + + + Hailong Chen + + + Kaiwen Zheng + + + Joemon M. Jose + + + Xuri Ge + + + Yujun Li + + + + http://arxiv.org/abs/2610.30942v1 + GateFormer: Forecast-Space Decomposition for Intra-Hour Solar Irradiance Prediction from Sky Images + 2026-10-22T08:58:18Z + + + Sub-hourly dispatch, balancing, and storage control increasingly depend on forecasts that anticipate rapid variability in solar generation. Accurate sky-image-based irradiance forecasting requires a combination of visual cloud dynamics with recent irradiance state while adapting to different short-term irradiance-change regimes. To address this, we introduce GateFormer, a GHI-conditioned dual-decoder ViT for intra-hour global horizontal irradiance (GHI) forecasting through forecast-space decomposition. GateFormer embeds observed GHI into the visual token stream, allowing interaction with sky-image patch features through self-attention. From this shared representation, a Trajectory Head predicts future GHI sequence, while a Delta Head predicts final-horizon change from the latest observed GHI. The two final-horizon forecasts are adaptively weighted in prediction space, with magnitude- and direction-supervision targeting the remaining error. On the NREL-TSI benchmark, GateFormer attains 125.01 W/m^2 RMSE at +30 min, improving over a state-of-the-art transformer baseline by 9.6% under paired-timestamp evaluation. Across NREL-TSI, Chilbolton, and SIRTA, GateFormer achieves the lowest final-horizon RMSE among the evaluated baselines, with forecast skill of 22.97-28.86% relative to smart persistence. Component ablations show adaptive weighting outperforms both individual decoders and fixed averaging, distinguishing GateFormer from conventional forecast combination, while the supervised correction further reduces RMSE by 1.68 W/m^2 and MAE by 4.86 W/m^2. Ramp-regime diagnostics show larger gains during operationally important positive ramps, reducing RMSE by 26.27 W/m^2. These results identify forecast-space decomposition as an alternative forecasting formulation, with potential relevance to other multimodal short-horizon forecasting tasks and deployment using only sky images and measured GHI. + + + + + 2026-10-22T08:58:18Z + + Energy and AI 26 (2026), 100917 + + David Hamlyn + + + Sunny Chaudhary + + + Jonathon Hare + + + Tasmiat Rahman + + 10.1016/j.egyai.2026.100917 + + + + http://arxiv.org/abs/2610.30926v2 + Making MLLM Latents Matter: Factor-Aware Predictive Learning for Cinematic Video Generation + 2026-10-23T11:09:51Z + + + Cinematic video generation requires both temporal inference from limited inputs (i.e., sparse rather than frame-by-frame guidance) and factor-aware control of character, scene, action, and camera. Multimodal large language models (MLLMs) offer useful priors for both capabilities, but their representations are not automatically actionable for video generation: a Video Diffusion Transformer (DiT) may bypass them through native conditioning pathways, and using them does not ensure either factor-aware control or generation-compatible temporal prediction. We propose Factor-Aware Predictive Learning (FAPL), which establishes effective MLLM latent use as a shared prerequisite and then targets the two capabilities with complementary learning signals. First, latent-only generator grounding trains the DiT with a frozen MLLM and connector, strengthening the DiT's use of MLLM latents for generation. Second, for factor-aware control, paired videos specify a target-factor change and non-target preservation, and factor-span replacement trains the DiT to realize this relationship in its output. Third, for temporal inference, text-only and text-plus-complete-video observations share a video target, and the trained DiT is then frozen while the MLLM and connector are optimized through it. This final stage trains limited-input representations for generation while retaining complete-observation reconstruction as a complementary training mode. Extensive experiments demonstrate our consistently better performance on three cinematic video generation tasks (i.e., sparse-to-video, factor-aware editing, and multi-shot generation) over baselines and validate FAPL's contributions to MLLM feature use, temporal control, and factor coordination. + + 2026-10-22T08:43:48Z + + + Songlin Yang + + + Zhe Wang + + + Xiaotong Zhao + + + Xi Wang + + + Ran Zhang + + + Shuai Li + + + Taiyi Wu + + + Songlian Li + + + Eric Liu + + + Alan Zhao + + + Anyi Rao + + + + http://arxiv.org/abs/2610.30592v1 + Visual Grounding First, Multimodal In-context Learning Follows + 2026-10-22T01:48:28Z + + + LLMs have shown strong in-context learning (ICL) capability, but extending it to Multimodal LLMs (MLLMs) remains challenging. Prior multimodal ICL methods often rely on ICL-specific datasets for additional training or task vector extraction, which can improve performance on the same ICL benchmark used for adaptation. However, they do not generalize well to other benchmarks and often induce forgetting in previously well-solved tasks. For this reason, we identify 'visual grounding' as the key bottleneck in multimodal ICL; MLLMs often fail to attend to task-relevant visual evidence in demonstrations, instead over-relying on textual cues and producing hallucinated outputs. To address this, we propose ProCoRe to enhance visual grounding through contrastive reinforcement learning on multimodal contrastive data for improving multimodal ICL. ProCoRe generates captions for contrastive image pairs, decomposes them into propositions, and optimizes contrastive rewards that encourage alignment with corresponding images while discouraging mismatched ones. Despite never seeing ICL-formatted training examples, ProCoRe improves average multimodal ICL classification accuracy by 5.6% and captioning ROUGE-L by 13.8% over the off-the-shelf Qwen-VL-3-8B model, outperforming ICL-data-dependent state of the arts across benchmarks. Finally, we introduce PICL, a personalized multimodal ICL captioning benchmark that tests whether MLLMs genuinely understand visual demonstrations rather than relying on pre-trained semantic priors. + + + 2026-10-22T01:48:28Z + NeurIPS 2026 + + + Minhyuk Seo + + + Minjae Lee + + + Chaeeun Lee + + + Wei Lin + + + Muhammad Jehanzeb Mirza + + + Tinne Tuytelaars + + + Jonghyun Choi + + + + http://arxiv.org/abs/2610.30326v1 + R4DGS: Referring Segmentation in 4D Gaussian Splatting + 2026-10-21T18:42:09Z + + + Dynamic representations based on 4D Gaussian Splatting (4DGS) have shown strong capabilities in reconstruction and rendering, yet current methods remain limited in supporting complex natural-language referring in dynamic scenes. Existing 4D Gaussian methods are primarily designed for rendering-oriented dynamic modeling, while current semantic extensions often rely on scene-specific semantic optimization or are evaluated on relatively simple query settings. In this paper, we study Referring 4D Gaussian Splatting (R4DGS), a task for grounding temporally varying, multi-target or reasoning-intensive, and zero-target or distractor expressions in dynamic 4D scenes. To support this task, we introduce R4D-Bench-QA, a benchmark with structured query annotations. We further present ReferGaussian, a unified framework built upon 4DGS that converts low-level dynamic Gaussians into persistent, language-addressable entities for training-free referring inference. ReferGaussian organizes mask-supported Gaussian entities in an EntityBank, uses Multimodal Large Language Models (MLLMs) to decompose complex queries into trackable object phrases and structured referring constraints, and performs constraint-aware grounding without scene-specific semantic optimization. Experiments on R4D-Bench-QA and the 4D LangSplat protocol demonstrate improved temporal target selection and competitive spatiotemporal grounding without scene-specific semantic training. Project resources are available at https://chenbangpu.github.io/R4DGS/. + + 2026-10-21T18:42:09Z + 10 pages. Accepted at ACM Multimedia 2026. Project page: https://chenbangpu.github.io/R4DGS/ + + + Bangpu Chen + + + Yaxuan Li + + + Shirui Peng + + + Xiangtian Si + + + Liuxin Chu + + + Xitong Cao + + + Hongbo Jin + + + Jiayu Ding + + + + http://arxiv.org/abs/2610.30108v1 + Multimodal Embodied Agents: A Unified Capability-centric Perspective from Computer-Use to Robot-Use + 2026-10-21T17:52:48Z + + + Multimodal agents (MMAs) sustain interaction through reasoning, memory, tools, and feedback, most visibly as computer-use agents, while robotic systems (RSs) couple sensing and actuation under physical dynamics. We define multimodal embodied agents (MMEAs) as goal-directed systems that couple multimodal task reasoning with physical action and revise decisions from the resulting feedback. This raises a central question: what changes when a multimodal agent moves from computer-use to robot-use? We introduce PAPAV, a unified capability-centric framework of five recurring functions: Perceive the current state, Anticipate action effects, Plan a feasible course, Act through an interface or body, and Verify the outcome. Defined by function rather than architecture, these capabilities let PAPAV identify what all three share and then compare MMEAs with MMAs and with RSs. Five physical constraints, from partial observability to unverifiable outcomes, leave fewer choices fixed in advance and less room to reverse errors. Across 64 benchmarks, explicit evaluation centers on Act; only 5 assess Anticipate and 3 assess Verify, leaving both largely hidden behind task success. These constraints also frame the open challenges we identify. PAPAV therefore provides a common basis for designing reliable physical agents and measuring progress across all five capabilities rather than task success alone. + + + + + + 2026-10-21T17:52:48Z + Project website: https://showlab.github.io/Awesome-Multimodal-Embodied-Agent/ + + + Yanzhe Chen + + + Ziyi Yang + + + Jifeng Zhu + + + Qiming Huang + + + Ruihe An + + + Peiyao Xu + + + Hesen Yang + + + Runda Liu + + + Chang Gong + + + Zhijun Cao + + + Zechen Bai + + + Wenzheng Zeng + + + Yiqi Lin + + + Guoqiang Liang + + + Kevin Yuchen Ma + + + Kevin Qinghong Lin + + + Mike Zheng Shou + + + + http://arxiv.org/abs/2610.30089v1 + ProactEgoMem: Benchmarking Proactive Memory in Streaming Egocentric Video + 2026-10-21T17:37:58Z + + + Today's multimodal assistants are typically prompted to interpret the visual evidence presented to them. To offload the cognitive burden of remembering across long horizons, wearable assistants should instead proactively acquire and maintain useful memory as the user's surroundings evolve. Doing so on the user's behalf requires identifying what matters, understanding the scene in real time, and initiating memory maintenance in the background while the user stays focused on their activities. We introduce ProactEgoMem, a benchmark that evaluates proactive memory in streaming egocentric video. Three tasks ground the evaluation in ambient environmental needs: Information Capture (IC) preserves transient yet dense visual information, State Tracking (ST) follows changing object states, and Location Tracking (LT) records object movements. The benchmark defines its protocol at two levels of proactiveness: the Notification Level asks for a single timely notification that satisfies the user's intent, while the deeper Intervention Level asks the agent to maintain memory on the user's behalf through an active start-to-stop tool lifecycle. Parallel ProactEgoMem-Daily and ProactEgoMem-Sci tracks contain 300/100 clips covering daily and scientific use cases, paired with 1000/500 questions in ProactEgoMem-QA, which measures the quality of the proactively acquired memory. Across proprietary, open-source, video-language, and streaming baselines, even the strongest models fail to capture memory both timely and accurately. ProactEgoMem provides a rigorous evaluation foundation for proactive multimodal assistance and for video agents that co-exist with their users. + + 2026-10-21T17:37:58Z + 30 pages, 22 figures, Project Page: https://proactegomem.github.io/ + + + Ruotong Liao + + + Meikel Kokowski + + + Xiaoxiao Sun + + + Yongqin Xian + + + Laura Bravo Sánchez + + + Shiye Su + + + Federico Tombari + + + Serena Yeung-Levy + + + Volker Tresp + + + + http://arxiv.org/abs/2610.29913v1 + Asking a Multimodal LLM Whether Someone Fell: Zero-Shot Screening of Low-Resolution Thermal Video in a Laboratory and an Occupied Home + 2026-10-21T15:53:17Z + + + Thermal cameras can watch over older people living alone without capturing faces, and multimodal large language models (LLMs) can judge a short video without task-specific training. We evaluate a production multimodal LLM, Gemini 3.8 Flash at temperature 0, as the decision stage of an event-triggered fall screener, used exactly as a deployed prototype uses it: one request per short thermal clip, with its sound track when there is one, and its predecessor Gemini 3.7 Flash on the same requests. On 438 staged falls and 563 non-fall windows that we located by hand in a public 32x24 thermal dataset, the deployed request called 69% of the held-out subjects' falls (67% over all subjects; bed falls excluded) and none of 499 non-fall windows, including people lying on the floor and getting up. Over 76 h of ordinary life in an occupied room, recorded at 160x120 with sound, it called none of 395 clips a fall (95% upper bound 1.2 false alarms per day) and caught 4 of the 9 staged falls the camera could see. One cautionary sentence in the prompt ("a person who goes out of view ... is not a fall") accounted for many of the misses: removing it raised sensitivity on the held-out subjects from 69% to 83% on 3.8 Flash and from 80% to 92% on Gemini 3.7 Flash, and in the home from 4 to 9 of the 9 visible falls, with no false call in ordinary living but at the price of calling deliberate lie-downs a fall. Sensitivity collapsed at 8x6 pixels (34%); identical requests disagreed on 4% of windows; and when the model called a fall, its explanation placed it within a second of the annotated landing 99% of the time. Two conventional detectors trained on the laboratory data caught nearly every held-out laboratory fall but raised 14.2 and 23.9 false alarms per day in the home. We release the frame-level fall annotations of the public dataset and every model answer on it. + + + 2026-10-21T15:53:17Z + 13 pages, 6 figures. Data: https://senecta.ai/research/thermal-fall-llm-data.zip + + + Marcos Junca + Senecta Inc. + + + Mauro Junca + Senecta Inc. + + + + http://arxiv.org/abs/2610.29768v1 + UniRAP: Towards Unified Part-level Physical Affordance Reasoning and Actionable Perception + 2026-10-21T14:02:25Z + + + Vision-language perception has achieved impressive progress in aligning natural language with visual observations, yet grounding high-level semantics into part-level physical interaction remains challenging. To address this gap, we propose UniRAP, a unified model for inferring part-level physical affordances and mapping language instructions to actionable geometric representations. UniRAP formulates this problem as a conditional multimodal generation task, integrating visual inputs, textual instructions, and optional prompts into a shared spatiotemporal representation space through a unified interface token mechanism. To predict executable contact geometry, we introduce a Unified Affordance Decoder (UAD), which jointly performs object detection, part-level affordance segmentation, and 4-DoF interaction pose estimation by leveraging intermediate segmentation features. In addition, we propose a curriculum-based transfer training strategy that progressively adapts the model from general visual parsing to interaction-aware perception, improving data efficiency under limited textual annotations. Experiments show that UniRAP achieves state-of-the-art performance on referring expression segmentation, affordance grounding, and interaction pose estimation, while maintaining strong spatiotemporal consistency in dynamic video scenarios. These results demonstrate the effectiveness of UniRAP as a unified perception framework for language-guided physical manipulation. + + 2026-10-21T14:02:25Z + Accepted by NeurIPS 2026. Webpage: https://lif314.github.io/projects/unirap + + + Linfei Li + + + Ruining Hu + + + Lin Zhang + + + Zhong Wang + + + Fengyi Zhang + + + Ying Shen + + + Binqiang Wang + + + Xin Zhang + + + + http://arxiv.org/abs/2610.29740v1 + APED-CXR: Adaptive Privileged Evidence Distillation for Chest X-Ray Grounding with Image-Only Inference + 2026-10-21T13:39:07Z + + + Compact chest X-ray (CXR) models that localize findings suit deployment, but box annotations are limited and report-aware multimodal models are expensive at inference. We introduce APED-CXR, which distills report-informed spatial evidence from a frozen multimodal teacher into a student with 11.1M parameters that predicts diseases and boxes from shared evidence maps and requires the image alone at test time. During training, the teacher uses the radiograph, report, and queried class to evaluate regions proposed from the student's current evidence maps, and its support scores serve as training targets for the student's pooled evidence scores within these regions. Trained on PadChest and evaluated on held-out PadChest-GR, refreshing the student's proposals for teacher evaluation improves box-level localization F1 from 0.302 with fixed warm-up proposals to 0.338 (IoU >= 0.5; gain 0.036, 95% CI [0.022, 0.049]), while maintaining diagnostic AUC. This gain depends on the teacher checking current proposals: with equally many random boxes, a fixed dense box set, teacher-generated boxes, or report rules instead of the teacher, F1 stays near the fixed-proposal level, and proposals two refreshes old recover only part of the gain. On NIH ChestX-ray14, a secondary test set, box recall also rises from 0.423 to 0.447. + + 2026-10-21T13:39:07Z + 5 pages, 2 figures, 3 tables. Submitted to IEEE ISBI 2027 + + + Md Shihabul Islam Shovo + + + Nishi Kanta Paul + + + Jamil Fayyad + + + + http://arxiv.org/abs/2610.29642v1 + OpenEarth-OVS44: A Multimodal Remote Sensing Dataset for Open-Vocabulary Segmentation + 2026-10-21T12:25:26Z + + + In remote sensing, open-vocabulary segmentation is particularly important for flexible and scalable land-cover understanding across diverse regions, as it improves generalization to novel categories without requiring exhaustive pixel-level annotations. Despite its great promise, progress in this area remains largely constrained by existing datasets with limited category coverage and overly coarse taxonomies, and therefore struggles to support fine-grained semantic understanding required in real-world applications such as urban functional zoning, carbon accounting, and post-disaster assessment. To address these challenges, we present OpenEarth-OVS44, a multimodal benchmark with 290,587 expert-verified segments from 2,832 RGB images and 1,341 strictly registered RGB-SAR pairs at sub-meter spatial resolution, covering 40 cities across France, Japan, and the United States under a unified 44-class taxonomy organized into 9 base categories. Three evaluation tracks are provided: an RGB-only fine-grained benchmark, a multimodal track with diverse synthetic cloudy conditions for weather-robust evaluation, and a held-out cross-region track. Extensive experiments on representative open-vocabulary segmentation models demonstrate that training on OpenEarth-OVS44 substantially improves fine-grained segmentation performance over the strongest training-free baseline, with improvements of up to 7.1 mIoU points on unseen categories and 27.6 mIoU points on seen categories. The dataset and code will be released. + + 2026-10-21T12:25:26Z + + + Yimin Wei + + + Hongruixuan Chen + + + Hao Zheng + + + Hao Liu + + + Jian Song + + + Yuting Zhu + + + Junshi Xia + + + Naoto Yokoya + + + + http://arxiv.org/abs/2610.29552v1 + Generalized CycleGRPO for Fine-Grained Multimodal Understanding and Grounding + 2026-10-21T10:39:56Z + + + Fine-grained multimodal intelligence requires models to both understand a designated region and localize it from language. Existing methods learn these directions with separate objectives and task-specific annotations. We present Generalized CycleGRPO, the first unified reinforcement learning framework coupling region understanding and localization across spatial, temporal, and spatio-temporal domains. Given a region, a multimodal large language model generates candidate descriptions and then localizes each description to reconstruct the input region. Reconstruction overlap provides a verifiable reward for captioning, while individual localization rewards improve the inverse mapping. A common region-space formulation extends this cycle from image masks and boxes to video intervals and timestamped spatial evidence, without reference captions or an external language-model judge during reinforcement learning. In videos, the cycle encourages descriptions that distinguish a target event from similar recurrences. We introduce DOVE (Distinctive Occurrence-level Video-caption Evaluation), a human-verified contrastive benchmark for this temporal distinctiveness. CycleGRPO improves SAMTok's overall gIoU from 57.5% to 68.2% on GroundingSuite and average gIoU from 71.2% to 78.7% on GRES. For temporal tasks, it achieves 51.9% tIoU on Charades and 33.3% Temporal Evidence Coverage on DOVE, compared with 45.6% and 14.8% for the Qwen3-VL initialization. These results establish region-text cycle consistency as a general self-evaluation principle for multimodal understanding and localization. Models, code, and DOVE are available at https://devinxzhang.github.io/Generalized-CycleGRPO-Page/. + + 2026-10-21T10:39:56Z + 31 pages, 14 figures, 16 tables + + + Xin Zhang + + + Haochen Wang + + + Beibei Lin + + + Zhaoxiang Zhang + + + Robby T. Tan + + + Jason Li + + + Dacheng Tao + + + + http://arxiv.org/abs/2610.29495v1 + Balancing Foundation Models and Trait-Specific Learning for Forehead-Crease Recognition + 2026-10-21T09:50:08Z + + + Biometric recognition often degrades under partial facial vis- ibility, where conventional facial cues are occluded. The forehead region remains consistently visible and contains distinctive crease patterns that can serve as a complementary biometric trait. We present a unified eval- uation of forehead-crease recognition across explainable zero-shot rea- soning, domain-adaptive learning, and trait-specific modeling. FIRE en- ables interpretable zero-shot verification using multimodal large language models, while pretrained face-recognition models are adapted to the fore- head domain through margin-based learning. Under open-set evaluation, the best zero-shot model GPT-4o+FIRE achieves 18.22% EER, while Edge-Forehead achieves 8.30% EER and 54.01% TMR@0.1% FMR. The results show that although MLLMs offer interpretable zero-shot verifi- cation, trait-specific learning remains more effective for robust forehead- crease biometric recognition. + + 2026-10-21T09:50:08Z + Accepted at CVIP 2026 + + + Geetanjali Sharma + + + Aryan Jain + + + Dev Nagaich + + + Aditya Nigam + + + Raghavendra Ramachandra + + + + http://arxiv.org/abs/2610.29409v1 + LLMSeg: Training-Free Text-Prompted Image Segmentation with B-Splines + 2026-10-21T08:35:16Z + + + Promptable segmentation models such as SAM 3 achieve remarkable open-vocabulary performance but require dedicated architectures, large-scale annotation engines, and task-specific training. We ask a different question: can a general-purpose multimodal large language model (MLLM) segment images directly, without an added segmentation head, mask decoder, or training? We present LLMSeg, a training-free pipeline that turns a vision-capable LLM into a text-prompted image segmenter. LLMSeg decomposes segmentation into three LLM-driven stages. First, detect localizes all instances matching a free-form text query and describes their coarse morphology. Next, segment traces each instance using closed periodic B-splines confined to its detected box. These splines define an outer boundary and optional hole loops. Finally, refine iteratively proposes focus boxes around residual errors and retraces confined splines. The process ends when the mask stabilizes or the pass budget is exhausted. The output is a binary mask with inspectable intermediate geometry. We evaluate LLMSeg across ten referring and reasoning segmentation splits (ReasonSeg and RefCOCO/+/g). We also evaluate open-vocabulary instance segmentation (LVIS, COCO, and SA-Co), semantic segmentation, and zero-shot detection (ODinW13 and RF-100VL). With an off-the-shelf Gemini-3.7-Flash backend, LLMSeg is competitive with and often surpasses the specialist SAM 3 model on identical items. It reaches 71.5 cIoU on ReasonSeg val without additional segmentation-specific training. Backend model updates can improve accuracy without retraining the pipeline. The code is available at https://abdullahamdi.com/llmseg . + + + 2026-10-21T08:35:16Z + preprint + + + Abdullah Hamdi + + + + http://arxiv.org/abs/2610.29231v2 + DisasterRoute: Evidence-Guided Dual-System Routing for Visual Disaster Question Answering + 2026-10-23T05:34:13Z + + + Visual question answering from low-altitude UAV imagery must deliver timely and accurate judgments to support disaster response under limited edge computing resources. Routine questions may be answered through direct decisions, whereas more challenging questions may benefit from step-by-step reasoning. However, existing research primarily focuses on improving models' visual understanding and generative reasoning capabilities, with limited exploration of efficient direct decision-making and its adaptive coordination with generative reasoning. We develop Disaster-S1 based on a vision-language model adapted to the disaster domain. Trained for option discrimination, it outputs a probability distribution over answer options in a single multimodal forward pass for fast decision-making. We further propose DisasterRoute, a dual-system routing framework that combines prediction confidence with disaster evidence to decide whether to accept the initial answer or invoke the disaster reasoning model DisasterVL for review. By allocating inference computation on demand, the framework retains the efficiency of direct decision-making and improves overall question-answering accuracy through selective review. Experiments on DisasterBench show that Disaster-S1 achieves superior accuracy with low latency, while DisasterRoute further improves accuracy through selective review at substantially lower latency than full reasoning. + + 2026-10-21T05:41:44Z + Technical report; follow-up study to DisasterBench; this version is not intended for conference or journal submission + + + Tan Zhang + + + Xing Deng + + + Lu Zhang + + + Xiaofeng Zhu + + + Ping Hu + + + + http://arxiv.org/abs/2610.29174v1 + LocalAgent: Collaborative Agentic Verification for Fine-Grained Instance-Level Consistency + 2026-10-21T04:04:32Z + + + Multimodal large language models (MLLMs) have made rapid progress in general visual understanding, yet they still struggle with fine-grained instance-level consistency verification, where the goal is to determine whether two images depict the exact same physical object under varying viewpoints, illumination, and backgrounds. This task requires both global semantic perception and precise examination of subtle local evidence, since semantically similar objects may differ only in small suspicious regions. To address this challenge, we propose LocalAgent, a collaborative agentic framework that integrates the complementary strengths of a generalist MLLM and lightweight specialist verifiers. The MLLM first reasons globally to identify suspicious local regions, which are then delegated to a Local Evidence Verifier (LEV) toolkit for fine-grained appearance and geometric matching. LEV comprises Local Appearance Consistency (LAC), which estimates appearance similarity under illumination and color changes, and Local Geometric Correspondence (LGC), which estimates spatial correspondence under viewpoint changes. LEV returns structured scalar evidence that the MLLM integrates for the final decision. We further introduce an auxiliary-capped reinforcement fine-tuning (RFT) strategy, in which answer correctness dominates auxiliary tool-use and format signals, enabling the policy to learn when verification is necessary. Experiments show that LocalAgent improves mean accuracy by 4.9% over the strongest CoT-RFT baseline while invoking a verifier on only 12.13% of samples and preserving the general multimodal capabilities of the underlying MLLM. The open-source repository is available at https://github.com/Firefly-zoo/LocalAgent-main. + + 2026-10-21T04:04:32Z + 22 pages, 4 figures + + + Jiachen Guo + + + Xinshan Zhu + + + Boyun Wang + + + Yanyan Liang + + + Jun Wan + + + Feng Lin + + + Ajian Liu + + + + http://arxiv.org/abs/2610.28964v1 + Can Quantum Layers offer Performance and Security Advantages in Vision-Language Models? + 2026-10-20T22:28:17Z + + + As quantum computing moves from the noisy intermediate-scale quantum (NISQ) era toward early fault-tolerant quantum computing (EFTQC), quantum-enhanced AI is shifting from a conceptual idea to experimental research. Quantum components are expected to extend the capabilities of existing AI systems, yet it remains unclear how such components will help within large multimodal models. In this study, we try to answer that question for vision-language models (VLMs) using classically simulated quantum layers. With LLaVA-OneVision as the backbone, we evaluate 4- and 8-qubit basic-ring and strongly entangling circuits at four insertion and four replacement locations. Insertion adds quantum layers to the classical model, while replacement substitutes them for classical components. Using the same setup, we compare performance and computational cost between classical and quantum-classical hybrid models. On the Visual Spatial Reasoning dataset, inserting a quantum layer after the visual projector reaches 80.7% development accuracy, 2.28 percentage-points above classical full fine-tuning. Replacing the final decoder feed-forward sublayer retains 79.22% accuracy with 13.07 million fewer trainable parameters. Quantum insertion can thus improve accuracy, and selective replacement can reduce parameters. These benefits depend strongly on where the quantum layer is inserted or which classical component it replaces: earlier replacements lower accuracy, and fewer parameters do not reliably shorten training or reduce computation. To assess potential security benefits, we evaluated the robustness of quantum-classical hybrid models under six attack settings. Overall, our study maps where quantum layers help and hurt within VLMs, offering a starting point for hybrid VLM design; whether these gains generalize remains open. The code is available at https://github.com/TITANS-Lab-Artifacts/QuantumVLM. + + + + + 2026-10-20T22:28:17Z + + + Md Khalid Syfullah + + + Alvi Ataur Khalil + + + + http://arxiv.org/abs/2610.28801v1 + JUICE: Unified Multimodal Modeling in Pretrained Representation Spaces + 2026-10-20T18:25:09Z + + + Most unified multimodal models treat images and text asymmetrically: a pretrained language model generates text, an attached diffusion head generates images, and outputs that contain both are produced in a fixed order, so the first output cannot adapt to the second. We ask whether both modalities can instead be generated by one process that is trained on them jointly from scratch. Pretrained encoder spaces hold both modalities in one continuous form and carry knowledge learned at scale, and recent work finds them effective as generative targets for vision and language. We therefore model the joint distribution directly in these spaces. We introduce JUICE (Joint Unified multimodal modeling In Continuous Encoder spaces), a single flow matching Transformer over frozen image and text representations, in which each modality has its own noise level. Which modalities are clean and which are generated then decides the task: image generation, captioning, visual question answering, or joint generation. Controlled pretraining runs test each design choice. At equal guidance, generating text as continuous states leaves image generation intact (48.41 GenEval, against 47.86 for a model trained only for text-to-image generation), while captions lose some exact wording. Training on joint and conditional denoising together beats either alone, and semantic encoder spaces beat VAE latents and raw pixels as targets. At 2.1B parameters, with no language model initialization and at 224x224, JUICE reaches up to 0.88 on GenEval and 73.1 on VQAv2. By sampling both modalities from the joint distribution (coupled sampling), it can also draw a route on a map while writing out the matching moves. On mazes with several valid solutions, joint success rises from 54.6% with independent sampling to 93.7%, and no modality has to go first. On visual spatial planning, JUICE solves 99.8% of maps at its training sizes. + + 2026-10-20T18:25:09Z + 69 pages, 31 figures, 37 tables. Project page: https://ced3-han.github.io/JUICE-Website/ Code: https://github.com/Ced3-han/JUICE-Code Weights: https://huggingface.co/collections/CedLJH/juice + + + Jiahan Li + + + Huangyuan Su + + + Shengbang Tong + + + Shusheng Yang + + + Ruihan Guo + + + Suozhi Huang + + + Hexu Zhao + + + Pratyusha Sharma + + + Sherry Yang + + + Jiatao Gu + + + Rob Fergus + + + Kyunghyun Cho + + + + http://arxiv.org/abs/2610.28416v1 + Code2Video-Compass: A Comprehensive Benchmark for General-Purpose Code-Based Video Generation across T2V, I2V, and V2V + 2026-10-20T15:51:41Z + + + Code-based video generation offers fine-grained control, targeted editing, and component reuse compared with direct video generation. This approach requires multimodal large language models (MLLMs) to translate visual and temporal requirements into executable programs that produce complete videos. However, existing code-based benchmarks primarily target specialized tasks, leaving complete video creation across diverse creative categories and input modalities insufficiently evaluated. We introduce Code2Video-Compass, a general-purpose benchmark for code-based video generation across text-to-video (T2V), image-to-video (I2V), and video-to-video (V2V) settings. Code2Video-Compass comprises 2,104 tasks spanning 10 categories, 24 subtypes, and three complexity dimensions covering construction, dynamic animation, and state dependency. It combines tasks curated from textual instructions and visual references with corresponding T2V, I2V, and V2V tasks derived from complete professional and user-created videos. We propose a dual-level evaluation framework combining 12 objective metrics and five subjective metrics. Objective evaluation covers operational performance, video quality, text-video alignment, and reference fidelity, while subjective evaluation uses an MLLM judge to evaluate instruction following and holistic video quality. Extensive evaluation of 15 recent proprietary and open-weight MLLMs from nine families reveals that even leading models face challenges in reliably generating high-quality complete videos aligned with textual and visual requirements, with performance generally declining as construction, dynamic animation, and state-dependency complexity increases. We anticipate that Code2Video-Compass will advance reliable, coherent, and controllable code-based video generation and inspire broader progress in programmatic visual creation. + + + 2026-10-20T15:51:41Z + + + Zhenghan Chen + + + Zekai Shao + + + Xin Lin + + + Leting Cheng + + + Siming Chen + + + + http://arxiv.org/abs/2610.28382v1 + RACE: Learning Multimodal Search through Referential Abstraction and Compositional Evidence + 2026-10-20T15:33:24Z + + + Training multimodal search agents requires tasks that make visually grounded search necessary for determining the answer. Textual identity clues and unused target evidence allow shortcuts in synthetic questions, weakening supervision for visual search and evidence integration. We propose RACE, an image-conditioned task synthesis framework that constructs dependencies from images to targets and from target-specific evidence to answers. Referential Abstraction (RA) replaces identity-revealing text with specific visual references or ambiguous relational references resolved by searching among depicted candidates. Compositional Evidence (CE) links retrieved facts about multiple entities in one image or entities from different images into joint questions whose answers require every designated contribution. Both operations also apply to images found during search, allowing new visual observations to determine subsequent search targets or supply answer evidence. Fine-tuning Qwen3.5-27B on only 12K teacher-generated trajectories from RACE raises average accuracy across ten multimodal benchmarks from 53.5 to 56.0, a relative improvement of approximately 4.7% over the matched base agent. Our code, data, and model will be publicly available. + + 2026-10-20T15:33:24Z + + + Eric Tao + + + Minhao Sun + + + Liyan Liu + + + Zhijing Wu + + + Xiaohan Yu + + + Lang Mei + + + Li Huang + + + Chao Feng + + + Jinchao Ma + + + Sichen Kang + + + Siyu Mo + + + Chong Chen + + + + http://arxiv.org/abs/2610.28356v2 + CountVideoBench: A Benchmark to Evaluate Prediction Biases on the Object Counting task by Video-Language Models + 2026-10-21T11:52:51Z + + + Object counting in videos remains a poorly characterized capability of multimodal large language models. Counting questions are included in many existing VideoQA benchmarks, but the ground-truth count distributions in these benchmarks are heavily skewed toward small values. Across the nine benchmarks we survey, the median ground-truth count is at most five, and the three most frequent values together account for between 45% and 93% of the videos. The resulting mean accuracy is then dominated by the most frequent counts; a value-dependent bias at a rare count contributes negligibly to the average and remains invisible. We introduce CountVideoBench, a benchmark of 2,600 synthetic videos covering 26 cardinalities in the interval [5, 50] (100 videos each), grouped into six clusters of consecutive counts that span the range while enabling near-neighbor comparisons. Each video contains a single class of static objects under a controlled camera motion, removing object motion and reducing recognition as confounds. We evaluate sixteen video-language models from nine architecture families in a zero-shot setting. No model exceeds 27.6% Exact Match. The dependence of accuracy on cardinality varies across models, ranging from monotonic decline to a non-monotonic peak-and-collapse pattern, which rules out increasing difficulty with cardinality as the dominant explanation of counting failure. Every model further concentrates its predictions on its own set of preferred integers, with accuracy peaks coinciding with these values and collapsing at adjacent counts. These findings highlight the need for balanced, diagnostic counting benchmarks to reliably assess this fundamental visual capability. + + + + 2026-10-20T15:20:28Z + Accepted at BMVC 2026. Project page: https://countvideobench.github.io + + + Marc Chapus + + + Carlos Crispim-Junior + + + Véronique Eglin + + + Atilla Baskurt + + + + http://arxiv.org/abs/2610.28282v1 + ChartEvo: Self-Evolving Agent Harnesses for Long-Tail Chart Reasoning + 2026-10-20T14:34:54Z + + + Multimodal large language models (MLLMs) have substantially advanced chart understanding and reasoning, yet their performance remains highly uneven across chart types. While modern MLLMs perform well on common charts, their accuracy drops sharply on long-tail charts with diverse visual structures and reasoning requirements. Tool-augmented agents can improve complex chart reasoning by introducing specialized visual capabilities, but manually engineering strategies and tools for the heterogeneous and evolving long tail is difficult to scale. We introduce \textbf{ChartEvo}, a recursive self-improvement framework that enables chart agents to adapt to underperforming chart types through experience-driven harness-level self-improvement. ChartEvo jointly evolves reusable chart-specific Skills and executable Tools, while learning reusable local tool-call chains to compose evolved capabilities and control the inference overhead of tool-augmented reasoning. On long-tail charts from ChartBench and ChartX, ChartEvo improves accuracy over its base MLLM, Qwen3.7-Plus, by \textbf{45.6\%} and \textbf{32.5\%}, respectively, demonstrating the effectiveness of recursive self-improvement for long-tail chart adaptation. + + + 2026-10-20T14:34:54Z + + + Qi Wang + + + Peijie Wang + + + Jun Cao + + + Haoyang Tong + + + Xiao-Hui Li + + + Fei Yin + + + Cheng-Lin Liu + + + + http://arxiv.org/abs/2610.28266v1 + VGL-stGen: Learning a shared multimodal model for lung histology and spatial transcriptomics + 2026-10-20T14:22:47Z + + + VGL-stGen is a multimodal large language model adapted from a pretrained medical vision-language model using paired lung H&E and spatial transcriptomics with single-cell references. Training integrates image-expression and expression-cell-type pairs, and gene-conditioned pseudo-labels transfer transcriptomic cell-type supervision to histology images. One deployed checkpoint supports thirteen evaluated tasks spanning tissue and cell-type classification, gene prediction and conditional expression completion from combinations of histology, cell identity and observed gene expression. Task-specific decoding produces categorical labels, gene lists and structured expression levels. For conditional completion, fixing queried gene identities and predicting their levels autoregressively improves structured prediction. Controlled adaptation shows that restricting supervision to requested expression-level tokens can further improve image-conditioned completion. Image-permutation experiments indicate that correctly paired histology adds information beyond observed expression. External classification relies partly on computational references with shared annotation lineage, and some H&E sources were exposed during cancer training or model development. Within these conditions, VGL-stGen demonstrates how a medical vision-language backbone can learn from spatial transcriptomics and histology to connect tissue morphology and molecular states through shared generative modeling. + + + + 2026-10-20T14:22:47Z + 46 pages, 18 figures, 16 tables; appendix included + + + Haenara Shin + + + Dongjoo Lee + + + Sungwoo Bae + + + Kwon Joong Na + + + Daeseung Lee + + + Hongyoon Choi + + + + http://arxiv.org/abs/2610.28264v1 + PI-MLLM: Psychophysics-Inspired Multimodal Large Language Model for Oddly Satisfying Video Emotion Analysis + 2026-10-20T14:20:39Z + + + Oddly Satisfying Videos (OSVs) can evoke strong viewer responses through repetitive motion, visual tactility, and ASMR-like sounds despite containing few explicit semantic emotion cues. This makes OSVs a challenging setting for Video Emotion Analysis (VEA), since most existing methods focus on semantic video content and under-model the physical sensory dynamics that shape viewer responses. To support Oddly Satisfying Video Emotion Analysis (OSVEA), we construct the Oddly Satisfying Video Dataset (OSVD), comprising 12,000 annotated 5-second clips. Each clip provides viewer-emotion labels under video-only, audio-only, and audio-visual conditions, together with explanations grounded in visual and acoustic sensory evidence. Building on OSVD, we propose PI-MLLM, a psychophysics-inspired multimodal large language model that integrates Modality-Specific Dynamics Alignment (MSDA) and Coalition-Based Audio-Visual Attribution (CAVA). MSDA uses auxiliary prediction objectives to align modality representations with visual motion and acoustic energy-onset dynamics. CAVA evaluates emotion scores across modality coalitions and applies Shapley attribution to identify the dominant modality and determine whether visual and auditory evidence is synergistic or conflicting. Experiments show that PI-MLLM improves both viewer-side emotion prediction and sensory-grounded explanation quality, suggesting the value of physical sensory cues to video emotion analysis. + + + 2026-10-20T14:20:39Z + 12 pages, 5 figures, 8 tables; includes supplementary material + + + Yuheng Zhang + + + Jie Zhang + + + Yuecong Min + + + Yunwei Zhao + + + Meichen Liu + + + Qiankun Li + + + Shiguang Shan + + + + http://arxiv.org/abs/2610.28129v1 + GAMF-Net: Grouped Availability-Aware Multimodal Fusion for Smartphone Skin Lesion Classification + 2026-10-20T12:35:39Z + + + Smartphone clinical images provide a low-cost data source for computer-aided skin lesion classification in resource-constrained settings, but images alone cannot fully capture patients' medical histories and lesion symptoms. To address the lack of structured organization among heterogeneous clinical variables, the ambiguity between observed and imputed values, and the risk that clinical information may interfere with visual evidence, we propose GAMF-Net, a grouped availability-aware multimodal fusion network. Ten clinical variables are divided into three semantic groups---demographics, history-related risk, and lesion presentation---and each group jointly encodes field values and field-level availability masks. The image branch produces the base classification logits, while each clinical group generates image-conditioned class-level residual evidence. Only available groups participate in availability-normalized equal-weight fusion; when all clinical information is unavailable, the model reduces exactly to the image-only pathway. We evaluate the method on PAD-UFES-20 under a patient-disjoint five-fold protocol with separate training, validation, and test partitions. GAMF-Net achieves an Accuracy of $74.17\pm2.85\%$, a balanced accuracy (BACC) of $70.11\pm2.11\%$, a Macro-F1 of $68.85\pm0.85\%$, and a Macro-AUROC of $93.42\pm1.20\%$, outperforming all image-only and multimodal baselines reimplemented under a unified protocol. Compared with the strongest baseline, MetaBlock, the corresponding improvements are 2.37, 2.59, 4.14, and 1.02 percentage points, respectively. Ablation results show that clinical information substantially improves class-balanced performance, constrained equal-weight fusion is more effective than dynamic fusion, and the lesion-presentation group provides the most informative clinical complement. + + 2026-10-20T12:35:39Z + 14 pages, 4 figures. Accepted at MMM 2027 + + + Yue Zhuo + + + Jingjia Yan + + + Fangyu Liu + + + Lingjun Liu + + + Zongjun Chen + + + Zhisheng Luo + + + Zhonghua Xie + + + + http://arxiv.org/abs/2610.28087v2 + WildAIGC-Bench: Can AI Image Detectors Handle the Wild? A Benchmark of Generated and Edited Images in Online Circulation + 2026-10-22T08:50:02Z + + + AI-generated images linked to news events and online claims can mislead audiences, enable fraud, or cause public controversy. We introduce WildAIGC-Bench, built through recurring collection across news websites, fact-checking sources, and related social media content. The pipeline combines broad coverage, timely updates, and human-verified labels through scheduled discovery, automatic screening and preliminary annotation, and human review of image-specific evidence. The benchmark contains 407 verified AI-generated or edited images, each accompanied by a source webpage link and an evidence summary. Images retain the conditions encountered online, including compression, screenshots, and recapture. Evaluation of dedicated visual detectors, multimodal large language models, and a simple Perception Encoder baseline reveals substantial recall gaps relative to existing benchmarks. WildAIGC-Bench provides both a practical detection challenge and a basis for continued data expansion and source-based verification. The dataset is released at https://github.com/YuZijian/WildAIGC-Bench. + + 2026-10-20T12:07:16Z + 19 pages, including references and supplementary appendix + + + Zijian Yu + + + Hangwei Zhang + + + Jun Lan + + + Huijia Zhu + + + Weiqiang Wang + + + Jianfu Zhang + + + + http://arxiv.org/abs/2610.27999v1 + Matrix-Game 4.0: Harnessing Video Models for Real-Time Playable Game Worlds + 2026-10-20T10:41:38Z + + + Moving from controllable videos to genuinely playable worlds requires persistent world state, executable game rules, and low-latency interaction. We outline a roadmap for the next generation of Matrix-Game that separates game execution from visual generation through an executable game harness, and introduce Matrix-Game 4.0 as the first system built on this design. A lightweight game engine maintains world state and executes interaction rules, a multimodal coding agent translates player ideas into game code and dynamic scene captions, and a renderer based on autoregressive video model transforms engine-rendered low-poly proxies into detailed visuals, conditioned on dynamic captions and memory references. This framework provides continuous guidance for visual generation and enables natural-language creation and modification of scenes and gameplay. Our renderer is trained on aligned low-poly and high-fidelity video pairs and distilled into a causal generator that generates in four-frame chunks with one or two denoising steps. Together with targeted inference optimizations, Matrix-Game 4.0 enables 480p, 60 FPS gameplay on a single NVIDIA RTX5090 with a key-press-to-display latency of 112ms. Single-step generation achieves 83FPS steady-state throughput with 18.2GiB of peak GPU memory usage. With fixed prompts, steady-state throughput also reaches 67FPS on an RTX5080 and 58FPS on an RTX5070Ti. We demonstrate customizable shooter and driving games with engine-enforced mechanics, and release code, model weights, and low-poly game assets to support research and creation of playable game worlds. + + + 2026-10-20T10:41:38Z + Project page, videos, code and models: https://matrix-game-v4-0.github.io/page/ + + + Jihai Zhang + + + Runjia Qian + + + Kaiqin Kong + + + Biao Jiang + + + Puyi Wang + + + Siru Chen + + + Tianle Li + + + Guanjie Chen + + + Junyi Wu + + + Chubin Chen + + + Yuanhang Li + + + Kaichen Huang + + + Haobo Zhang + + + Yangguang Li + + + Wei Yu + + + Guibin Chen + + + Yu Cheng + + + Yahui Zhou + + + + http://arxiv.org/abs/2610.27974v1 + Media Intelligence Platform: Multimodal Detection of Synthetic and Manipulated Content + 2026-10-20T10:18:49Z + + + The rapid progress of generative artificial intelligence has led to a significant increase in manipulated multimedia content, including synthetic faces, forged videos, AI-generated images, fake audio, and locally edited images. Existing detection approaches are typically designed for a single manipulation type, limiting their applicability in real-world scenarios involving heterogeneous media sources. In this work, we present the Media Intelligence Platform (MIP), a unified web-based framework for multimodal media forensics integrating specialized modules for fake video detection, face morphing detection, AI-generated image detection, audio deepfake detection, localized image manipulation detection, and text analysis. Its modular architecture enables flexible integration of heterogeneous models and supports future extensions for emerging manipulation techniques. Experimental results on representative benchmark datasets demonstrate reliable detection performance across multiple media modalities while providing a practical and user-friendly interface for forensic investigations. The platform highlights the potential of unified multimodal systems for comprehensive deepfake detection in real-world environments, and is accompanied by a public demonstrator released with this workshop submission to support reproducibility and community evaluation. + + + 2026-10-20T10:18:49Z + ECCV 2026, Workshop on AI for Multimedia Forensics & Disinformation Detection (AI4MFDD2026) + + + David Fischinger + + + Marcel Hasenbalg + + + Silvia Poletti + + + Davide Antonutti + + + Mina Schütz + + + Lam Pham + + + Justin Ilyes + + + Péter Rjabcsenkó + + + Simon Freitter + + + Martin Boyer + + + + http://arxiv.org/abs/2610.27904v1 + Staged Continual Adaptation of Multimodal Foundation Models for Japanese Financial Documents + 2026-10-20T09:19:36Z + + + Staged post-training of multimodal foundation models chains vision-language alignment, reasoning distillation, and domain tuning, yet how each phase trades capabilities against the others remains under-characterised. Tracking an 8.4B-parameter model from an un-fine-tuned baseline through three training phases on Japanese financial documents (evaluated on five text-input benchmarks), we find the phases interact non-additively: math-only distillation overwrites the financial knowledge acquired earlier even as procedural math skill survives, and the domain phase repairs more than it installs. A skip-phase ablation is best for domain knowledge but forfeits numerical-reasoning gains, so per-phase contributions are not decomposable and the best checkpoint is task-dependent, with implications for checkpoint retention and scheduling rather than added stages. + + + + 2026-10-20T09:19:36Z + 17 pages, 10 figures, 9 tables. Presented at the ICML 2026 Workshop "Continual Adaptation at Scale: Towards Sustainable AI". Code: https://github.com/AtsushiYanaigsawa768/Compass + + + Genshin Kakimoto + + + Atsushi Yanagisawa + + + + http://arxiv.org/abs/2610.27894v1 + Testing Associative Creativity in Humans and Multimodal LLMs with Difficult-to-Name Visual Stimuli + 2026-10-20T09:13:16Z + + + We investigate associative creativity in descriptions of abstract visual stimuli by humans and multimodal large language models (MLLMs). While conceptual association is central to human communication, it remains unclear how humans and models adapt when visual stimuli become increasingly difficult to map onto familiar semantic concepts. We evaluate several state-of-the-art MLLMs and human participants along two dimensions of creativity, originality and effectiveness, using two datasets with controlled manipulations of difficulty. SilCC varies naming difficulty through progressively more complex combinations of abstract shapes, and PixCC varies difficulty through increasing levels of random visual noise. Results show that humans produce more diverse associative descriptions than MLLMs, including greater semantic distance, higher entropy, and more novel expressions relative to reference lexica. As difficulty increases, effectiveness declines in SilCC, and humans increasingly shift from holistic associations to descriptions of low-level visual properties in PixCC. + + + 2026-10-20T09:13:16Z + Under review + + + Manar Ali + + + Lisa Gottschalk + + + Simeon Junker + + + Lisa Hudalla + + + Alon Fishman + + + Joana Cholin + + + Stefan Kopp + + + Hendrik Buschmeier + + + Sina Zarrieß + + + + http://arxiv.org/abs/2610.27829v1 + GARRET: Generative Feedback for Region Retrieval in Visual Documents + 2026-10-20T08:19:14Z + + + Multimodal retrieval-augmented generation over visually rich documents requires evidence at a finer granularity than entire pages. Existing visual retrievers typically index or return full pages, whereas training region-level retrievers often requires costly query-to-region annotations or noisy model-generated labels. We introduce GARRET, a region-retrieval framework trained from (page, question, answer) triplets through differentiable generative feedback. A shared context-preserving retriever produces page and region multi-vector representations. During training, their retrieval scores define a soft routing distribution over candidate region crops. An auxiliary vision-language model attends to each crop separately, aggregates crop-specific contexts using the routing weights, and predicts the question followed by the answer under a next-token prediction objective. Gradients through the routing distribution assign query-conditioned credit to the indexed region representations, without requiring query-to-region annotations. At inference, the auxiliary model is removed. GARRET also reuses the contextualized region representations, together with page summary tokens, to construct a compact page representation. We introduce ViDoRe-V3-Region, a corpus-wide benchmark containing 200,682 fixed candidate regions across eight domains. GARRET achieves a macro nDCG@10 of 0.4126, outperforming the strongest visual baseline by 2.94 points. On page retrieval, it remains comparable to ColQwen2.5-v0.2 while indexing 47.8% fewer vectors per page. + + + 2026-10-20T08:19:14Z + 28 pages, 7 figures, including appendices + + + Weijian Jian + + + Siyang Chen + + + Yuguang Yang + + + Yajun Zhang + + + Chunyu Xie + + + Dawei Leng + + + Yuhui Yin + + + + http://arxiv.org/abs/2610.27782v1 + RoboJudge: Multimodal Language Models as Judges for Embodied Video Generation + 2026-10-20T07:48:41Z + + + Video generation models are promising foundations for embodied world models, but only if their generated rollouts are physically valid and faithful to task instructions. Multimodal large language models (MLLMs) are increasingly used to judge these properties, yet their agreement with human judgments on embodied videos has not been systematically evaluated. To address this gap, we introduce RoboJudge-Bench, a benchmark for evaluating MLLMs as judges of embodied video generation. The benchmark measures two fundamental dimensions, Physical Adherence and Instruction Alignment, across 800 human-annotated videos from 8 source corpora and 10 video generators, spanning grippers, human hands, and dexterous hands. Experiments reveal uneven alignment between existing judges and human ratings: general-purpose MLLMs show lower agreement on physical adherence, while specialized video judges designed for general-domain physical reasoning do not consistently transfer to embodied scenarios. Motivated by these findings, we construct RoboJudge-Train, comprising 12K videos annotated with 25K human-verified scores and model-assisted rationales for Physical Adherence and Instruction Alignment. We fine-tune a 9B MLLM on this dataset with supervised learning followed by reinforcement learning, yielding RoboJudge-9B. Among the model judges evaluated on RoboJudge-Bench, RoboJudge-9B achieves the highest overall agreement, reaching a Pearson correlation of 0.719 with a statistically significant 0.089 gain over Gemini-3.7-Flash, the best-performing proprietary baseline in our evaluation. Training on RoboJudge-Train also yields gains on external benchmarks, including VideoPhy2 and Physion-Eval. We further use RoboJudge-9B as a downstream evaluator to benchmark video generation models according to Physical Adherence and Instruction Alignment. + + + 2026-10-20T07:48:41Z + Project page: https://spherelab.ai/RoboJudge + + + Siyuan Ma + + + Yu Qi + + + Cheng Ye + + + Ruotian Peng + + + Xinyi Xu + + + Zitiantao Lin + + + Zedong Cai + + + Yijian Huang + + + Weiyang Liu + + + Siyuan Wang + + + Yandong Wen + + + + http://arxiv.org/abs/2610.27692v1 + A Principled Optimal Transport Framework for Frame Selection in Long Video Understanding + 2026-10-20T06:12:30Z + + + Long-video understanding with multimodal LLMs is fundamentally constrained by the mismatch between video length and the model's limited visual context budget, making frame selection essential for practical reasoning. Existing query-aware methods typically rely on heuristic pipelines: they assign one-dimensional query-conditioned scores to frames and then apply sampling, ranking, or extraction rules to form the final subset. While effective in practice, such methods are generally not derived from an explicit optimization objective and struggle to capture the heterogeneous evidence required for complex reasoning. In this paper, we revisit long-video frame selection from a principled optimization perspective. We formulate it as a structured evidence-allocation problem and propose OTFS, an optimal transport framework that maps multiple evidence sources onto video frames. To reflect the asymmetry of this problem---important evidence should be preserved, whereas redundant frames need not absorb mass---we instantiate this view with a semi-unbalanced entropic optimal transport objective and an efficient solver, OTFS-Sinkhorn. Combined with an exact dynamic program for coverage-aware subset extraction, OTFS yields a practical two-stage training-free pipeline. We further show that, in the single-source case, our formulation induces a Gibbs-type distribution over frames, making Q-Frame's temperature-scaled distribution a special case of our framework while also providing a broader perspective for understanding related prior methods. Experiments on three long-video understanding benchmarks show that OTFS consistently outperforms strong training-free baselines. Codes are available at https://github.com/barry664/OTFS. + + 2026-10-20T06:12:30Z + Accepted by NeurIPS 2026 + + + Ziwei Zhao + + + Yuhang Liu + + + + http://arxiv.org/abs/2610.27657v1 + PLaCA: Learning Patch-Level Future Latent Change for Action Generation + 2026-10-20T05:15:35Z + + + Vision-Language-Action (VLA) models generate robot actions from visual observations and language instructions, but effective manipulation also requires anticipating how the environment will change. Existing world-action models explore future image prediction and latent dynamics modeling. However, generating complete future images can be computationally expensive, while highly compressed latent representations may obscure local changes. To address these challenges, we propose PLaCA, a world-to-action framework built around future latent change. PLaCA directly predicts spatially structured patch-level future latent change from the current multimodal input, preserving local information about expected environmental changes. We introduce patch-level change-aware supervision to emphasize regions undergoing larger changes and a future-to-action interface that explicitly incorporates predicted future latent change into action generation. Experiments on LIBERO-Long show that PLaCA achieves a 79.0% success rate, improving upon the Action-only baseline by 5.0 percentage points. On CALVIN, PLaCA improves the average sequence length from 2.784 to 3.564. These improvements are achieved while updating only 2.95% of the model parameters during the second training stage, demonstrating the effectiveness of future latent change modeling for downstream robotic manipulation. + + + 2026-10-20T05:15:35Z + + + Zhan Yi + + + Yuchen Wang + + + Chao Li + + + Lei Hong + + + Boyuan Yang + + + + http://arxiv.org/abs/2610.27571v2 + Text-Anchored Modality Experts with Uncertainty-Guided Routing for Multimodal Sentiment Analysis + 2026-10-21T02:07:53Z + + + Multimodal sentiment analysis (MSA) aims to understand user-generated videos by integrating multiple modalities. Existing methods often treat modalities as symmetric, overlooking the fact that language provides a dominant semantic prior while nonverbal signals are complementary and noise-prone. To address this, we propose a Text-Anchored Modality Experts with Uncertainty-Guided Routing, termed TAME, that reformulates MSA as an uncertainty-guided refinement paradigm, where the language prior is calibrated and enhanced by selectively trusted nonverbal evidence. Specifically, TAME adopts an asymmetric Mixture-of-Modality-Experts framework, in which textual features act as a fixed and always-activated shared expert, while audio-textual and video-textual cross-modal branches serve as dynamically routed auxiliary experts. Furthermore, we introduce lightweight Prophet Heads to quantify the sample-level predictive uncertainty of each individual modality, and this uncertainty metric is further incorporated into the modality router to realize reliability-aware expert aggregation and fusion. Experiments on CMU-MOSI, CMU-MOSEI, and CH-SIMS datasets demonstrate that TAME achieves state-of-the-art performance on the majority of metrics while reducing parameter count by up to 78.7% and FLOPs by up to 41.2% over the mixture-of-expert baseline. + + 2026-10-20T03:39:51Z + 10 pages, 1 figure + + + Xiaohua Huang + + + Bingrui Lei + + + Xiuyan Shao + + + Ling Zhou + + + Yuan Zong + + + Wenming Zheng + + + Guoying Zhao + + + + http://arxiv.org/abs/2610.27565v1 + AnomalyJev: Towards Evaluating Image Anomaly Explanations via Claim-Level Verification + 2026-10-20T03:29:08Z + + + Recent multimodal LLM (MLLM)-based anomaly detection (AD) methods can generate textual explanations that help interpret their predictions. However, reliably and efficiently evaluating these explanations remains challenging. While LLM judges can assess explanations through structured rubrics, they often require substantial token generation, making evaluation costly and difficult to scale. We instead propose to anchor evaluation in the available ground truth by extracting verifiable claims from each explanation and verifying them against the corresponding annotations. We instantiate this idea as AnomalyJev, a lightweight framework that extracts verifiable claims from contextualised representations using ground-truth-defined queries and pointer based heads, without token generation. The claims are then verified against the ground truth to score faithfulness and completeness. For evaluation, we construct a human-annotated set of 640 explanations with over 1,600 expert ratings across in-domain and cross-dataset settings. Despite its compact design, AnomalyJev achieves stronger agreement with human annotators than most open MLLM judges and approaches that of flagship MLLM judges, at a fraction of their runtime and resources. + + + + 2026-10-20T03:29:08Z + + + Qizhou Wang + + + Jiawen Zhu + + + Guansong Pang + + + Christopher Leckie + + + + http://arxiv.org/abs/2610.27521v1 + Multiscale Temporal-Spectral-Spatial EEG Learning With Modality-Specific and Modality-Invariant Representations for Emotion Recognition + 2026-10-20T02:35:16Z + + + Multimodal physiological signals provide complementary cues for emotion recognition. They also raise two related challenges. Emotion-related EEG patterns vary across time, frequency bands, electrodes, and brain regions. Different physiological modalities also contain both modality-specific and shared affective information. This paper presents GMSI-Net, an EEG-centered multimodal emotion recognition framework. It has three key components. The temporal-spatial-spectral-region (TSSR) encoder models multiscale temporal-channel patterns, differential entropy features, and local-to-global brain-region relations. The modality-specific representation (MSR) branch uses bidirectional cross-modal attention and learnable gates. It controls information transfer while retaining modality-specific cues. The modality-invariant representation (MIR) branch learns a shared affective representation. An adaptively weighted contrastive loss aligns this representation across modalities. Independent multiscale Conv-Transformer encoders process the peripheral physiological signals. GMSI-Net is evaluated on DEAP and MAHNOB-HCI using within-subject random ten-fold cross-validation. The model reaches 96.21 (1.47) and 96.41 (1.60) for valence and arousal on DEAP. It reaches 94.10 (2.86) and 94.48 (3.77) on MAHNOB-HCI. These results indicate that combining EEG features with complementary physiological information can improve emotion recognition. + + 2026-10-20T02:35:16Z + + + Jian Zhang + + + Manrong Liu + + + Yilei Huang + + + Wenhua Liu + + + Xiaohui Yang + + + Lijun Yang + + + + http://arxiv.org/abs/2610.27360v1 + On the Limits of Scale: Inverse Scaling in Vision-Language Models + 2026-10-19T22:39:42Z + + + Scaling laws suggest that increasing model size, training data, and compute generally yields monotonic performance improvements. While this often holds at the aggregate level, we present systematic evidence that vision-language models (VLMs) exhibit inverse scaling at the subtask level: specific question categories on which larger models perform worse than smaller counterparts within the same model family. We evaluate 19 models from four distinct model families across eight multimodal benchmarks (nine evaluation splits), answering 29,386 questions per model, 558,334 model-question evaluations in total. Using per-question pairwise analysis across all model pairs in each family, we identify 375 subtask-model-pair combinations exhibiting inverse scaling, spanning 4,342 unique queries where a smaller model answers correctly but a larger model fails, and we find that these patterns replicate across independently developed architectures. We identify 13 subtask-dataset pairs that show inverse scaling across multiple families, consistent with the phenomenon being task-driven rather than model-specific. The most affected domains in our study include multi-image spatial reasoning, visual perception, and university-level STEM knowledge, with accuracy gaps exceeding 20 percentage points in several cases, while diagram understanding appears comparatively resistant. These findings challenge the assumption that increasing model size uniformly improves multimodal capabilities and suggest that model selection should be task-aware. + + + 2026-10-19T22:39:42Z + + + Rohit Saxena + + + Alessandro Suglia + + + Marek Rei + + + Pasquale Minervini + + + + http://arxiv.org/abs/2610.27341v1 + Look Before You Reason: Implicit Visual Thinking for Efficient Multimodal Reasoning + 2026-10-19T22:11:24Z + + + Vision-language models (VLMs) have advanced rapidly in multimodal reasoning, yet they remain limited on tasks requiring fine-grained understanding of small or easily overlooked image regions. Recent thinking with images approaches mitigate this limitation by allowing models to inspect images through operations such as zooming, cropping, or code execution. While effective, their multi-turn interactions with VLMs introduce redundant token computation and slow inference, and separate region inspection from the reasoning step that depends on it. To address these issues, we propose Look Before You Reason (LoRe), an implicit visual thinking framework for efficient visual reasoning within a single-turn VLM interaction. Given an image and a question, LoRe predicts the most relevant image region, aligns it with the corresponding image patch features, and strengthens the associated key-value (KV) cache entries, enabling subsequent decoding to directly exploit the selected visual cues without additional visual inputs or explicit tool calls. We further employ reinforcement learning to guide the VLM toward identifying informative image regions and leveraging them during reasoning. To support fine-grained evaluation of multimodal reasoning, we introduce COCO-ObjQA, a large-scale benchmark for object-centric multimodal reasoning. Experiments on three challenging multimodal benchmarks demonstrate that LoRe consistently improves VLM reasoning performance with low additional inference overhead. + + 2026-10-19T22:11:24Z + Accepted by NeurIPS 2026. Project Page: https://zerchen.github.io/projects/lore.html + + + Zerui Chen + + + Changrui Chen + + + Fei Ni + + + Jiankang Deng + + + + http://arxiv.org/abs/2610.27298v1 + Generalizing Multimodal Foundational Models in Context-Driven Class Incremental Learning + 2026-10-19T21:13:45Z + + + Class-Incremental Learning (CIL) aims to learn new classes continuously without forgetting the previously learned ones. Recent works in CIL have significantly advanced across various modalities; however, at the intersection of audio-visual modality, this problem remains underexplored. While representations from multimodal foundational models (MFMs) encapsulate rich static priors, our preliminary analysis shows that these representations struggle in incremental settings. Motivated by this, we propose a framework that generalizes frozen MFMs to audio-visual CIL. Specifically, we leverage their dense audio and visual representations and employ an attention-based contextual guidance module, in which the audio representations serve as task-stable contextual guidance for the visual representations, enabling effective class recognition in the incremental setting. To further mitigate catastrophic forgetting and preserve stability across tasks, we employ feature- and logit-level distillation, which are primarily responsible for the reduced forgetting. Extensive evaluations across various audio-visual CIL benchmarks demonstrate that our approach consistently outperforms state-of-the-art methods. Code is available at https://github.com/avigupta2798/MFM-CIL. + + + 2026-10-19T21:13:45Z + This work has been accepted in WACV 2027 + + + Avi Gupta + + + Nilotpal Sinha + + + Vishnu Raj + + + Sambuddha Saha + + + Pratik Joshi + + + Koteswar Rao Jerripothula + + + Tammam Tillo + + + + http://arxiv.org/abs/2610.27192v1 + CARLAR Influence: A Structured Hallucination Risk in Multimodal Cheque Extraction and an Exploratory Compressed-Image Countermeasure + 2026-10-19T19:29:12Z + + + Multimodal large language models (LLMs) are increasingly used for structured extraction from financial documents, but their behavior under visual ambiguity is poorly understood. We study CARLAR (Courtesy Amount Recognition and Legal Amount Recognition) influence: a model returns the same amount for both cheque fields even though their annotations differ, including cases with a blank annotation encoded as zero. Across ten visual prompting conditions, we evaluate GPT-4.1 and Claude 4.5 Sonnet on 243 primary cheques (124 with two observed unequal amounts) and 598 strict mismatches from two additional datasets. Under courtesy redaction, GPT-4.1 CARLAR reaches 73.7 percent (95 percent bootstrap interval: 68.3 to 79.0; p below 0.001 versus baseline). Model-reported confidence can remain high when predictions agree; expected calibration error reaches 0.93 among CARLAR cases. We also test a compressed-image few-shot intervention that presents examples as one visual table without model fine-tuning. On the 243-case cohort, Claude's Control condition increases paired joint extraction accuracy by 11.5 percentage points (95 percent interval: 6.2 to 16.9; adjusted p = 0.00054), but its strict-124 gain is smaller and not significant after correction. The intervention's effect on predicted-field agreement is model-dependent: it decreases for Claude and increases for GPT-4.1. These results motivate validation methods that account for visual context and dependencies between extracted fields. + + + 2026-10-19T19:29:12Z + 12 pages + + + Joong Ho + Joshua + + + Choi + + + Aditya Paul + + + Nidhi Singh + + + + http://arxiv.org/abs/2610.26863v2 + Text-to-Image Generative Modeling Without Language Pretraining + 2026-10-20T15:44:34Z + + + Modern text-to-image (T2I) systems use internet-scale language pretraining for text-conditioned image generation. We ask whether language pretraining is necessary for strong T2I generation. We introduce Halcyon, a family of early-fusion multimodal autoregressive models pretrained entirely from scratch on GPIC, a dataset of 100M image-text pairs. Halcyon-0.52B outperforms LlamaGen-XL/8 (48.0 vs. 63.3 gFD) with 18.2$\times$ less pretraining compute. Further, Halcyon-1.6B outperforms JiT-T2I-XXL/8++ (35.3 vs. 41.0 gFD) with 275$\times$ less pretraining compute. Controlled experiments show that text-only pretraining does not improve T2I generation. Halcyon also learns image captioning by replacing caption dropout with I2T supervision, maintaining competitive T2I generation quality under the same pretraining budget. We show that strong T2I systems can be trained from scratch without internet-scale language pretraining. Code and models are available at https://cs.stanford.edu/~keshik/halcyon + + + 2026-10-19T17:59:59Z + 27 pages; Project website: https://cs.stanford.edu/~keshik/halcyon + + + Keshigeyan Chandrasegaran + + + Yue Zhao + + + Armin W. Thomas + + + Ehsan Adeli + + + Jiajun Wu + + + Juan Carlos Niebles + + + Li Fei-Fei + + + Michael Poli + + + + http://arxiv.org/abs/2610.26860v1 + OpenVLHarness: Real World Visual Agentic Tool-Use with Multimodal Memory + 2026-10-19T17:59:58Z + + + Multimodal large language models (MLLMs) have made rapid progress on visual reasoning, yet many tasks require evidence that is difficult to obtain through internal reasoning alone: our controlled study on 22 benchmarks shows that simply increasing the inference budget of the base model yields only modest gains. Such tasks demand grounded perception, external knowledge, and numerical measurements obtained through heterogeneous tools, whose outputs must be made interpretable to the model and retained across reasoning steps. We introduce OpenVLHarness, a multimodal reasoning harness organized around a capability layer and persistent multimodal memory. The capability layer combines task-level tool interfaces with evidence rendering, providing consistent access to heterogeneous backends and converting their outputs into model-readable observations. Persistent multimodal memory retains the corresponding images, structured data, and web references as addressable artifacts throughout each query. A coding interface executes generated programs over stored data, enabling computations that combine results from multiple tools. Together, these mechanisms support an iterative process of acquiring, inspecting, and composing multimodal evidence. Evaluated on 22 benchmarks with eight open and proprietary backbones, OpenVLHarness improves average scores by 9.7-12.6 points over matched no-tool baselines, including +11.2 with Qwen3-VL-8B, +9.7 with Kimi K3, and +9.9 with GPT-6 Astra. With GPT-6 Luna at medium reasoning effort, OpenVLHarness outperforms the base model, Codex, and Visual Sketchpad at maximum effort by 7.7-8.5 points while incurring at most 37% of their model-token cost. + + + + + + 2026-10-19T17:59:58Z + + + Yu Zhou + + + Cheng-Fu Yang + + + Rui Sun + + + Di Wu + + + Sibo Peng + + + Mingyang Zhang + + + Zhen Yang + + + Ruiyi Zhang + + + Nanyun Peng + + + Zhe Gan + + + Kai-Wei Chang + + + + http://arxiv.org/abs/2610.26856v1 + Reinforcement Learning with Visually Attributable On-Policy Self-Distillation + 2026-10-19T17:59:56Z + + + Multimodal reinforcement learning with verifiable rewards (RLVR) provides reliable task-level supervision, yet offers limited guidance for localizing errors in visual reasoning. On-policy self-distillation (OPSD) complements this supervision with dense token-level corrections from a privileged teacher equipped with an evidence-centered visual view. However, the resulting corrections may conflate visual evidence with non-visual shifts induced by linguistic priors, response style, or the privileged view itself. We formalize this phenomenon as privileged-correction contamination: a token-level correction is contaminated when its update direction cannot be consistently attributed to the privileged visual evidence. Directly distilling contaminated corrections may therefore reinforce erroneous token-level updates. To address this issue, we propose reinforcement learning with visually attributable on-policy self-distillation, an evidence-consistent paradigm that augments task-level RLVR supervision with privileged token-level corrections grounded in visual evidence. We instantiate this paradigm with Visual-Attribution Gating (VAG), which uses the verifier-derived advantage as the optimization anchor and validates each privileged correction against the contrast between evidence-present and evidence-degraded teacher views. By admitting only corrections directionally supported by this visual contrast, VAG preserves visually grounded guidance while suppressing inconsistent residuals. Experiments across six visual reasoning benchmarks show that VAG consistently outperforms GRPO and OPSD methods, establishing new state-of-the-art average performance. + + + 2026-10-19T17:59:56Z + + + Shiao Xie + + + Siyu Chen + + + Jianwei Lv + + + Xiandong Li + + + Yujin Wang + + + + http://arxiv.org/abs/2610.27049v1 + VitronEdit: Universal Visual Editing across Images, Videos, and 3D Scenes + 2026-10-19T17:59:55Z + + + Recent advances in unified visual editing have begun to consolidate image and video editing within a single model, while 3D scene editing remains largely separate and constrained by scarce paired training data. Given the rich image and video editing supervision now available and the common editing semantics shared across modalities, a natural question is whether this knowledge can be transferred to data-scarce 3D editing. We present VitronEdit, a universal framework for image, video, and 3D scene editing. VitronEdit adopts a shared sequence representation and progressive multimodal training to transfer editing knowledge across modalities. We further introduce geometry-aware post-training, which leverages a pretrained geometry reconstruction model to provide depth and camera-pose supervision. Surprisingly, applying geometric supervision only to 3D samples yields the best overall performance, while image and video editing also improve despite receiving no direct geometric supervision, suggesting that geometric regularization transfers through the shared backbone. Our analysis further shows that image and video training mainly transfers editing semantics to 3D, whereas 3D supervision primarily improves multi-view consistency. The project page: https://vitron-llm.github.io/VitronEdit/. + + 2026-10-19T17:59:55Z + 27 pages,9 tables,9 figures + + + Jing Wang + + + Yanlin Li + + + Mong-Li Lee + + + Wynne Hsu + + + Shengqiong Wu + + + Hao Fei + + + + http://arxiv.org/abs/2610.26855v1 + Ropedia W0: Scaling Loco-Manipulation World Models across Embodiments with Human Experience + 2026-10-19T17:59:55Z + + + World models enable embodied agents to anticipate action consequences, yet jointly modeling locomotion and manipulation across diverse embodiments remains challenging due to heterogeneous action spaces and limited multimodal supervision. We present Ropedia W0, the first egocentric loco-manipulation world foundation model spanning humans and robots with diverse embodiments. We curate Xp-Data, comprising 10k hours of egocentric human data and 3k hours of robot data with unified multimodal annotations and systematic quality control. A unified kinematic representation encodes locomotion through camera poses and manipulation through projected skeletons, with robot skeletons combining embodiment-specific forward kinematics with extensive manual keypoint annotation and correction. We also introduce Xp-Teleop, a long-horizon loco-manipulation benchmark based on high-quality dexterous humanoid teleoperation data. Evaluations demonstrate state-of-the-art performance across five cross-embodiment benchmarks (DreamDojo, $Ψ_0$, $ω$-HOME, Xp-Teleop, and AgiBot) and on held-out human egocentric video, from zero-shot inference to few-shot and full-data post-training. Scaling human pre-training data improves performance on both human and robot evaluations. After distillation, our model supports real-time, minute-long rollouts, enabling live VR interaction. Applications in policy evaluation, model-based planning, and world-action modeling further demonstrate the model's utility for embodied decision-making. + + + 2026-10-19T17:59:55Z + Project page: https://ropedia.github.io/ropedia-w0/ ; Code: https://github.com/Ropedia/ropedia-w0 + + + Tianqi Liu + + + Hanfei Zhao + + + Qifeng Liang + + + Hui En Pang + + + Jiarui Xu + + + Sayang Mu + + + Penghao Qiu + + + YingSheng Zhang + + + Jun Wang + + + Ziang Cao + + + Mingze Sun + + + Yukang Cao + + + Fangzhou Hong + + + Zhaoxi Chen + + + Ziwei Liu + + + + http://arxiv.org/abs/2610.26826v1 + RefCraft: Benchmarking Visual-Reference-Conditioned Agentic Generation through Web Development + 2026-10-19T17:55:06Z + + + Beyond basic tool use and coding skills, effectively incorporating visual references into agentic generation is equally essential for applying AI agents to real-world productivity tasks. We study this crucial capability through webpage development, a practical and readily evaluable setting in which existing benchmarks remain largely idealized: they typically focus on reconstructing visual targets or generating webpages from textual instructions alone, overlooking the more common workflow of developing from visual examples. Specifically, we introduce RefCraft, a benchmark comprising 300 realistic multimodal webpage-development tasks that combine natural-language instructions with screenshots from one to five reference webpages. Agents must selectively interpret and utilize these references while rendering, visually inspecting, and iteratively refining their outputs. We evaluate the resulting open-ended artifacts using independently verifiable keypoints and complementary programmatic and VLM judges. Across nine frontier (M)LLMs, the strongest system achieves an overall score of only 52.12 out of 100, revealing that visual-reference-conditioned agentic generation remains a substantial challenge for current models in practical webpage-development settings. + + + + 2026-10-19T17:55:06Z + Project page: https://wangyuchi369.github.io/refcraft/ + + + Yuchi Wang + + + Rongyao Fang + + + Weihao Yu + + + Xilin Wei + + + Tiancheng Gu + + + Dingkang Yang + + + Hang Zhang + + + Dayiheng Liu + + + Hongsheng Li + + + Shuai Bai + + + + http://arxiv.org/abs/2610.26751v1 + Beyond Omni: A Unified MLLM for Embodied Sensory Understanding + 2026-10-19T17:14:37Z + + + Recent embodied systems increasingly build on multimodal large language models (MLLMs) for their pretrained understanding and reasoning capabilities, but their perception of the physical world remains largely limited to basic modalities such as vision and audio. However, broadening MLLMs to more diverse sensory modalities from the physical environment is challenging: their representations are often weakly connected to the MLLM and vary substantially in structure and statistics, while their interpretation still requires shared high-level understanding and reasoning. We therefore propose Unisense, a unified embodied MLLM framework that supports diverse physical sensory modalities within a shared multimodal architecture. Unisense follows a two-stage training process: (i) aligning sensory representations with language to establish a language-accessible interface; and (ii) tuning modality-specific experts within the shared LLM to provide specialized processing for different sensory modalities. To support broad sensory learning, we curate Unisense-1M, a large-scale embodied sensory training corpus comprising 1M samples across 8 sensory modalities. We further evaluate Unisense on 12 benchmarks spanning depth, point cloud, IMU, tactile, thermal, radar, motion, and smell understanding. Across these heterogeneous sensing tasks, Unisense achieves strong performance and outperforms both generalist and specialized models on most benchmarks, demonstrating the potential of pretrained MLLMs as unified models for embodied sensory understanding. + + 2026-10-19T17:14:37Z + + + Shiyun Xiong + + + Dongming Wu + + + Peiwen Sun + + + Bokang Yang + + + Jiaxu Wang + + + Xiaolou Sun + + + Mingxing Wen + + + Xiangyu Yue + + + + http://arxiv.org/abs/2610.26585v1 + Drive2Gauss: FeedForward 4D Gaussian Reconstruction from Multimodal Generative Driving Videos + 2026-10-19T15:34:28Z + + + Generating reusable driving environments requires both controllable future observations and an explicit representation that supports rendering from different viewpoints, yet existing methods still recover explicit scenes from generated RGB videos through optimization for each sequence. To overcome these limitations, we present Drive2Gauss, a feedforward framework that converts jointly generated RGB, metric depth, and dynamic flow into dynamic 4D Gaussian scenes. A Multimodal Video Generator predicts the three modalities from reference multiview images and future control signals. Furthermore, we introduce a Gaussian Query Decoder that uses depth to initialize sparse 3D queries and flow to associate the queries across time, and integrates appearance information through spatiotemporal feature aggregation and iterative query refinement. The reconstruction stage operates in a single feedforward pass without optimization for each scene. Extensive results on nuScenes demonstrate that our approach attains an FID of 6.38 and an FVD of 12.43 for future RGB generation, a PSNR of 29.91 dB when reconstructing its generated observations, and supports both direct rendering under lateral camera shifts and downstream video fixing. Code and more visualizations are available at https://zttt04. github.io/Drive2Gauss_page/. + + 2026-10-19T15:34:28Z + + + Tong Zhao + + + Zhiyuan Han + + + Lin Chen + + + Bowen Xie + + + Yunxi Qiao + + + Bohan Li + + + Weiqing Xiao + + + Gen Li + + + Shu Han + + + Xuyang Dai + + + Cheng Bi + + + Hao Zhao + + + Chaojian Li + + + + http://arxiv.org/abs/2610.26538v2 + Small Average Error, Wide Individual Error: General-Purpose LLMs Estimating Energy Intake from Meal Photos in a Feeding Trial + 2026-10-20T19:44:32Z + + + Photo-based estimation of food energy could ease dietary assessment, and general-purpose multimodal large language models (LLMs) make such estimates easy to obtain. Most evaluations use one photo taken before eating and compare with energy served, while dietary assessment needs energy eaten. We evaluated eight models from three vendors (Claude Haiku, Sonnet and Opus 5.5; GPT-6 luna, 6.1 sol and 6 astra; Gemini 3.8 Flash and 4 Argon) on 802 meals from ACETADA, a controlled feeding trial with weighed intake, with the before photo only, before and after photos in separate calls (subtraction), or both photos in one request. Three results ran against intuition. Subtraction under-estimated intake for six of eight models, because the models still report hundreds of kilocalories for a nearly empty tray. Scaling the before-only estimate by the average share eaten (0.87) matched much of the gain from the after photo; beyond that constant, the second photo lowered meal-level error by only 2.2 to 4.4 points, mainly in meals with food left. With one photo, two models had a near-zero intake bias only because they under-estimated the served energy and ignored uneaten food. In ablations, adding the after photo improved accuracy under both prompt formats for seven models, while prompt effects varied across models. Over 148 feeding days, five models kept the 90% confidence interval of their mean error within a pre-set 10% margin; one model also met the pre-set 30% limits of agreement, narrowly (-28% to +27%; limits outside 30% cannot be excluded), and the other seven did not. Protein was under-estimated by every model, most in protein-dense meals; repeated calls changed error by at most 1.4 points; a high reasoning effort helped only the smallest model. A low average bias is not evidence of accurate individual intake estimation; such estimates should support, not replace, assessment by a dietitian. + + + + 2026-10-19T15:00:20Z + 20 pages, 1 figure, 12 tables. v2: adds Gemini 3.8 Flash and Gemini 4 Argon under a pre-registered addendum; all tables recomputed over eight models; conclusions unchanged except that one model now meets the pre-set limits of agreement, narrowly. Code, prompts, per-meal model outputs: https://github.com/xtea/llm-intake-validation + + + Xiaomeng Li + + + + http://arxiv.org/abs/2610.26431v1 + Long-form Video-to-Text Summarization using Recursive Language Models + 2026-10-19T13:56:33Z + + + While VideoLLMs have made significant progress in understanding short video benchmarks, they often struggle to summarize long-form ones. This is mainly due to performance degradation caused by long-context prompts, the inherent difficulty of preserving temporal continuity and a lack of semantically rich concepts in event descriptions. To tackle these issues, this paper introduces the first recursive Video Language Summarization Model (RVLSM) designed for video processing and tailored to long-form video-to-text summarization. RVLSM recursively decomposes videos into semantically coherent segments and delegates chunk-level reasoning to VideoLLM sub-models and external tools. It employs (1) Semantic Temporal Decomposition (STD), which preserves temporal coherence and continuity through a scene-aware chunking strategy that dynamically partitions videos according to semantic boundaries, and (2) Adaptive Multimodal Tool Calling (AMTC), which ensures semantic richness of the summary via a routing mechanism that selectively invokes auxiliary modules such as action recognition, optical character recognition, automatic speech recognition, and object detection. Experiments on the VideoXum and MixTyVSum benchmarks show that RVLSM consistently improves over zero-shot VideoLLM baselines across multiple model settings and performance metrics, and is competitive with a state-of-the-art fine-tuned model for video-to-text summarization. Importantly, the named entities in the RVLSM's summaries align more closely with those detected in the ground-truth summaries than those detected by baseline and state-of-the-art methods, confirming the saliency of the event descriptions it generates. + + 2026-10-19T13:56:33Z + Paper currently under review + + + Alessia Intini + + + Lorenzo Vaiani + + + Enrico Chen + + + Luca Cagliero + + + + http://arxiv.org/abs/2610.26357v2 + HGASurv: Hierarchical Granularity-Aware Multimodal Integration for Survival Prediction + 2026-10-20T16:17:16Z + + + Multimodal survival prediction jointly analyzes histopathological whole-slide images (WSIs), genomic profiles, and clinical variables to stratify patients by risk. However, existing approaches often inadequately account for granularity differences across modalities, particularly in spatial organization and feature dimensionality. Within pathology, aggregating WSI patch features without preserving their spatial arrangement can obscure tissue architecture; across modalities, directly concatenating low-dimensional clinical variables with high-dimensional visual and genomic features may limit the contribution of clinical information to prediction. To address these challenges, we propose HGASurv, which introduces a hierarchical WSI encoding module and a clinical-guided graph propagation module for granularity-aware multimodal integration. The hierarchical WSI encoding module maps WSI patch features onto a spatial grid using their original coordinates and applies parallel convolutions to construct representations at patch, local-neighborhood, and regional scales. Genomic signature embeddings then query these scale-specific WSI representations through cross-modal co-attention, producing signature-conditioned morphological features. The clinical-guided graph propagation module uses clinical variables to define patient-similarity edges and propagates fused image-genomic node embeddings with graph attention, integrating clinical information through topology rather than feature concatenation. Across three TCGA cohorts, HGASurv achieved the strongest overall C-index performance, with ablation studies supporting the complementary contributions of the hierarchical WSI encoding and clinical-guided graph propagation modules. This design shows that matching representation and integration mechanisms to modality-specific granularity improves multimodal survival prediction. + + 2026-10-19T13:19:03Z + Preprint. Updated title, author notes, and manuscript presentation; reformatted using the Elsevier template + + + Peike Yu + + + Wuchao Liu + + + Jihong Guan + + + Shuigeng Zhou + + + + http://arxiv.org/abs/2610.26203v1 + Focused Omni-Modal GUI Agents + 2026-10-19T11:30:48Z + + + Graphical User Interface (GUI) agents increasingly act over streaming omni-modal observations spanning screenshots, audio, video, interaction history, and device states. However, exposing this complete context uniformly at every step ignores that relevance is transient and sparse: the signal determining one action can become clutter at the next. Because executed actions feed back into the context, these errors compound into Sequential Distraction, driving the agent into irreversible trajectory drift. We formulate the underlying requirement as Focused Perception: a representation that is step-adaptive, action-sufficient, and non-intrusive. We realize this in FocusGUI, a lightweight adapter that dynamically prioritizes multimodal channels against a step-specific decision reference. Instead of uniformly processing all inputs, it compresses the most relevant evidence into a compact latent and subtly injects it into the frozen decoder's embeddings, guiding the model's attention without altering its native parameter space. FocusGUI trains from action supervision alone, requiring neither modality-relevance labels nor backbone fine-tuning. Across four omni-modal backbones, it raises overall Type Match by +33.2 and Exact Match by 3.0 times over the frozen backbone on average, and Type Match by +30.1 over the strongest existing enhancement method. + + 2026-10-19T11:30:48Z + + + Fuyao Zhang + + + Wenwen He + + + Jiaming Zhang + + + Yurong Hao + + + Xuan Wang + + + Guowei Guan + + + Che Wang + + + Longtao Huang + + + Wei Yang Bryan Lim + + + + http://arxiv.org/abs/2610.26194v1 + GeoEdit: Adversarial De-Evidencing for Silent Geoprivacy Protection via Image Editing + 2026-10-19T11:23:14Z + + + Recent efforts have demonstrated the strong capabilities of Multimodal Large Reasoning Models (MLRMs) in geographic reasoning. By jointly analyzing subtle visual cues, these models can infer the locations of photos, thus enabling doxing even by non-expert adversaries. Existing defense methods struggle to balance the shareability of photos with effective protection, and often fail to sufficiently disrupt the implicit geo-evidence chains embedded in scene semantics. To this end, we propose GeoEdit, an adversarial de-evidencing framework for silent geoprivacy protection via image editing. Specifically, we apply minimal edits to high-risk evidence anchors in the image, thereby disrupting the underlying spatial reasoning chains while preserving overall scene semantics. We identify these anchors by combining structured knowledge with adversarially discovered geographic cues. To further navigate the large editing action space, we adopt a learnable policy to iteratively refine editing decisions, distilling successful trajectories into transferable natural-language insights for consistent and efficient editing. Evaluated on LifePhotoBench, GeoEdit achieves strong protection against 6 mainstream MLRMs, outperforming visual perturbation baselines by over 0.59 in image fidelity. + + + 2026-10-19T11:23:14Z + + + Yu Yan + + + Shengjia Cheng + + + Fei Ma + + + Zhe Wang + + + Peng Chen + + + + http://arxiv.org/abs/2610.26084v1 + Context-Aware Topological Distillation Graph Network for Asymmetric EEG-Eye Movement Emotion Recognition + 2026-10-19T09:43:01Z + + + EEG-eye movement emotion recognition can support mental-health monitoring and adaptive interfaces, but most fusion models treat the two signals as parallel features, classify each window alone and degrade when eye data are lost. We propose the Context-Aware Topological Distillation Graph Network (CTD-GNet), in which EEG features form the nodes of an electrode graph, and eye movements and preceding windows modulate its edges, nodes and readout, the edges through electrode-specific prompts. Bidirectional distillation of the graph, node relations and predictions couples this multimodal teacher with a single-window EEG student, improving the teacher and aligning the two graphs 35-fold. In leave-one-subject-out tests on SEED and SEED-IV against 17 baselines, CTD-GNet has the highest mean accuracy, 84.91% and 76.17%, significantly above 9 and 6 of 13 eye-based baselines after Holm correction, the smallest cross-subject spread among multimodal models and the highest worst-subject accuracy. It is the most accurate model at every rate of missing eye data on SEED-IV, keeps 66.1% on SEED without eye data, more than any EEG-only model, and stays 9.3 and 11.9 points above all single-window fusion models under eye-movement noise of one standard deviation. On film clips unseen in training, it leads on SEED with 77.1%. + + + 2026-10-19T09:43:01Z + + + Peijun Shi + + + Xiujin Zhu + + + Zhenguo Lao + + + Chee-Onn Chow + + + Wei Ru Wong + + + Zhen Liu + + + Xiaobing Jiang + + + + http://arxiv.org/abs/2610.26078v1 + DCR-TSF: Dual-Level Compositional Reasoning with Triadic Spherical Fusion for Training-Free Zero-Shot Composed Image Retrieval + 2026-10-19T09:34:58Z + + + Zero-shot composed image retrieval (ZS-CIR) aims to retrieve a target image that reflects an intended textual modification while maintaining semantic consistency with a reference image. Existing training-free ZS-CIR methods typically rely on fine-grained generated target descriptions, which often overemphasize reference-specific visual details and lead to appearance-biased retrieval. Moreover, since these descriptions are generated through multimodal large language models (MLLMs), the direct influence of the original image-text query can be weakened in the final retrieval representation. In this paper, we propose DCR-TSF, a training-free ZS-CIR framework that combines Dual-level Compositional Reasoning (DCR) and Triadic Spherical Fusion (TSF). DCR generates fine- and coarse-grained descriptions from the reference image and modification text, capturing complementary target-side semantics across different granularities. To preserve the original image-text query information, TSF constructs a composed-query anchor by spherically interpolating the reference image feature and modification text feature, and fuses it with the fine- and coarse-grained representations using a weighted Karcher mean on the unit hypersphere. The resulting final query representation balances detailed visual evidence, high-level semantic abstraction, and direct preservation of the original composed query. Extensive experiments on CIRCO, CIRR, and Fashion-IQ demonstrate that our method achieves state-of-the-art performance among training-free methods. + + 2026-10-19T09:34:58Z + Accepted to ACCV 2026. 14 pages, 6 figures, 6 tables + + + Gwang-Ho Na + + + Ho-Joong Kim + + + Seong-Whan Lee + + + + http://arxiv.org/abs/2610.26046v1 + AVTime: Reinforcing Dense Audio-Visual Captions with Bidirectional Alignment + 2026-10-19T09:05:39Z + + + Dense temporal audio-visual captioning is important for multimodal video understanding and generation. However, prior work is constrained by three main limitations: (1) the lack of a dataset combining high temporal resolution, longer videos, and bidirectional alignment between time and events; (2) the reliance of most existing RL methods on checklists; and (3) the lack of a benchmark that bidirectionally evaluates event semantic correctness and temporal accuracy. To address these challenges, we propose: (1) AVTime-50K, a high-quality 50K-scale dataset with temporally precise, semantically accurate captions and longer videos; (2) AVTime, a state-of-the-art model optimized with a novel Bidirectional Temporal-Semantic Alignment (BiTSA) reward that imposes explicit bidirectional constraints between time and events; and (3) AVTime-Bench, a specialized benchmark that introduces a novel bidirectional evaluation of temporal accuracy and semantic correctness. Our code, models, and datasets are available at https://huggingface.co/collections/Apryle/avtime. + + 2026-10-19T09:05:39Z + + + Mingyang Wu + + + Kaituo Feng + + + Bohao Li + + + Kaixiong Gong + + + Zihao Yin + + + Xiangyu Yue + + + + http://arxiv.org/abs/2610.26022v1 + FrameGRPO: Incentivizing Video Reasoning via Multi-Frame Rollouts and Temporal Credit + 2026-10-19T08:45:21Z + + + Reinforcement learning with verifiable rewards, particularly Group Relative Policy Optimization (GRPO), has improved video reasoning in multimodal large language models. However, standard video GRPO varies only linguistic trajectories while conditioning every rollout in a group on the same sampled frames, which can produce homogeneous rewards and weaken group-relative learning when the shared visual evidence is insufficient or distracting. We propose \textbf{FrameGRPO}, a simple and effective reinforcement-learning framework that requires neither auxiliary networks nor changes to the model architecture. Specifically, FrameGRPO combines two lightweight components: (1) \textbf{Multi-Frame Rollouts}, which use only uniform temporal subsampling of a single maximal-frame decode to construct aligned views that diversify visual evidence and reasoning trajectories; and (2) \textbf{Gated Temporal Efficiency Credit}, which selectively reinforces a correct lower-ratio trajectory when all rollouts in a fixed full-ratio reference subset fail, without imposing an unconditional preference for fewer frames. Extensive experiments across diverse video understanding and reasoning benchmarks demonstrate robust overall improvements over standard GRPO, highlighting temporal-view diversification as an effective mechanism for exploration and credit assignment in video MLLMs. + + + 2026-10-19T08:45:21Z + + + Jiaxuan Sun + + + Biao Wang + + + Shuai Li + + + + http://arxiv.org/abs/2610.25999v1 + TempoMoE: Identifying and Steering Fast-Slow Thinking Experts for Efficient Multimodal Reasoning + 2026-10-19T08:22:28Z + + + Multimodal Mixture-of-Experts (MoE) reasoning models rely on long chain-of-thought (CoT) for complex tasks, yet often overthink easy inputs, increasing token cost and latency, and sometimes degrading accuracy. Existing methods optimize reasoning length during training or impose external control at inference, but leave the underlying reasoning mechanism a black box. We find that fast and slow thinking exhibit distinct expert-routing patterns: holding the input fixed and varying only the prompted reasoning tempo produces stable routing shifts. Suppressing slow-thinking experts shortens the reasoning chain, whereas suppressing fast-thinking experts lengthens it, providing causal evidence that these experts influence reasoning depth. Based on this finding, we propose TempoMoE, a training-free, two-stage framework. It identifies fast- and slow-thinking experts via tempo-contrastive routing analysis and redistributes routing weights within the original top-k set according to sample difficulty. It amplifies fast-thinking experts and suppresses slow-thinking experts on easy inputs and reverses this adjustment on hard ones, enabling difficulty-adaptive control over reasoning depth. We evaluate TempoMoE on Kimi-VL, Qwen3-VL, and ERNIE-4.5-VL across six benchmarks. Compared with Vanilla, TempoMoE consistently improves accuracy while reducing output tokens, with accuracy gains of up to 2.6 points and token reductions of up to 35.4%. + + + + 2026-10-19T08:22:28Z + 11 pages, 3 figures + + + Xiyue Zhang + + + Keru Zhou + + + Ziyi Wang + + + Bing Hu + + + Li Wang + + + + http://arxiv.org/abs/2610.25926v1 + MIRA: A Multimodal Illustrated Deep Research Agent for Controllable Reports + 2026-10-19T07:24:44Z + + + Deep research agents are increasingly capable of searching the open web and synthesizing evidence, yet they remain poorly suited to controllable report generation in multimodal deep research. This task requires agents to handle interleaved textual and visual inputs, gather multimodal evidence through multi-step web search, and deliver comprehensive illustrated reports under user-specified requirements. Existing systems face two limitations. During reasoning, they often underuse images discovered along the search trajectory; during generation, they tend to produce fixed-form answers with limited control over report granularity, multimodal composition, and evidence grounding. We introduce MIRA, a Multimodal Illustrated Deep Research Agent for controllable reports. MIRA integrates textual and visual evidence throughout research and writing. At its core, MIRA-Harness translates user requirements into generation contracts and connects four stages: evidence collection, report submission, feedback-driven revision, and final delivery. Building on this harness, MIRA-Data constructs high-quality multi-hop multimodal research trajectories, and we post-train foundation models to operate within the workflow. Using Qwen3.6-35B-A3B, MIRA achieves state-of-the-art performance among open agents on 7 representative, established multimodal-search and deep-research-agent benchmarks, while producing user-aligned illustrated reports with traceable textual and visual evidence. + + 2026-10-19T07:24:44Z + 33 pages, 8 figures, 9 tables + + + Hongrui Wu + + + Kaiwen Tuo + + + Congcong Wang + + + Gen Li + + + Shuai Dong + + + Xinlei Yu + + + Yuqi Xu + + + Haowen Hou + + + Zelin Peng + + + Jiaqi Wang + + + + http://arxiv.org/abs/2610.25649v2 + InteractAgent: Agentic Human Motion Interaction with Memory-Augmented Reflection + 2026-10-20T06:57:04Z + + + Long-horizon human-scene interaction requires coordinated spatial reasoning, physical feasibility, and the ability to recover from compounding execution errors. Text-driven motion models are largely scene-agnostic and lack closed-loop correction, while geometry-conditioned approaches depend on paired scene-motion training or explicit 3D preprocessing that limits generalization to novel layouts and open-vocabulary goals. We present InteractAgent, an agentic multimodal LLM system for long-horizon human-scene interaction that plans, executes, observes, and reflects in a closed loop, using a single MLLM as both planner and evaluator and a frozen MotionLLM as the executor. InteractAgent integrates Online Observation for step-wise recovery decisions (continue/redo/replan) and Memory-Augmented Reflection for multi-round plan refinement with adaptive stopping. On UniHSI, InteractAgent improves task success and reduces penetration compared with training-free baselines. Code: https://github.com/AIGeeksGroup/InteractAgent. + + + 2026-10-19T01:51:14Z + + + Senhe Zhang + + + Tao Zhang + + + Yujia Zhang + + + Zeyu Zhang + + + Dong Gong + + + + http://arxiv.org/abs/2610.25617v1 + CheXFuse: Guided Differential Joint Attention Fusion for Robust Multimodal Chest X-Ray Classification in Data-Scarce Medical Settings + 2026-10-19T00:45:16Z + + + A central challenge in multimodal learning is how to fuse modalities that differ substantially in predictive strength. When one modality provides a much stronger representation than another, indiscriminate cross-modal interaction can introduce weak, redundant, or unstable signals, limiting or even degrading performance relative to the strongest unimodal representation. To address this problem, we propose CheXFuse, a multimodal fusion framework based on Guided Differential Joint Attention (GuDJA). CheXFuse combines image and text token representations within a joint multimodal sequence, where learned token guidance emphasizes informative representations and differential attention reduces less useful attention responses. We evaluate CheXFuse on the Indiana University (IU) Chest X-ray dataset, using binary (normal vs. abnormal) classification as the downstream task. Experiments are conducted under both original-report and masked-report settings, with the latter serving as a controlled stress test under reduced textual informativeness. CheXFuse with GuDJA achieves the strongest mean overall performance across the evaluated baselines and ablations, reaching 95.73% accuracy, 95.79% F1-score, 96.54% recall, and 95.28% sensitivity at 95% specificity (Sens@95Spec) with original reports, and 95.58%, 95.60%, 95.60%, and 94.34%, respectively, under masked reports. These results suggest that GuDJA provides a promising fusion strategy under asymmetric or partially reduced modality informativeness. + + + 2026-10-19T00:45:16Z + IEEE ICDM DMBIH 2026 + + + Muntaqim Ahmed Raju + + + Priyanka Siddappa + + + Md Shifat Haider Al Amin + + + Ruizhe Ma + + + Md Ripon Ahammed + + + + http://arxiv.org/abs/2610.25570v1 + DiffGround: Semantic Difference-Guided Zero-Shot Video Question Grounding + 2026-10-18T22:17:03Z + + + Video Question Grounding (VideoQG) requires both accurate question answering and precise temporal localization. Existing supervised methods rely on costly temporal annotations, while existing zero-shot approaches are primarily designed for Video Question Answering (VQA) and are not optimized for temporal grounding. We propose DiffGround, an action-driven zero-shot framework built upon frozen Multimodal Large Language Models (MLLMs). Our framework first predicts an answer-relevant action cue that transforms the input question into an explicit semantic target for grounding. Action Cue converts a reasoningoriented question into an action-centric retrieval query. Guided by the action cue, a Vision-Language Model (VLM) efficiently selects informative keyframes for reasoning. Finally, we introduce Semantic Diff Refinement, a training-free temporal refinement method that exploits semantic differences between neighboring SigLIP2 embeddings to recover complete action segments from sparse predictions. Extensive experiments on NExT-GQA and STAR show that DiffGround consistently outperforms existing zero-shot and supervised methods, establishing a new state of the art for Video Question Grounding. + + 2026-10-18T22:17:03Z + This paper is accepted by ACCV 2026. We plan to publicly release the source code at https://github.com/steven413d/DiffGround + + + Cheng-Han Lee + + + Amir Salimi + + + Hsiang-Wei Huang + + + Che-Chun Su + + + Min Sun + + + Cheng-Hao Kuo + + + + http://arxiv.org/abs/2610.25533v1 + Modaliff: A Unified Token Diffusion Model for Any-to-Any Generation + 2026-10-18T21:07:26Z + + + Any-to-any generation seeks a single model that translates flexibly among text, image, and audio, yet existing approaches either require fully aligned multimodal tuples or a shared representation that suppresses modality-specific structure. We introduce Modaliff, a novel token-based diffusion model that learns from widely available bimodal pairs while preserving each modality in its native latent sequence. Modaliff assembles conditions and targets into a unified token sequence, with per-token attributes to disambiguate token identities and role-based positional embedding to preserve each modality's internal structure across sequence layouts. This design enables a single denoiser to support diverse generation tasks without task-specific architectural changes or a shared cross-modal latent space. Beyond one-to-one generation, Modaliff supports multiple conditions either by combining single-condition predictions at inference or by lightweight finetuning on captions that jointly describe multiple inputs. Experiments across text, image, and audio show that Modaliff achieves the best fidelity among any-to-any models on most generation tasks while using substantially fewer parameters and training data. + + + 2026-10-18T21:07:26Z + + + Duc Kieu + + + Kien Do + + + Minh Khoa Le + + + Tung Kieu + + + Dang Nguyen + + + Thin Nguyen + + + + http://arxiv.org/abs/2610.25493v1 + GroundedVDR: Grounding Video-to-Web Evidence Dependencies in Video Deep Research + 2026-10-18T19:26:54Z + + + Video large multimodal models have improved at identifying cross-frame visual evidence and conducting open-web retrieval, as reflected in recent video deep research (VDR) benchmarks. However, existing VDR benchmarks primarily evaluate tool-use trajectories and final responses without verifying whether a model actually uses the temporal video information or the retrieved web evidence. To fill this gap, we introduce \method{}, an evidence-grounded benchmark with three features. First, it combines human review with restricted-access probing across multiple models to exclude questions answerable from parametric knowledge or a single information source. Second, each question carries structured video-to-web evidence annotations that link the relevant video segments to their supporting web evidence. Third, its evaluation protocol separately scores video grounding, web evidence grounding, and final-answer correctness. Across eight multimodal agent systems, the best reaches 76.0\% answer accuracy, yet none recovers the complete required web evidence for more than 8\% of questions. Our benchmark is publicly available at \url{https://huggingface.co/datasets/hh721/vdr_temp}. + + 2026-10-18T19:26:54Z + + + Xiyuan Liang + + + Yu Wang + + + Zuhao Yang + + + Ziting Wang + + + Duo Li + + + Sudong Wang + + + Zhongyu Yang + + + Xiaoqin Zhang + + + Ling Shao + + + Shijian Lu + + + + http://arxiv.org/abs/2610.25481v2 + Multimodal-Conditioned Latent Diffusion Models for Spatiotemporal Brain MRI Forecasting + 2026-10-20T10:25:35Z + + + Spatiotemporal forecasting of 3D anatomical changes is a critical generative vision challenge for modeling Alzheimer's Disease (AD) progression. While brain MRI forecasting from single-modality data has advanced, other key complementary multimodal biomarkers remain underutilized. In this work, we propose the Multimodal-Conditioned Latent Diffusion Model (MC-LDM), a novel framework for patient-specific brain MRI synthesis. MC-LDM leverages multimodal biomarkers---MRI, tau-PET, Clinical Dementia Rating (CDR), and APOE4---during training, but relies only on baseline MRI, APOE4, and patient metadata at inference, reflecting realistic clinical availability. Our contributions are threefold: (1) a Latent Diffusion Model (LDM) fine-tuned via Low-Rank Adaptation (LoRA) for data-efficient learning; (2) a multimodal conditioning that integrates molecular and clinical signals to model heterogeneous disease trajectories; and (3) auxiliary predictors estimating unobserved multimodal biomarkers from MRI features and patient covariates to condition the diffusion model, removing the need for these assessments at inference. Trained on 1,355 visits from 852 subjects in the Alzheimer's Disease Neuroimaging Initiative (ADNI), MC-LDM reduces average regional volumetric MAE by 18% over the second-best baseline on an independent test set of 664 visits. To our knowledge, MC-LDM represents the first diffusion-based framework to leverage multimodal priors for MRI forecasting. This conceptual advancement enables patient-specific trajectory generation that captures aspects of AD heterogeneity not observable from structural anatomy alone, bridging the gap between rich multimodal supervision and the strict constraints of routine clinical deployment. Code is available at: https://github.com/antonioscardace/MC-LDM. + + + 2026-10-18T19:09:40Z + Accepted to WACV 2027 + + + Antonio Scardace + + + Silvia Ingala + + + Sebastiano Battiato + + + Daniele Ravì + + + + http://arxiv.org/abs/2610.25470v1 + A failure of Imagination: VLMs fail to use visual representations for text, but self-distillation can help + 2026-10-18T18:53:18Z + + + Vision-language (VL) models are typically built by fine-tuning a language model to attend to visual features in service of a Visual Question-Answering objective. We ask whether this alignment changes how language models represent text---especially on tasks where visualization would help, like geometry questions posed in words. We distinguish weak multimodality (the model can answer questions about an input image) from strong multimodality (the model's text representations themselves become vision-aligned, improving performance on text-only tasks with latent visual structure). To test for strong multimodality, we construct a task of shape-counting problems with paired equivalent text and image specifications. This task is trivial when the image is provided, but requires visualization when specified in text as line coordinates. We compare instruction-tuned Qwen-2.5 and Mistral models against their vision-aligned counterparts on the text variant of the task. We find that the multimodal models do no better in this setting, despite strong performance on the image version of the task. Probing experiments corroborate this: vision-aligned decoder embeddings carry no more visual structure than their text-only counterparts. Finally, we provide an optimization objective that distills in-context visual embeddings into text embeddings. This alignment induces gains on the text variant of the task without explicit task supervision, even on samples more complex than seen during alignment. This suggests that VQA-style alignment leaves available cross-modal transfer untapped. + + + + 2026-10-18T18:53:18Z + + + Shashwat Singh + + + He He + + + Tal Linzen + + + + http://arxiv.org/abs/2610.25448v1 + UBD-Bench: Benchmarking and Analyzing Unimodal Branch Degradation in Multimodal Perception for Autonomous Driving + 2026-10-18T18:11:32Z + + + Multimodal perception improves autonomous-driving performance by combining complementary sensor information. However, stronger multimodal predictions do not necessarily imply stronger representations in each modality-specific branch. Such branch-level weaknesses can remain hidden in conventional output-level evaluation. We introduce UBD-Bench, a systematic benchmark for studying unimodal branch degradation (UBD) in multimodal perception. UBD-Bench uses a Paired Frozen-Branch Probe to compare the task-relevant representation quality of the same modality after independent unimodal training and multimodal joint training under matched decoding conditions. Across four autonomous-driving perception tasks and 10 models, we find that Camera branches consistently degrade after multimodal joint training, whereas LiDAR branches exhibit weaker and more model-dependent changes, revealing a pronounced modality asymmetry. Hierarchical probing further shows that Camera-branch degradation extends from the visual backbone through the Camera-to-BEV pathway and is most severe at the pre-fusion Camera BEV representation. Guided by this diagnosis, we introduce unimodal-to-multimodal distillation at the degraded representation. This intervention consistently improves both Camera-branch Probe performance and full-model performance across all four tasks. These results show that multimodal gains can coexist with degraded unimodal representations, highlighting branch-level representation quality as an important dimension for evaluating and improving multimodal perception. + + 2026-10-18T18:11:32Z + 11 pages, 5 figures + + + Ang Liu + + + Xiang Gu + + + Ruikai Li + + + Qiyue Wang + + + Yizhe Fan + + + Hao Shan + + + Ziyang Yan + + + Han Jiang + + + Zhenning Li + + + Xiaoshuai Hao + + + Yilong Ren + + + Zhiyong Cui + + + Haiyang Yu + + + + http://arxiv.org/abs/2610.25418v1 + From Label Priors to Task Evidence: Efficient Long-Video Frame Selection via Bayesian GRPO + 2026-10-18T17:17:59Z + + + Multimodal Large Language Models (MLLMs) face significant scalability challenges in long-video understanding due to quadratic attention complexity and context window constraints. Existing retrieval-based approaches typically rely on supervised learning from static keyframe annotations. However, these label priors often fail to align with the actual information required by downstream MLLMs for complex reasoning, creating a misalignment between the training target and inference needs. To bridge this gap, we propose a probabilistic framework that reformulates frame selection as latent-variable inference. We first initialize a lightweight policy using supervised learning to capture general visual saliency. Then, we treat a frozen MLLM as a task environment and use its answer likelihood as dense task evidence to refine the policy via Bayesian Group Relative Policy Optimization (GRPO). Within this formulation, the negative log-likelihood (NLL) over ground-truth answer tokens provides a principled dense reward, while a prior-matching KL term preserves semantic consistency with the elicited label prior. This process transitions the selection principle from static label priors to task evidence. Extensive experiments on Video-MME, MLVU, and LongVideoBench demonstrate that our selector achieves competitive accuracy with MLLM-based scorers while retaining the inference efficiency of lightweight methods. The selector is trained once with a frozen MLLM environment and transfers directly to multiple downstream MLLMs without retraining. Code is available at \url{github.com/Miraclecsc/Frame_Selection_GRPO}. + + 2026-10-18T17:17:59Z + + + Shuochen Chang + + + Bingjie Gao + + + Qingyang Liu + + + Qianli Ma + + + Yibo Miao + + + Haonan Zhao + + + Zhaohe Liao + + + Xiaofeng Zhang + + + Jiangtong Li + + + Li Niu + + + + http://arxiv.org/abs/2610.25404v2 + MT Forcing: Towards Stable and Consistent Multi-Turn Image Editing with Autoregressive Diffusion + 2026-10-21T08:45:58Z + + + Multi-turn image editing aims to modify an image according to a sequence of instructions, enabling more effective interactive visual content creation for users. However, existing methods often exhibit noticeable drift after only a few editing turns, manifesting in two aspects: 1) unstable visual quality, with accumulating artifacts and degraded details; and 2) inconsistent image content, with unintended changes to preserved regions and prior edits. To address these challenges, we propose MT Forcing, a novel training paradigm for multi-turn image editing with unified multimodal models (UMMs) based on autoregressive diffusion. Specifically, we propose Single-Turn Distribution Matching Distillation (Single-Turn DMD), which supervises student self-rollouts with a teacher that applies cumulative edits to the source image in a single turn, providing visual-quality guidance without recursive error accumulation. Additionally, we introduce Teacher-Forcing Guidance, which supervises history-dependent transitions on reference trajectories during warmup and as a regularizer during distillation, encouraging cross-turn content consistency beyond what per-turn distribution matching alone can ensure. Extensive experiments demonstrate that our approach significantly improves the multi-turn image editing capabilities of UMMs, yielding more stable visual quality and stronger cross-turn consistency. + + 2026-10-18T17:01:40Z + Project page: https://houyuanchen111.github.io/mt-forcing.github.io/ + + + Houyuan Chen + + + Fanzhou Wang + + + Xiangyu Fan + + + Zesong Qiu + + + Yukun Wei + + + Songlin Yang + + + Zhitao Yang + + + Lvmin Zhang + + + Pei Yang + + + Hao Zhao + + + Dahua Lin + + + Lei Yang + + + Anyi Rao + + + + http://arxiv.org/abs/2610.25247v1 + Visual Scaffolding: Toward Native Multimodal Reasoning + 2026-10-18T13:06:46Z + + + The success of chain-of-thought (CoT) in complex reasoning can be attributed to a textual scaffolding effect: explicit intermediate results can be examined, reused, and composed to support subsequent reasoning, much as scaffolding supports a building under construction. However, mainstream multimodal LLMs lack an equivalent scaffold for visual distinctions that are difficult to express in concise verbal descriptions. We therefore ask: Can native visual representations become first-class citizens alongside language, providing a visual scaffold for reasoning? We define native multimodal reasoning as reasoning in which native visual representations and language jointly carry reusable intermediate states. As a concrete implementation, the visual scaffolding mechanism we proposed lets the MLLM autonomously initiate a retrieval action at any reasoning step. A lightweight retriever selects native visual features, which are then incorporated directly into the evolving CoT and remain available to subsequent steps. To evaluate this mechanism under controlled visual demands, we introduce NMR-Bench, comprising Burden Counting and Path Tracing. With 88M added parameters (approximately 2%) on Qwen3-VL-4B-Thinking, our model achieves 66.43% and 72.50% accuracy, respectively, surpassing the evaluated GPT-5.5 and Gemini 3.1 Pro baselines. Controlled interventions show that changing selected visual content affects task accuracy and can redirect subsequent visual selection even when intervening text is held fixed. These findings show that native visual states can function as intermediate reasoning material and point toward reusable scaffolds for additional modalities. + + 2026-10-18T13:06:46Z + + + Run Shao + + + Zhaoyang Zhang + + + Ziyu Li + + + Linrui Xu + + + Ji Qi + + + Xiu Su + + + Yichao Cao + + + Chao Tao + + + Haifeng Li + + + + http://arxiv.org/abs/2610.25005v1 + ReTrace: Visual Backtracking for Efficient Multimodal Large Language Models + 2026-10-18T04:19:13Z + + + Multimodal Large Language Models (MLLMs) encode images into dense visual token sequences, creating substantial attention and KV-cache overhead. Existing visual token compression methods reduce this cost by pruning low-saliency tokens in shallow layers, but this practice couples temporary computational deactivation with irreversible information deletion. We show that this coupling breaks an intrinsic inference pattern in MLLMs. Through layer-wise attention analysis, we identify \textbf{Visual Backtracking}: visual pivots remain spatially stable, yet in middle layers they actively retrieve context from tokens that appeared unimportant earlier. Thus, early low-saliency tokens can be inactive for computation while still being useful for later reasoning. Motivated by this finding, we propose \textbf{ReTrace}, a backtracking-aware compression framework that introduces a dormant token state. ReTrace caches non-pivot tokens outside expensive layer-wise computation, restores them during the backtracking window, and prunes only after their information has been absorbed. Experiments on Qwen2.5-VL and InternVL3 demonstrate nearly 90\% reductions in FLOPs and KV cache, a 2.83$\times$ prefilling speedup, and strong performance retention across complex vision-language benchmarks. + + + 2026-10-18T04:19:13Z + Accepted to Findings of EMNLP 2026, forthcoming + + + Guangzong Si + + + Dong Wang + + + Yifan Yu + + + Miao Liu + + + Panwang Pan + + + Wentao Zhu + + + + http://arxiv.org/abs/2610.24786v1 + Video-Language Entailment for Video Similarity Estimation + 2026-10-17T17:24:59Z + + + Comparing videos to assess their semantic similarity remains a challenging task for current Large Multimodal Models (LMMs), which are primarily trained with single-video objectives. While most prior works have focused on computing global similarity, recent studies have introduced the more challenging problem of concept-based similarity, which measures how similar two videos are with respect to specific concepts (e.g., activity, location). However, no dedicated approaches have yet leveraged LMMs to explicitly address this task. In this paper, we aim to fill this gap introducing Video Caption Entailment for video similarity estimation (VICE): a dual-branch design that leverages LMMs for cross-video reasoning. Each branch jointly processes one video and the caption of the other, measuring their alignment for a specific concept via video-language entailment. The outputs from both branches are fused to produce a final similarity score, along with a textual explanation of the model reasoning. This approach leverages the model's native single-video understanding while enabling fine-grained comparative reasoning between video and text. Experiments on ConViS-Bench and StepDiff show that VICE outperforms models that process both videos simultaneously, highlighting the promise of single-video reasoning for concept-based similarity estimation. + + 2026-10-17T17:24:59Z + EMNLP 2026 Findings + + + Benedetta Liberatori + + + Lorenzo Vaquero + + + Elisa Ricci + + + Paolo Rota + + + + http://arxiv.org/abs/2610.24771v1 + Design Anything, Design at Scale + 2026-10-17T16:29:33Z + + + As multimodal resources are transformed into media outputs, agentic AI is expected to stay aligned with design intent over long horizons. Designers follow briefs specifying goals, constraints, and deliverables, with later work building on earlier decisions. Recent work reuses design experience across tasks, yet alignment among artifacts within one project remains challenging. Agents therefore need to preserve and apply this intent across domains and as projects grow. We introduce Design Anything, a graph-based harness that preserves design intent outside the model and binds deliverables to the workflow steps that produce them through an intent-execution graph. A task contract retains constraints and decisions, selected designs become explicit inputs to later generations, and a deterministic controller uses bindings and execution records to check output types and counts, identify outstanding deliverables, and guide subsequent turns. We also introduce DesignAnything-Bench, with 228 tasks across 19 design domains, including 38 project families at scales of 6, 14, and 24 artifacts. With the LLM held fixed, Design Anything satisfies 85.0% and 92.5% of the brief's factual constraints with DeepSeek V4.1 Flash High and GPT-5.6 Sol High, respectively, exceeding the strongest same-model baselines by 15.4% and 14.4%. These gains reach 25.1% and 23.0% on 24-artifact tasks. Under each model, Design Anything leads or ties in constraint satisfaction in 18 of 19 domains. Professional designers also prefer its complete deliverable sets over those of same-model baselines in a blind evaluation. + + 2026-10-17T16:29:33Z + 47 pages, 25 figures, 16 tables. Project page: https://designanything.gemus.ai + + + Xuchao Ren + + + Siyuan Feng + + + Jing Huang + + + Yanhua Yao + + + Jing Wang + + + Lingyu Alina Wang + + + Anan Chen + + + Hangjie Yuan + + + Tao Feng + + + Qiong Wu + + + Sai Ma + + + + http://arxiv.org/abs/2610.24537v1 + Write Once, Query Many: Evolving Compact Reusable Memory for Long Videos + 2026-10-17T07:58:29Z + + + Long videos often exceed the context capacity of multimodal large language models (MLLMs), while agentic search repeats costly video processing and grounding for each query. Reusable memory can amortize this cost, but must preserve information for questions unknown during construction. We propose Video-EMem, an evolvable video memory harness built on time-anchored perceptual observations. This representation combines compact free-form text with sparse images to preserve semantic content and complementary visual details across temporal scales, supporting temporal navigation without a fixed semantic schema. A Writer encodes each video once by consolidating overlapping multiscale observations, and a Reader retrieves and organizes evidence solely from the resulting memory. With the underlying models frozen, we evolve their workflows and operators using distinct feedback: query-independent source fidelity and coverage for the Writer, and QA failures in evidence localization and utilization for the Reader. Experiments support this separation for generalization beyond development queries, with our evolution strategy improving average accuracy by 7.2% over the unevolved harness. While reducing storage by about 99.86% on average relative to raw videos, Video-EMem improves Qwen3-VL-30B by an average of 2.6% across three long-video QA benchmarks over direct input of 2,048 frames. Using the same o3 answer model as the state-of-the-art agentic method, it improves average accuracy by 2.5% with lower per-query latency. + + + 2026-10-17T07:58:29Z + + + Kerui Chen + + + Jinglu Wang + + + Yun Wang + + + Xinjiang Wang + + + Yan Lu + + + + http://arxiv.org/abs/2610.24452v2 + HumanSkill-4D: Training-Free Language Querying of Animatable Gaussian Avatars in Space and Time + 2026-10-20T04:37:26Z + + + We introduce avatar referring segmentation, which selects regions of animatable Gaussian avatars from language queries. A query can also specify a pose or motion to select matching intervals. This lets users interact with avatars for local editing and motion inspection. However, making these selections with existing language Gaussian splatting methods poses two challenges: adjacent parts and garments are hard to separate and may be referred to indirectly (region ambiguity), while fine-grained motions can look alike in RGB (motion ambiguity). We address these challenges with HumanSkill-4D, a training-free framework that shares a multimodal large language model (MLLM) and geometric operators across avatars. For each avatar, a semantic memory links body-part and garment categories to persistent Gaussian regions and appearance descriptions. The MLLM uses category names and descriptions to select categories by appearance, relation, or function. To find matching intervals, it composes operators into programs that check query conditions on driving joint trajectories stored in a motion memory. These category choices and operator outputs make selections traceable, while composing or adding operators supports new motion conditions. To evaluate this task, we introduce three human-annotated benchmarks and show that HumanSkill-4D outperforms the baselines in part segmentation and 3D and 4D referring segmentation, with compact memories and only minutes of setup per avatar. + + + 2026-10-17T04:43:01Z + 29 pages, 14 figures, 16 tables. Project page: https://jjunsss.github.io/HumanSkill-4D/ + + + Junsu Kim + + + Naeun Kim + + + Dongyoon Han + + + Seungryul Baek + + + + http://arxiv.org/abs/2610.24395v1 + MSCR: Jointly Balancing Utilization Across Modalities and Discovering Synergistic Information + 2026-10-17T02:54:30Z + + + In multimodal learning, modality imbalance often lets one modality dominate optimization and keeps the model from fully exploiting cross-modal interactions. Balance-oriented methods such as the Multimodal Competition Regularizer (MCR) perform well by alleviating this imbalance during training. These dynamic balancing methods, however, mainly adjust modality contributions and do not consider how imbalance affects the formation of synergistic information during fusion. Synergy is a major source of multimodal advantage, because it is predictive gain that cannot be recovered from unimodal evidence alone. We propose the Multimodal Synergistic Competition Regularizer (MSCR), a fusion method that jointly promotes balanced modality utilization and the discovery of synergistic information. MSCR has two complementary objectives. An anti-dominance objective suppresses excessive unimodal influence and leaves room for synergistic information, and a synergy objective encourages the fused predictor to outperform a non-synergistic unimodal reference. An adaptive gate further concentrates the regularization on samples that need stronger collaborative modeling. Experiments on five benchmarks show that MSCR consistently improves performance over MCR and strengthens synergistic capability. It raises conditional recovery, the accuracy of the fused prediction on samples that the unimodal predictors misclassify, as well as the share of the model's output that InterSHAP attributes to cross-modal interactions. Its gain in conditional recovery persists when the fusion module is Transformer-based. Code is available at https://github.com/chenxinyu991-collab/MSCR. + + + + 2026-10-17T02:54:30Z + Accepted at NeurIPS 2026 + + + Xinyu Chen + + + Liangjian Wen + + + Jiang Duan + + + Dongkai Wang + + + Yong Dai + + + Jiayu Bai + + + Jianzhuang Liu + + + Zhen Tian + + + Guoping Qiu + + + Zhao Kan + + + + http://arxiv.org/abs/2610.24379v1 + Defending Against Dormant Poisoning Attacks Across Language and Multimodal Agents + 2026-10-17T02:26:09Z + + + Recent work shows that attackers can implant dormant malicious behaviors that remain hidden at release but emerge after benign fine-tuning. As foundation models are used as agents, whether dormant poisoning extends to harmful agent actions and multimodal settings remains unclear. We show two agentic risks: (1) harmful behaviors activated by benign fine-tuning can extend to unseen actions; (2) multiple harmful behaviors can coexist and be jointly activated by benign downstream fine-tuning. Existing defenses often rely on external safe responses, which are hard to obtain for agent actions, or a trusted clean reference model. We exploit a key property of dormant poisoning: the attacker must preserve safe behavior at release to conceal poisoning, and this behavior can serve as a safety reference. Leveraging this property, we automatically construct a Safety Buffer pairing harmful inputs with the released model's responses and benign versions generated by the same model to remove harmful intent. The Safety Buffer can replace external safe responses in existing defenses, but these defenses do not distinguish updates that weaken safety from those that preserve it, often increasing over-refusal or reducing utility. To address this limitation, we introduce LookAhead Defense, which previews benign fine-tuning updates using the Safety Buffer and penalizes only updates predicted to weaken safe behavior on harmful inputs or increase the likelihood of refusals on benign versions in the Safety Buffer. Across language models, language agents, and multimodal agents, LookAhead Defense reduces harmful behavior in agents from up to 93.9% to at most 14.2% and harmful responses in language models from up to 92.5% to at most 2.0% versus vanilla fine-tuning, while maintaining competitive utility and low over-refusal. It remains effective against other poisoning methods. + + + + 2026-10-17T02:26:09Z + Project page: https://wonjuun.github.io/LookAhead/ + + + Wonjun Lee + + + Vaidehi Patil + + + Zaid Khan + + + Yue Zhang + + + Hyunji Lee + + + Suhyun Kim + + + Mohit Bansal + + + + http://arxiv.org/abs/2610.24378v1 + PACE-Mem: Prefix-Aware Complementary Evidence for Multimodal Agents + 2026-10-17T02:24:19Z + + + As multimodal agents accumulate experience, their long-term memories contain many similar observations of recurring scenes, actions, and entities. Answer quality depends on the evidence retrieved from these memories into the model's context. However, query-relevant memories may contain overlapping information, and a fixed retrieval depth may return too little or too much evidence for a given question. To address these challenges, we propose PACE-Mem, Prefix-Aware Complementary Evidence, which constructs a complementary evidence sequence and determines its length from the same selection trajectory. For structured memories, query-guided pooling combines records within each clip to obtain relevance scores and representations. Using these relevance scores and representations, maximal marginal relevance (MMR) selection balances query relevance against overlap with previously selected evidence. From the resulting score trajectory, a prefix-length selection algorithm determines retrieval depth by comparing length-normalized adjacent declines, accounting for both score changes and the amount of evidence accumulated. PACE-Mem is a training-free, plug-in retrieval method for clip-based agent memory systems, leaving memory construction and answer generation unchanged. Across three long-video benchmarks and two agent frameworks, PACE-Mem improves question-answering accuracy by an average of 1.6% over Adaptive-k, the strongest baseline at comparable mean retrieval depths. Further analysis reveals that jointly adding and removing evidence is associated with larger net accuracy gains than either change alone. + + 2026-10-17T02:24:19Z + 10 pages, 5 figures. Code: https://github.com/Shidu-Ren/PACE-Mem + + + Shidu Ren + + + Rong-cheng Tu + + + Hang Zhou + + + Xiao Luo + + + diff --git a/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm2.xml b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm2.xml new file mode 100644 index 0000000..8e47757 --- /dev/null +++ b/wizard-work/sphinx/archive-lcmm-corpus-2026-10-26/source/arxiv-mm2.xml @@ -0,0 +1,1871 @@ + + + https://arxiv.org/api/4jsvQ/zqzKwd0cvBxbCI07dfE8w + arXiv Query: search_query=cat:cs.CV AND abs:"vision language"&id_list=&start=0&max_results=60 + 2026-10-26T11:17:14Z + + 60 + 12381 + 0 + + http://arxiv.org/abs/2610.32967v1 + MiD-VLM: Detecting and Grounding Global Semantic Misinformation in Image-Caption Pairs + 2026-10-23T17:55:02Z + + + Semantic misinformation can arise when an authentic image is paired with a caption that changes or distorts its narrative. Because the image itself may contain no visible signs of manipulation, methods designed to detect pixel-level artifacts can miss these misleading image-caption pairs. We study this problem using DGM4+, a dataset designed to evaluate the detection of global scene and semantic inconsistencies. We propose a multimodal model that combines image-text representations from SigLIP with visual scene features from DINOv2 through a projection MLP, and adapts Qwen2-VL-7B using LoRA. The model jointly predicts whether an image-caption pair is authentic, identifies the manipulation type, and grounds the misleading caption tokens. On the DGM4+ validation split, the model achieves an F1 score of $0.9679$ for binary authenticity classification. These results suggest that parameter-efficient adaptation of vision-language models is promising for detecting semantic inconsistencies, while also motivating further work on precise token-level grounding. + + 2026-10-23T17:55:02Z + + + Tarunya Prasad + + + Bharatesh Chakravarthi + + + + http://arxiv.org/abs/2610.32948v1 + Beyond Discrete Tokens: Preserving Numerical Continuity in Medical Vision-Language Models + 2026-10-23T17:40:58Z + + + Objective: To develop a unified vision-language model for prompt-conditioned quantitative ultrasound measurement that addresses the mismatch between continuous measurement targets and discrete token-based numerical prediction. Methods: This article presents HAD-VLM, a hybrid autoregressive-diffusion framework that combines autoregressive text generation with continuous measurement prediction within a shared backbone. Visual prompt tuning adapts the vision encoder to ultrasound images. A diffusion process predicts a five-component representation comprising caliper endpoint coordinates and measurement length. A post-processing strategy combining the proposed coordinate-length consistency mechanism with ensemble prediction is introduced to refine measurement estimates. We evaluate four echocardiographic measurement tasks on EchoNet-LVH, with additional assessments of medical question answering and X-ray vertebral measurement. Results: HAD-VLM achieves mean absolute errors of 1.36, 2.77, 3.05, and 1.16 mm for IVSd, LVIDd, LVIDs, and LVPWd, respectively, reducing errors by 21.4-37.6\% relative to the Vicuna-based autoregressive baseline. It also outperforms fine-tuned Qwen3-VL and direct MLP regression across all four tasks. Medical question answering performance is preserved on the evaluated dataset. For X-ray vertebral measurement, HAD-VLM reduces mean absolute error from 11.4 to 6.7 pixels. Conclusion: Integrating autoregressive language generation with diffusion-based continuous prediction improves quantitative medical image measurement while retaining prompt-conditioned task flexibility. Significance: HAD-VLM provides a unified approach to combining language interaction with anatomically grounded numerical prediction for quantitative medical image analysis. + + + 2026-10-23T17:40:58Z + + + Dianye Huang + + + Jiamei Guo + + + Yue Zhou + + + Mingde Li + + + Yi Xiong + + + Wei Wang + + + Nassir Navab + + + Zhongliang Jiang + + + + http://arxiv.org/abs/2610.32880v1 + Multimodal Generative AI Assists Comprehensive Echocardiographic Interpretation + 2026-10-23T16:47:01Z + + + Echocardiography is the cornerstone of cardiovascular diagnostics, yet its global utility is constrained by a critical shortage of experienced interpreters. Current artificial intelligence (AI) solutions remain limited, typically operating as opaque "black boxes" or focusing on narrow tasks that fail to capture the holistic, guideline-driven reasoning of a clinician. Here we introduce EchoChat, a generative multimodal vision-language model that performs comprehensive echocardiographic analysis to support clinician interpretation. By emulating the cognitive workflow of a cardiologist, EchoChat integrates vast medical knowledge with a chain-of-thought reasoning mechanism to explicitly ground its conclusions in visual evidence. Trained on echocardiography-instruction pairs from 46,358 examinations, our model establishes a new state-of-the-art across diverse cohorts from six international medical centers. It supports the broadest diagnostic scope of 33 cardiac conditions and findings, including 15 newly added conditions for which it achieves an average F1 of 73.7% across available external evaluations. It surpasses existing best-performing foundation models in cardiac condition recognition (improving average recall by 13.54% on shared tasks) and quantification (average R2 score increase of 0.275 on shared tasks). Furthermore, in a source-blinded echocardiographer reader study, echocardiography reports co-generated with EchoChat were rated higher in diagnostic accuracy and completeness by two senior echocardiographers, and improved diagnostic performance from 72.78% to 82.75% in terms of F1 score over routine-reader only reports. These results demonstrate that integrating clinical reasoning into multimodal AI can democratize specialist expertise and transform the standard of cardiovascular care. + + 2026-10-23T16:47:01Z + + + Yi Qin + + + Marawan Elbatel + + + Shanshan Song + + + Taoran Huang + + + Jiarong Guo + + + Ningshu Li + + + Lehan Wang + + + Chenxu Zhao + + + Jiexin He + + + Machteld J. Boonstra + + + Stephan van der Zwaard + + + Marielle C. van de Veerdonk + + + Pere Lopez-Gutierrez + + + Lydia Dux-Santoy + + + Andrea Guala + + + Enrique Almar-Munoz + + + Sebastian Johannes Reinstadler + + + Radek Debiec + + + Yi-Hang Zhu + + + Huiyu Zhou + + + Adrian P Cheong + + + Yike Guo + + + Agnes Mayr + + + Karim Lekadir + + + Yong Jiang + + + Nilesh J. Samani + + + Dacheng Tao + + + Folkert W. Asselbergs + + + Hongwen Fei + + + Alex PW Lee + + + Xiaomeng Li + + + + http://arxiv.org/abs/2610.32697v1 + SP-Guide: Enhancing Aerial Vision-Language Navigation with Spatial Priors + 2026-10-23T14:21:58Z + + + Aerial vision-language navigation (AVLN) requires a UAV to reach a language-described target from partial egocentric observations while reasoning over large outdoor scenes. Existing approaches typically fuse view-centered RGB observations and globally anchored history maps as generic visual embeddings, leaving cross-modal spatial alignment to be learned from sparse navigation supervision. We present SP-Guide, a transformer- based goal-prediction framework that addresses this weakness of alignment through a Spatial Prior Cross-Modal Encoder, an Instruction Enhanced Decoder, and a Goal Convergence Filter for terminal target refinement. Experiments implemented on the CityNav benchmark show that SP-Guide improves success rate over the representative baselines, with the largest gains on unseen environments. These results indicate that physically grounded spatial priors provide an effective inductive bias for robust AVLN. + + + 2026-10-23T14:21:58Z + + + Haoxiang Tang + + + Dong Zhou + + + Shen Tan + + + Minxuan Jiang + + + Xitong Li + + + + http://arxiv.org/abs/2610.32635v1 + EditJev: System One Routing for Image Editing Models + 2026-10-23T13:46:53Z + + + Instruction-based image editing models exhibit pronounced sample-specific performance variation: different models can produce substantially different results for the same source image and editing instruction, and the best-performing model often varies across requests. These models also differ substantially in inference latency, making fixed-model deployment inefficient. We therefore study image editing model routing, which dynamically selects an editor from a candidate pool given an input image and editing instruction. We introduce EditJev, a System One routing model that directly predicts sample-level preference scores over candidate image editing models in a single forward pass. A lightweight preference head on a vision-language backbone produces a fixed-dimensional score vector without autoregressive model-name generation or response parsing. To train EditJev, we construct pairwise preferences from offline candidate outputs and optimize a pairwise ranking objective to learn relative model suitability. At inference time, EditJev combines the predicted preference scores with model-level speed scores to balance editing quality and generation latency. Experiments on ImgEdit and GEdit-En show that EditJev improves aggregate quality over the strongest fixed editor, from 4.540 to 4.592 and from 8.194 to 8.255, respectively, while reducing estimated end-to-end latency by 60.8% and 31.7%. These results demonstrate the effectiveness of direct, structured model routing for efficient image editing. + + + 2026-10-23T13:46:53Z + 12 pages, 4 figures, 7 tables + + + Zhile Guan + + + Xu Jiang + + + Yule Duan + + + Gongbo Zhang + + + Shuyu Wang + + + Xiao Chen + + + Jian Zhang + + + + http://arxiv.org/abs/2610.32486v1 + Efficient Zero-Shot Video Anomaly Detection via Signal-Aware Adaptive Fusion (SAAF) + 2026-10-23T11:02:16Z + + + Deploying Vision-Language Models for video anomaly detection confronts a fundamental constraint. Their semantic reasoning demands computational budgets incompatible with the scale of real-world video streams. We present Signal-Aware Adaptive Fusion (SAAF), a framework that achieves efficient zero-shot anomaly detection through three key innovations. First, we introduce a dual-signal adaptive sampler operating in semantic embedding space: a delta signal captures sudden events via frame-to-frame cosine distance, while a drift signal detects static and gradual anomalies through deviation from rolling temporal context. Their OR-gated combination with adaptive EMA-based thresholding provides comprehensive anomaly coverage without training data. Second, we propose a threshold-gated cascaded architecture where lightweight frame-level scoring precedes expensive video-level temporal analysis, invoking it only when confidence warrants additional context. Third, we design a signal-aware weighted fusion mechanism that dynamically adapts score combination based on which signal triggered frame selection. Across four benchmarks, SAAF delivers competitive accuracy at substantially lower cost. Among training-free zero-shot methods, SAAF sets a new state of the art on XD-Violence (92.07%), MSAD (86.70%), and ShanghaiTech (80.54%) AUC-ROC, with XD-Violence and MSAD also surpassing supervised baselines. SAAF sustains 44.95, 48.61, and 41.06 FPS on XD-Violence, UCF-Crime, and MSAD, a 2.43$\times$, 2.63$\times$, and 2.22$\times$ throughput improvement over the prior best zero-shot method. Code: https://github.com/kdawoud91/SAAF + + + + 2026-10-23T11:02:16Z + Accepted at WACV 2027 + + + Khaled Waleed Dawoud + + + Muhammad Haris Khan + + + + http://arxiv.org/abs/2610.32485v1 + PCFBench: How Far Can Large Vision-Language Models Go in Physics-aware Photonic Inverse Design? + 2026-10-23T11:02:02Z + + + Photonic crystal fibers (PCFs) underpin critical applications in telecommunications, sensing, and high-power laser delivery, yet their design remains a manual, expert-intensive process that couples geometric intuition with deep waveguide physics. Vision-language models (VLMs) offer a promising path toward automating PCF design, but can they truly reason about photonic physics from microscopy images, or do they merely recognize visual patterns? We introduce PCFBench, the first comprehensive benchmark for evaluating VLMs on the perception, reasoning, and decision steps of the photonic inverse-design loop. PCFBench spans 26 tasks organized into six categories of increasing cognitive demand (Geometry Perception, Physics Understanding, Text Generation, Multi-modal Reasoning, Inverse-Design Decision, and Code Generation), built from over 220K FDTD simulation samples across 18 structurally diverse fiber families. We evaluate both individual VLMs on isolated tasks and multi-agent systems (MAS) on the full sequential pipeline from perception to design. Our results reveal a striking perception-design gap: current models can identify fiber geometry with moderate success, yet consistently fail to translate that visual understanding into physics-aware design actions. Moreover, cascading agents through the pipeline exposes significant error propagation, where upstream perception mistakes compound into downstream design failures. These findings suggest that neither model scaling nor naive agent chaining suffices, and that closing the loop demands explicit physical grounding. PCFBench provides the community with a rigorous, multi-dimensional testbed to measure progress toward AI-assisted photonic engineering. The project is available at https://pcfbench.github.io/. + + 2026-10-23T11:02:02Z + Accepted to NeurIPS 2026, 66 pages, 30 figures, 27 tables + + + Shengchao Chen + + + Ting Shu + + + Sufen Ren + + + + http://arxiv.org/abs/2610.32478v1 + PathJev: Decision-Native Vision-Language Modelling for Histopathology + 2026-10-23T10:47:40Z + + + Vision-language models used for decisions in histopathology rarely return calibrated probabilities over the candidates a user cares about. Decision-native models write a question and a candidate set chosen at run time into the input and return a normalised distribution from a small decision head in one forward pass. We build PathJev-P, a decision-native model for histopathology: MedGemma-1.5-4B with LoRA adapters and a decision head, trained on 40,000 patch states from three public collections whose expert labels are turned into typed questions with organ-specific candidate sets and a "none of these" option. In a comparison over 3 seeds with an analysis plan fixed before testing, on test sets without documented overlap with the training data of the backbone, PathJev-P is more accurate than a generative model trained with the same backbone, data and selection rule, the zero-shot pathology model CONCH and a general medical decision model (balanced accuracy 0.541 against 0.492, 0.345 and 0.213); its advantage over the generative model comes from two organs absent from training. The calibration advantage depends on how the generative model's probabilities are read out. With the summed candidate log-likelihood used in previous work, PathJev-P has the lower calibration error (ECE 0.204 against 0.279); with a length-normalised read-out of the same generative model, examined post hoc, the two have similar mean calibration error (0.201) and the generative model is better calibrated on the unseen organs, where PathJev-P remains over-confident. A supervised linear probe on a pathology foundation model is better calibrated in every setting. In a qualitative whole-slide demonstration, PathJev-P labels unsupervised tissue clusters with abstention and separates carcinoma from other tissue while running the model on a fraction of the tiles. + + + 2026-10-23T10:47:40Z + 25 pages, 4 figures. Code: https://github.com/CosmoIknosLab/PathJev ; model and demo: https://huggingface.co/Cristiandieti/PathJev-P + + + Cristian Tommasino + + + Antonio M. Rinaldi + + + + http://arxiv.org/abs/2610.32440v1 + PROVE: Probabilistic Visual Grounding via Patch-Level Evidence for Vision-Language Models + 2026-10-23T10:06:50Z + + + Visual grounding with vision-language models such as CLIP typically produces a single deterministic relevance map for an image-query pair, without indicating whether the localisation is reliable or whether the referent is present at all. We introduce \textbf{PROVE} (\textbf{Pro}babilistic \textbf{V}isual Grounding via Patch-Level \textbf{E}vidence), a post-hoc evidential adapter that maps frozen CLIP patch features to per-patch Beta distributions without modifying the backbone. PROVE casts grounding as per-patch membership: each patch accumulates positive and negative evidence for whether it belongs to the referent, so a query may match zero, one, or many patches. We train PROVE with an evidential objective on soft patch-coverage targets, and define a prior-pull objective that keeps absent-referent examples near an uninformative prior, so that vacuity serves as an absence signal without a dedicated presence classifier. During inference, a single forward pass yields, in closed form, a posterior-mean grounding map, a spatial vacuity map, and an image-level absence score. We evaluate PROVE on referring-expression benchmarks: it is competitive in localisation with state-of-the-art CLIP grounding methods, its uncertainty tracks localisation error and supports selective prediction under abstention, and its image-level score detects when the referent is absent altogether. Our evidential patch-membership modelling offers a simple, drop-in mechanism for probabilistic verification in frozen vision-language grounding systems. + + + 2026-10-23T10:06:50Z + + + Mayank Nautiyal + + + Tianru Zhang + + + Li Ju + + + Ekta Vats + + + Prashant Singh + + + + http://arxiv.org/abs/2610.32423v1 + Cycle-of-Thought: Self-Evaluative Iterative Reasoning for Table Visual Question Answering in Document Images + 2026-10-23T09:50:37Z + + + Recent advances in Vision-Language Models (VLMs) have significantly improved Visual Question Answering (VQA) performance, yet their reasoning over structured content such as tables remains inconsistent, often plagued by spatial misalignment and logical hallucinations. Existing approaches for improving table VQA typically rely on architectural modifications or expensive supervised fine-tuning (SFT), which impose high barriers to entry due to the need for large-scale, expert-annotated datasets and significant computational resources. In this work, we propose Self-RefineVQA, a training-free, inference-time self-correction framework that improves table VQA performance without additional labeled data or model updates. Inspired by human revision behavior, our method enables a single VLM to iteratively act as a generator, critic, and refiner, forming a closed self-feedback loop that corrects common reasoning errors through prompt-guided re-evaluation. Experiments on tabular VQA benchmarks demonstrate that Self-RefineVQA yields consistent accuracy gains in monolingual and cross-lingual understanding, with a particularly significant boost for small models, enabling lightweight models (e.g., 2B-7B parameters) to rival the performance of significantly larger counterparts. Furthermore, we provide a comparative complexity analysis demonstrating that while inference cost increases linearly, our framework offers superior data efficiency and a lower cumulative cost by eliminating the prohibitive annotation bottleneck of human labeling required for fine-tuning. Our results highlight the potential of prompt-based self-improvement as a scalable, accessible paradigm for reliable table reasoning in VLMs. + + + + 2026-10-23T09:50:37Z + + + Somraj Gautam + + + Gaurav Harit + + + + http://arxiv.org/abs/2610.32360v1 + Search-Based Testing of Modality Sensitivity in Vision Language Models + 2026-10-23T08:52:02Z + + + Vision-language models (VLMs) process images and text jointly, yet robustness evaluations often perturb these inputs separately or assess only predefined corruption levels. Such evaluations provide limited evidence of which modality is more susceptible to perturbations and whether smaller changes across both modalities can jointly expose failures. We present MoST, a black-box testing framework that characterizes modality sensitivity by comparing image-only, text-only, and joint perturbations. MoST uses multi-objective search to select and combine perturbations and adjust their severity, seeking prediction degradation while limiting changes to images and prompts. We evaluate MoST on four VLMs performing object localization on ImageNet and driving images. The models exhibit distinct sensitivities: textual perturbations dominate for some, whereas others are susceptible across both modalities. In several configurations, joint perturbations match or exceed the effectiveness of single-modality perturbations with smaller modifications to each input. In a human study, 60-76% of assessments across models judge the perturbed inputs sufficiently understandable to perform the task, and human localization is more accurate than that of the corresponding VLMs. These results show that evaluating modalities separately can overlook failure-inducing combinations and that modality sensitivity provides a more detailed account of VLM robustness than aggregate failure rates alone. + + + 2026-10-23T08:52:02Z + + + Oliver Weißl + + + Eduardo Breitembach + + + Andrea Stocco + + + + http://arxiv.org/abs/2610.32220v1 + Angular Supervision for Visual Object Grounding in Autoregressive Vision-Language Models + 2026-10-23T06:16:32Z + + + Autoregressive vision-language models (VLMs) struggle to ground generated text in the correct image regions, and existing explainability methods, such as attention maps and Logit Lens, often produce poor spatial explanations due to weak text-to-vision attention and sink tokens. We propose \textbf{Angular Relevance} ($R_L$), a simple visualization measure based on cosine similarity between visual token embeddings and unembedding-matrix rows. Because $R_L$ is invariant to token norm, it produces substantially sharper and more faithful heatmaps than attention maps or Logit Lens on out-of-the-box models. Without any training, $R_L$ yields competitive referring-expression segmentation (RES), outperforming prior diagnostic maps and CLIP-based training-free methods. To preserve localized object information during cross-modal mixing, we introduce \textbf{Angular Object-Aware Loss (AOL)}, an auxiliary loss that directly supervises visual token embeddings to align angularly with the vocabulary directions of their corresponding object concepts. Finetuning with AOL alongside the standard next-token prediction objective significantly sharpens object localization in heatmaps, showing that the VLM's own visual tokens can be used directly for grounding and improving RES, without training any segmentation heads and without degrading general VQA performance. We further demonstrate that the learned grounding also transfers to category-level segmentation of object categories not seen during training. + + 2026-10-23T06:16:32Z + + + Parsa Esmaeilkhani + + + Longin Jan Latecki + + + + http://arxiv.org/abs/2610.32182v1 + Depth-Dependent Safety Geometry in Vision-Language Models: Layer-Wise Localization and Bidirectional Refusal Control + 2026-10-23T05:28:49Z + + + Vision-Language Models (VLMs) are widely deployed, yet the internal mechanisms behind their safety behavior remain poorly understood. We present a lightweight inference-time framework for localizing and manipulating safety-sensitive representations in frozen VLMs, without retraining or modifying parameters. On Qwen3-VL-4B, layer-wise activation divergence analysis reveals non-uniform safety geometry across depth. Causal interventions show that early vision layers support strong bidirectional refusal control through activation steering along a learned safety direction, with unsafe rejection spanning 6%-96%, whereas later layers respond more to activation magnitude scaling and exhibit a substantial safety-selectivity trade-off. Deeper layers remain well separated along the safety direction yet are largely insensitive to steering, distinguishing representational separability from causal controllability. InternVL2.5-4B shows qualitatively similar depth-dependent activation geometry despite differences in layer location and magnitude. Our results expose a white-box, representation-level refusal-bypass attack surface in VLM vision encoders and motivate inference-time stabilization of safety-sensitive representations. + + + + + 2026-10-23T05:28:49Z + Accepted at the NeurIPS 2026 Workshop + + + Muhammad Zeeshan Karamat + + + Syed Talal Hassan + + + Christiana Chamon Garcia + + + + http://arxiv.org/abs/2610.32177v1 + $Ψ$-0.6: Adaptive Streams of Thought in a Unified Vision-Language World Model + 2026-10-23T05:24:02Z + + + Humans reason about the physical world by flexibly combining different forms of inference as a problem unfolds. Achieving this flexibility is a major open challenge in AI: capabilities often remain separated across specialized models, limiting how they can be composed and jointly adapted to a task. We introduce $Ψ$-0.6, a unified vision-language world model that adaptively composes perception, language, geometry, and simulation within a shared reasoning process we call streams of thought. These streams interleave images, text, and explicit representations of geometry and motion, all of which the model can generate and interpret through a shared token interface. $Ψ$-0.6 surpasses leading open-weight models zero-shot on multi-view spatial reasoning, with further gains from reasoning through geometric intermediates. It also supports counterfactual simulation: generating and interpreting imagined scenes to determine, for example, whether moving an object would obstruct a pathway. Reinforcement learning from task feedback jointly optimizes the selection, generation, and use of intermediate representations, improving visual question-answering accuracy with gains that transfer to unseen benchmarks. $Ψ$-0.6 offers a path toward adaptive physical reasoning -- not only predicting the physical world but also choosing the representations through which to reason. + + + + 2026-10-23T05:24:02Z + + + Khai Loong Aw + + + Klemen Kotar + + + Baihan Zhang + + + Yifan Liu + + + Lilian Chen + + + Atlas Kazemian + + + Rahul Venkatesh + + + Daniel Yamins + + + + http://arxiv.org/abs/2610.32146v1 + Separating Angular Alignment from Radial Ordering in Hyperbolic Vision-Language Models + 2026-10-23T04:25:17Z + + + Hyperbolic vision-language models are well suited to modeling the hierarchical structure of multimodal data, because hyperbolic volume grows exponentially with radius, enabling low-distortion representations of tree-like taxonomies from general to specific concepts. However, existing pretraining objectives for hyperbolic vision-language models entangle semantic alignment with entailment modeling, forcing radial coordinates to simultaneously encode semantic matching and hierarchical structure, leading to conflicting geometric constraints. In this paper, we introduce AURORA, a hyperbolic vision-language framework that decouples the objectives through angular alignment and a novel Radial-Angular Order Cone (RAOC) for entailment modeling. Angular alignment captures semantic similarity while preserving the radial structure for representing hierarchies. Unlike conventional entailment cones, RAOC determines angular allowance from relative parent-child radial gaps. It is incorporated into hierarchical entailment contrastive training to capture partial-order relations. We further introduce a norm regularization term that prevents undesirable radial degeneration for stable training. We train models on millions of image-text pairs and evaluate them across zero-shot classification, image-text retrieval, hierarchical reasoning, and compositional understanding. Our model consistently outperforms strong Euclidean and hyperbolic vision-language baselines, demonstrating the effectiveness of decoupling semantic alignment from hierarchical entailment modeling. + + 2026-10-23T04:25:17Z + 34 pages, 12 figures + + + Mingyang Gao + + + Yuwei Wu + + + Shiyu Luo + + + Wei Wu + + + Xiaomeng Fan + + + Qihao Lv + + + Haoyu Zhang + + + Rui Gao + + + Bingzhen Liu + + + Zhi Gao + + + Che Sun + + + + http://arxiv.org/abs/2610.32013v1 + MAGIC: Margin-gated Contrastive Debiasing with Evidence Restoration for VLM Test-time Robustness Scaling + 2026-10-23T00:24:44Z + + + This paper studies the problem of test-time robustness scaling for large vision-language models (LVLMs), which aims to mitigate language bias during inference. Existing approaches typically adopt test-time scaling techniques such as contrastive decoding to improve inference performance. Despite the progress, the performance of these approaches is far from satisfactory due to intentional evidence removal during perturbations and redundant inference cost. Towards this end, we propose a novel approach named Margin-gated Contrastive Debiasing with Evidence Restoration (MAGIC). The core of our MAGIC is to evaluate the decision margins of LVLMs to selectively activate textual and visual perturbation branches for efficient debiased inference. In particular, our MAGIC first measures the prediction margins of crucial tokens, and applies a gating function to identify low-confidence responses that are susceptible to language biases. For selected samples, we integrate the token logits from multiple textual and image perturbation branches with the original ones for debiased decision. More importantly, we selectively restore the most informative corrupted views with sharp prediction distributions for ambiguous samples after debiasing, enabling evidence recovery for discriminative decision-making. We further utilize a calibration dataset to actively identify and prune ineffective branches during contrastive debiasing for cost reduction. Extensive experiments on benchmark datasets validate the effectiveness of the proposed MAGIC in comparison with extensive baselines. + + + 2026-10-23T00:24:44Z + + + Shunshun Gu + + + Enze Zhang + + + Ming Pei + + + Hang Zhou + + + Xiao Luo + + + + http://arxiv.org/abs/2610.31986v1 + OpenHome: From Perception to Insight in Smart-Home Camera Videos + 2026-10-22T23:04:49Z + + + Vision language models (VLMs) have been increasingly adopted in consumer smart-home camera systems to interpret recorded videos and provide insights. However, video clips captured from smart-home cameras are different from curated web videos dominating existing VLM benchmarks. Smart-home video clips often do not contain subtitles or narration and are captured from different viewing angles, under various lighting conditions, and in diverse scenarios. However, the capabilities of the model in this domain, under sparse visual signals and limited context, are not fully assessed by existing VLM benchmarks. To close this gap, we introduce OpenHome, a visual-only, four-option multiple-choice benchmark for evaluating smart-home video understanding. It contains 2,254 questions on 1,118 real-world video clips and organizes 10 tasks into three capability levels. Perception evaluates visible content, Reasoning evaluates causal, spatial, and temporal relationships, and Insight evaluates subject intent, supporting evidence and appropriate homeowner responses. Based on the dataset, we describe the task design, data pipeline and evaluation protocol, and report results for 32 closed-source and open-weight VLMs. The best model, Gemini 4 Argon, reaches 81.2% overall accuracy. Frontier closed-source models outperform open-weight models on every level. The best closed-source model leads the best open-weight model by 16.3% on Perception, 22.4% on Reasoning and 37.4% on Insight. + + + 2026-10-22T23:04:49Z + + + Xianglong Wang + + + Neil Rodrigues + + + Pei Guo + + + Yiru Fang + + + Kevin Beussman + + + Shuyang Wang + + + Jingzhi Wang + + + Liangju Li + + + Shunyao Xu + + + Zhongwei Cheng + + + Wei Li + + + Lin Chen + + + + http://arxiv.org/abs/2610.31898v1 + StateBridge: Phase- and Track-Grounded Reasoning for Synthetic-to-Real Traffic Video Captioning and VQA + 2026-10-22T20:52:22Z + + + Traffic safety videos provide rich evidence for understanding interactions between pedestrians and vehicles, but synthetic-to-real evaluation makes this setting challenging because models must learn from simulated scenes and generalize to real-world traffic. In this work, we present StateBridge, a traffic video-language framework designed to operate under this synthetic-only training protocol. Our approach uses phase-aware clip construction, pedestrian and vehicle track summaries, and structured prompts to ground vision-language models in stable traffic evidence rather than appearance alone. We fine-tune public vision-language models on synthetic captioning and visual question answering examples, then combine their outputs through fact-locked caption fusion and evidence-diverse VQA consensus to improve consistency across actor roles, behavioral phases, and question types. StateBridge achieves an official S2 score of 55.4679 on AI City Challenge 2026 Track 2 using only synthetic training data. These results demonstrate the effectiveness of structured evidence transfer for traffic safety captioning and visual question answering. + + 2026-10-22T20:52:22Z + 25 pages, 5 figures, ECCV conference + + + Blessing Agyei Kyem + + + Richard Dzinyela + + + Joshua Kofi Asamoah + + + Eugene Denteh + + + Andrews Danyo + + + Solomon Owusu-Ansah + + + Dickson Gyimah Asiedu + + + Armstrong Aboah + + + + http://arxiv.org/abs/2610.31845v1 + EgoForesight: Effectively Scaling Policy Learning with Noisy Egocentric Actions + 2026-10-22T19:28:43Z + + + Scaling policy learning requires broad experience and reliable supervision. Robot demonstrations provide high-quality trajectory supervision but are costly to collect. Egocentric videos broaden task and environment coverage, yet motion reconstruction and retargeting introduce noisy action labels. To address this challenge, we introduce EgoForesight, a vision-language-action framework that learns jointly from both sources by reducing the influence of unreliable action labels and exploiting demonstrated outcomes as complementary supervision. A joint vision-action flow couples future visual representation prediction with action generation, unifying reliability-aware action learning with outcome-informed representation transfer. Specifically, reliability-conditioned corruption allocates action supervision across noise levels according to source reliability, while reliability-weighted regression regulates each source's contribution. Complementing this treatment of noisy labels, privileged-future representation distillation draws supervision from demonstrated outcomes. An exponential-moving-average teacher observes the current scene and clean future to encode action-relevant structure from the resulting scene change. Its deeper representations supervise an earlier student layer receiving a corrupted future, providing outcome-informed structure beyond noisy action annotations. Together, these mechanisms support effective scaling with noisy egocentric actions. Over the tested range, EgoForesight exhibits steeper scaling slopes than the baseline, reducing real-world open-loop action MSE by 20.5% and improving RoboCasa few-shot success by 8.1 percentage points at 30,000 hours of pretraining data. After post-training, it also achieves strong absolute performance in both simulated and real-world dexterous manipulation. + + + 2026-10-22T19:28:43Z + Project page: https://lin-shan.com/EgoForesight + + + Chubin Zhang + + + Changyuan Wang + + + Yirui Wang + + + Ao Li + + + Shilin Ma + + + Yue Su + + + Cai Zhou + + + Xiuwei Xu + + + Tianle Zhang + + + Yansong Tang + + + + http://arxiv.org/abs/2610.31835v1 + SAGE: A hybrid vision-language and geometry framework for work-zone pathway prediction under temporary traffic control + 2026-10-22T19:14:17Z + + + Temporary traffic control redirects vehicles through work zones, requiring automated vehicles to connect an interpretation of the visible devices to a continuous passing path. Geometric predictors can provide several plausible paths, yet selecting the one consistent with the temporary control remains difficult. We propose SAGE (Semantic-to-Action Grounded Execution), a read-decide-execute-check framework that separates path construction, path preference, and control compliance within a shared candidate space. The central idea is to use a vision-language model's (VLM's) trajectory as a preference over intact geometric candidates. A role-decoupled generator constructs the candidates, and rank fusion combines each candidate's geometric score with its agreement with the VLM trajectory. Supervision structured around the Manual on Uniform Traffic Control Devices (MUTCD) trains SAGE-VLM to state the lane status and hazard side before its passage decision and trajectory. The predicted hazard side enters image-space predicates derived from MUTCD provisions, which support a final intervention bounded in score and displacement. On 2,306 real-world ROADWork validation episodes, the candidates include a path within 10 px of the human demonstration in 87% of episodes, yet selection regret accounts for 53% of the geometric ranker's error. SAGE reduces average and final displacement errors by 8.3% and 12.0% relative to the ranker, mostly in the far field, and hard-constraint violations by 37%. The trajectory opinion improves all four tested generator-selector combinations. SAGE is comparable to state-of-the-art VLM modules in accuracy, with a faster-responding VLM, and outperforms four other adapted driving VLMs in displacement error and safety measures. Project page: https://hhjj233.github.io/SAGE-page/. + + + 2026-10-22T19:14:17Z + 26 pages, 9 figures, 7 tables. Project page: https://hhjj233.github.io/SAGE-page/ + + + Jiaxi Liu + + + Keshu Wu + + + Weizhe Tang + + + Bofeng Cao + + + Sikai Chen + + + Xiaopeng Li + + + Steven T. Parker + + + Bin Ran + + + + http://arxiv.org/abs/2610.31670v2 + Sensorimotor Alignment: A Platonic Proxy for Embodied Policy Success + 2026-10-23T05:34:10Z + + + Robot foundation models are typically evaluated through costly closed-loop rollouts, motivating low-cost offline proxies for model capability. The Platonic Representation Hypothesis (PRH) suggests that as representations improve, modalities such as vision and language converge toward a shared statistical model of reality. We ask whether motion trajectories form another such modality: as embodied models become more capable, should their sensory representations converge toward the structure of physical motion? To test this, we propose Sensorimotor Alignment ($S^2$), a training-free offline metric that measures how well a model's sensory representation aligns with the geometry of physical motion. We find that $S^2$ correlates positively with downstream robot task success across model families, making it a low-cost offline proxy for prioritizing models before closed-loop evaluation. $S^2$ can also identify promising vision-language model (VLM) backbones before costly fine-tuning into vision-language-action models (VLAs). Beyond this correlation, $S^2$ offers representation-level explanations for phenomena observed in VLAs and world action models (WAMs). With $S^2$, we extend PRH to robotics and make sensorimotor alignment measurable, offering a low-cost, representation-level view of robot foundation models that closed-loop success rates alone cannot reveal. + + + + 2026-10-22T17:59:51Z + 28 pages. Project page and code available at https://yunfeixie233.github.io/s2/ + + + Yunfei Xie + + + Howard H. Qian + + + Shiyi Lan + + + Kaiyu Hang + + + Chen Wei + + + + http://arxiv.org/abs/2610.31566v1 + CellTrack-Bench: Microscopic Cell Tracking Benchmark for Vision-Language Models + 2026-10-22T17:09:12Z + + + Large language models have shown outstanding performance on text-first tasks such as coding, math, and writing. Recent efforts are shifting models' training to include scientific problems that often live in highly specialized domains beyond text, such as protein structure and biological images. However, in these scenarios, their general-purpose accuracy compared with specialized algorithms remains in question. One such domain is cell tracking, which requires spatiotemporal awareness of cell dynamics. To evaluate this, we created a new benchmark, CellTrack-Bench, which assesses Vision-Language Models' (VLMs) cell-tracking-related performance against specialized trackers. The full benchmark draws from 15 standard cell-tracking datasets across four imaging modalities and comprises 1,537 problems corresponding to 9,041 cell-linking decisions. We selected a hard subset requiring greater reasoning effort by identifying failures shared across distinct algorithmic trackers. With this proposed dataset, we: (i) evaluated different environment harnesses for VLMs; (ii) benchmarked 9 frontier closed-source models and 13 open-weight models; and (iii) provided a detailed analysis of their failure modes. Code, the stored model outputs, and a pipeline that regenerates the benchmark from the source datasets are available at https://github.com/royerlab/celltrack-bench. + + 2026-10-22T17:09:12Z + + + Ilan Theodoro + + + Jordão Bragantini + + + Loïc A. Royer + + + + http://arxiv.org/abs/2610.31494v1 + AgentVQA: A Unified Benchmark for Agentic Visual Understanding + 2026-10-22T16:13:35Z + + + Vision-language models (VLMs) can perform a broad range of tasks across diverse settings, yet their performance in agentic contexts remains poorly understood. Although online evaluations in simulators and real-world environments are essential for measuring interactive agent performance, they are costly and challenging to scale. Complementary offline VQA benchmarks can enable faster and more reliable comparisons across agentic domains, yet existing benchmarks remain limited and fragmented. To address this gap, we introduce AgentVQA, an offline benchmark for evaluating VLMs on realistic agentic scenarios across five agent domains: Web Agents, Robotics, Egocentric Videos, Games, and Spatial Planning. We build AgentVQA by manually selecting 1000 challenging, real-world agent examples from 23 source datasets and adapting them for reliable offline evaluation. The resulting benchmark preserves realistic scenarios from interactive environments across diverse domains, and its model rankings track those from corresponding online evaluations. Across the 22 evaluated models, the best achieves only 58.5% accuracy. Our cross-domain analysis shows that errors are driven primarily by failures to ground and maintain accurate representations of the current and evolving visual state, including localizing relevant UI elements, interpreting motion, tracking state changes over time, and inferring 3D spatial relationships, rather than by task misinterpretation or downstream logical reasoning. + + 2026-10-22T16:13:35Z + Project page: https://zlab-princeton.github.io/AgentVQA + + + Advait Gupta + + + Sachin Konan + + + Tom Yin + + + Gabriel Sarch + + + Zhuang Liu + + + + http://arxiv.org/abs/2610.31478v1 + MoG-VLM: Efficient Video Anomaly Detection through Motion-Guided Vision-Language Models + 2026-10-22T16:03:47Z + + + Vision-Language Models (VLMs) have shown strong potential for video anomaly detection, but dense frame-level inference makes them impractical for real-time deployment. Existing acceleration commonly relies on uniform sampling, which ignores content dynamics and can either waste computation on static segments or miss localized anomalies. We propose MoG-VLM a motion-adaptive anomaly detection framework that leverages motion purely as a lightweight control signal to decide when VLM inference is necessary. To this end, we introduce Temporal Gradient Magnitude (TGM) which performs content-aware sampling to concentrate computation on informative regions while avoiding redundant processing. We further introduce a hierarchical dual-stream design in which dense multi-frame VLM reasoning is activated only around frames with elevated anomaly likelihood, via anchor-triggered context-window expansion with early termination. A fusion module then reconciles these instantaneous semantic cues with temporal action dynamics. Across four benchmarks, our method achieves 91.91%, 84.30%, 87.88%, and 78.96% AUC-ROC on XD-Violence, UCF-Crime, MSAD, and ShanghaiTech, respectively, establishing new state of the art on three benchmarks under the zero-shot, training-free setting. On XD-Violence, we improve over the previous best result by +0.57% while delivering a 1.31x inference speedup. These results demonstrate that content-aware allocation of VLM capacity, processing fewer frames more intelligently rather than all frames uniformly, is a more effective axis of progress than uniformly densifying VLM inference across frames. Code is available on GitHub: https://github.com/kdawoud91/MoG-VLM. + + + + 2026-10-22T16:03:47Z + Accepted at BMVC 2026. Includes supplementary material + + + Khaled Waleed Dawoud + + + Muhammad Zaigham Zaheer + + + Khan Muhammad + + + Muhammad Haris Khan + + + + http://arxiv.org/abs/2610.31471v1 + Ask About the Right Moment: Training-Free Object Identity Reasoning for Video-Language Models + 2026-10-22T15:59:59Z + + + Many questions about a video concern one physical object. Where does the ball end up after the cups are shuffled? Which card is the queen? How often was the mug covered? Video-language models (Video-LMs) recognise such objects in single frames but do not keep them apart over time. On real shell-game videos, open models from 8B to 235B parameters, their thinking variants, a reinforcement-learned tool agent and three training-free tool agents all stay within ten points of chance. We separate semantic identity binding from temporal identity maintenance. An object's identity should be fixed at a moment when the evidence for it is visible, and carried afterwards by a tracker. \emph{Track, Then Bind} implements this principle without training. A promptable video tracker follows every candidate object and draws it with a track number. A frozen vision-language model answers a static question about the identifying evidence, which binds the target to a track. The answer is then derived from the tracked state in text, without asking the model to reinterpret the original video during read-out. A single configuration covers all benchmarks. With Qwen3-VL-32B it solves both VET-Bench tasks, where a fine-tuned trajectory model reaches 92\% and 90\% and the same VLM voting over 16 samples stays at 30--32\%. It answers 55.4\% of the hardest Perception Test cup games, where the best published model answers 41.5\%, and, using track-derived timelines, 48.6\% of TOC-Bench questions, against 37.1\% for the same model answering directly. Drawing the same tracks on the video and asking the question directly falls 12--19 points short of the agent on real cup games. + + 2026-10-22T15:59:59Z + + + Di Yang + + + Xiaochang Li + + + Muyang Liu + + + Yufei Wang + + + Yanhai Xiong + + + + http://arxiv.org/abs/2610.31329v1 + WeVisOne-VL: Unified Visual Perception from Objects to Pixels + 2026-10-22T14:19:50Z + + + Existing vision-language models (VLMs) remain unreliable for fine-grained visual perception. In this report, we present WeVisOne-VL (WeChat Vision All-in-One), a powerful VLM that unifies object-level and pixel-level perception through structured next-token prediction. It supports multiple visual tasks including object detection, referring localization, counting, OCR, segmentation, and matting, enabling localization at any user-specific granularity, from points and boxes to masks and alpha mattes. Architecturally, we integrate a lightweight pixel decoder into the VLM via a special <OBJ> token to generate instance-level pixel outputs. We train the model with a three-stage curriculum SFT followed by mixed-task RL. Across over 30 benchmarks, WeVisOne-VL demonstrates leading performance on both object-level and pixel-level tasks, while maintaining robust rejection for object-absent queries. By releasing WeVisOne-VL to the open-source community, we hope to advance VLMs from broad visual understanding toward truly reliable perception systems for real-world deployment. + + 2026-10-22T14:19:50Z + + + Tianming Liang + + + Junyi Pan + + + Yuxi Li + + + Canmiao Fu + + + Zhipeng Huang + + + Chong Sun + + + Chen Li + + + Jing Lyu + + + + http://arxiv.org/abs/2610.31304v1 + Data-Driven Vision-Language Models for Remote Sensing: A Survey + 2026-10-22T14:03:29Z + + + During the deep learning era, innovations in remote sensing (RS) vision models primarily focused on optimizing network architectures for specific tasks and conducting end-to-end training. However, with the advent of the Vision-Language Models (VLMs) era, constrained by substantial computational resource demands, the mainstream research paradigm has shifted towards adapting general-purpose VLMs using RS vertical domain data for fine-tuning, rather than modifying their core architectures. This transition marks a change in the innovation pathway from model-centric to data-centric. Despite the increasing importance of data, the academic community still lacks a systematic, data-centric survey to guide researchers in constructing high-quality RS vision-language datasets for various application scenarios and in conducting effective model fine-tuning and performance evaluation based on these datasets. To address this gap, this paper presents a systematic review of the development status of RS datasets tailored for VLMs. It further provides a comprehensive practical guide for RS researchers in the large model era, covering the entire pipeline from data construction to fine-tuning and evaluation. This paper aims to encourage the academic community to build more diverse and higher-quality vision-language datasets for specialized RS sub-fields. Ultimately, the goal is to converge these efforts into a comprehensive RS vision-language corpus that offers extensive task coverage and a wide geographical distribution, thereby laying a solid data foundation for advancing towards general artificial intelligence in RS. + + + 2026-10-22T14:03:29Z + 44 pages, 15 figures + + IEEE Geoscience and Remote Sensing Magazine, vol. 14, no. 5, pp. 232-267, Oct. 2026 + + Yue Zhou + + + Shujun Zhao + + + Xue Yang + + + Ruigang Li + + + Tianwen Zhang + + + Mengcheng Lan + + + Chaofeng Chen + + + Lingfei Ma + + + Hongjie He + + + Jonathan Li + + 10.1109/MGRS.2026.3696441 + + + + http://arxiv.org/abs/2610.31282v1 + ReCoG: Relational Concept Graph for Training-Free Personalization + 2026-10-22T13:48:41Z + + + Training-free personalization adapts a frozen vision-language model (VLM) to recognize user-defined concepts from only a few exemplars by retrieving concept entries at inference time. While recent retriever-based methods enrich each concept with descriptive evidence, they largely treat concepts in isolation, so the retrieved information can be plausible yet non-discriminative, especially when the personalized concept set contains highly confusable, fine-grained categories. We argue that personalization is inherently relational: correct recognition depends on the specific distinctions between a concept and its nearest alternatives. To this end, we propose ReCoG, a Relational Concept Graph for retrieval-augmented personalization. ReCoG represents concepts as nodes and augments them with directed edges that explicitly capture discriminative cues between concept pairs, elicited by a frozen VLM during database construction. At inference, ReCoG retrieves a shortlist and resolves ambiguity via explicit pairwise comparisons conditioned on the corresponding relational edges, selecting the concept that consistently wins against competing candidates. We also introduce FINGER benchmark to test personalized recognition on confusable concept sets. Across FINGER, ReCoG substantially outperforms prior methods, with the largest gains in the most confusable regimes. ReCoG also achieves consistently best performance on established personalization benchmarks including captioning and VQA, confirming that relational evidence is broadly beneficial beyond fine-grained settings. Project Page: https://csy-98.github.io/ReCoG/ + + 2026-10-22T13:48:41Z + + + Changseon Yu + + + Hyeokjun Kweon + + + + http://arxiv.org/abs/2610.31166v1 + Memory before Goal: Role of Pre-History Memory for Humanoid Loco-Manipulation + 2026-10-22T12:24:25Z + + + Humanoid loco-manipulation in dynamic scenes is non-Markovian: cues vanish as objects change or are hidden, or leave the view as the robot turns and walks, yet whole-body vision-language-action (VLA) policies see only the present. We present WholeBodyMem, an object-guided perceptual memory that keeps the pre-history of object events seen before the robot acts on its goal. SAM3 tracks the task objects, and their events causally select key frames within an adaptive budget, which the action expert reads by cross-attention together with object tokens encoding appearance, geometry and time. We also contribute HuMeGo, a humanoid memory benchmark with six simulated and six real-world Unitree G1 tasks. Keeping the right frames rather than more frames, WholeBodyMem surpasses memoryless and uniform-memory baselines, raising its base policy's success from 29.1% to 72.6% in simulation and from 36.7% to 88.3% on the real robot, while also improving the standard SIMPLE tasks (70.2% to 86.9%). + + + + 2026-10-22T12:24:25Z + 8 pages, 4 figures, 5 tables. Submitted to IEEE Robotics and Automation Letters (RA-L). Project page: https://memory-before-goal.github.io + + + Chenyuan Chen + + + Ran Ding + + + Lechen Zhang + + + Zewen He + + + Yoshihiko Nakamura + + + + http://arxiv.org/abs/2610.31145v1 + RankAlign: Vision-Language Representation Alignment via Rank Transformation + 2026-10-22T12:03:19Z + + + While the Platonic Representation Hypothesis posits that vision and language models converge toward compatible latent geometries, recovering class-level correspondences between unpaired modalities without cross-modal supervision remains challenging. Existing relational matching methods compare within-modality similarity kernels directly, although the same semantic structure may be represented through different numerical parameterizations across modalities. We propose RankAlign, a rank-based normalization strategy for class-level unpaired vision-language matching. RankAlign transforms each within-modality similarity kernel into an ordinal relational representation before permutation matching, while leaving the correspondence space and matching solver unchanged. The resulting representation is invariant to strictly increasing reparameterizations of similarity values while preserving the ordinal structure used for matching. We provide exact-recovery and stability guarantees that characterize correspondence recovery under both exact and partial ordinal agreement. Experiments across diverse frozen vision and language encoders and multiple datasets demonstrate improved and more stable class-level correspondence recovery, including under label corruption and domain shift. + + 2026-10-22T12:03:19Z + Accepted at NeurIPS 2026 + + + Enzhe Zhao + + + Marco Fiorucci + + + Lamberto Ballan + + + + http://arxiv.org/abs/2610.30980v1 + Diagnostic Loss: Asymmetric Supervision for Radiology Report Generation + 2026-10-22T09:26:17Z + + + Automated radiology report generation requires models to do more than produce fluent clinical narratives: they must explicitly state supported diagnoses while avoiding unsupported ones. However, existing medical vision-language models (MedVLMs) are typically trained with token-level maximum likelihood objectives, which prioritize text agreement over diagnostically critical terms. As a result, models can miss key diagnoses and introduce wrong ones. We identify this as an objective misalignment between conventional language modeling and the asymmetric diagnostic requirements of radiology reporting. To encode these requirements, we introduce Diagnostic Loss (DLoss), a differentiable, architecture-agnostic objective that operates directly on decoder token probabilities. DLoss separately aggregates probability mass over vocabularies associated with diagnoses supported by the reference report and with unsupported alternatives. Using asymmetric pooling across token positions in the report, it encourages supported diagnoses to receive sufficient probability in at least one position while suppressing spurious probability spikes for unsupported diagnoses across all positions during training. The loss can be applied to existing 3D MedVLMs without modifying their vision backbones, language decoders, or inference procedures, and introduces no additional inference-time computation. We train and evaluate DLoss on 50,000 abdominal CT scans across several 3D MedVLM architectures on both in-distribution and out-of-distribution report-generation benchmarks. Across these settings, DLoss improves diagnostic faithfulness while maintaining competitive performance on conventional language-generation metrics, showing the value of asymmetric sequence-level supervision for radiology report generation. The code for DLoss is available at https://github.com/gmum/DLoss. + + + 2026-10-22T09:26:17Z + 26 pages, 6 figures, 7 tables. Code available at https://github.com/gmum/DLoss + + + Ignacy Kolton + + + Wenxuan Li + + + Zongwei Zhou + + + Jarosław B. Ćwikła + + + Arkadiusz Sitek + + + Pedro R. A. S. Bassi + + + Szymon Płotka + + + + http://arxiv.org/abs/2610.30913v1 + Watch and Learn: Teaching Visual In-Context Learning by Removing Textual Shortcuts + 2026-10-22T08:34:24Z + + + Vision-language models (VLMs) struggle with in context learning compared to their textual counterparts. Our preliminary study shows that VLMs rely on textual shortcuts and underutilize the visual demonstrations. We therefore hypothesize that VLMs are insufficiently trained to perform visual in-context learning (vICL). To this end, we construct MIME, a task-agnostic vICL training set without textual shortcuts. We ensure the instruction does not state the rule linking the demonstration images to their answers, so the model must infer it from the visual demonstrations. Fine-tuning on MIME improves vICL accuracy by 8.1 to 18.0 points across three VLMs, preserves single-image performance, and improves multi-image and text only in-context learning. In contrast, stating the rule in the training data sharply reduces this gain. We further propose DTAD (Demonstration Text Attention Dropout), which randomly withholds demonstration labels during training so that the VLM must infer the rule from the demonstration images. While achieving comparable vICL accuracy to fine-tuning on MIME, DTAD yields more consistent attention to the demonstration images. On TrueMICL, Qwen3-VL-8B trained on MIME matches frontier models such as Claude Opus 5, and surpasses them with DTAD. Finally, adding MIME to the instruction-tuning mix of LLaVA 1.5 13B more than doubles its vICL accuracy without hurting single-image abilities, whereas a same-size multi-image set improves it only slightly. These results suggest that vICL data should be a standard component of VLM training. + + 2026-10-22T08:34:24Z + + + Nimrod Shabtay + + + Asaf Yehudai + + + Avihu Dekel + + + Eli Schwartz + + + Raja Giryes + + + + http://arxiv.org/abs/2610.30908v1 + Query-Time Calibration of CLIP Features for Open-Vocabulary 3D Segmentation + 2026-10-22T08:31:12Z + + + Lifting vision-language features such as CLIP into 3D Gaussian reconstructions enables open-vocabulary segmentation through natural-language queries. Although CLIP represents a broad range of semantic concepts, the lifted features of individual scenes can exhibit strong directional concentration, while raw cosine similarity does not account for the scene-specific feature distribution. We show that substantial segmentation gains can be obtained by changing how a fixed lifted feature field is compared with text. Our method partially subtracts a shared scene direction from visual features and text prototypes and whitens text prototypes using a fixed reference vocabulary of generic terms. It then uses soft clustering for multiclass prediction and CSLS with a relevance margin against the reference vocabulary for single-query prediction. Beyond reducing directional concentration, scene centering improves class-relative feature separation in every evaluated scene. Across seven lifting methods and four datasets, the resulting query-time calibration consistently improves mean intersection over union in both multiclass and single-query segmentation. These gains require no retraining, source-image re-encoding, or feature re-lifting, demonstrating the value of scene-conditioned comparison for making better use of existing lifted representations. + + + 2026-10-22T08:31:12Z + + + Dominik Engel + + + Yousef Rajeh + + + Leon Sick + + + Ivan Viola + + + + http://arxiv.org/abs/2610.30834v1 + RECAP: Looking Once Is Not Enough for Vision-Language Reasoning + 2026-10-22T07:04:23Z + + + Long chain-of-thought reasoning improves vision-language models (VLMs), but it also exposes a temporal grounding failure: as generation unfolds, models may drift from image evidence while reinforcement learning still provides only a final-answer reward. We study this gap through visual revisit, a temporally localized reactivation of image evidence during reasoning. Across three VLM backbones, revisit peaks are predictive of correctness and causally linked to performance: masking them degrades accuracy more than masking non-peaks, while injecting revisit-like peaks into failed rollouts partially restores correct answers. Control analyses show that this signal is not explained by raw attention strength, uncertainty, logit margin, or hidden-state norm. We propose RECAP, a GRPO-compatible training method that turns detached revisit traces into a credit-assignment signal. RECAP uses revisit-conditioned advantage estimation, dynamic discounting, and gated value prediction to propagate final rewards through visually important reasoning steps, without extra rewards, additional rollouts, or inference-time changes. Across Qwen2.5-VL-7B, InternVL3-8B, and LLaVA-OV-7B, RECAP consistently improves over GRPO and VPPO, yielding $+6.1$--$+6.5$ HallusionBench gains over the SFT base while preserving reasoning and text-only performance. Results on larger LoRA-tuned models, Chinese zero-shot benchmarks, visual perturbations, and human evaluation further demonstrate robust improvements in image-grounded reasoning. + + 2026-10-22T07:04:23Z + NeurIPS 2026 + + + Zhaolu Kang + + + Tailong Luo + + + Chenxin Li + + + Yingjie He + + + Zhenyu Yu + + + Fengyu Zhou + + + Jiachen Qian + + + Lei Wei + + + Shuang Chen + + + Jiachen Li + + + Eric Hanchen Jiang + + + Rongchao Zhang + + + Zhengtao Yao + + + Hoi Leong Lee + + + Guansu Wang + + + Kaiyue Zhou + + + + http://arxiv.org/abs/2610.30824v1 + Loop to Look Better: Learning Adaptive Depth for Question-Guided Perception in Vision-Language Models + 2026-10-22T06:53:13Z + + + Visual perception should be iterative and task-directed, with representations refined in response to the question and the need for further processing. While Vision-Language Models (VLMs) increasingly support extended reasoning, their visual tokens are still typically acquired in a single, task-agnostic encoder pass. This creates an evidence-acquisition bottleneck: models may reason longer without refining the visual evidence needed to answer the question. We propose LoopLook, a lightweight encoder-side recurrent perception framework that equips pretrained VLMs with adaptive visual depth. LoopLook recurrently revisits a middle-to-late window of the vision encoder, injecting question representations at each loop to guide visual refinement. A learned stopping mechanism adaptively determines the recurrent depth, while a token-wise Mixture-of-Looks (MoL) combines representations from different loops, allowing each visual token to selectively integrate information acquired across recurrent steps. Across four backbones and eight benchmarks, LoopLook consistently improves performance over the baseline, yielding gains of up to 8.6% on MMStar and 8.1% on HallusionBench. Our analysis shows that LoopLook progressively refines visual attention and adaptively allocates depth according to task difficulty. It also better preserves task-relevant visual information under reduced input resolution, while increasing time to first token (TTFT) by only 5.1-6.5%. By bringing recurrence from reasoning back into perception, LoopLook transforms visual perception from a one-shot glimpse into an adaptive process of recurrent refinement. + + 2026-10-22T06:53:13Z + + + Wencheng Ye + + + Anning Hu + + + Hongye Fang + + + Tianyi Wang + + + Junchi Yan + + + + http://arxiv.org/abs/2610.30814v1 + DRILL: Training World Models to Improve Policies, Not Predict Pixels + 2026-10-22T06:40:31Z + + + World models are increasingly used to reduce environment interaction when post-training vision-language-action (VLA) policies with reinforcement learning. Yet they are typically trained to predict pixels one step ahead, even though their role here is not merely to render visually faithful videos but to produce learning signals from imagined rollouts that improve the policy. We show that this mismatch is substantial: lower pixel MSE can produce worse policy gradients, and a world model trained for policy utility can yield better downstream policies despite 17% higher pixel MSE on the next frame. We propose the Downstream-Return Imagination Learning Loop (DRILL), a bilevel framework that updates the world model to maximize the policy's return after an inner GRPO update on imagined rollouts. DRILL has two instantiations. DRILL-VWI is a closed-form surrogate, requiring no additional simulator rollouts, that reweights prediction errors by policy visitation, the group-relative GRPO advantage, and model confidence. DRILL-IMG is a full meta-gradient method that differentiates through the inner update using truncated Hessian-vector products. We show that DRILL-VWI recovers the local one-step component of the DRILL-IMG meta-gradient under score-compatibility and small-residual assumptions. Across five manipulation simulators and two VLA backbones, DRILL-IMG raises mean success rate by 13.1 points over WMPO and 7.9 points over RLVR-World, and complements RLVR pretraining rather than competing with it. More broadly, we believe video world models for VLA reinforcement learning can be productively trained by the policy gradients they produce, not only by pixel-level prediction. + + 2026-10-22T06:40:31Z + NeurIPS 2026 + + + Zhaolu Kang + + + Tailong Luo + + + Lei Wei + + + Guangyuan Dong + + + Sihan Liu + + + Yingjie He + + + Siheng Wang + + + Shuaibo Li + + + Rongchao Zhang + + + Zhen Tian + + + Richeng Xuan + + + Zhichao Hu + + + + http://arxiv.org/abs/2610.30740v1 + Where Did the Light Come From? Diagnosing Cast-Shadow Reasoning in VLMs and Borrowing the Missing Shadow Prior from Image Generation Models + 2026-10-22T05:11:07Z + + + Shadows are observable consequences of latent physical causes, arising from the interaction between illumination, object geometry, and scene structure. A model that understands shadows should be able not only to read a shadow's direction, but also to infer where a shadow should fall when it is absent, and to judge whether a shadow is physically consistent with the scene. We introduce ShadowBench, built from real photographs, which poses these three questions to vision-language models (VLMs). From each scene, we build a correct-shadow, a shadow-removed, and a human-annotated wrong-direction state. Evaluating 19 open VLMs (2B to 78B) and frontier proprietary models, we find that VLMs read a visible shadow's direction well above chance and improve with scale, yet infer the absent direction only weakly and fall to chance at judging physical consistency even under a bias-free two-alternative test that removes the yes-bias of single-image naturalness questions. Only Gemini-3.1-pro exceeds chance on validity, and even then only modestly and far below humans. Chain-of-Thought (CoT) does not help. The missing ingredient is not reasoning but knowledge that image generation models (IGMs) already hold. Routing a VLM through an IGM lifts its inference well above its direct attempt and helps it flag the wrong-direction shadows it otherwise accepts. Cast-shadow direction is a single facet of illumination understanding, but the sharp gap it reveals between VLMs and IGMs suggests image-generation or reconstruction objectives as a route toward illumination-aware VLMs. + + 2026-10-22T05:11:07Z + Accepted to WACV2027 + + + Ryugo Morita + + + Shunsuke Kitada + + + Stanislav Frolov + + + Brian Bernhard Moser + + + Ko Watanabe + + + Riku Takahashi + + + Jinjia Zhou + + + Andreas Dengel + + + + http://arxiv.org/abs/2610.30732v1 + SmolVLA-MoE: Sparse Mixture-of-Experts for Efficient Multi-Task Robotic Manipulation + 2026-10-22T04:58:45Z + + + Vision-Language-Action (VLA) models have shown promising results in multi-task robotic manipulation by leveraging visual and language understanding for action generation. However, existing lightweight VLA models employ a single dense action expert to handle all tasks, which limits their multi-task capability under constrained computational budgets. To address this issue, we propose SmolVLA-MoE, a novel framework that introduces sparse Mixture-of-Experts (MoE) into the FFN layers of the action expert in VLA models. SmolVLA-MoE replaces dense FFN layers with multiple parallel expert FFNs and a token-level router, enabling each token to adaptively select the most suitable expert for action generation. We further introduce a shared expert with a tunable weight parameter to balance the inheritance of pre-trained capabilities and task-specific expert specialization. Through sparse activation, SmolVLA-MoE activates only a single expert FFN during inference, with a total activated parameter count of approximately 500M including the frozen VLM backbone, while benefiting from approximately 800M total stored parameters. We evaluate our method on four task suites of the LIBERO benchmark. SmolVLA-MoE achieves an average success rate of 84.25%, outperforming SmolVLA (82.75%) and OpenVLA-7B (76.5%), while maintaining comparable inference efficiency. Our code is publicly available at https://github.com/dudu435/smolvla-moe. + + 2026-10-22T04:58:45Z + 16 pages, 5 figures, 4 tables; conference paper prepared for IROS2027 + + + Shiyang Zhang + + + Miao Yang + + + Zhengda Li + + + Yang Shao + + + Ruifang Zhai + + + Hui Peng + + + Peng Song + + + + http://arxiv.org/abs/2610.30680v1 + Zero-Shot Domain Generalization via Domain Prompt Learning + 2026-10-22T03:47:32Z + + + Domain generalization (DG) aims to improve + the generalization of the model to any unseen domains. Targeting this goal, existing DG methods mainly focus on learning domain-invariant features or prompts from the given source domains. However, these methods rely on source-domain data, and collecting and annotating large-scale single- or multi-source datasets is often infeasible, limiting the practical applicability of DG. To tackle this challenge, we propose {\underline{Do}}main \underline{P}rompt Learning (DoP), a method built on a large vision-language model (e.g., CLIP) for zero-shot domain generalization, which recognizes unseen classes in unseen target domains without access to source-domain data. DoP essentially learns the target domain knowledge via prompt both in text and visual modalities to overcome the domain shift in text-visual modalities under the test-time adaptation formulation. Specifically, DoP first takes text domain learning (TDL) to simulate various distribution shifts by learning diverse style tokens implicitly in the text space with inter-style diversity loss and intra-style consistency loss. Subsequently, DoP employs visual domain learning (VDL) to further refine the target-domain-relevant style token generated by TDL by making use of the test visual data with self-supervised learning. Extensive experiments on popular DG benchmark datasets (e.g., PACS, VLCS, OfficeHome, and DomainNet) and ImageNet show that our DoP consistently outperforms the state-of-the-art DG approaches. Codes are available at: https://github.com/shiming-chen/DoP. + + 2026-10-22T03:47:32Z + Accepted to IJCV + + + Shiming Chen + + + Shuhuang Chen + + + Salman Khan + + + Fahad Shahbaz Khan + + + + http://arxiv.org/abs/2610.30634v1 + FedBST: Bilateral Self-Training for Unsupervised Federated Classification + 2026-10-22T02:56:05Z + + + Unsupervised federated learning with Vision-Language Models (e.g., CLIP) offers a promising solution for label-free classification, yet its performance often degrades under severe non-IID shifts. A pioneering method, FedCoPL, typically relies on self-training strategies that exclusively prioritize high-confidence predictions for pseudo-labeling. However, this selective approach neglects the information of ambiguous samples (often referred to as ``waist" samples), leading to the underutilization of data and biased decision boundaries. To address this limitation, we propose FedBST, a bilateral self-training framework that effectively exploits both high-confidence and ambiguous data. Specifically, for local optimization, we introduce uncertainty-aware confidence penalization (UACP). UACP targets ambiguous samples by penalizing overconfident predictions to implicitly promote higher uncertainty, thereby preventing erroneous pseudo-labeling. At inference, we employ a visual-text ensemble strategy. This approach aggregates uncertainty-aware local visual prototypes and ensembles them with textual prototypes, achieving lightweight adaptation to local distributions via prototype-based calibration. Experiments demonstrate that FedBST achieves consistent improvements over existing methods with standard federated aggregation protocols. + + 2026-10-22T02:56:05Z + ICME 2026 + + + Aijing Yu + + + Kuangpu Guo + + + Jian Liang + + + Xiao-Yu Zhang + + + + http://arxiv.org/abs/2610.30097v1 + AtomicRL: Atomic Reinforcement Learning for Long-Horizon Robotic Manipulation + 2026-10-21T17:45:24Z + + + Vision-language-action (VLA) models have shown promise in robotic manipulation, but imitation learning (IL) alone often struggles to master complex long-horizon skills. Reinforcement learning (RL) offers an effective avenue for further improving VLA policies. However, existing VLA-RL methods typically suffer from delayed and biased credit assignment due to trajectory-level sparse rewards, while imbalanced subtask mastery creates bottlenecks that limit overall performance. To address these challenges, we propose AtomicRL, an RL post-training framework that leverages atomic task structures for reliable credit assignment and adaptive exploration. AtomicRL introduces Semantic-Aware Policy Optimization (SAPO), which uses semantic-aware gating to constrain TD residuals from failed atomic subtasks from propagating across task boundaries, mitigating credit contamination while preserving intra-subtask credit assignment and value bootstrapping. In addition, Bottleneck-Adaptive Target Exploration (BATE) dynamically coordinates task sampling and local exploration incentives based on the mastery of individual atomic subtasks, directing learning toward the remaining bottlenecks. Finally, we develop a Real2Sim2Real pipeline that bridges online RL in simulation with real-world deployment, facilitating practical transfer to physical robots. On LIBERO-LONG, AtomicRL achieves absolute performance gains of 3.6% and 4.0% over PPO across two VLA architectures. On CALVIN ABC-D, it improves full-task performance by up to 9.5% over PPO. Combined with the Real2Sim2Real pipeline, AtomicRL further improves real-world task performance by an average of 21.3%. These results demonstrate that AtomicRL effectively improves the learning efficiency and manipulation performance of VLA policies on long-horizon tasks. + + + + 2026-10-21T17:45:24Z + + + Likui Zhang + + + Zhe Zhu + + + Zhihao Zhan + + + Yibo Bai + + + Hanlin Wang + + + Dongwei Li + + + Bin Wang + + + Tianle Zhang + + + Xiaodan Liang + + + Liang Lin + + + + http://arxiv.org/abs/2610.29905v1 + ViBMR: A Large-Scale Multi-Sequence Brain MRI Dataset and Comprehensive Evaluation for Vietnamese Radiology Report Generation + 2026-10-21T15:46:37Z + + + Automated radiology report generation for multi-sequence brain MRI holds strong promise for alleviating radiologists' workload, yet it remains a demanding problem: brain MRI studies are inherently volumetric, each pulse sequence carries complementary diagnostic information, and annotated data are critically scarce for low-resource clinical languages. Existing brain MRI-report resources are still dominated by English reports, translated clinical text, or datasets adapted from task-specific imaging benchmarks, leaving routine low-resource clinical reporting and heterogeneous multi-sequence MRI protocols insufficiently represented. To bridge this gap, we introduce ViBMR, to the best of our knowledge, the first large-scale multi-sequence brain MRI dataset paired with routine Vietnamese clinical reports, comprising 3,649 patients and 11,875 MRI series across T1, T2, FLAIR, and contrast-enhanced T1 sequences. Building on ViBMR, we establish a comprehensive evaluation setup for brain MRI report generation, covering representative medical vision-language models, multi-sequence inputs, and feature aggregation strategies. The results provide key insights into dataset characteristics and model behavior, while demonstrating the necessity of native low-resource clinical datasets for reliable Vietnamese-origin brain MRI report generation. Our dataset and baseline models will be released for non-commercial research. + + 2026-10-21T15:46:37Z + Accepted at IEEE/CVF Winter Conference on Applications of Computer Vision (WACV 2027) + + + Dai Lam Le + + + Minh Khoi Nguyen + + + Son Dinh Nguyen + + + Amir Reza Jafari + + + Viet Ha + + + Nguyen Son + + + Reza Farahbakhsh + + + Noel Crespi + + + Phi Le Nguyen + + + + http://arxiv.org/abs/2610.29881v1 + Expandable Modality Experts for Medical Vision-Language Learning + 2026-10-21T15:28:40Z + + + Learning across medical imaging modalities requires making use of images without paired text and accommodating new domains while retaining existing representations. We propose a medical vision-language technique built around an expandable bank of modality experts. Its Multiway Transformer combines shared visual computation with deterministically routed feed-forward experts and a separate text pathway. A modality-aware visual tokenizer supplies targets for masked pretraining on 19.4 million unpaired image rows across seven modalities; contrastive alignment then uses 3.23 million image-text pairs. Additional fundus and optical coherence tomography experts learn from paired data while the original image and text embedding paths remain frozen. With a ViT-Large backbone, the proposed technique achieves the best or tied-best result in 24 of 25 benchmark settings across nine modalities: 10 of 11 zero-shot classification benchmarks, all 10 linear probes, and all four retrieval benchmarks. Mean balanced accuracy is 0.674 for zero-shot classification and 0.856 for linear probing, and mean bidirectional retrieval recall is 20.70%. A separate three-seed sequential experiment with matched adaptation data yields fundus and OCT retrieval gains of 14.95 and 9.31 percentage points, with no measured loss on preceding fundus or pathology tasks. The preservation argument requires unchanged existing computation paths and inference conditions, and feature-identity checks verify retention on evaluated inputs. The proposed technique provides a modular approach to learning and expanding medical vision-language representations. + + 2026-10-21T15:28:40Z + 11 pages (main text), 42 pages (supplementary material), 2 main figures. Submitted to ICLR 2027 + + + DM BAPPY + + + Eunsu Kim + + + Hanjoo Lee + + + Sung Hak Lee + + + Sangjeong Ahn + + + + http://arxiv.org/abs/2610.29811v1 + Compositionality with Primitives: A Unified View from Euclidean to Hyperbolic Vision-Language Models + 2026-10-21T14:34:51Z + + + Compositional zero-shot learning (CZSL) aims to recognize novel combinations of previously observed objects and attributes. Prior work showed that large-scale vision-language models encode decomposable semantic structures that can be recomposed to enable generalization. The Geodesically Decomposable Embeddings (GDE) framework formalizes this by identifying directions in the tangent space at the Frechet mean of the embedding distribution, which encode primitive visual concepts. Unseen attribute-object compositions can be synthesized through vector addition of these primitives. We revisit the assumption that compositional generalization requires explicit attribute-object pair re-composition. By means of new compositional scoring functions and extensive evaluations, we show that directly using the decomposed primitives suffices for recognizing unseen compositions. In that, we gain insights on how the geometry of the embedding manifold (Euclidean, spherical, or hyperbolic) and dataset structure affect compositional reasoning. Across models (CLIP, DINOv2, MERU, HyCoCLIP), we show that compositional structure consistently emerges as primitive representations, enabling inference on CZSL benchmarks (MIT-States, VAW-CZSL, UT-Zappos50K, Clothing16K) and group robustness on Waterbirds and CelebA. Code: https://github.com/nis-research/Compositionality-with-Primitives. + + 2026-10-21T14:34:51Z + Accepted at WACV 2027 Main Conference, 17 pages, 6 figures, 8 tables + + + Puru Vaish + + + Meelad Dashti + + + Christoph Brune + + + Pascal Mettes + + + Tatiana Tommasi + + + Nicola Strisciuglio + + + + http://arxiv.org/abs/2610.29768v1 + UniRAP: Towards Unified Part-level Physical Affordance Reasoning and Actionable Perception + 2026-10-21T14:02:25Z + + + Vision-language perception has achieved impressive progress in aligning natural language with visual observations, yet grounding high-level semantics into part-level physical interaction remains challenging. To address this gap, we propose UniRAP, a unified model for inferring part-level physical affordances and mapping language instructions to actionable geometric representations. UniRAP formulates this problem as a conditional multimodal generation task, integrating visual inputs, textual instructions, and optional prompts into a shared spatiotemporal representation space through a unified interface token mechanism. To predict executable contact geometry, we introduce a Unified Affordance Decoder (UAD), which jointly performs object detection, part-level affordance segmentation, and 4-DoF interaction pose estimation by leveraging intermediate segmentation features. In addition, we propose a curriculum-based transfer training strategy that progressively adapts the model from general visual parsing to interaction-aware perception, improving data efficiency under limited textual annotations. Experiments show that UniRAP achieves state-of-the-art performance on referring expression segmentation, affordance grounding, and interaction pose estimation, while maintaining strong spatiotemporal consistency in dynamic video scenarios. These results demonstrate the effectiveness of UniRAP as a unified perception framework for language-guided physical manipulation. + + 2026-10-21T14:02:25Z + Accepted by NeurIPS 2026. Webpage: https://lif314.github.io/projects/unirap + + + Linfei Li + + + Ruining Hu + + + Lin Zhang + + + Zhong Wang + + + Fengyi Zhang + + + Ying Shen + + + Binqiang Wang + + + Xin Zhang + + + + http://arxiv.org/abs/2610.29590v1 + CineEvolve: An Agentic Self-Evolution Framework for Cinematic Multi-Shot Video Generation + 2026-10-21T11:30:09Z + + + Cinematic multi-shot video generation requires both narrative planning and iterative refinement. Existing methods either lack narrative reasoning or rely on feed-forward workflows without policy updates. In this paper, we propose CineEvolve, an agentic self-evolution framework for cinematic multi-shot video generation that unifies a Director and a Critic within a single vision-language policy. Emulating real-world filmmaking that couples iterative direction with critical feedback, we train CineEvolve via alternating reinforcement learning, where the Director surfaces flaws to sharpen the Critic, and the updated Critic guides the Director's targeted revisions. To stabilize co-evolution, we introduce Evolutionary GRPO (E-GRPO), leveraging historical anchoring and revision safeguarding to mitigate advantage inflation. Additionally, we contribute CineTraj, a 40K cinematic trajectory dataset spanning creation, critique, and revision. Extensive experiments demonstrate that CineEvolve outperforms existing approaches. Our code will be available at https://github.com/JingZhe-8/CineEvolve. + + 2026-10-21T11:30:09Z + 11 pages, 5 figures, 2 tables + + + Jingzhe Zhang + + + Peixuan Zhang + + + Genying Li + + + Bing Ma + + + Shuchen Weng + + + Si Li + + + Boxin Shi + + + + http://arxiv.org/abs/2610.29581v1 + Unlocking Spatial Grounding in Flow-Matching Models via SNR Tuning + 2026-10-21T11:22:58Z + + + Despite the success of foundation models in image synthesis, achieving fine-grained spatial control remains a significant challenge, typically requiring auxiliary structural adapters or complex inference-time steering. While modern vision-language (VLM) text encoders possess the latent capacity to represent spatial coordinates, generative models often fail to leverage this information. We demonstrate that the signal-to-noise ratio (SNR) distribution is a critical determinant of spatial grounding in flow-matching models. Using a novel synthetic benchmark of geometric primitives, we isolate structural mechanics from textural complexity inherent in natural imagery and introduce a rigorous color-aware layout metric to quantify spatial fidelity. We show that training on a centered SNR distribution results in poor layout adherence (25.9%). Instead, we identify high-noise regimes as a "critical learning phase" for spatial grounding. Shifting the training focus toward these stages increases layout adherence to 80.8%, effectively reaching the 83.6% reconstruction ceiling of the underlying variational autoencoder. We find that the necessity for this shift scales with resolution and aspect ratio variance, and that the conservative noise schedules employed by models like FLUX.1 are insufficient for precise layout adherence. Finally, we show that these findings translate to real-world imagery via the COCO dataset (1.0 vs. 57.3 Average Precision), where state-of-the-art layout adherence is unlocked through distribution tuning alone, without architectural modifications. + + + 2026-10-21T11:22:58Z + Accepted at BMVC 2026 (Oral) + + + Martin Thißen + + + Elke Hergenröther + + + + http://arxiv.org/abs/2610.29318v1 + Asking What a Director Sees Can Change What Vision-Language Models Choose + 2026-10-21T07:21:08Z + + + Vision-language models are now routinely tested on theory of mind: whether they can work out what another person sees, knows, and means. A common design asks the model to report that perspective and then to act for the person, and reads a correct report beside a wrong action as a failure to use the perspective. That reading rests on a quiet assumption: that asking for the report leaves the action unchanged. We show that it does not. In a rendered Director Task, a partition hides the largest block from a director who asks for "the largest block". Asking first which blocks the director can see raises the share of replies that choose this hidden block by 12 to 88 percentage points on six GPT models and by 17 on Qwen3.8-27B, even though the models mostly report correctly which blocks the director sees. Reasoning traces and prompt rewordings suggest why: the question shifts how the request is read, from the director's view toward the model's own. When the prompt states what the director knows and refers to, fewer than 1% of replies pair a correct report with a hidden-block choice. Any evaluation that elicits a perspective report before the action it scores needs a baseline without the question, and we deliver one: paired prompts that differ only in that question, a design any perspective-taking benchmark can adopt. + + + 2026-10-21T07:21:08Z + + + Jiaxuan Guo + + + Xingyu Ren + + + Kejia Zhang + + + Jingxin Yang + + + Youran Sun + + + Haizhao Yang + + + + http://arxiv.org/abs/2610.29244v1 + Failure Modes of Vision-Language Models for Human Activity Understanding in Thermal HRI + 2026-10-21T05:49:05Z + + + Thermal cameras enable robots to perceive human activities in darkness while revealing less personally identifiable appearance information and fewer details of the surrounding environment than RGB cameras. As vision-language models (VLMs), originally developed for RGB imagery, are increasingly integrated into embodied systems for scene understanding and high-level planning, thermal sensing offers a promising way to extend activity perception to low-light and privacy-sensitive settings. However, the failure modes of VLMs in thermal human activity understanding for human-robot interaction (HRI) remain underexplored. We fill this gap by evaluating seven locally deployable VLMs, including models developed for physical AI and robotics, on two person-centric thermal datasets. Our diagnostic tasks examine fine-grained action recognition, activity timeline reconstruction, and the ability to withhold unsupported answers. Paired RGB recordings serve as a performance reference, while controlled variations in frame sampling, thermal input presentation, and reasoning are used to assess whether the observed errors can be mitigated. Our results show that models can recognize broad activity categories but struggle with fine-grained actions such as coughing, sneezing, and yawning. They also produce inaccurate event timelines and hallucinate actions involving objects. Simple thermal input preprocessing and additional reasoning offer only limited, model-dependent gains. Abstention behavior also varies across models even under explicit instructions, limiting their reliability for practical robotic use. + + + 2026-10-21T05:49:05Z + 9 pages, 6 figures, 2 tables + + + Han Hu + + + He Chen + + + + http://arxiv.org/abs/2610.29241v1 + Encoded but Unused: Bounding the Sources of VLM Errors + 2026-10-21T05:47:57Z + + + In this paper, we investigate why vision-language models (VLMs) produce errors by decomposing them into two sources: visual-representation failures, in which the visual evidence required for the correct answer is not encoded, and visual-utilization failures, in which this evidence is encoded but not successfully used. We propose to estimate the visual-utilization failure rate using lightweight probes and derive theoretical bounds on the true rate that account for probe imperfections. We introduce VELens (Visual Evidence Lens), a rank-based probe that traces visual evidence for both a target object and its ground-truth attribute, such as color, material, or shape, across VLM layers. We evaluate VELens on over 6,000 images using LLaVA-1.6-7B and Qwen2.5-VL-7B. Our method achieves ROC-AUC scores of 0.95 and 0.91, respectively, and outperforms alternative probes in both low-resource and unseen-attribute settings. Using it to diagnose errors, we estimate that visual-utilization failures account for 84.4% of LLaVA errors and 70.0% of Qwen errors, with conservative lower bounds of 77.5% and 61.0%, respectively. Overall, our study identifies visual utilization as the dominant bottleneck in VLMs and suggests that a central opportunity for improvement lies in developing better mechanisms to locate, route, and use the visual information they already encode. + + 2026-10-21T05:47:57Z + + + Anat Veikherman + + + Mor Ventura + + + Nitay Calderon + + + Lihi Zelnik-Manor + + + Roi Reichart + + + + http://arxiv.org/abs/2610.29232v1 + Think-Capture: Active 3D Geometry Acquisition for Spatial Reasoning in Vision-Language Models + 2026-10-21T05:42:29Z + + + Vision-Language Models (VLMs) excel at 2D recognition but often fail to maintain consistent 3D relations across sparse viewpoints, leading to spatial hallucinations under occlusion and perspective changes. Existing methods commonly fuse all frames with dense geometry, incurring substantial computation and context overhead while encouraging blind reliance on imperfect estimators. We present Think-Capture, a query-conditioned framework that first identifies task-critical objects and then acquires their geometry on demand. A 3D toolkit lifts zero-shot masks into a common coordinate frame, and a Symbolic 3D State Abstraction compresses object and camera states into structured text. Hierarchical Group Relative Policy Optimization (GRPO) trains the VLM on cases in which geometry either helps or misleads, teaching it when to use tool evidence and when to fall back on visual cues. Think-Capture-4B reaches 54.4% on MindCube-Tiny (+21.5 points over its backbone), 39.1% on the MMSI-Bench positional subset (+7.9), and 42.8% on ViewSpatial (+5.2). It also remains robust under coordinate and mask perturbations. The full stack fits one 24 GB GPU and serves as an asynchronous high-level reasoner on an Agibot G1. Our code is available at https://github.com/819346675/Think-Capture. + + 2026-10-21T05:42:29Z + Accepted at WACV 2027 + + + Junjie Wang + + + Zhihao Yuan + + + Yunhan Tang + + + Sheng Xu + + + Jiaqi Mao + + + Xiaoyu Ye + + + Yueru Luo + + + Xu Yan + + + Chun-Mei Feng + + + Zhen Li + + + + http://arxiv.org/abs/2610.29231v2 + DisasterRoute: Evidence-Guided Dual-System Routing for Visual Disaster Question Answering + 2026-10-23T05:34:13Z + + + Visual question answering from low-altitude UAV imagery must deliver timely and accurate judgments to support disaster response under limited edge computing resources. Routine questions may be answered through direct decisions, whereas more challenging questions may benefit from step-by-step reasoning. However, existing research primarily focuses on improving models' visual understanding and generative reasoning capabilities, with limited exploration of efficient direct decision-making and its adaptive coordination with generative reasoning. We develop Disaster-S1 based on a vision-language model adapted to the disaster domain. Trained for option discrimination, it outputs a probability distribution over answer options in a single multimodal forward pass for fast decision-making. We further propose DisasterRoute, a dual-system routing framework that combines prediction confidence with disaster evidence to decide whether to accept the initial answer or invoke the disaster reasoning model DisasterVL for review. By allocating inference computation on demand, the framework retains the efficiency of direct decision-making and improves overall question-answering accuracy through selective review. Experiments on DisasterBench show that Disaster-S1 achieves superior accuracy with low latency, while DisasterRoute further improves accuracy through selective review at substantially lower latency than full reasoning. + + 2026-10-21T05:41:44Z + Technical report; follow-up study to DisasterBench; this version is not intended for conference or journal submission + + + Tan Zhang + + + Xing Deng + + + Lu Zhang + + + Xiaofeng Zhu + + + Ping Hu + + + + http://arxiv.org/abs/2610.29196v1 + A Unified Evaluation Framework of Physical Adversarial Robustness in the Edge VLM Era + 2026-10-21T04:38:02Z + + + Recent advancements in Vision-Language Models (VLMs) enable end-to-end visual grounding via language prompts and generative decoding, demonstrating largely improved zero-shot and open-vocabulary detection capabilities. As a result, VLMs are rapidly being deployed at the edge in safety-critical real-world systems. However, the physical adversarial robustness of edge VLMs has not been systematically studied, and the fundamental differences in output with modern object detectors create methodological challenges for fair evaluation. To compare the two families directly, we evaluate every selected representative model on one outcome: whether an adversarial patch worn on a person evades detection of the model. We report this by introducing a unified metric, conditional attack success rate (cASR), counted only on images the model still localizes under a matched gray occluder, and partition every failure into omission (no box), substitution (a box on the patch), and displacement (a box on neither). We benchmark the physical adversarial vulnerability of compact grounding VLMs against a range of object detectors, and find that the VLMs can be as vulnerable as the detectors. We disclose that failure mode is largely associated with the output format of a model rather than its architecture family. Of the three, only omission is visible to a downstream system; displacement and substitution return confident, well-formed boxes, making them potentially more dangerous failures. Further, we find that, under distribution shift, VLMs that primarily failed by omission instead shift to failing more by displacement/substitution. Thus, a grounding VLM can inherit the detector's vulnerability while showing the possibility to adopt more dangerous failure modes. Our code and data are available at https://github.com/ericliang1/physical-adversarial-robustness. + + + + 2026-10-21T04:38:02Z + Accepted at the NeurIPS 2026 Workshop on Grounded and Faithful Vision-Language Models for Real-World Deployment (VLM4RWD). 16 pages, 6 figures, 5 tables. Code: https://github.com/ericliang1/physical-adversarial-robustness + + + Eric Liang + + + Alan Luo + + + Kaiwen Yuan + + + + http://arxiv.org/abs/2610.29025v1 + Single-Image Food Mass Estimators Do Not Transfer Their Gram Scale Across Datasets + 2026-10-21T00:59:03Z + + + Estimating food mass from a photograph is central to image-based dietary assessment, but whether trained models transfer to new cameras and foods is unclear. We fine-tuned DINOv2-base on 2,253 weighed Nutrition5k dishes to predict mass from one RGB photograph and compared it with a zero-shot vision-language model, Qwen3-VL-32B, on Nutrition5k and three external datasets: ASA24 studio portions, ECUSTFD whole foods and Food Portion Benchmark meal trays. In domain, the fine-tuned model's mean absolute error was 24.8 g, less than half of Qwen's. On external datasets it did not beat Qwen. For a food it had never seen, it ranked portions by size, but no better than a count of food pixels. Its gram scale was wrong in two ways: it changed with how much of the scene the photograph showed, and it was off by a different factor for each food. Training on other foods or trays from the tested dataset cut the external error by 38 to 65%. DINOv2-large, a larger backbone trained on the same dishes, did not reduce the external error. One labeled photograph of the same food cut the model's ASA24 error to 28.3 g, better than that photograph achieved alone. Prediction intervals that held the true mass for 90% of Nutrition5k dishes held it for at most half of external photographs. Nutrition5k often photographed the same plate several times, so a random test split shared near-identical photographs with training and overstated accuracy. Single-image mass estimators therefore need labeled photographs from the setting where they are used. + + 2026-10-21T00:59:03Z + 19 pages, 6 figures, 13 tables. Code, set lists and model weights: https://github.com/yongshenglian/foodmass-transfer + + + Yongsheng Lian + + + + http://arxiv.org/abs/2610.28964v1 + Can Quantum Layers offer Performance and Security Advantages in Vision-Language Models? + 2026-10-20T22:28:17Z + + + As quantum computing moves from the noisy intermediate-scale quantum (NISQ) era toward early fault-tolerant quantum computing (EFTQC), quantum-enhanced AI is shifting from a conceptual idea to experimental research. Quantum components are expected to extend the capabilities of existing AI systems, yet it remains unclear how such components will help within large multimodal models. In this study, we try to answer that question for vision-language models (VLMs) using classically simulated quantum layers. With LLaVA-OneVision as the backbone, we evaluate 4- and 8-qubit basic-ring and strongly entangling circuits at four insertion and four replacement locations. Insertion adds quantum layers to the classical model, while replacement substitutes them for classical components. Using the same setup, we compare performance and computational cost between classical and quantum-classical hybrid models. On the Visual Spatial Reasoning dataset, inserting a quantum layer after the visual projector reaches 80.7% development accuracy, 2.28 percentage-points above classical full fine-tuning. Replacing the final decoder feed-forward sublayer retains 79.22% accuracy with 13.07 million fewer trainable parameters. Quantum insertion can thus improve accuracy, and selective replacement can reduce parameters. These benefits depend strongly on where the quantum layer is inserted or which classical component it replaces: earlier replacements lower accuracy, and fewer parameters do not reliably shorten training or reduce computation. To assess potential security benefits, we evaluated the robustness of quantum-classical hybrid models under six attack settings. Overall, our study maps where quantum layers help and hurt within VLMs, offering a starting point for hybrid VLM design; whether these gains generalize remains open. The code is available at https://github.com/TITANS-Lab-Artifacts/QuantumVLM. + + + + + 2026-10-20T22:28:17Z + + + Md Khalid Syfullah + + + Alvi Ataur Khalil + + + + http://arxiv.org/abs/2610.28880v1 + Real2Sem2Real: 3D Semantic Augmentations for Robot Learning from a Single Human RGB Demonstration + 2026-10-20T19:59:24Z + + + Human video scales easily and does not need robot hardware, but existing methods require depth sensing, overlay the robot onto 2D video, or generate data only for the demonstrated objects. We present Real2Sem2Real (R2Sem2R), a real-to-semantic-to-real pipeline that turns one monocular RGB video of a human demonstration into thousands of robot demonstrations across the semantic object instances of a category. R2Sem2R tracks the SE(3) pose of each object with DINOv3-distilled Gaussian splats, outperforming existing methods and FoundationPose with estimated metric depth. R2Sem2R then aligns digital cousins, each generated from one or a few photographs, to the demonstrated objects with a semantic alignment. This alignment matches whole objects and the functional regions of target objects, such as a coffee machine's tray. R2Sem2R maps the human hand to a feasible robot grasp that extends to the cousins. Robot demonstrations are generated either in IsaacSim, for photorealistic rendering, or MuJoCo, for contact physics, and R2Sem2R can generate over 2,000 episodes in about two hours. On two real robots and four tasks, we train a vision-language-action policy on data from one human video per task, and policies trained on our data match or exceed policies trained on teleoperation across diverse object instances. The project page is available at https://real2sem2real.github.io/. + + + 2026-10-20T19:59:24Z + Matthew Strong and Ankush K. Dhawan contributed equally. Project page: https://real2sem2real.github.io/ + + + Matthew Strong + + + Ankush K. Dhawan + + + Julien Poffet + + + Giuse Pham + + + Jinho So + + + Monroe Kennedy + + + + http://arxiv.org/abs/2610.28626v1 + UniWALM: Unified World Action Language Model for Embodied Robot Control + 2026-10-20T17:59:04Z + + + Motivated by the human ability to integrate experience across language, perception, and action, we introduce UniWALM, a unified world-action-language model that learns video, action, and language in a single shared representation, where each modality is both a conditioning signal and a supervision target. We ask: can jointly generating language enrich this shared representation, improving manipulation and supporting memory-dependent behavior? Unlike prior approaches that attach a reasoning or vision-language model to a video-action backbone and run them as distinct stages, UniWALM unifies all three modalities inside a single mixture-of-transformers backbone whose per-modality diffusion heads co-denoise synchronously, decoding subtask and textual memory in the same pass as action with no separate planning stage; the generated language is re-consumed on the next step, closing a language-as-memory loop without an external planner or memory bank. To keep the action stream reliable under this richer objective, we further introduce Flow Matching with Correction (FMC), a training objective that teaches recovery from perturbed action trajectories at no inference-time cost. UniWALM consistently improves over same-backbone baselines (e.g., FastWAM) on compositional pick-and-place (MolmoSpaces) and across the memory-dependent subset of RMBench, where it reaches 34.5% without any pretrained language or reasoning model and exceeds Mem-0's keyframe-equipped setup (28.5%) using only a single anchor frame. On a real-world Find-the-Item task, generating textual memory lifts success from 11.1% to 61.1%, while state-of-the-art VLAs stay at or below chance (<=33.3%). + + + + 2026-10-20T17:59:04Z + Preprint: 25 pages + + + Rahul Sajnani + + + Diego Romeres + + + Mingyuan Zhang + + + Kai Gao + + + Carl Qi + + + Baichuan Huang + + + Srinath Sridhar + + + Dylan Randle + + + Lillian J. Ratliff + + + Jose Barreiros + + + Manikantan Nambi + + + Jeroen Vanbaar + + + + http://arxiv.org/abs/2610.28502v1 + GazeLens for Efficient Egocentric Video Question Answering with Simple Gaze-Driven Adaptive Token Reduction + 2026-10-20T16:43:06Z + + + Smart glasses can help users understand their activities and surroundings, but small vision-language models must preserve useful evidence within limited computation. This is difficult because redundant frames consume the visual budget, while aggressive spatial compression can discard relevant details. Although gaze identifies the wearer's focus, the question may require evidence from the surrounding scene. To address these constraints, we propose GazeLens, which combines frame selection with gaze- and question-guided token reduction. First, HOG transitions and image sharpness select frames before visual encoding. For each selected frame, Gaussian pooling then forms gaze-focused and complementary summaries. Because their relevance depends on the question, a lightweight gate blends them into a primary token. Together with a global scene token, this retains both focused and contextual summaries within two tokens per frame. On StreamGaze, GazeLens achieves higher macro and micro accuracy than the evaluated full-grid and token-reduction baselines, with lower input-forward FLOPs than the shared-backbone token-reduction baselines. + + 2026-10-20T16:43:06Z + 17 pages, 6 figures + + + Trong-Thang Pham + + + Anh Nguyen + + + Hien Van Nguyen + + + Ngan Le + + + + http://arxiv.org/abs/2610.28476v1 + CLOSER: Evidence-Aware Active Visual Verification for Embodied Object-Goal Navigation + 2026-10-20T16:27:33Z + + + Object-goal navigation (ObjectNav) requires an embodied agent to find an instance of a specified category in an unseen environment and stop near it. The agent typically relies on an object detector but must judge online from a limited egocentric video stream, sometimes a single frame, whether a detected candidate is the target. Detectors often confidently mistake similar objects, such as a sofa for a bed, and stopping at a false positive fails the episode. Prevailing systems also approach candidates greedily, leaving them occluded or partially observed. We present CLOSER, an evidence-aware active verification framework that treats stopping as closed-loop evidence acquisition, coupling vision-language model (VLM) verification with active perception. CLOSER fine-tunes an open-source VLM to label each view of a candidate tracked across frames as target, non-target, or uncertain, selects complementary views with an embedding-based diversity gate, and fuses their per-view probabilities with a lightweight network. If the fused judgment remains uncertain, a diffusion policy drives the agent toward the candidate using only the tracked mask and depth until the decision becomes decisive. CLOSER runs locally and plugs into existing ObjectNav systems without retraining them. On Gibson and Habitat-Matterport 3D, it raises average success rate by 3.6 points and success weighted by path length by 2.0 points, showing that verifying evidence before committing improves embodied navigation. + + + 2026-10-20T16:27:33Z + 13 pages, 8 figures, 10 tables + + + Pengying Wu + + + Mingye Jiang + + + Yunze Hu + + + Zhejia Wen + + + Kangjie Zhou + + + Zongru Yang + + + Zhe Peng + + + Chang Liu + + + + http://arxiv.org/abs/2610.28419v1 + DISTRACT: Degradation-Indexed Study of Textual Reference Across Competing Targets + 2026-10-20T15:53:23Z + + + Vision-language trackers (VLTs) accept descriptions intended to assist tracking, but accepting text does not establish that its content changes tracking decisions, particularly as visual evidence deteriorates. We introduce DISTRACT, a matched-intervention benchmark that holds video, target, and distractor fixed while crossing four text priors with four image degradations along a controlled severity axis. We evaluate five VLTs on four datasets using behavioral contrasts, layerwise representation probes, and activation patching. Molmo2 and JointNLT exhibit directed text use. Some effects contract under degradation, whereas others show no significant endpoint change after multiplicity correction. UVLTrack, MMTrack, and DUTrack respond only weakly to changes in text semantics, with no directed behavioral effect surviving FDR correction in the tested settings. Model-internal analyses reveal that at decision-near states, correct-versus-conflicting text is decodable in Molmo2 and JointNLT but not in the other three systems. In the responsive models, decodability peaks at late states where replacement produces little behavioral change, whereas replacing selected earlier states redirects conflict-associated trajectories toward the target. Because matched-correct donors do not significantly outperform unrelated donors, these interventions identify earlier intervention-sensitive states without establishing target-specific semantic rescue. DISTRACT thus exposes when and where text affects tracking under degraded visual evidence. + + + + 2026-10-20T15:53:23Z + + + Dan Zlotnikov + + + Ohad Ben-Shahar + + +