Large language models

Model releases, architecture work and prompting research on large language models — from frontier-lab announcements to the arXiv papers behind them.

26,848 stories · RSS feed

arXiv Machine Learning
Oct 3

RPTune: Learned Context Curation for LLM Catalog Search

RPTune is an end‑to‑end framework that improves in‑context catalog search for small merchant businesses by learning to curate product catalogs and fine‑tuning large language models (LLMs) with catalog‑grounded supervision. It uses an encoder‑reorganizer curator to order and prune products based on LLM feedback, and then applies context‑relative rewards during LLM post‑training. Across seven real merchants and 100 complex conversational queries per merchant, RPTune boosts search accuracy by up to 31.4 percentage points from curation alone and an additional 10.3 points on average from post‑training.

By Chuxuan Hu, Hejie Cui, Norman Huang, Shubham Kumar Bharti, Wang-Chiew Tan, Sercan \"O. Ar{\i}k
arXiv Machine Learning
Oct 3

CHORDONOMICON: A Dataset of 666,000 Songs and their Chord Progressions

Chordonomicon is a new dataset of over 666,000 song-level symbolic chord progressions, each annotated with structural parts such as verse, chorus, and bridge, as well as genre and release date. The dataset was compiled by scraping user-generated progressions from multiple sources and shows strong similarity to established prior datasets. The authors also provide a reproducible benchmark suite for next chord prediction, evaluating RNN, GRU, and LSTM models across various context windows and data scales, and find that structural part annotations consistently improve prediction performance.

By Spyridon Kantarelis, Ioannis Liolitsas, Konstantinos Thomas, Vassilis Lyberatos, Edmund Dervakos, Giorgos Stamou
arXiv Machine Learning
Oct 3

Beyond Linear Concepts: Discovering and Aligning Non-Linear Concept Manifolds in Large Language Models

The paper extends mechanistic interpretability of large language models by modeling concepts as low‑dimensional non‑linear manifolds rather than linear subspaces. It introduces a concept‑based alignment (CBA) score to compare these manifolds across layers and models, revealing block structures in intermediate layers, a shift from syntax‑dominated to mixed syntactic‑semantic concepts, and training‑dependent multilingual sharing. The study also shows that alignment patterns differ across model families and training stages, with adjacent stages aligning more closely than distant ones.

By Tido Specht, Elias Benedict Krey, Nils Neukirch, Nils Strodthoff
arXiv Machine Learning
Oct 3

SyntheticHLS: Building Diverse Synthetic High-Level Synthesis Datasets using LLMs

SyntheticHLS is a framework that uses large language models to create large-scale, diverse synthetic high‑level synthesis (HLS) datasets. It employs an iterative, feedback‑guided mutation loop that transforms seed designs into more complex, scalable ones, guided by quantitative metrics of design complexity and scalability. The resulting datasets outperform manually curated or zero‑shot generated ones in training deep learning models for HLS quality‑of‑results, offering broader coverage of design space and better generalization.

By Stefan Abi-Karam, Miaoyan Zhou, Callie Hao
arXiv Machine Learning
Oct 3

Clock Diffusion: Efficient Semi-Autoregressive Continuous Diffusion Language Models

The paper introduces Clock Diffusion, a framework for semi‑autoregressive continuous diffusion language models that incorporates position‑dependent noise schedules, efficient training, and sampling algorithms. It presents two generation modes—block and sliding window—and defines ClockDLMs, a family of Gaussian models that achieve state‑of‑the‑art diffusion likelihoods on OpenWebText and outperform continuous baselines on GSM8K while matching or exceeding discrete diffusion models. The authors also propose Cache Grab, a set of efficient samplers that adapt accelerated inference techniques from discrete diffusion to further improve model quality and efficiency.

By Yair Schiff, Omer Belhasin, Roy Uziel, Matan Rusanovsky, Ran Zilberstein, Marianne Arriola, Gilad Turok, Guanghan Wang, Volodymyr Kuleshov, Michael Elad
arXiv Machine Learning
Oct 3

Persistent Depth Ordering amid Shifting Block-Bypass Responses in Language Model Pretraining

The study investigates how layer‑wise intervention responses in language models change over the course of pretraining, using single‑block identity bypass across multiple checkpoints and model‑domain combinations. It finds that while depth ordering of responses persists, their magnitudes shift, with nearby checkpoints showing stronger rank correspondence than distant ones and large changes occurring at positions that recur across samples and transfer across evaluation domains. Controlled experiments reveal that these longitudinal changes cannot be explained by a single downstream sensitivity and depend on perturbation strength and direction, indicating that layer sensitivity is structured but dynamic.

By Shengye Tao, Yinzhu Cheng, Haihua Xie
arXiv Machine Learning
Oct 3

Higher-Order Positional Encodings for Graph Representation Learning

The paper introduces higher-order positional encodings that enrich graph representations by incorporating topological information from lifted incidence structures, without altering existing graph learning backbones. It theoretically shows that these encodings can mix graph Laplacian frequencies beyond what scalar spectral filters achieve, and demonstrates their effectiveness on Graph Transformers for datasets like ZINC and synthetic benchmarks. The approach bridges graph positional encodings and topological deep learning, enabling standard models to exploit higher-order interactions.

