{"id":113,"date":"2026-07-08T15:03:15","date_gmt":"2026-07-08T19:03:15","guid":{"rendered":"https:\/\/monizesairesearch.com\/index.php\/2026\/07\/08\/llms-foundation-models-frontier-ai-research-brief-w26-2026\/"},"modified":"2026-07-08T15:03:15","modified_gmt":"2026-07-08T19:03:15","slug":"llms-foundation-models-frontier-ai-research-brief-w26-2026","status":"publish","type":"post","link":"https:\/\/monizesairesearch.com\/index.php\/2026\/07\/08\/llms-foundation-models-frontier-ai-research-brief-w26-2026\/","title":{"rendered":"LLMs &#038; Foundation Models &#8211; Frontier AI Research Brief (W26 2026)"},"content":{"rendered":"<p>A focused look at this week&#8217;s most significant advances in llms &#038; foundation models \u2014 83 papers surveyed from arXiv and leading AI labs.<\/p>\n<p>&#8212;<\/p>\n<p>This week in foundation models, researchers pushed further into understanding how these systems learn, what they represent internally, and how far we can scale them. The papers span training dynamics, evaluation methodology, and architectural innovations.<\/p>\n<h2>Key Developments<\/h2>\n<p><strong>Prompt Injection in Automated R\u00e9sum\u00e9 Screening with Large Language Models: Single and Multi-Injection Settings<\/strong> \u2014 <em>Preet Baxi, Jiannan Xu, Jane Yi Jiang, Stefanus Jasin<\/em><\/p>\n<p>Large language models (LLMs) are increasingly used to screen and rank job applicants, creating incentives for candidates to strategically manipulate algorithmic hiring systems. We study prompt injecti&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27287v1\">arXiv<\/a><\/p>\n<p><strong>TOPS: First-Principles Visual Token Pruning via Constructing Token Optimal Preservation Sets for Efficient MLLM Inference<\/strong> \u2014 <em>Tinghao Wang, Yichen Guo, Rui Huang, Zheng Lu, Qizhe Zhang, Chenxi Li, Yuan Zhang, Jiajun Cao, Zhirong Shen, Yaosong Du,<\/em><\/p>\n<p>Multimodal large language models (MLLMs) have achieved strong multimodal reasoning capabilities, but their efficiency is limited by the large number of visual tokens, which introduces substantial comp&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27161v1\">arXiv<\/a><\/p>\n<p><strong>NuclearQAv2: A Structured Benchmark for Evaluating Domain-Science Competence in Large Language Models<\/strong> \u2014 <em>Henry Shaowu Yuchi, Michal Kucer, Benjamin H. Sims, Selma Peterson, Emily Taylor<\/em><\/p>\n<p>Large language models (LLMs) have demonstrated strong performance across a wide range of tasks, but ensuring their reliability in highly technical domains remains a significant challenge. In nuclear e&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27047v1\">arXiv<\/a><\/p>\n<h2>Training &#038; Scaling<\/h2>\n<p><strong>The Riddle Riddle: Testing Flexible Reasoning in Large Language Models and Humans<\/strong><\/p>\n<p><em>Bella Fascendini, Kathryn McGregor, Max D. Gupta, Thomas L. Griffiths<\/em><\/p>\n<p>Humans flexibly adapt their reasoning strategies to the requirements of a given problem. Large language models (LLMs) have performed well on many cognitive tasks, however, it is unclear whether this accuracy is a result of pattern matching from&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27103v1\">arXiv<\/a><\/p>\n<p><strong>RelAfford6D: Relational 6D Affordance Graphs for Constraint-Driven Robotic Manipulation<\/strong><\/p>\n<p><em>Guodong Zhang, Qichen He, Wenyuan Xie, Shaokai Wu, Yanbiao Ji, Qiuchang Li, Bayram Bayramli, Yue Din<\/em><\/p>\n<p>Bridging abstract semantics and precise physical control remains a fundamental challenge in open-world robotic manipulation. While recent data-driven policies show promise, their reliance on isolated contact points or latent affordance embeddings&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27036v1\">arXiv<\/a><\/p>\n<p><strong>Data-Free Reservoir Features for Efficient Long-Horizon Cold-Start Continual Learning<\/strong><\/p>\n<p><em>Augustinas Ju\u010das, Yangchen Pan<\/em><\/p>\n<p>Cold-start exemplar-free class-incremental learning requires learning a growing set of classes without replay, external pretraining, or a large initial task. Existing cold-start methods typically either train the backbone throughout the stream and&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27095v1\">arXiv<\/a><\/p>\n<p><strong>Inherited Circuits, Learned Semantics: How Fine-Tuning Creates Evasion Vulnerabilities Invisible to Standard Evaluation<\/strong><\/p>\n<p><em>Ryan Fetterman<\/em><\/p>\n<p>LLMs fine-tuned for security classification are usually evaluated on held-out examples from the same distribution as their training data. We show that this can miss vulnerabilities introduced by fine-tuning itself: models can learn token-level&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27091v1\">arXiv<\/a><\/p>\n<p><strong>A Generalization Theory for JEPA-Based World Models<\/strong><\/p>\n<p><em>Jingyi Cui, Qi Zhang, Hongwei Wen, Yisen Wang<\/em><\/p>\n<p>Joint Embedding Predictive Architectures (JEPAs) have recently emerged as a promising paradigm for world modeling by learning predictive dynamics in a latent space rather than generating future observations at the input level. Despite their&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27014v1\">arXiv<\/a><\/p>\n<p><strong>KARLA: Knowledge-base Augmented Retrieval for Language Models<\/strong><\/p>\n<p><em>Francois Crespin, Fabian M. Suchanek, Nils Holzenberger<\/em><\/p>\n<p>We propose a new method that allows an LLM to automatically pull in factual knowledge from a knowledge base during token generation. This means that (1)~factual knowledge in the LLM output can be updated without retraining the LLM, (2)~facts in the&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26807v1\">arXiv<\/a><\/p>\n<p><strong>Escaping Iterative Parameter-Space Noise: Differentially Private Learning with a Hypernetwork<\/strong><\/p>\n<p><em>Naoki Nishikawa, Shokichi Takakura, Satoshi Hasegawa<\/em><\/p>\n<p>Differentially private (DP) training of neural networks is often hindered by the large amount of noise required by gradient-based methods such as DP-SGD, which repeatedly inject high-dimensional noise in parameter space throughout training. In this&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26772v1\">arXiv<\/a><\/p>\n<p><strong>EEG Benchmarking Needs a Task Specification Layer: NeuroDoc for Rulebook-Guided, Executable Benchmark Construction<\/strong><\/p>\n<p><em>Chengxuan Qin, Zhige Chen, Shu Peng, Rui Yang, Jiping Cui, Yikai Dong, Jun Li, Liu Peng, Zhida Shang<\/em><\/p>\n<p>Electroencephalography (EEG) foundation models increasingly rely on multi-dataset training and evaluation, yet public EEG datasets still lack a shared task specification layer that can turn heterogeneous recordings into reusable benchmark units&#8230;.<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.22925v1\">arXiv<\/a><\/p>\n<p><strong>DMuon: Efficient Distributed Muon Training with Near-Adam Overhead<\/strong><\/p>\n<p><em>Vincent Chen, Starrick Liu, Regis Cheng, Dance Yang, Shalfun Li, Ryan Yu, Lucy Liang, Hang Su, Roy G<\/em><\/p>\n<p>Matrix-orthogonalization-based optimizers, exemplified by Muon, have demonstrated strong convergence behavior across a wide range of modern deep learning workloads. The matrix-aware updates offer a compelling alternative to conventional&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27153v1\">arXiv<\/a><\/p>\n<p><strong>Just how sure are you? Improving Verbalized Uncertainty Calibration in Medical VQA<\/strong><\/p>\n<p><em>Eren Senoglu, Federico Toschi, Nicolo Brunello, Andrea Sassella, Mark James Carman<\/em><\/p>\n<p>Multimodal large language models (MLLMs) applied to Medical Visual Question Answering (VQA) tend to produce overconfident outputs regardless of actual correctness, and existing verbalized confidence calibration methods, developed primarily for text&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27023v1\">arXiv<\/a><\/p>\n<p><strong>Enabling self-supervised learned primal dual with Noise2Inverse<\/strong><\/p>\n<p><em>Antti S\u00e4llinen, Siiri Rautio, Santeri Kaupinm\u00e4ki, Andreas Hauptmann<\/em><\/p>\n<p>X-ray computed tomography reconstruction is an ill-posed inverse problem, particularly in low-dose and sparse-angle settings where measurements are noisy and incomplete. While learned reconstruction methods such as the Learned Primal-Dual algorithm&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26991v1\">arXiv<\/a><\/p>\n<p><strong>How Surprising Is Historical Italian to Language Models? Tokenization Tax, Comprehension Tax, and a Simple Mitigation<\/strong><\/p>\n<p><em>Maria Levchenko<\/em><\/p>\n<p>Large language models (LLMs) are increasingly critical to digital library workflows, yet their ability to process historical language remains poorly understood. Historical difficulty is typically treated as a monolithic barrier, conflating&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27275v1\">arXiv<\/a><\/p>\n<p><strong>Structure Before Collapse: Transient semantic geometry in next-token prediction<\/strong><\/p>\n<p><em>Yize Zhao, Isabel Papadimitriou, Christos Thrampoulidis<\/em><\/p>\n<p>Neural Collapse predicts that balanced one-hot classification pushes model representations to be equally far from each other; a symmetric configuration that depends only on the output label and ignores any semantic similarity in the inputs. This&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26749v1\">arXiv<\/a><\/p>\n<p><strong>Training for the Model You Return: Improving Optimization for Iterate-Averaged Language Models<\/strong><\/p>\n<p><em>Kwok Chun Au, Adam Block<\/em><\/p>\n<p>Many modern Language Model (LM) pipelines return an averaged model, such as an exponential moving average of the training iterates, rather than the final iterate itself. This raises a fundamental question: given that we will return an iterate&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25086v1\">arXiv<\/a><\/p>\n<p><strong>A probabilistic framework for online test-time adaptation<\/strong><\/p>\n<p><em>Daniel Corrales, David R\u00edos Insua<\/em><\/p>\n<p>This paper presents a probabilistic framework for online test-time adaptation problems. In them, a model is trained on labeled data but must adapt to unlabeled data at test time under the assumption that training and test distributions potentially&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26457v1\">arXiv<\/a><\/p>\n<h2>Reasoning &#038; Inference<\/h2>\n<p><strong>CORTEX: A Structured Reasoning Benchmark for Trustworthy 3D Chest CT MLLMs<\/strong><\/p>\n<p><em>Hashmat Shadab Malik, Anees Ur Rehman Hashmi, Numan Saeed, Muzammal Naseer, Salman Khan, Christoph L<\/em><\/p>\n<p>Reasoning in multimodal large language models (MLLMs) has shown strong promise in medical imaging. However, this reasoning is usually free-form text judged only by its final answer, making it hard to interpret and verify, especially in 3D&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27264v1\">arXiv<\/a><\/p>\n<p><strong>Confidence-Aware Tool Orchestration for Robust Video Understanding<\/strong><\/p>\n<p><em>Yangfan He, Yujin Choi, Jaehong Yoon<\/em><\/p>\n<p>Video reasoning language models implicitly assume that every input frame is equally reliable. This leads to what we term the Blind Trust Problem: under realistic perturbations such as motion blur, glare, or occlusion, frontier video reasoning&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26904v1\">arXiv<\/a><\/p>\n<p><strong>ReaORE: Reasoning-Guided Progressive Open Relation Extraction Empowered by Large Reasoning Models<\/strong><\/p>\n<p><em>Xin Lin, Liang Zhang, Guoqi Ma, Hongyao Tu, Jinsong Su<\/em><\/p>\n<p>Open Relation Extraction (OpenRE) requires a model to extract unseen relations between head and tail entities from unstructured text for real-world applications. The core challenge of OpenRE lies in achieving reliable generalization to unseen&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26986v1\">arXiv<\/a><\/p>\n<p><strong>Information-Aware KV Cache Compression for Long Reasoning<\/strong><\/p>\n<p><em>Jushi Kai, Zhuiri Xiao, Alexandra Birch, Zhouhan Lin<\/em><\/p>\n<p>Reasoning capability has advanced rapidly in large language models (LLMs), leading to an increasing size of key-value (KV) cache in both prefilling and decoding stages. Existing KV cache compression methods mainly rely on attention weights to&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26875v1\">arXiv<\/a><\/p>\n<p><strong>Beyond Logical Forms: LLM-Extracted Patterns for Fallacy Classification<\/strong><\/p>\n<p><em>Eleni Papadopulos, Firoj Alam, Giovanni Da San Martino<\/em><\/p>\n<p>In today&#8217;s fast-paced information era, logical fallacies, defined as defective patterns of reasoning, inevitably contribute to the growth of information disorder. However, often fallacies appear in nuanced forms that complicate automated&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26698v1\">arXiv<\/a><\/p>\n<h2>Safety &#038; Alignment<\/h2>\n<p><strong>Statistically Valid Hyperparameter Selection: From Tuning to Guarantees<\/strong><\/p>\n<p><em>Amirmohammad Farzaneh, Osvaldo Simeone<\/em><\/p>\n<p>Hyperparameter selection is a critical step in the deployment of modern artificial intelligence systems, given the need to tune degrees of freedom such as inference-time parameters, implementation-level settings, and thresholds driving decision&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25601v1\">arXiv<\/a><\/p>\n<h2>Additional Research<\/h2>\n<p><strong>RSPC: A Benchmark for Modeling Stress and Psychiatric Conditions in Digitally Mediated Relationships using Psychiatrist Annotations<\/strong><\/p>\n<p><em>Parmitha Vangapandu, Sai Ganesh Mokkapati, Sathwik Narkedimilli, MSVPJ Sathvik, Timothy Liu, Simon S<\/em><\/p>\n<p>In NLP, mental health conditions are often modeled as isolated phenomena, without interpersonal context. We use Reddit posts about long-distance relationships to capture both mental health distress and associated relational triggers. We introduce&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27247v1\">arXiv<\/a><\/p>\n<p><strong>SamaVaani: Auditing and Debiasing Multilingual Clinical ASR for Indian Languages<\/strong><\/p>\n<p><em>Subham Kumar, Prakrithi Shivaprakash, Abhishek Manoharan, Astut Kurariya, Diptadhi Mukherjee, Prabha<\/em><\/p>\n<p>Automatic Speech Recognition (ASR) is increasingly used to document clinical encounters, yet its reliability in multilingual and demographically diverse Indian healthcare context remains largely unknown. In this study, we first conduct the&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26901v1\">arXiv<\/a><\/p>\n<p><strong>Reproducibility Study of &#8220;AlphaEdit: Null-Space Constrained Knowledge Editing for Language Models&#8221;<\/strong><\/p>\n<p><em>Ananth K S, Arya Hariharan<\/em><\/p>\n<p>Fang et al. (2025) introduced a null-space constrained projection, named AlphaEdit, for locate-then-edit knowledge editing methods, theoretically guaranteeing that edits do not disrupt previously preserved knowledge, and reports substantial gains&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26783v1\">arXiv<\/a><\/p>\n<p><strong>SocialPersona: Benchmarking Personalized Profiling and Response with Multimodal Social-Media Context<\/strong><\/p>\n<p><em>Qinkai Zhang, Yanyan Zhao, Xin Lu, Yulin Hu, Pengtao Han, Bing Qin<\/em><\/p>\n<p>Personalized language-model assistants are often evaluated through a memory lens: can a model recall preferences users have explicitly stated in dialogue? More comprehensive personalization demands a harder capability &#8212; inferring what users care&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26654v1\">arXiv<\/a><\/p>\n<p><strong>Peek2: Regex-free Byte-level Byte-Pair Encoding Pretokenizer for LLM Inference on Edge Devices<\/strong><\/p>\n<p><em>Liu Zai, Iraklis Klampanos<\/em><\/p>\n<p>Pretokenization is a crucial, sequential pass in Byte-level BPE tokenizers, yet little work has been done to optimize it for edge-side inference. Our proposed new implementation, Peek2, serves as a drop-in replacement for cl100k-like pretokenizers&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2601.05833v2\">arXiv<\/a><\/p>\n<p><strong>Application of LLMs to Threat Assessment of Foreign Peacekeeping Missions<\/strong><\/p>\n<p><em>Gerhard Backfried, Christian Schmidt, Diego Pilutti, Michael Suker<\/em><\/p>\n<p>We present a novel approach for applying Large Language Models (LLMs) to threat assessment in the context of foreign peacekeeping missions. Building on the PINPOINT project and its use case, the EU Monitoring Mission in Georgia, we combine an&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27106v1\">arXiv<\/a><\/p>\n<p><strong>Decision-Aligned Evaluation of Uncertainty Quantification<\/strong><\/p>\n<p><em>Annika Schneider, Tommy Rochussen, Joshua Stiller, Vincent Fortuin<\/em><\/p>\n<p>Uncertainty estimates in machine learning are typically evaluated using generic metrics such as the negative log-likelihood and expected calibration error, yet good performance on such metrics does not necessarily imply high utility in downstream&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26990v1\">arXiv<\/a><\/p>\n<p><strong>XMSE-Aware Adaptive Empirical Bayes Estimation<\/strong><\/p>\n<p><em>Minghao Chen, Jiale Zheng<\/em><\/p>\n<p>Empirical Bayes (EB) estimators can match the first-order asymptotic risk of maximum likelihood (ML) while behaving very differently at second order: recent excess mean squared error (XMSE) analysis shows that kernel-based EB estimation may be&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26975v1\">arXiv<\/a><\/p>\n<p><strong>Generative Models on Analog Hardware with Dynamics<\/strong><\/p>\n<p><em>Yu-Neng Wang, Sara Achour<\/em><\/p>\n<p>Analog hardware platforms such as coupled oscillators and Analog Ising Machines naturally solve differential equations at a fraction of the energy cost of digital computation, making them attractive for low-power generative modeling, yet a&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27294v1\">arXiv<\/a><\/p>\n<p><strong>Ribbon: Scalable Approximation and Robust Uncertainty Quantification<\/strong><\/p>\n<p><em>Graham Gibson, John Tipton, Kellin Rumsey, Natalie Klein<\/em><\/p>\n<p>Reliably quantifying predictive uncertainty is difficult for complex, high-dimensional, or misspecified models. Both fully Bayesian and bootstrap resampling methods provide principled uncertainty estimates but are often too expensive for modern&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27269v1\">arXiv<\/a><\/p>\n<p><strong>GAVEL: Grounded Caption Error Verification and Localization<\/strong><\/p>\n<p><em>Zixian Gao, Atsushi Hashimoto, Kuniaki Saito<\/em><\/p>\n<p>Vision-language models (VLMs) often produce hallucinated or inconsistent outputs, where text and images are not properly aligned. Addressing this issue requires not only detecting misalignment but also explaining the discrepancy and localizing its&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26923v1\">arXiv<\/a><\/p>\n<p><strong>FBK&#8217;s Long-form SpeechLLMs for IWSLT 2026 Instruction Following<\/strong><\/p>\n<p><em>Zhihang Xie, Marco Gaido, Sara Papi, Matteo Negri, Luisa Bentivogli<\/em><\/p>\n<p>This paper describes our submission to the IWSLT 2026 Instruction Following shared task. SpeechLLMs are developed for both short-form and long-form speech instruction following under constrained settings. For the short track, strong performance is&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26819v1\">arXiv<\/a><\/p>\n<p><strong>DnA: Denoising Attention for Visual Tasks<\/strong><\/p>\n<p><em>Ron Campos, Subhajit Maity, Xin Li, Srijan Das, Aritra Dutta<\/em><\/p>\n<p>The softmax activation in multihead attention (MHA) is the de facto standard for attention-based models in visual perception tasks. However, standard softmax can produce noisy attention patterns that dilute relevant features and degrade its&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27372v1\">arXiv<\/a><\/p>\n<p><strong>RoPEMover: Depth-Aware Object Relocation via Positional Embeddings<\/strong><\/p>\n<p><em>Ipek Oztas, Duygu Ceylan, Aybars Bugra Aksoy, Aysegul Dundar<\/em><\/p>\n<p>Moving an object in a single image requires geometry-consistent spatial rearrangement, including handling occlusions, revealing previously unseen regions, and maintaining coherent shadows and reflections. Existing approaches are not well suited to&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27332v1\">arXiv<\/a><\/p>\n<p><strong>Learning Probabilistic Filters with Strictly Proper Scoring Rules<\/strong><\/p>\n<p><em>Eviatar Bach, Ricardo Baptista, Jochen Br\u00f6cker, Bohan Chen, Andrew Stuart<\/em><\/p>\n<p>Bayesian filtering of partially and noisily observed dynamical systems seeks to infer the evolving conditional distribution of the state of a dynamical system, given observations, in an online fashion. This Bayesian filtering distribution is the&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26497v1\">arXiv<\/a><\/p>\n<p><strong>Stabilizing black-box algorithms through task-oriented randomization<\/strong><\/p>\n<p><em>Yali Wang, Zhaojun Wang<\/em><\/p>\n<p>As black-box models become foundational to modern research, ensuring their stability is paramount for the realization of trustworthy artificial intelligence. The inherent diversity of inputs &#8211; ranging from structured Gaussian distributions to&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25269v1\">arXiv<\/a><\/p>\n<p><strong>Efficient Adaptive Data Acquisition via Pretrained Belief Representations<\/strong><\/p>\n<p><em>Daolang Huang, Zhuoyue Huang, Conor Hassan, Luigi Acerbi, Samuel Kaski, Tom Rainforth<\/em><\/p>\n<p>Learning effective policies for adaptive data acquisition remains challenging: posterior-based methods rely on surrogate models and posterior approximations that can be misspecified or biased, while direct policy-learning methods map from&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25197v1\">arXiv<\/a><\/p>\n<p><strong>Hierarchical Partial-Order Models for Ranking<\/strong><\/p>\n<p><em>Dongqing Li, Geoff K. Nicholls, Jeong Eun Lee,  Chuxuan,  Jiang<\/em><\/p>\n<p>Rank aggregation combines information from ordered lists ranking items by preference. Classical parametric models for such data, including the Mallows and Plackett-Luce models, assume the orders concentrate around one or more complete consensus&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25062v1\">arXiv<\/a><\/p>\n<p><strong>EML Trees Are Universal Approximators<\/strong><\/p>\n<p><em>Joe Germany, Elie Abdo, Joseph Bakarji<\/em><\/p>\n<p>The recently introduced EML (Exp-Minus-Log) function acts as continuous analogue of NAND gates, providing a compositional building block capable of representing elementary functions. In this work, we study the expressive power of tree-structured&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.23179v1\">arXiv<\/a><\/p>\n<p><strong>Error Highways: Scaling Predictive Coding to Very Deep Networks<\/strong><\/p>\n<p><em>Amirhossein Mohammadi, Alexander G. Ororbia<\/em><\/p>\n<p>Predictive coding networks (PCNs) offer a biologically-plausible, local-learning alternative to back-propagation of errors (backprop). Nevertheless, they have remained largely confined to shallow architectures and evaluated on simple machine&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.22744v1\">arXiv<\/a><\/p>\n<p><strong>DeepSeek LLM: Scaling Open-Source Language Models with Longtermism<\/strong><\/p>\n<p><em> DeepSeek-AI,  :, Xiao Bi, Deli Chen, Guanting Chen, Shanhuang Chen, Damai Dai, Chengqi Deng, Honghu<\/em><\/p>\n<p>The rapid development of open-source large language models (LLMs) has been truly remarkable. However, the scaling law described in previous literature presents varying conclusions, which casts a dark cloud over scaling LLMs. We delve into the study&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2401.02954v1\">arXiv<\/a><\/p>\n<p><strong>Autoregressive Boltzmann Generators<\/strong><\/p>\n<p><em>Danyal Rehman, Charlie B. Tan, Yoshua Bengio, Avishek Joey Bose, Alexander Tong<\/em><\/p>\n<p>Efficient sampling of molecular systems at thermodynamic equilibrium is a hallmark challenge in statistical physics. This challenge has driven the development of Boltzmann Generators (BGs), which allow rapid generation of uncorrelated equilibrium&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27361v1\">arXiv<\/a><\/p>\n<p><strong>Language-Based Digital Twins for Elderly Cognitive Assistance<\/strong><\/p>\n<p><em>Mohammad Mehdi Hosseini, Mohammad H. Mahoor, Hiroko H. Dodge<\/em><\/p>\n<p>Digital twins have emerged as a promising paradigm for personalized healthcare, enabling modeling of individual behavior and health trajectories. In cognitive health, early detection of Mild Cognitive Impairment (MCI) remains challenging, where&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27334v1\">arXiv<\/a><\/p>\n<p><strong>Beyond the Hard Budget: Sparsity Regularizers for More Interpretable Top-k Sparse Autoencoders<\/strong><\/p>\n<p><em>Nathana\u00ebl Jacquier, Maria Vakalopoulou, Mahdi S. Hosseini<\/em><\/p>\n<p>Sparse autoencoders (SAEs) have become a leading tool for interpreting the representations of vision foundation models, decomposing their polysemantic activations into a larger set of sparse, more monosemantic features. The Top-$k$ SAE, a&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27321v1\">arXiv<\/a><\/p>\n<p><strong>When Does Combining Language Models Help? A Co-Failure Ceiling on Routing, Voting, and Mixture-of-Agents Across 67 Frontier Models<\/strong><\/p>\n<p><em>Josef Chen<\/em><\/p>\n<p>Multi-model LLM systems such as routing, voting, cascades, fusion, and mixture-of-agents are used to beat single-model accuracy. We show that their gain is capped by a quantity the field rarely reports. For any policy whose output is one member&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27288v1\">arXiv<\/a><\/p>\n<p><strong>CARVE: Content-Aware Recurrent with Value Efficiency for Chunk-Parallel Linear Attention<\/strong><\/p>\n<p><em>Sayak Dutta<\/em><\/p>\n<p>Recurrent models must forget in order to remember, yet the state of the art decides what to erase without consulting what is stored &#8212; the gate sees only the arriving token, not the memory it is about to modify. This memory-blind gating is one of&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27229v1\">arXiv<\/a><\/p>\n<p><strong>Ask, Don&#8217;t Judge: Binary Questions for Interpretable LLM Evaluation and Self-Improvement<\/strong><\/p>\n<p><em>Sangwoo Cho, Kushal Chawla, Pengshan Cai, Zefang Liu, Chenyang Zhu, Shi-Xiong Zhang, Sambit Sahu<\/em><\/p>\n<p>Evaluating LLM outputs remains a major bottleneck in NLP: human evaluation is expensive and slow, lexical metrics correlate poorly with human judgments on open-ended generation, and holistic LLM judges often produce opaque scores that are hard to&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27226v1\">arXiv<\/a><\/p>\n<p><strong>Vulnerability of Natural Language Classifiers to Evolutionary Generated Adversarial Text<\/strong><\/p>\n<p><em>Manjinder Singh, Alexander E. I. Brownlee, Mohamed Elawady<\/em><\/p>\n<p>Deep learning models have achieved impressive performance across various fields but remain vulnerable to adversarial inputs, particularly in NLP, where such attacks can have significant real-world consequences. Adversarial attacks often involve&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27215v1\">arXiv<\/a><\/p>\n<p><strong>Joint Learning of Experiential Rules and Policies for Large Language Model Agents<\/strong><\/p>\n<p><em>Shicheng Ye, Chao Yu<\/em><\/p>\n<p>For LLM agents in multi-step interactive environments, a key challenge is to make effective use of accumulated interaction experience. Existing work has typically separated two uses of such experience: keeping it outside the model as&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27136v1\">arXiv<\/a><\/p>\n<p><strong>Efficient foundation decoders for fault-tolerant quantum computing<\/strong><\/p>\n<p><em>Ge Yan, Shanchuan Li, Shiyi Xiao, Pengyue Ma, Hanyan Cao, Feng Pan, Yuxuan Du<\/em><\/p>\n<p>Foundation decoders, a class of high-capacity neural decoders, are leading candidates for fault-tolerant quantum computing, with accurate and efficient decoding at large code distances. However, their construction often faces a steep scaling&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27119v1\">arXiv<\/a><\/p>\n<p><strong>On-board Remote-Sensing Foundation Models for Unsupervised Change Detection of Disaster Events<\/strong><\/p>\n<p><em>S. Ram\u00edrez-Gallego<\/em><\/p>\n<p>Remote Sensing Foundation Models (RSFMs) have emerged as a powerful alternative to supervised models for Earth Observation, allowing satellites to autonomously trigger high-resolution captures or adjust tasking parameters upon detecting an anomaly,&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27018v1\">arXiv<\/a><\/p>\n<p><strong>Semantic Early-Stopping for Iterative LLM Agent Loops<\/strong><\/p>\n<p><em>Sahil Shrivastava<\/em><\/p>\n<p>Multi-agent large language model (LLM) loops, for example a Writer that drafts and a Critic that revises, are almost always terminated by a fixed iteration cap (max_iterations). This is a syntactic kill-switch: it is blind to whether the answer is&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27009v1\">arXiv<\/a><\/p>\n<p><strong>Auditing Framing-Sensitive Behavioral Instability in Large Language Models for Mental Health Interactions<\/strong><\/p>\n<p><em>Abla Bedoui, Ashley L. Greene, Mohammed Cherkaoui<\/em><\/p>\n<p>Large language models (LLMs) are increasingly being integrated into mental health support tools and other psychologically sensitive conversational applications. In such settings, behavioral stability and consistency are important for trustworthy&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26982v1\">arXiv<\/a><\/p>\n<p><strong>In-Context Model Predictive Generation: Open-Vocabulary Motion Synthesis from Language Models to Physics<\/strong><\/p>\n<p><em>Xiaomeng Fu, Junfan Lin, Yang Liu, Yaowei Wang, Guanbin Li, Liang Lin, Ziliang Chen<\/em><\/p>\n<p>Synthesizing human motion from textual descriptions is essential for immersive digital applications, yet existing methods face a persistent trade-off between semantic fidelity and physical realism. Large language model (LLM)-based approaches can&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26981v1\">arXiv<\/a><\/p>\n<p><strong>When are likely answers right? On Sequence Probability and Correctness in LLMs<\/strong><\/p>\n<p><em>Johannes Zenn, Jonas Geiping<\/em><\/p>\n<p>Many decoding methods for large language models can be understood as shifting probability mass toward outputs that are more likely under the model, either locally at the token level or globally at the sequence level. Therefore, their success&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27359v1\">arXiv<\/a><\/p>\n<p><strong>A Multi-Fidelity Convolutional Autoencoder-Transfer Learning Framework for Guided-Wave-Based Damage Diagnosis Using Large Simulated and Limited Experimental Datasets<\/strong><\/p>\n<p><em>Santosh Kapuria,  Abhishek<\/em><\/p>\n<p>Guided wave-based structural health monitoring (GWSHM) with onboard transducers offers significant potential for the early diagnosis of damage in engineering structures. However, the practical deployment of deep learning models is often hindered by&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27304v1\">arXiv<\/a><\/p>\n<p><strong>How Good Can Linear Models Be for Time-Series Forecasting?<\/strong><\/p>\n<p><em>Lang Huang, Jinglue Xu, Luke Darlow<\/em><\/p>\n<p>Time-series forecasting research has been moving steadily toward larger architectures, from specialized transformers to general-purpose foundation models, on the assumption that capacity is what unlocks accuracy. We take the opposite position: most&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27282v1\">arXiv<\/a><\/p>\n<p><strong>Explaining Temporal Graph Neural Networks via Feature-induced Information Flow<\/strong><\/p>\n<p><em>Ping Xiong, Thomas Schnake, Klaus-Robert M\u00fcller, Shinichi Nakajima<\/em><\/p>\n<p>Event-based Temporal Graph Neural Networks (ETGNNs) have demonstrated strong performance across a wide range of applications, including social network analysis, epidemic tracing, recommender systems, and political event forecasting. However, their&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27201v1\">arXiv<\/a><\/p>\n<p><strong>Transformer-Based Classification of Bacterial Raman Spectra with LOOCV<\/strong><\/p>\n<p><em>Jamile Mohammad Jafari, Thomas Bocklitz<\/em><\/p>\n<p>Transformer-based models have recently attracted increasing attention for Raman spectral classification. In this study, a transformer-based approach was systematically evaluated using a nested leave-one-replicate-out cross-validation framework and&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27096v1\">arXiv<\/a><\/p>\n<p><strong>Finding Stationary Points by Comparisons<\/strong><\/p>\n<p><em>Helin Wang, Chenyi Zhang, Xiwen Tao, Yexin Zhang, Tongyang Li<\/em><\/p>\n<p>We study the problem of finding stationary points of non-convex functions when access to the objective is provided only through a comparison oracle that, given two points, outputs which has the larger function value. For a twice differentiable&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27082v1\">arXiv<\/a><\/p>\n<p><strong>Mapping Political-Elite Networks in Europe with a Multilingual Joint Entity-Relation Extraction Pipeline<\/strong><\/p>\n<p><em>Kirill Solovev, Jana Lasser<\/em><\/p>\n<p>Whether political elites organise into rent-seeking coalitions that capture public resources or civic networks that sustain governance is a central question in comparative politics. Yet observing these complex, informal, and adversarial ties at&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27347v1\">arXiv<\/a><\/p>\n<p><strong>LLM-Based Examination of Eligibility Criteria from Securities Prospectuses at the German Central Bank<\/strong><\/p>\n<p><em>Serhii Hamotskyi, Akash Kumar Gautam, Christian H\u00e4nig<\/em><\/p>\n<p>Verifying the eligibility of securities as collateral is a key responsibility of the German Central Bank. However, manually verifying these assets against legal and financial criteria within lengthy, semi-structured, and often bilingual&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27316v1\">arXiv<\/a><\/p>\n<p><strong>LMs as Task-Specific Knowledge Bases: An Interpretability Analysis<\/strong><\/p>\n<p><em>Amit Elhelo, Amir Globerson, Mor Geva<\/em><\/p>\n<p>Language models (LMs) capture large amounts of factual knowledge applicable to a wide range of tasks, motivating the view of their parameters as a knowledge base. An important property of knowledge bases is that different queries for the same fact&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27237v1\">arXiv<\/a><\/p>\n<p><strong>Syntactic Belief Update as the Driver of Garden Path Processing Difficulty<\/strong><\/p>\n<p><em>Alan Zhou, Milo\u0161 Stanojevi\u0107, John T. Hale<\/em><\/p>\n<p>Garden path sentences present a processing difficulty for humans &#8212; the sentence prefix leads the listener towards one interpretation, until the listener hears a critical word that shows that the initial interpretation was wrong. Lexical surprisal,&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27206v1\">arXiv<\/a><\/p>\n<p><strong>Heterogeneous Neural Predictivity from Language Models During Naturalistic Comprehension<\/strong><\/p>\n<p><em>Xiao Jia<\/em><\/p>\n<p>Language-model representations provide structured, high-dimensional annotations of naturalistic language stimuli and can serve as informative neural predictors during comprehension. We analyzed locked derived data from Brain Treebank, MEG-MASC, and&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26880v1\">arXiv<\/a><\/p>\n<p><strong>Cascaded Multi-Granularity Pruning for On-Device LLM Inference in Industrial IoT<\/strong><\/p>\n<p><em>Jinghan Wang, Yanjun Chen, Wei Zhang, Xiaotong Huang, Tianchen Liu, Gaoliang Peng<\/em><\/p>\n<p>Deploying large language models (LLMs) on Industrial Internet of Things (IIoT) edge devices demands extreme compression, yet existing structured pruning methods collapse at high compression ratios due to one-shot importance estimation, and their&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26861v1\">arXiv<\/a><\/p>\n<p><strong>SubdivAR: Autoregressive Next-Scale Prediction for Neural Mesh Subdivision<\/strong><\/p>\n<p><em>Huipeng Guo, Zikai Song, Hang Long, Jielei Zhang, Wenbing Li, Junkai Lin, Tianhao Zhao, Jinshen Zhan<\/em><\/p>\n<p>Mesh subdivision is a fundamental operation for converting coarse, editable meshes into high-resolution surfaces, with broad applications in digital asset creation. Classical rule-based schemes rely on fixed local refinement rules and often produce&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.27088v1\">arXiv<\/a><\/p>\n<p><strong>Modeling Local, Global, and Cross-Modal Context in Multimodal 3D MRI<\/strong><\/p>\n<p><em>Minh Duc Do, Tillmann Rheude, Noel Kronenberg, Roland Eils, Benjamin Wild<\/em><\/p>\n<p>Brain MRI poses a fundamental challenge for machine learning: models must learn from high-dimensional 3D data spanning multiple co-registered modalities, despite the limited sample sizes typical of neuroimaging studies relative to the diversity in&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26894v1\">arXiv<\/a><\/p>\n<p><strong>$\u03bb$-PSD: Scalable Approximate SNR-Optimised Polynomial Stein Discrepancies<\/strong><\/p>\n<p><em>Minh-Long Nguyen, Thanh-Long Vu, Christopher Drovandi, Leah F. South, Trung-Tin Nguyen<\/em><\/p>\n<p>Polynomial Stein discrepancies (PSD) provide a scalable alternative to kernel Stein methods for measuring sample quality and goodness-of-fit testing, but their statistical properties remain poorly understood. We show that increasing polynomial&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.26621v1\">arXiv<\/a><\/p>\n<p><strong>Gaussian Mean Field Variational Inference can Overestimate Predictive Variance<\/strong><\/p>\n<p><em>James Odgers, Ben Riegler, Siddharth Swaroop, Vincent Fortuin<\/em><\/p>\n<p>Mean Field Variational Inference (MFVI) is widely understood to underestimate posterior variance. By analysing conjugate Bayesian Linear Regression (BLR), we show that this characterization is incomplete: while MFVI underestimates the variance in&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25745v1\">arXiv<\/a><\/p>\n<p><strong>A functional central limit theorem for kernel gradient flow and infinitesimal gradient boosting<\/strong><\/p>\n<p><em>Cl\u00e9ment Dombry, Jean-Jil Duchamps<\/em><\/p>\n<p>Building on the large-sample analysis of infinitesimal gradient boosting (Dombry and Duchamps, 2024b), we study the fluctuations of the process around its deterministic limit and establish a functional central limit theorem: the rescaled deviations&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25494v1\">arXiv<\/a><\/p>\n<p><strong>Learning Interpretable Text Signals for Structured Responses<\/strong><\/p>\n<p><em>Cixiao Jiang, Ben Powell, Niall MacKay<\/em><\/p>\n<p>Textual data are often collected alongside structured response variables, but prediction and interpretation are commonly treated as separate tasks. This paper studies rating prediction as an initial case of interpretable text-response modelling,&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.25268v1\">arXiv<\/a><\/p>\n<p><strong>Distributed Quality-Diversity Search for Toxicity in Large Language Models<\/strong><\/p>\n<p><em>Onkar Shelar, Travis Desell<\/em><\/p>\n<p>Large Language Models remain vulnerable to adversarial prompts that elicit harmful responses, and scaling red-teaming to cover a broad range of failure modes is constrained by the cost of text generation and evaluation. We present&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.24166v1\">arXiv<\/a><\/p>\n<p><strong>It&#8217;s Much Easier for Neural Networks to learn Game of Life Dynamics with the Right Activation Function: Polynomial Kolmogorov-Arnold Networks<\/strong><\/p>\n<p><em>Tashin Ahmed, Q. Tyrell Davis<\/em><\/p>\n<p>Previous work has found a gap between the scale of neural networks that reliably learn Conway&#8217;s Game of Life, and minimal networks capable of representing the classic cellular automaton with hard-coded parameter values. Viewing neural network&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.23587v1\">arXiv<\/a><\/p>\n<p><strong>Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptation<\/strong><\/p>\n<p><em>Samuel Yen-Chi Chen, Yifeng Peng, Jiun-Cheng Jiang, Chun-Hua Lin, Kuo-Chung Peng, Junghoon Justin Pa<\/em><\/p>\n<p>Recent advances in quantum computing and machine learning have motivated the development of quantum models for sequential data processing. In this paper, we propose a Recursive Quantum Long Short-Term Memory model, or Recursive QLSTM, which extends&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.24932v1\">arXiv<\/a><\/p>\n<p><strong>Trace Only What You Need: Structure-Aware On-Demand Hypergraph Memory for Long-Document Question Answering<\/strong><\/p>\n<p><em>Xiangjun Zai, Xingyu Tan, Chen Chen, Xiaoyang Wang, Wenjie Zhang<\/em><\/p>\n<p>Long-document question answering (QA) requires large language models (LLMs) to reason over evidence scattered across lengthy documents, where answers often depend on event order, section-level context, and cross-part evidence connections. Although&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2606.10921v1\">arXiv<\/a><\/p>\n<p><strong>IGLU: The Integrated Gaussian Linear Unit Activation Function<\/strong><\/p>\n<p><em>Mingi Kang, Zai Yang, Jeova Farias Sales Rocha Neto<\/em><\/p>\n<p>Activation functions are fundamental to deep neural networks, governing gradient flow, optimization stability, and representational capacity. Within historic deep architectures, while ReLU has been the dominant choice for the activation function,&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2603.06861v2\">arXiv<\/a><\/p>\n<p><strong>Vibro-Sense: Robust Vibration-based Impulse Response Localization and Trajectory Tracking for Robotic Hands<\/strong><\/p>\n<p><em>Wadhah Zai El Amri, Nicol\u00e1s Navarro-Guerrero<\/em><\/p>\n<p>Rich contact perception is crucial for robotic manipulation, yet traditional tactile skins remain expensive and complex to integrate. This paper presents a scalable alternative: high-accuracy whole-body touch localization via vibro-acoustic&#8230;<\/p>\n<p><a href=\"https:\/\/arxiv.org\/abs\/2601.20555v1\">arXiv<\/a><\/p>\n<p><strong>Natural Language Autoencoders: Turning Claude\u2019s thoughts into text<\/strong><\/p>\n<p>**<\/p>\n<p><a href=\"https:\/\/www.anthropic.com\/research\/research\/natural-language-autoencoders\">arXiv<\/a><\/p>\n<p>&#8212;<\/p>\n<h2>Looking Ahead<\/h2>\n<p>The foundation model landscape continues to evolve rapidly. Next week, we expect to see more work on efficient training, longer context windows, and multilingual capabilities.<\/p>\n<p><em>This digest is part of the Frontier AI Research Brief series, covering the most significant AI research each week.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"<p>A focused look at this week&#8217;s most significant advances in llms &#038; foundation models \u2014 83 papers surveyed from arXiv and leading AI labs. &#8212; This week in foundation models, researchers pushed further into understanding how these systems learn, what they represent internally, and how far we can scale them. The papers span training dynamics, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":112,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2,16],"tags":[],"class_list":["post-113","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-topic-01","category-weekly-digest"],"_links":{"self":[{"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/posts\/113","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/comments?post=113"}],"version-history":[{"count":0,"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/posts\/113\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/media\/112"}],"wp:attachment":[{"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/media?parent=113"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/categories?post=113"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/monizesairesearch.com\/index.php\/wp-json\/wp\/v2\/tags?post=113"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}