The core problem is known in machine learning as out-of-distribution, or OOD, data. A diagnostic network is, at heart, a pattern matcher that learns statistical regularities from a fixed training set. If a model is trained on vibration recordings collected at one motor speed, with one sensor placement, on one fleet of machines, it implicitly assumes those regularities will hold forever. In industrial reality they never do. Loads change, speeds change, sensors age and are replaced, entire machine models are swapped in, and genuinely new fault modes appear that no engineer anticipated when the labels were written. Each of these changes shifts the input distribution, and the survey’s central claim is that this shift splits into two distinct technical demands that the field has too often blurred together.

The first demand is generalization: the model must keep classifying known fault categories accurately even when conditions differ from training. The second demand is detection: the model must recognize when an input belongs to no known category at all and refuse to force it into one of its trained labels. These goals pull in opposite directions. A model tuned to be maximally confident on known faults will often assign absurdly high certainty to unfamiliar inputs, because softmax-based classifiers were never designed to say “I don’t know.” Conversely, a detector tuned to be suspicious of everything novel may start rejecting legitimate fault signals that merely look unusual. The survey treats this tension as the defining operational boundary of the field.

To build the review on solid ground, the authors ran a reproducible literature search across IEEE Xplore, the Web of Science Core Collection, and Scopus, covering publications from January 1, 2020, to July 16, 2026. The search returned 280 database records, which the team reduced to 181 after removing duplicates and then distilled to 161 primary studies specifically concerned with out-of-distribution issues in mechanical fault diagnosis. Each included study was coded according to its deployment role and the type of distribution shift it addressed. That systematic coding, the authors argue, is what allows the field’s scattered results to be compared on equal terms rather than celebrated anecdotally.

A key conceptual contribution of the paper is a task-relative operational definition of what “out-of-distribution” actually means in this domain. Rather than treating OOD as a vague property of data, the survey anchors it in three elements: the effective training support, meaning the data the model actually learned from; the training label space, meaning the fault categories the model was taught; and a declared deployment envelope, meaning the range of conditions the system is promised to handle in service. This framing lets the authors cleanly separate condition-related shifts, which they call C-shifts, from fault-semantic shifts, or F-shifts, and from combined C+F settings where both occur at once. A change in rotational speed is a C-shift; the sudden appearance of a compound gear-mesh defect never present in the training labels is an F-shift; a new machine running at a new speed with a new fault is the combined case.

This taxonomy matters because the two shift types demand different machinery. Generalization-oriented methods, such as domain adaptation and domain generalization, aim to learn representations that are invariant to condition changes, so that a fault signature extracted from a slow-running pump still matches the features the classifier learned from fast-running ones. Detection-oriented methods, drawing on open-set recognition and OOD detection research, instead focus on measuring how far an input lies from the training support, using tools like distance metrics in feature space, energy scores, density estimates, or reconstruction errors from generative models. The survey organizes representative techniques by their deployment role and underlying mechanism, comparing their assumptions, data requirements, output types, strengths, and limitations in a single framework.

The comparison exposes uncomfortable gaps between what papers report and what deployment requires. Many studies evaluate generalization on benchmark datasets where the shift is mild and the label space is closed, which flatters accuracy numbers while saying little about behavior when a truly unknown fault arrives. Others demonstrate detection on synthetic anomalies that barely resemble real mechanical novelty. The survey also notes that the literature frequently conflates general anomaly detection, which flags any statistical outlier, with unknown-fault rejection, which must specifically decide whether a signal belongs outside the declared fault taxonomy. A cooling-fan hum that is statistically odd but mechanically harmless should not trigger the same alarm as an incipient bearing spall, yet generic detectors cannot make that distinction without domain-aware design.

Perhaps the survey’s most consequential argument is architectural in the broadest sense: reliable diagnosis is not a single model property but a system property. The authors contend that any trustworthy deployment must evaluate three components separately and then integrate them coherently. First, known-class generalization must be measured under realistic condition shifts within the declared envelope. Second, OOD detection must be calibrated, meaning that when the system reports uncertainty or novelty, those reports should correspond to actual error rates rather than arbitrary scores. Third, there must be an explicit escalation or human-referral pathway, so that detected unknowns are routed to engineers rather than silently absorbed into the nearest familiar class. A pipeline that excels at the first two but lacks the third still fails the operator, because a flagged anomaly with no defined next step is functionally indistinguishable from an unflagged one.

