The Inference Report

June 4, 2026

The AI market is consolidating into tiers by capital and scale while regulatory pressure applies selectively to incumbents already winning. Google faces orders to disclose sources in AI search results after claiming users don't want them, yet simultaneously raised $85 billion to fund spending that will dwarf any competitor's runway. Anthropic pulled in $50 billion in May alone, representing 54 percent of global venture funding that month. The message is unmistakable: scale and capital are tilting sharply upward, and regulatory friction applies only to those already dominant.

Product competition below the headline layer reveals a different pattern. Gemma 4 12B runs on any laptop with 16GB of RAM, signaling that smaller efficient models are becoming table stakes. Nvidia's RTX Spark chips are designed to move AI workloads from cloud to edge, potentially fragmenting the market into mainstream laptops and premium workstations. Google bundles AI into existing surfaces, Amazon generates product images at search time, WhatsApp charges businesses per token for AI agents. These are not innovations but plays to lock in usage and extract margin from infrastructure everyone else is already building. Lovable signed a multiyear expansion with Google Cloud worth a 5x increase in footprint and expanded access to Anthropic's Claude, a reminder that distribution and API access matter more than the model itself.

Regulatory capture is happening in plain sight. UK publishers can now opt out of Google's generative AI search, a requirement rolling out globally but only after Google already trained on their content. OpenAI added session visibility controls to ChatGPT after the governance problem surfaced. Meanwhile, startups handling 17,000 calls per day in Africa and the Middle East, builders using Claude for DIY infrastructure, and firms like Coralogix raising capital to monitor AI agents in production are moving fast into underserved markets. They operate on top of APIs and infrastructure controlled by companies that just raised enough capital to outspend any competitor for the next decade.

Across labs and research, competition has shifted from benchmark scores to operational deployment. OpenAI doubled down on agent-driven enterprise workflow automation, Nvidia positioned itself as the platform for robotics and autonomous systems, and IBM pushed hands-on AI experience to 20,000 universities to build a developer pipeline. Materials science research shows the same pattern: machine learning is no longer treated as a surrogate for expensive calculations but embedded as a component in hybrid workflows where validation, constraint-handling, and mechanistic transparency are prerequisites. In developer tooling, token compression via Headroom achieves 60-95% reduction while preserving answer quality, signaling teams have moved past throwing everything at models into surgical data selection. Agent frameworks fractured into specialized tools rather than monolithic systems, and inference optimization became hardware-specific rather than general-purpose. The field stopped waiting for hardware to catch up and started building software that works within real constraints.

Grant Calloway

AI LabsAll labs
From the WireAll feeds
Research Papers — FocusedAll papers
Graph representations of dislocation networks cond-mat.mtrl-sci

