Skip to content
AI NEWS JOURNAL
AI, IN PERSPECTIVE

Search AI news

Search headlines, summaries and articles to connect the dots.

Newest first

What Constitutes Food Similarity? Visual Representations and Retrieval in Indian Cuisine

arXiv:2610.37867v1 Announce Type: new Abstract: Food similarity underlies retrieval, recommendation, substitution, and other food computing tasks, yet food representations are typically evaluated by identity preservation. We ask what happens to food similarity beyond identity: how different visual representations organize foods into relational neighborhoods, what culinary relationships these neighborhoods reveal or obscure, and how consistently these structures emerge across representations. Indian cuisine provides a challenging setting in which visually similar foods may have different culinary identities, while foods within a culinary family can vary substantially in appearance. Using an expanded Khana dataset and seven pretrained visual representations spanning convolutional, transforme

Timeline and related coverage

Exposure Is Not Commitment: Double-Stratified Evaluation of Latent Monitors for Tool-Using Agents

arXiv:2610.37679v1 Announce Type: new Abstract: Tool-using language agents are vulnerable to indirect prompt injection, and a growing literature probes model internals to catch unsafe actions before they execute, with sharply conflicting results. We argue much of the conflict is an evaluation artifact, and propose a double-stratification protocol: separate injection exposure from behavioral commitment, in both the evaluation and the training population. On the primary Qwen AgentDojo grid, monitors trained on the naive mixed unsafe-versus-rest contrast mostly learn exposure: they flag exposed trajectories whether or not the agent complies, and barely predict which cases turn unsafe. Retrained on exposed cases only, the same probe families predict the model's own unsafe tool call up to two s

Timeline and related coverage

ProtoEEG: Structured Prototype Alignment for EEG Visual Decoding

arXiv:2610.33065v1 Announce Type: new Abstract: EEG visual decoding remains difficult because scalp recordings are noisy, spatially coarse, and variable across trials and subjects. Most systems align each trial with a dense image embedding, although that embedding mixes semantic content with instance-specific texture, pose, and background. This target can demand details absent from EEG and provides no explicit account of the visual factors supporting a prediction. We propose \textbf{ProtoEEG}, a prototype-mediated framework that reformulates EEG--image alignment as soft composition over a shared learnable visual codebook. A trainable EEG encoder and a frozen visual teacher produce assignment distributions over the same $K=64$ prototypes. Their weighted reconstructions form a structured rep

Timeline and related coverage

Perturbation-Based Data Selection for Medical Question Answering

arXiv:2610.33440v1 Announce Type: new Abstract: Selecting a compact training subset is an important step in adapting medical language models from existing question-answering banks. We investigate perturbation-based data selection using two signals derived from Gaussian perturbations of the final-block representation: prediction-change frequency and non-flipping margin contraction. After a shared entropy prefilter, Representation-Sensitivity Prioritization (RSP) combines the signals using automatic root-mean-square scaling, while RSP-Drop ranks candidates by contraction alone. Both selectors use only questions and answer options during selection. We evaluate them with MedGemma-4B on five medical QA datasets at retained-set budgets of 64, 128, and 256 examples. At the primary budget of 128,

Timeline and related coverage

Quantifying Meaning with SCAPE-T: Semantic Complexity from Encoder-Only Transformer Attention

arXiv:2610.33441v1 Announce Type: new Abstract: Automated semantic complexity estimation remains underexplored in NLP, despite important applications in linguistics and interpretability. This paper defines semantic complexity as the code length required to uniquely specify a text's semantic meaning, and operationalises it via SCAPE-T, an attention-derived metric based on encoder-only transformers. Existing measures either model reader effort (readability, lexical difficulty), which correlates with surface features (word length, syntax), or quantify surface features directly (type-token ratio, word frequency). SCAPE-T targets semantic integration directly by combining three submetrics: (i) inverse-weighted self-focus (token-to-self), (ii) CLS focus (token-to-CLS), and (iii) inter-head redun

Timeline and related coverage

Examining form-based linguistic productivity in people and large language models