The scope of the review is deliberately bounded, and the authors are transparent about the exclusions. They do not attempt an exhaustive treatment of closed-set domain adaptation, of domain generalization studies lacking unseen mechanical-domain evaluation, of general anomaly detection unrelated to unknown-fault rejection, of non-mechanical industrial process monitoring, or of general-purpose computer-vision OOD methods, except where such work supplies necessary conceptual foundations. This restraint keeps the 161 included studies focused on the mechanical diagnosis setting, where signals are physical, faults evolve over time, and the cost of a missed or fabricated diagnosis is measured in downtime, damage, and sometimes safety.

For an industry racing to embed AI in turbines, gearboxes, and production lines, the message is sobering but constructive. The survey does not claim that deep-learning fault diagnosis is unreliable; it claims that reliability has been measured with the wrong yardstick. Accuracy on a held-out test set drawn from the same distribution says nothing about the day a new sensor type, a new operating regime, or a never-before-seen failure mode arrives. By giving the field a shared vocabulary of C-shifts, F-shifts, training support, and deployment envelopes, and by insisting that generalization, calibrated detection, and human escalation be judged as separate, testable commitments, the Xi’an Jiaotong team has effectively written the acceptance criteria that future diagnostic systems will have to meet before they can honestly be called intelligent. The machines, it turns out, are only as smart as their honesty about what they do not know.

Subject of Research: Out-of-distribution generalization and unknown-fault detection in deep-learning-based intelligent fault diagnosis of mechanical systems

Article Title: Out-of-distribution challenges in intelligent fault diagnosis: a survey of generalization and detection

Article References: Lin, F., Zhang, L., Guo, C., Zhao, Z., Zhang, X., & Chen, X. (2026). Out-of-distribution challenges in intelligent fault diagnosis: a survey of generalization and detection. Artificial Intelligence Review. https://doi.org/10.1007/s10462-026-11722-3

Image Credits: AI Generated

DOI: 10.1007/s10462-026-11722-3

Keywords: out-of-distribution detection, intelligent fault diagnosis, deep learning, distribution shift, domain generalization, open-set recognition, mechanical systems, predictive maintenance, machine learning, model calibration, domain adaptation, survey

The central idea can be stated without symbols. Any AI system acts through an observational regime: a channel that maps the world’s possible states onto what the system can actually perceive. A thermometer, for example, maps bodily states onto a single temperature reading. It can settle whether a patient has a fever, but it can never determine which infection caused that fever, because two patients with entirely different infections can register the same temperature. No physician, however brilliant, can extract that distinction from the instrument, because the instrument never preserved it. Moore formalises this intuition with an elementary condition drawn from the mathematics of quotient sets: a yes-or-no question about the world, cast as a predicate on states, is decidable by a system only when the question gives the same answer for any two states the observation map cannot distinguish. When this factorisation condition fails, the question is well-posed in the world but malformed inside the machine.

From this definition follows a proposition that is mathematically trivial yet strategically devastating. If a predicate is not admissible with respect to the observation map, then no decision rule operating on observations alone can agree with it, and no optimisation criterion defined over such rules can recover it. A second proposition extends the verdict to post-processing: calibration, reranking, reward shaping, decoding, and benchmark aggregation may improve performance when the required distinction survives in the representation, but none can restore a distinction the observation map has already erased. In the idiom of Edsger Dijkstra, admissibility functions as the weakest precondition for asking a question through an observation. If the question is not invariant under the identifications the observation performs, no later command operating on the same observations can make it so. The failure lies upstream of inference, and nothing downstream of the observation channel can repair it.

To show that this is more than an abstract truism, the paper constructs a finite example that can be checked by hand. Four regions are arranged in a ring, each overlapping only its two neighbours, with local assignments on each region and recorded discrepancies on each overlap. The question is whether the local assignments assemble into a single globally consistent object. In the worked instance, every overlap reports a mismatch of exactly one unit. The profile passes every local coherence check available to the structure, because with no triple overlaps there is no way for the residue to contradict itself. Yet summing the four mismatch equations yields zero on one side and four on the other, an outright contradiction proving that no local correction can cancel the discrepancy. The gap between local coherence and global coherence is captured by a computable residue, which Moore names warrant debt: not a measure of how much more search is needed, but a certificate that no correct global assembly exists under the current data.

