This article introduces an evolutionary modeling framework that integrates formal semantics by allowing lexical meanings and composition functions to co-evolve under pressures for conceptual simplicity and communicative accuracy.
This article presents a conceptual framework for analyzing dialogue dynamics in collaborative problem-solving contexts, with a specific focus on human-AI and multi-agent interactions. The authors argue that understanding these dialogic interactions is crucial for optimizing partnerships as intelligent systems gain autonomous reasoning capabilities.
This study investigates whether language models function as consistent knowledge bases by analyzing if facts acquired during one task remain accessible in others. The research reveals that LMs encode knowledge in a task-specific manner, with distinct parameter subsets underlying different tasks for the same fact.
The CARVE architecture addresses three critical defects in the leading GDN-2 delta-rule recurrent model by restricting erase operations to the key axis, thereby enabling valid WY-form triangular chunk solving and improving value efficiency. By reusing the recurrent output tensor as a content signal and replacing per-value write-gate projections with single scalars, CARVE maintains bit-identical initialization to GDN-2 while resolving memory-blind gating issues.
This article addresses the challenge of training-free source selection for large language models with shared vocabularies in scientific domains like SMILES and genomics, where classical metrics are either uninformative or computationally prohibitive. The authors demonstrate that representation similarity metrics are non-identifiable for transfer because models can share identical representations yet have orthogonal head updates.
This paper proposes a diagnostic framework decomposing historical language difficulty into tokenization cost, predictive uncertainty, semantic robustness, and context sensitivity. The authors evaluate this framework on 17th-century Italian, 19th-century Italian, and 18th-century Russian texts to understand how LLMs process historical languages.
Translation cascades for reasoning translate queries to English, reason, and translate back, but this process is structurally lossy due to information discard at each stage. The authors propose a context-aware translation cascade that preserves the original question, translated query, and reasoning trace to mitigate these losses.
Researchers propose a mechanism-oriented taxonomy of indirect linguistic expressions (ILE) to categorize the underlying operations used to encode and recover meaning in coded language. This approach abstracts away from communicative goals to focus on the specific encoding mechanisms found in algospeak, euphemisms, and adversarial obfuscation.
This paper presents the first case study applying Large Language Models to the German Central Bank's process of verifying securities eligibility for collateral, shifting from traditional Named Entity Recognition to a generative Information Extraction pipeline. The approach decomposes the task into extraction, normalization, and interpretation to handle noisy text and bilingual content more effectively.
Researchers introduce the Planning Experience Exploration and Utilization (PEEU) method to enhance task planning in multimodal web agents using small open-source Multimodal Large Language Models (MLLMs). This approach autonomously explores environments to discover experiences and synthesizes high-level training data through hindsight experience utilization.
This study proposes a longitudinal text analysis framework combining Japanese-language NLP metric extraction with paired testing and shift function analysis to evaluate qualitative changes in corporate risk disclosures. Applied to Japan's 2019 disclosure reforms, the approach analyzes 19,770 firm-year observations over ten years to capture multidimensional dynamics often masked by single-indicator methods.
Researchers present a modular, fully open-weight pipeline for multilingual joint entity-relation extraction that builds signed, temporal knowledge graphs from massive unstructured news corpora. The system combines span-based named-entity recognition with a linking cascade to Wikidata and an ontology-constrained mixture-of-experts model to extract directed relationships.
The authors introduce DanceOPD, an on-policy generative field distillation framework designed to unify text-to-image generation with local and global editing capabilities in flow-matching models. This approach routes samples to specific capability fields and trains using a velocity MSE objective to compose expert skills without mutual interference.
A Reddit user is seeking recommendations for YouTube channels that provide news and updates on local large language model development.
The article references the LiquidAI LFM2.5-230M model as an alternative for users without access to data center GPUs.
Ornith-1.0 is a new family of open-source large language models specialized for agentic coding tasks. The model family spans multiple parameter sizes, including 9B Dense, 35B MoE, and 397B MoE configurations.
NVIDIA introduces Nemotron-TwoTower, a diffusion language model that decouples context representation and iterative denoising into two separate networks to overcome capacity limitations in existing approaches. Built on the open-weight Nemotron-3-Nano-30B-A3B model and trained on 2.1T tokens, it retains 98.7% of the autoregressive baseline's quality while achieving 2.42X higher wall-clock generation throughput.
A study reveals that while large reasoning models (LRMs) and humans both spend more time on harder problems, they diverge significantly in how they allocate deliberation within specific items. When making errors, LRMs generate more tokens than when correct, whereas humans do the opposite, spending less time on trials they get wrong.
The article introduces MemStrata, a retrieval memory system designed to eliminate stale-fact errors in AI agents by maintaining temporal validity within accumulated knowledge. Unlike standard Retrieval-Augmented Generation (RAG), which struggles to distinguish between duplicated and contradicted facts due to embedding similarity, MemStrata uses a deterministic supersession rule to retire outdated information.
The authors propose Erase-then-Delta Attention (EDA), a memory update rule for recurrent models that decouples the address used to erase stale information from the address used to write new content. This approach addresses the limitation of delta-rule linear attention, which cannot actively remove outdated data stored at different locations before writing.