The paper demonstrates that high‑quality graph embeddings can be produced without complex models or training by propagating random features through topological structures derived from random walks and anonymous walks. These training‑free embeddings capture node proximity and structural roles, respectively, and perform competitively on node, edge, and graph tasks while often requiring less computation. Combining the two embedding types further improves inference quality for some tasks.
Associative Recall (AR) is the cognitive ability to learn and retrieve links between items in memory. In NLP, AR is used as a benchmark for evaluating the in-context memory capacity of architectures s...
The paper introduces GRACE, a framework that breaks down large language model (LLM) responses into atomic claims and grounds them against trusted knowledge priors using a weighted bipartite graph. Edge weights enable weighted centrality analysis to classify claims as Grounded, Refuted, or Boundary, identifying hallucinations and frontier knowledge. An objective called Return on Attention (RoA) prioritizes expert review only for high‑uncertainty claims, and verified claims become new evidence anchors, creating a loop that expands the knowledge base across iterations.
By John Seon Keun Yi, Joshua R. Minot, Dokyun Lee
The paper introduces FedIoC, a federated learning framework that embeds structured threat indicators into gradient updates using a supervised contrastive loss. By aligning gradients from clients that share indicators for the same attack campaign, the server can cluster updates via cosine similarity to recover global campaign patterns without transmitting sensitive indicators. Experiments on two public threat‑detection benchmarks show that the server successfully identifies cross‑organizational campaign cohorts from fragmented local data.
By Manuel R\"oder, Bibin Babu, Frank-Michael Schleif
RefactorPlatform is an open‑source harness that standardizes the evaluation of repository‑scale refactoring agents by fixing the environment and systematically varying design choices such as model backbone, execution regime, and prompt specificity. Each run operates in an isolated workspace, logs detailed telemetry, and verifies changes with AST‑based checks. Experiments on 100 RefactorBench tasks show that AST‑aware chunking improves performance by 25‑30%, a lean retrieval‑augmented single agent outperforms a sub‑agent configuration, and retrieval’s accuracy gains offset its token overhead, keeping cost per successful refactoring unchanged.
By Aziz Ben Amor, Drish Mali, Mann Acharya, Vijayasri Iyer, S\'ebastien Brati\`eres
The paper introduces Expert Modulation, a novel approach for multi‑modal time series prediction that conditions both expert routing and computation on textual signals, thereby providing direct cross‑modal control over expert behavior. Unlike previous methods that rely on token‑level fusion, this mechanism avoids mixing temporal patches with language tokens in a shared embedding space, which can be problematic when high‑quality time‑text pairs are scarce or when time series characteristics vary widely. Experiments and theoretical analysis demonstrate that Expert Modulation yields strong improvements over existing multi‑modal forecasting techniques.
By Lige Zhang, Ali Maatouk, Jialin Chen, Karthik Charan Konduri, Leandros Tassiulas, Rex Ying
The paper introduces a promptable localized motion representation that generates persistent embeddings for user-specified regions in a video, without cropping or masking the input. By conditioning motion encoding directly on spatial masks while processing the full video, the method produces temporally consistent, region-addressable embeddings that capture local dynamics while preserving global context. These embeddings enable object-level motion transfer for dynamic scene composition and improve localized action classification in multi-actor videos, outperforming global representations that rely on cropping or post-hoc masking.
By Frank Fundel, Malek Ben Alaya, Thomas Ressler-Antal, Stefan Andreas Baumann, Bj\"orn Ommer
The paper introduces Linguistic Trajectory Encoding (LTE), a hybrid representation that compresses dynamic object motion histories using natural language descriptions, sparse spatial anchors, and visual anchors. LTE adapts compression to motion complexity by anchoring periods without reliable observations to the last seen location while preserving accuracy with geometric waypoints and linguistic descriptions. Evaluated on the newly constructed Spatial Memory Benchmark (SMB) from EgoLife multi‑day recordings, LTE achieves 45.3 % success in semantic trajectory retrieval and 48.7 % in long‑horizon object retrieval, outperforming prior structured‑memory and VLM baselines, and compresses trajectories 8.7×–26.1× with sub‑second query latency on 24‑hour video.
By Tianyidan Xie, Shenyi Wang, Qiang Tang, Mingjie Wang, Zhicheng Qiu, Xuanfu Li, Zhan Xu, Jian Yang, Lanjun Wang, Zili Yi
The article presents a technical manual for an open toolkit designed to measure how transformer language models individuate word meanings across different contexts. It introduces the concept of a "bridge form"—a single word that appears unchanged in multiple domains but with distinct senses—and outlines a full pipeline from specifying these forms to extracting layer-wise representations, computing silhouette-based separation metrics, and visualizing results. The manual details each design choice and its intended methodological safeguards, emphasizing that it serves as a methodological reference rather than reporting empirical findings.
By Jos\'e Luciano Ver\c{c}osa Marques, Frederico Jorge Heitmann, Daniel Omar Perez, Marcelo Vinicius de Paula, T\'arcio Andr\'e dos Santos Barros
The study investigates whether self‑supervised pretraining improves molecular graph neural networks by adapting the LeJEPA architecture to molecular graphs. While pretraining enhances learned representations and a frozen probe outperforms random initialization on tasks such as ogbg‑molhiv, it does not consistently boost finetuning performance across different data splits. Combining pretrained embeddings with 1024‑bit Morgan fingerprints yields modest gains, indicating that pretraining provides complementary information best exploited at the feature level.
By Micha{\l} Kulczykowski, Rafa{\l} {\L}ab\k{e}dzki
The article surveys Dynamic Heterogeneous Graph Representation Learning (DHGRL), a field that tackles the challenges of modeling evolving, multi‑type networks. It introduces a unified definition covering both discrete‑time and continuous‑time DHGs, and proposes an algorithm‑centric taxonomy that groups methods into embedding‑based, GNN‑based, and Transformer‑based approaches, highlighting their biases toward temporal granularity. The survey also reviews key applications, datasets, benchmarks, and outlines future research directions.
By Huan Liu, Pengfei Jiao, Jie Yin, Hongjiang Chen, Zhidong Zhao
The paper presents a scalable two‑stage clustering algorithm that guarantees per‑sample quality guardrails for large‑scale LLM‑based recommender systems. By first forming Mini‑batch K‑Means clusters and then greedily selecting representatives that meet user‑specified similarity and attribute constraints, the method ensures each sample inherits only relevant and safe outputs. Benchmarks show the approach runs faster and scales to millions of inputs, achieving a 50‑fold reduction in downstream LLM cost and runtime while maintaining personalization.
By Longshaokan Wang, Wai Tsang Keung, Punit Ghodasara, Roman Wang, Ali Dashti, Francesc Moreno-Noguer
The paper introduces VERGE, a verification-enhanced refinement workflow that extracts six red‑flag symptoms and family‑history risk status for early‑onset colorectal cancer from free‑text clinical notes. VERGE uses retrieval‑augmented generation followed by a bounded verification‑refinement cycle that checks textual grounding and clinical validity, correcting claims until resolved or escalating to human review. In evaluation on 4,033 clinician‑labeled note‑finding pairs, VERGE improved precision from 0.764 to 0.849 and MCC from 0.681 to 0.730 compared to a single‑agent baseline, while requiring human review for only 1.5 % of claims.
By Nikkie Hooman, Monarch Nigam, Amy E. Hughes, Rasmi G. Nair, Mehak Gupta
The paper introduces a resilient remote robotic control framework that couples control and wireless world models using a Joint Embedding Predictive Architecture (JEPA). By learning latent representations from visual observations and radio frequency (RF) data, the system predicts future robot states and wireless conditions to schedule uplink transmissions efficiently. An adaptive resilience mechanism adjusts perception embeddings when prediction errors arise, enabling robust operation without retraining the entire control policy.
By H. P. Madushanka, Sumudu Samarakoon, Mehdi Bennis
The paper introduces a multimodal emotion recognition framework that combines audio and visual feature extraction with an attention-based fusion strategy. Audio features include Wav2Vec2 embeddings, MFCCs, and statistical acoustic descriptors, fused via a BiLSTM, while video features are extracted using a ResNet50-BiLSTM architecture. A multi-head attention mechanism fuses these modalities, and experiments on MELD and IEMOCAP show significant accuracy and robustness gains, especially in unbalanced data settings.
By Xu Lin, Ke Wang, Hui Kang, Xinying Wang
The paper reports on building a research-software catalog using a coding agent, starting from a three‑day hackathon prototype and moving to public deployment. It details the engineering work needed—adversarial review, data‑quality checks, browser validation, and publication safeguards—to ensure reliable operation, noting that silent failures were more problematic than crashes. The authors then examine applying these lessons to a larger, human‑curated portal (MateriApps) that combines curated metadata, external documentation, vector search, and local language‑model generation, finding that explicit validation, monitoring, and repeated review remain essential for AI‑assisted software portals.
By Kazuyoshi Yoshimi, Satoshi Terasaki, Gotai Yamada
arXiv:2609. 05339v1 Announce Type: new Abstract: Model upgrades are routine; memory migrations are not.
By Ankit Goyal, Jaideep Ray
A new framework called APT‑RAG is introduced for evidence‑intensive question answering. It uses adaptive planning to expand a tree‑based reasoning structure according to question dependencies and evidence needs, and employs topology‑aware evidence gathering that reuses sibling evidence, retrieves directly, and aggregates evidence from child nodes. The approach also includes evidence‑guided batched answer generation to reduce generation overhead, and experimental results show it outperforms existing structured RAG methods on evidence‑intensive QA benchmarks.
By Songeun Lee, Kyungjin Min, Injae Na, Suyeong Lee, Chiyoung Kim, Woohwan Jung
The paper introduces RSM‑full, an online clustered‑memory pipeline that uses a cosine‑gated max‑member merge rule and an atom‑aware grouped context packer to improve compact‑memory performance for large language model deployments. On the AMA‑Bench benchmark, RSM‑full achieves 83 % of full‑context quality while using only 32 % of the token cost at a 4 k budget, outperforming streaming‑clustered baselines by 3.5–6.0 pp. Similar gains are observed on the RealMem persona‑memory benchmark, where RSM‑full surpasses Budget‑RAG, matches BM25‑RAG, and outperforms Streaming‑Proto and A‑MEM.
whyItMatters":"RSM‑full demonstrates that careful design of memory merging and context packing can substantially reduce token costs while maintaining high quality, addressing practical constraints of latency, cost, and context limits in long‑horizon LLM deployments."
By Jiahe Geng, Jinpeng Wang, Kun Yuan
PlaidQ is a 0.7B continuous diffusion language model designed for code generation. By distilling its iterative refinement trajectory into only a few denoising steps—or even a single step—PlaidQ achieves competitive performance with discrete diffusion models while dramatically reducing inference time. The study demonstrates that continuous diffusion can be effectively compressed, enabling efficient and accurate code generation with minimal computational overhead.
By Fred Zhangzhi Peng, Kaiwen Zheng, Anru R. Zhang