The same triple structure, a state space, an observation map, and a predicate that fails to descend, is then written out explicitly for two of the most consequential failure modes in contemporary AI. In reward hacking, the state space consists of an agent’s environment trajectories, the observation map is the scalar reward trace, and the intended predicate is genuine task success without deception. When two trajectories carry identical reward profiles while one accomplishes the intended task and the other violates it, the reward regime is inadmissible, and the paper’s fixed-regime limit applies: no optimiser whose objective is a function of the reward alone can recover the designer’s intent. The ordinary description says the agent gamed the reward. The admissibility account gives a structurally prior diagnosis: optimisation exposed a collapse that was already present, rather than causing it. The diagnosis holds whether the reward function is hand-designed or learned from human preference comparisons.

Benchmark and proxy failure receive the same treatment. Here the observation map records benchmark scores and evaluation transcripts, and the intended predicate is deployment adequacy: competence, safety, and reliability on the situations a system will actually face. When two interactions look equivalent under the benchmark while one is deployment-adequate and the other is not, the benchmark induces an observational quotient that deletes exactly the distinctions that matter. Brittleness under distribution shift, on this reading, is the expected consequence of training against a regime that was never shown to be admissible for the predicate it was meant to track. The framework also yields a sharpened reading of Goodhart’s law. When a measure becomes a target, optimisation drives the system toward the extreme regions of the observation space, where the equivalence classes are most likely to contain states that differ sharply in the intended property. Goodhart’s law, in this account, is simply what admissibility failure looks like once a proxy is made operational and optimisation is allowed to run.

What distinguishes the paper from pure critique is its architectural proposal. Moore separates productive systems, whose repertoire is search, prediction, generation, and optimisation within a fixed regime, from closure authority, which checks whether the regime itself preserves the distinctions a judgement requires. The analogy is the proof assistant: tactics may propose derivations heuristically, but a small kernel alone admits them, and the kernel does not search, it certifies. The paper demonstrates the discipline with an executable prototype for a cyclic diagnostic system, in which a productive layer proposes a fault attribution and a closure layer constructs a residue, computes its harmonic period, and emits one of three accountable verdicts: coherence failure, global admissibility, or warrant debt. In the worked instance the warrant-debt magnitude is exactly 25/4, a finite certificate that the local diagnostic residues, though mutually coherent, do not warrant the global claim. A refinement case shows the regime itself being revised, with an added sensor distinction driving the obstruction to zero and flipping the verdict to globally admissible. The certificates are checked by an independent verifier implemented separately from the proposing process, in exact rational arithmetic, with parts of the verdict logic mechanised in the Rocq proof assistant.

Moore is explicit about what the proposal does not solve. The complete detection algorithm applies only to finite, declared regimes, where the observation map and its operators are available as checkable objects. In modern neural networks the effective observation map is implicit, distributed across embeddings, hidden activations, attention patterns, and reward channels, and no general method exists for extracting an auditable surrogate from those weights. The paper specifies what a successful implicit-map algorithm would need: regime exposure, predicate specification from outside the productive component, probing of observational equivalence classes, contrastive witness search, positive certification rather than mere absence of counterexamples, independent verification, and an escalation discipline that never converts a missing certificate into silent permission to proceed. It also sketches how the deterministic theory extends to stochastic observation, where admissibility becomes a sufficiency condition connecting the framework to the classical theory of statistical experiments.

The philosophical stakes are considerable. The paper suggests, cautiously and as motivation rather than established fact, that behaviour appearing random under one observational regime may reflect competence under distinctions that regime fails to preserve, and it supplies a falsifiability criterion: a genuine boundary-revision claim must exhibit a refined observation map and behaviour that becomes stable and repeatable under the new description, while noise remains unstable under refinement. The deeper contrast is architectural rather than carbon-versus-silicon. Contemporary systems can change their representations through training, but representational change produced by optimisation within a fixed objective is not certified repair of inadmissibility; updating within a regime and revising the regime are different obligations. The conclusion lands as a challenge to the field’s dominant metric culture. A confidence score, however carefully calibrated, is still a function of the regime already in force and cannot certify that regime’s adequacy. What consequential AI systems owe us instead, the paper argues, is an admissibility witness: a checkable indication that the regime under which an answer is offered preserves the distinctions on which the answer depends, or an honest signal that it does not.

Subject of Research: Formal admissibility conditions defining structural limits on optimisation in artificial intelligence systems

Article Title: Admissibility defines structural limits on optimisation in artificial intelligence

Article References: Moore, D. (2026). Admissibility defines structural limits on optimisation in artificial intelligence. Discover Artificial Intelligence, 6(1), Article 1267. https://doi.org/10.1007/s44163-026-02252-6