By Caleb Stam, Aagrim Hoysal, Sanjukta Krishnagopal
arXiv Machine Learning
Oct 3

Generative modeling of intrinsically disordered protein regions by reinforcing sparse autoencoder features

The paper introduces IDiom, an autoregressive protein language model trained on a large dataset of intrinsically disordered protein regions (IDRs) from AlphaFold, and demonstrates that it can generate sequences matching natural IDR composition, motifs, and disorder. It further presents RL‑SAE, a reinforcement learning approach that uses sparse autoencoder features to steer generation toward specific functional patterns, achieving high activation of targeted features and improved predicted subcellular localization and transcriptional activity. The combination of IDiom and RL‑SAE allows interpretable, composable IDR design by explicitly controlling function‑associated sequence features.

By Jason X. Liu, Sebastian Ibarraran, Frank Hu, Soojung Yang, Xinyu A. Feng, Abigail Park, Anagha Aneesh, Lacramioara Bintu, Alexander R. Dunn, Grant M. Rotskoff
arXiv Machine Learning
Oct 3

A Large Scale Investigation of Scaling Limits in Chemical Language Models

The paper reports a large-scale, compute-controlled study of Chemical Language Models (CLMs) involving over 30,000 experiments across different molecular representations, tokenizations, model sizes, datasets, and architectures. It finds clear scaling trends in pretraining loss but shows that these improvements do not translate into proportional gains in goal-directed molecular design, with chemical syntax saturating early while semantic properties develop more slowly. The authors release a new suite of models, NovoMolGen, that achieves state-of-the-art results in drug discovery tasks, highlighting a disconnect between representation learning and downstream design and calling for new pretraining paradigms that target chemical semantics.

By Roshan Balaji, Kamran Chitsaz, Quentin Fournier, Nirav Pravinbhai Bhatt, Sarath Chandar
arXiv Machine Learning
Oct 3

Benchmarking System One decision models against trained classifiers and language models for automated decision gates

The paper evaluates System One decision models—typed models that output probabilities for branching decisions—against supervised classifiers and generative language models on automated decision gate tasks. Eight checkpoints from six families, including the hosted model Jev, were benchmarked on workflow, intent, and social‑science items, showing that small trained classifiers match or slightly outperform decision models on intent and workflow when labels are available, while decision models outperform zero‑shot classifiers when labels are absent. The study also explores calibration, risk thresholds, and cost‑efficiency trade‑offs, providing condition‑dependent design guidelines for automated decision gates.

By Amir Rafe, Subasish Das
OpenAI Blog
Oct 2

A model guide for the GPT-6 family

The article explains how startups can select GPT‑6 models and adjust their reasoning effort. It offers guidance on improving prompts and skills, coordinating tools, and preparing production workflows.

Towards Data Science
Oct 2

How to Build a Control Plane for AI Agents

The article titled "How to Build a Control Plane for AI Agents" outlines a nine-step process for granting a large language model (LLM) permission to act. It focuses on the practical steps involved in creating a control plane that manages the actions of AI agents. The post was originally published on Towards Data Science.

By Ari Joury, PhD
arXiv AI
Oct 2

Before Agents Decide: Epistemic Action in LLM-Based Systems

The paper discusses how large language model (LLM) agents can perform epistemic actions—actions that improve the evidence base before making a decision. It identifies three modes of such actions: acquiring missing evidence, transforming available evidence, and probing the system to generate revealing responses. The authors introduce the concept of epistemic scaffolding, referring to interfaces, tools, and environments that enable and audit these actions, arguing that agent design must explicitly address how decision-ready evidence is produced.

By Yizhi Liu, Balaji Padmanabhan, Siva Viswanathan
arXiv AI
Oct 2

HydroJEV: A one-second, training-free screen for cyber-attack and fault attribution in water distribution networks

HydroJEV is a training‑free, one‑second model that classifies SCADA alarms in water distribution networks into cyberattack, physical fault, normal transient, or faulty sensor. In a benchmark on the C‑Town EPANET network, HydroJEV matched a hand‑written rule tree and outperformed a supervised classifier, especially when few labeled events were available, while being 20‑40 times faster than large language models. When combined with a rule tree gate, it reduced the need for human review by about a third without sacrificing accuracy.

By Tianwei Mu, Shengyan Jiang, Mingzhe Yuan, Qing Luo, Min Xiao, Wenhong Wang, Jun Li, Manhong Huang
arXiv AI
Oct 2

A Framework for Egocentric and Exocentric Procedural Understanding via Temporal Segmentation and Semantic Abstraction

The paper introduces a compact framework that transforms continuous multimodal workplace video into a structured Procedural State Memory called a Work Environment Model (WEM). Using event segmentation theory, it detects segment boundaries based on changes in visual context, location, motion, narration, gaze/object interaction, and optional exocentric workspace evidence, then abstracts each segment into an evidence‑linked event card. These event cards incrementally update the WEM, enabling efficient, auditable documentation and retrieval while respecting on‑premise privacy constraints, and the authors evaluate the system on segmentation quality, memory compression, retrieval fidelity, and long‑horizon QA.

By Vivek Chavan, J\"org Kr\"uger