arXiv:2610.33433v1 Announce Type: new Abstract: Linguistic productivity, as evidenced by the use of words in novel contexts, is one of the most striking facts about human language. However, how abstract the knowledge that enables such productivity is remains unclear. We compare people's and computational language models' linguistic productivity in contexts where successful generalization depends on form-based information. We focus on extending the use of a novel verb learned in the active voice to passive contexts. We find people extend active to passive uses in a way consistent with abstract generalizations concerning linguistic form, even when no plausible meaning can be assigned to the novel verb. In contrast, large language models succeeded only when a meaning like an existing verb's c

Timeline and related coverage

POS-Signature Demonstration Retrieval for In-Context Dependency Parsing

arXiv:2610.31966v1 Announce Type: new Abstract: Demonstrations for in-context learning are often retrieved by semantic similarity, which may be a poor proxy for relevance in structured prediction. We study demonstration selection for Universal Dependencies parsing with a POS-signature policy that represents sentences with weighted part-of-speech statistics and retrieves three length-compatible, gold-parsed examples from the labeled training split. We evaluate two open-weight language models without fine-tuning on all 2,077 sentences of the UD English Web Treebank test set, comparing the policy with shot- and format-matched fixed and semantic three-shot baselines, as well as zero-shot, chain-of-thought, and critique-refinement systems. POS-signature retrieval yields the highest labeled atta

Timeline and related coverage

Semantically Rich, Metrically Affect-Blind: A Geometric Blind Spot in Modern Text Embedders

arXiv:2610.32122v1 Announce Type: new Abstract: We report a systematic dissociation in modern text embedders: sentiment is almost perfectly decodable from their embeddings, yet almost entirely absent from their metric. Across eleven frozen encoders spanning 2021 to 2026, including 2026-generation models and the 4B-parameter LLM embedder Qwen3-Embedding-4B, a linear probe recovers sentence polarity at up to 91.3% accuracy while cosine similarity separates polarity by a margin of only 0.003-0.064. Qwen3-Embedding-4B, the strongest probe in the panel, reaches 91.3% probe accuracy but only 64.3 retrieval MAP. Because retrieval, clustering, deduplication, and retrieval-augmented generation operate on the metric rather than on a trained probe, these systems are effectively blind to information t

Timeline and related coverage

Context or Knowledge: How LLMs Attribute Their Own Answers

arXiv:2610.32109v1 Announce Type: new Abstract: Language models can answer a question from a supplied document or from their parametric knowledge. When later asked where the answer came from, what determines their source report? We study this by intervening on the model's key-value (KV) cache after the answer is generated and before the source question is asked. On a controlled factual task with four models (7B-32B), changing or removing the document's cache never changes the report. In contrast, transplanting the question-and-answer (Q+A) cache between runs with identical question and answer tokens transfers it: every eligible report follows the donor, while the recipient's document is unchanged. On the two smaller models, steering Q+A values along directions fitted before any source ques

Timeline and related coverage

ULME Framework Achieves True Unification of Text Embedding and Language Modeling: A New Paper on arXiv Proposes a Predictive Coupling Mechanism

On October 24, 2026, arXiv published the paper arXiv:2610.30705v1, introducing ULME—a post-training framework for causal-decoder–based large language models that, through a predictive coupling mechanism, achieves, for the first time, a mutually reinforcing unification of text embedding and language-generation capabilities. This approach was validated on the Qwen2.5/Qwen3 series (with 0.5B–8B parameters), yielding MTEB improvements of 3.3–4.1 points while maintaining performance on generation tasks such as MMLU.

ULME: Predictive Coupling for Mutually Reinforcing Embedding and Language Modeling

Why it matters:This paper directly addresses the core issue of fragmented multimodal LLM capabilities: embeddings and generation have long been handled either by separate models or by “pseudo-unified” models that rely solely on parameter sharing. ULME achieves a substantial architectural breakthrough by employing learnable slots and joint training with three objectives—including a stop-gradient prediction loss—enabling the generation process to actively shape the embedding representations. The study features broad experimental coverage, strong baselines, comprehensive metrics, and was published on a reputable preprint platform, balancing timeliness with technical rigor.

Timeline and related coverage