Image Credits: AI Generated

DOI: 10.1007/s44163-026-02252-6

Keywords: admissibility, artificial intelligence, reward hacking, Goodhart's law, benchmark failure, warrant debt, formal verification, observation maps, AI safety, closure architecture, quotient factorisation, distribution shift

The motivation for the work stems from a simple but uncomfortable observation. Although AI-assisted synthesis planning has proliferated across the chemical and pharmaceutical industries in recent years, a detailed understanding of how and why these systems fail has never been achieved. According to the authors, current models still struggle with predicting less frequent yet strategically critical reactions, and they continue to produce hallucinated, incorrect predictions that are fundamentally misaligned with chemists’ expectations. For a discovery chemist weighing whether to trust a model’s suggestion, such failures are not merely inconvenient; they can derail weeks of planning and undermine confidence in computational tools altogether.

The core of the new system rests on two newly developed model components with what the researchers describe as complementary inductive biases. Inductive biases are the built-in assumptions a model makes about the structure of the problem it is learning, and in chemistry these assumptions matter enormously. One component may excel at capturing the local, rule-like transformations that dominate reaction databases, while another is better positioned to generalize to sparse, unusual reaction classes where such rules break down. By pairing architectures whose strengths and blind spots differ in a structured way, the team ensured that the ensemble’s errors would be less correlated than those of any single model.

Crucially, however, simply averaging predictions from different architectures is not enough, because the outputs of retrosynthesis models are discrete chemical transformations rather than continuous scores. The researchers therefore introduced a novel, learning-based ensembling strategy that integrates the diverse components. Rather than treating the ensemble as a post-hoc投票 mechanism, the approach learns how to weigh and combine candidate predictions in a way that reflects chemical validity and likelihood. This design allows RetroChimera to draw on the complementary knowledge embedded in each constituent model without letting the weaknesses of one corrupt the strengths of the other.

The experimental evaluation was deliberately broad, spanning several orders of magnitude in data scale, and the results point to robustness that previous systems lacked. RetroChimera outperformed leading baselines across the benchmark settings tested, and it demonstrated the ability to learn from very small numbers of examples per reaction class. This latter capability addresses one of the most persistent pain points in machine learning for chemistry: the long tail of the reaction literature. Highly unusual transformations, such as those used to forge complex molecular frameworks in natural product synthesis or to install challenging stereochemical motifs, are chronically underrepresented in public databases, yet they are often the exact steps that determine whether an ambitious synthesis route is feasible at all.

The team also subjected the model to tests of generalization outside its training data, a regime in which many deep learning systems collapse into confident nonsense. RetroChimera’s predictions remained reliable under distribution shift, suggesting that the combination of diverse inductive biases and learned ensembling confers a form of robustness that single-architecture models have not matched. The researchers frame this as a demonstration of the viability of deep learning for accurate synthesis prediction in increasingly challenging regimes, where the easy, well-documented reactions that dominate benchmarks are no longer representative of the problems chemists face.

Perhaps the most consequential validation, however, came not from automated benchmarks but from human experts. Using both pairwise and pointwise evaluation setups, the researchers asked organic chemists to compare RetroChimera’s predictions against published reference reactions and against the outputs of other AI models. In these blind assessments, the chemists systematically preferred the suggestions generated by RetroChimera. That preference for model output over the actual published record of real reactions is a striking result, because it indicates the system can propose transformations that experts judge more sensible or more practical than the routes that chemists historically chose and journals published.

To test whether these gains survive contact with industrial reality, the team performed zero-shot transfer and fine-tuning experiments on internal datasets from two major pharmaceutical companies. These proprietary datasets differ from public reaction corpora in both scale and character, reflecting the molecule types, reaction conditions, and strategic priorities of real drug discovery programs. RetroChimera showed robust generalization under this distribution shift, performing well without any additional training in the zero-shot setting and improving further when fine-tuned on internal data. For pharmaceutical companies that have long been skeptical of benchmarks built on public data alone, this industrial validation may prove as important as any academic result.