The mechanical response of a crystal is governed by the evolving network of dislocations it contains, yet quantitatively linking the `state of that network' to its yield stress remains challenging. Here we represent the dislocation networks obtained from discrete dislocation dynamic simulation as graphs, using five distinct graph representations, characterize each network through a compact set of topological properties, and predict the yield stress from these graph properties and the applied strain rate using a standard random forest model evaluated with strain rate stratified cross-validation. The model predicts the yield stress with $R^2\approx0.86-0.90$ across all box sizes and $R^2\approx0.91-0.94$ for larger box sizes, and this accuracy is consistent across all five representations, indicating that the topology-stress relationship is a robust feature of the graph properties rather than an artefact of any single graph representation. We propose graph topology as a compact and robust route for connecting the microstructural state of a dislocation network to its mechanical response in addition to established variables.

Evolutionary Design of Interpretable Spatial Descriptors for Structure-Property Relationship Discovery cond-mat.mtrl-sci

Structure property prediction is a classical task in machine learning, ranging from molecular activity and materials properties to local functional responses measured in microscopy. For image-based regression, two choices define the information available to the predictor: the size of the image neighborhood and the spatial resolution retained within it. A small neighborhood can omit relevant surrounding structure, whereas a large, finely sampled neighborhood can introduce redundant or irrelevant information. Here, we develop a framework for constructing spatial descriptors for prediction of local spectra and hysteresis loops. We benchmark regression models, use SHAP maps to examine their spatial attribution, and explore the effect of the patch size and compression to establish the relationship between predictive accuracy and descriptor dimensionality. We then use a genetic algorithm to optimize spatial partitions and the assignment of mean, minimum, and maximum pooling operations. Each retained region contributes an explicit measurement of the image, allowing the search to balance prediction error against the number of descriptor values. Cartesian and polar constructions provide complementary ways to organize this information. The resulting descriptors make it possible to examine where spatial detail is needed, where regional summaries are sufficient, and how these choices depend on the predictor and the measured response. The same approach can be used for molecules and solids once the genetic algorithm rules for these are established.

Thermally Conditioned Time-Series Forecasting of Grain Growth in Polycrystalline Materials cond-mat.mtrl-sci

Grain growth during heat treatment strongly affects the microstructure of polycrystalline materials and, consequently, their mechanical properties. Although numerical methods such as front-tracking or front-capturing simulations can accurately describe grain growth, their high computational cost limits their use for long or non-isothermal thermal cycles. In previous work, grain growth was successfully predicted under isothermal conditions by treating grain size distributions as time series and forecasting their evolution using recurrent neural networks, allowing complete grain growth trajectories to be generated in seconds rather than through costly PDE-based simulations. In the present work, this forecasting framework is reformulated to handle non-isothermal conditions by explicitly incorporating thermal information into the model architecture. Grain size distributions are encoded using a convolutional neural network, thermal descriptors are embedded through a dedicated multilayer perceptron, and temporal evolution is predicted using a recurrent network. Instantaneous temperature and thermal rate are provided at each time step, allowing the model to adapt its predictions to changing thermal conditions. The framework is trained and evaluated on datasets generated from validated front-tracking simulations across a wide range of non-isothermal thermal paths. The results show that the thermally conditioned model accurately reproduces grain growth dynamics under complex thermal histories, achieving, in k-fold cross-validation over all simulations, mean relative errors of 2.99% (one-hour cycles) and 4.51% (four-hour cycles) with coefficients of determination exceeding 0.99, and mean relative errors between 1.91% and 14.66% on ten simulations following four unseen thermal histories of increasing complexity.

Shock Loading Accesses Reaction Pathways beyond Accelerated Thermolysis cond-mat.mtrl-sci

Thermolysis and shock loading can produce similar major stable products in energetic materials, despite different chemical evolution and reaction pathways. Here, we develop EMFF-MACE, a reactive machine-learning potential for C/H/N/O energetic materials, enabling thermolysis simulations of 20 materials and shock simulations of 10 on a common potential energy surface. Comparisons at matched normalized reaction progress reveal divergent chemical states and local structural environments. Mean reaction-state similarity decreases from 94.0% at 20% progress to 25.9% at trajectory endpoints, while 47.1-92.6% of shock local environments lie outside corresponding material-specific thermolysis reference domains. Structural and reaction-network analyses reveal enhanced intermolecular reorganization and additional association and rearrangement branches under shock loading, despite partially shared early decomposition chemistry. These findings show that loading history influences the structural states and subsequent reaction pathways accessed during decomposition, rather than merely the rate of thermolysis.

Autonomous Quantum Measurement with Agentic AI cond-mat.mtrl-sci

Quantum materials exhibit diverse electronic and functional phenomena, but their characterization requires extensive experimental expertise, iterative decision-making and accumulated laboratory knowledge that is difficult to document and transfer. Here we introduce Quantum Agent (QUANTA), an agentic artificial intelligence (AI) framework for autonomous quantum-materials characterization. Using a widely adopted Physical Property Measurement System (PPMS) as an experimental platform, QUANTA combines retrieval augmentation using scientific literature, experimental protocols and prior measurements with specialized agents for experimental planning, troubleshooting, and data interpretation. A separate deterministic control layer validates instrument actions. Guided by incoming data, QUANTA evaluates measurement quality, revises experimental plans and selects subsequent measurements. We demonstrate these capabilities through transport measurements of the topological Weyl semimetal TaP, as well as investigations of nonlinear responses in magnetic material Co2MnGa. These results establish QUANTA as a generalizable framework for evidence-driven, safeguarded and closed-loop quantum-materials characterization.

Physical structure as an organizing principle for universal Hamiltonian learning cond-mat.mtrl-sci

Density functional theory (DFT) gives the electronic structure of materials, but its cost limits large-supercell calculations and materials screening. Machine-learned Hamiltonians bypass the self-consistent cycle but are usually system-specific; universal ones could cover new compositions and disordered solids. Such models must generalize across chemistry and keep downstream properties physical, while staying inexpensive for large cells. Here we introduce UniTB, a universal E(3) equivariant Hamiltonian representation framework that integrates physical priors rooted in density-functional tight-binding theory with deep learning. UniTB's network, which corrects a prior Hamiltonian, generalizes across chemistry through a mixture of experts routed by that prior and a charge-equilibration head as in self-consistent-charge tight binding. A projection bounds band shifts from the prior, suppressing spurious states and keeping downstream properties physical. We provide the fastest SO(2) tensor-product GPU kernels for the network. The variant UniTB-Flash assembles its prior from two-center tables at $O(N)$ cost for $N$ atoms, against $O(N\log N)$ on a grid. Trained on 29,242 crystals, UniTB reaches a 0.48 meV matrix-element error on nonmagnetic test crystals spanning 68 elements. Without amorphous training data, both models agree with DFT optics and conductivity of amorphous Ge-Sb-Te. UniTB-Flash ranks candidates with no significant difference from UniTB, whose property values are more accurate; together they screen 16,195 crystals for five application domains of industrial relevance.

BenchmarksFull tables
Artificial AnalysisIntelligence Index

Composite score across coding, math, and reasoning

#ModelScoretok/s$/1M
1Claude Opus 4.861.453$10.94
2GPT-5.560.267$11.25
3Claude Opus 4.757.347$10.94
4Gemini 3.1 Pro Preview57.2116$4.50
5GPT-5.456.878$5.63
SWE-rebench

Agentic coding on real-world software engineering tasks

#ModelScore
1gpt-5.5-2026-04-23-xhigh62.7%
2Codex60.4%
3Claude Code59.6%
4gpt-5.5-2026-04-23-medium58.9%
5Claude Opus 4.8-xhigh56.4%