The collaboration itself reflects the interdisciplinary demands of the problem. The author list spans machine learning researchers specializing in molecular AI, computational chemists embedded in industrial research organizations, and practicing medicinal and synthetic chemists at GSK, Novartis, and other partner organizations. Equal contributions are credited to Krzysztof Maziarz, Guoqing Liu, and Felix Pultar of Microsoft Research AI for Science, with corresponding authorship shared with Marwin H. S. Segler, who has worked on AI-driven synthesis planning for nearly a decade. Representatives from GSK’s discovery sciences group in Stevenage and Wuppertal-based chemist Mario P. Wiesenfeldt round out a team designed to ensure that evaluation criteria mirrored the judgments of working chemists rather than proxy metrics alone.

Looking ahead, the work suggests a broader lesson for applying AI in the natural sciences: progress may depend less on scaling a single architecture than on deliberately designing and combining models with different, complementary biases. As chemical synthesis remains a critical bottleneck in the discovery and manufacture of functional small molecules, tools that align with expert intuition while generalizing beyond the training literature could reshape how new medicines, materials, and agrochemicals are planned. If systems like RetroChimera continue to earn the trust of the chemists who use them, the long-promised collaboration between artificial intelligence and synthetic chemistry may finally be moving from demonstration to daily practice.

Subject of Research: Chemist-aligned AI retrosynthesis planning using ensembles of diverse inductive bias models

Article Title: Chemist-aligned retrosynthesis by ensembling diverse inductive bias models

Article References: Maziarz, K., Liu, G., Pultar, F., Gardner, J., Gensch, T., Helie, J., Misztela, H., Tripp, A., Li, J., Kornev, A., Gaiński, P., Hoefling, H., Fortunato, M., Gupta, R., Baxter, A., Poole, D. L., Elward, J. M., Krzyzanowski, A., Pogány, P., … Segler, M. H. S. (2026). Chemist-aligned retrosynthesis by ensembling diverse inductive bias models. Nature. https://doi.org/10.1038/s41586-026-11160-9

Image Credits: AI Generated

DOI: 10.1038/s41586-026-11160-9

Keywords: retrosynthesis, artificial intelligence, synthesis planning, machine learning, ensembles, inductive bias, chemical synthesis, pharmaceutical discovery, cheminformatics, deep learning, distribution shift, RetroChimera

The survey’s central argument is that weather and climate represent an unusually demanding, and unusually revealing, testbed for artificial intelligence. Unlike image recognition or language modelling, atmospheric science confronts machine-learning systems with petabyte-scale spatiotemporal data spread across a rotating sphere, governed by partial differential equations and constrained by global observational and reanalysis archives. On top of that sits a challenge that most mainstream AI benchmarks simply do not have: climate non-stationarity. The statistical properties of the atmosphere are themselves shifting as the planet warms, which means models trained on the past may be silently invalidated by the very future they are asked to predict. The authors argue that this combination of scale, physics and drift makes meteorology a proving ground whose lessons generalize far beyond forecasting.

To organize an enormous and sometimes chaotic literature, the survey classifies the major AI architectures by their physical inductive biases — the built-in assumptions each design makes about the structure of the world. Convolutional neural networks, the workhorses of early deep-learning weather prediction, assume local spatial structure and translation invariance. Graph neural networks treat the atmosphere as an irregular mesh, naturally handling the geometry of the sphere and unstructured computational grids. Transformers bring global attention mechanisms that can capture long-range teleconnections such as the El Niño–Southern Oscillation and the Madden–Julian oscillation, which link weather patterns across entire hemispheres. Generative models, including generative adversarial networks and diffusion-based approaches, address a different problem entirely: producing realistic ensembles and downscaling coarse global fields to fine local detail.

Two unifying mathematical themes run through this taxonomy. The first is geometric deep learning, the program of designing networks whose internal operations respect the symmetries of the underlying space — in this case, rotation and translation on a sphere rather than on a flat plane. The second is operator learning, exemplified by neural operators such as the Fourier neural operator and its spherical variant, which learn mappings between entire function spaces rather than between individual data points. This distinction matters because weather and climate models are fundamentally functions of functions: they map one continuous field of temperature, pressure and wind onto another. Architectures that respect the spherical geometry of the planet and learn operators rather than fixed-resolution maps are, the authors argue, better positioned to generalize across resolutions and physical regimes.

Beyond architecture, the survey gives systematic treatment to three areas it considers underappreciated. Representation learning and foundation models — large networks pre-trained on vast atmospheric archives and then adapted to many downstream tasks — are examined as the emerging backbone of the field. Uncertainty quantification receives extensive attention, covering techniques from Bayesian approaches to ensemble generation, all aimed at answering the question operational forecasters care most about: not just what will happen, but how confident we should be. And causal discovery is framed as a complement to pure prediction, a way of using machine learning not merely to reproduce correlations in reanalysis data but to probe the physical mechanisms connecting them — a distinction that becomes critical when the climate itself is changing.

The paper’s most provocative contribution, however, is its naming and dissection of what the authors call evaluation pathologies in scientific machine learning. The first is the RMSE smoothness bias. Because root mean square error and mean-squared-error training objectives penalize sharp, spatially displaced features more harshly than blurry, averaged ones, models optimized on these metrics are systematically pushed toward smooth, blurred forecasts. A prediction that gets the shape of a storm exactly right but places it a few dozen kilometers off can score worse than a smeared, featureless field that is wrong everywhere but mildly. The practical consequence is that the metrics used to declare AI models superior to numerical weather prediction may be quietly selecting for aesthetically smooth mediocrity while penalizing the crisp, high-impact detail that matters most to forecasters and the public.

The second pathology the authors identify is ERA5 training–evaluation circularity. ERA5, the European Centre for Medium-Range Weather Forecasts’ flagship reanalysis, is the de facto training ground for most AI weather models — but it is also the reference against which those models are scored. A model trained to reproduce ERA5 and then evaluated against ERA5 is, in a meaningful sense, being graded on its own homework. The circularity inflates apparent skill, obscures the reanalysis’s own biases, and makes it difficult to know how models would perform against genuinely independent observations. The third pathology, benchmark overfitting, compounds the problem: as the community iterates on a small set of standard test cases, models increasingly specialize to those cases, and leaderboard gains stop translating into real-world forecasting skill.

The survey does not stop at diagnosis. It frames the field’s open problems as scientific machine learning challenges that extend well beyond meteorology. Distribution shift under a non-stationary climate is the paradigm case: any AI system deployed over years must cope with input statistics that drift, potentially violating the stationarity assumptions baked into training. Physical consistency of learned operators — whether a neural network’s predictions obey conservation laws and dynamical constraints even far from its training distribution — remains unsolved. Sample efficiency in data-sparse regimes, such as the ocean interior, polar regions and the developing world’s observation networks, tests whether foundation-model approaches can transfer knowledge to places with few measurements. And the authors argue for intrinsic interpretability: not post-hoc explanations bolted onto a black box, but models whose internal reasoning is transparent enough for scientists to trust and interrogate, a theme connected to the explainable AI research program the work was partly funded to advance.

Why does this matter now? Because the operational stakes are rising fast. Deep-learning weather prediction systems are already being trialed by major forecasting centers, and skill on benchmarks is being cited as evidence they can replace or supplement physics-based simulation. If the benchmarks reward blur and circularity, the field risks institutionalizing models that look excellent on paper while underperforming on the rare, extreme events — hurricanes, heat waves, flash floods — where forecasts save lives. The survey’s argument is that verification against rare extremes, using metrics such as the fractions skill score and the continuous ranked probability score alongside traditional correlation measures, must become central rather than peripheral to how AI forecasters are judged.

The broader lesson, the authors contend, is that weather and climate offer scientific machine learning a uniquely honest mirror. The domain combines massive data, hard physics, distribution drift and unforgiving operational verification — a combination that strips away the comfortable assumptions of mainstream AI benchmarking. The survey, published open access with funding support from the Austrian Science Fund and the European Union’s Horizon Europe RI-SCALE project, is intended as both a map and a challenge: a structured account of where AI methods for the atmosphere stand today, and a warning that the path forward runs through better evaluation, not just bigger models. If the field heeds it, the same rigor that makes forecasting trustworthy in a changing climate could reshape how machine learning is validated across the sciences.

Subject of Research: Artificial intelligence methods, benchmarking, and scientific machine learning challenges for weather and climate prediction

Article Title: Artificial intelligence for weather and climate: a survey of methods, benchmarks, and scientific machine learning challenges

Article References: Holzinger, A., Fiore, S., Degiacomi, T., Antonio, F., & Müller, H. (2026). Artificial intelligence for weather and climate: a survey of methods, benchmarks, and scientific machine learning challenges. Artificial Intelligence Review. https://doi.org/10.1007/s10462-026-11690-8

Image Credits: AI Generated

DOI: 10.1007/s10462-026-11690-8

Keywords: artificial intelligence, weather forecasting, climate modeling, machine learning, neural operators, geometric deep learning, uncertainty quantification, benchmark design, distribution shift, spatiotemporal learning, foundation models, scientific machine learning