Descriptor Non-Uniqueness in Symbolic Regression: Conditional Bayesian Analysis of SISSO Supports

arXiv:2606.04042 · cond-mat.mtrl-sci · Submitted 2026-06-02 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Condensed Matter. The day in condensed matter: materials, phases and the measurements under them.

Kai: I'm Kai.

Mira: And I'm Mira, here with Lev.

Kai: We're looking at the paper: "Descriptor Non-Uniqueness in Symbolic Regression".

Mira: Here's the gist of the paper. The deterministic-SIS/Bayesian-SO framework introduces an uncertainty-aware extension to Symbolic Regression by keeping the screening stage deterministic while reformulating the sparsifying operator as Bayesian inference over the screened support space This approach yields posterior probabilities and predictive credible intervals, revealing competing descriptor families that deterministic analysis might miss Methodological Framework The framework retains the Sure Independence Screening (SIS) stage as a deterministic step to maintain scalability, while the sparsifying operator (SO) is replaced by Bayesian inference over the SIS-screened support space The standard SISSO pipeline involves recursively applying algebraic and functional operators to generate a symbolic library, followed by deterministic SIS screening and sparse optimization (SO) Specifically, the deterministic SIS stage reduces the combinatorially large feature library to a manageable subset, yielding a reduced design matrix ΦI The Bayesian SO stage then performs inference over this reduced space using a Gaussian linear model for each candidate support γ Support Prior Engineering The Bayesian SO framework requires a prior p(γ) over the candidate supports, and three distinct priors are compared to probe different organizational structures 1.

Kai: A uniform prior assigns equal probability to every admissible support, serving as the generic default choice 2.

Mira: The relevance-diversity prior favors supports containing individually relevant SIS features while discouraging redundant, highly correlated components 3.

Kai: A weak Slater–Pauling prior encourages a two-dimensional descriptor organized around an electron-count backbone and a residual correction These priors are illustrative choices designed to test generic, redundancy-aware, and weakly physics-guided support weighting Results on Descriptor Stability The analysis on the X2Y Z Heusler-alloy magnetic-moment dataset showed that Bayesian model averaging (BMA) modestly lowers the average validation RMSE compared to the deterministic SIS+SO baseline across both descriptor dimensions For d = 2, BMA reduces RMSE from 0.5609 to 0.5314 under the uniform prior, and similar results are observed for the relevance-diversity and Slater–Pauling priors The posterior reveals descriptor nonuniqueness by showing that a single deterministic support may only be one representative of a broader family of statistically competitive expressions Interpretability and Diagnostic Utility The comparison between the priors indicates that the validation improvement is not primarily driven by prior-specific performance gains, as the results under uniform, relevance-diversity, and Slater–Pauling priors are practically indistinguishable The posterior feature stability plots show that features 101, 201, 202, and 203 form the main competing descriptor family in d = 3 The Slater–Pauling prior is best viewed as a diagnostic prior that organizes this family in an electron-count-based way rather than a route to improved accuracy This makes the approach useful as a diagnostic tool for assessing descriptor stability in small-data materials problems The deterministic-SIS/Bayesian-SO construction is a conservative extension of standard SISSO that preserves scalability while adding uncertainty quantification at the descriptor-selection stage It successfully recovers the deterministic SO support in the MAP limit and supplies calibrated predictive intervals, demonstrating that uncertainty is localized within chemically similar symbolic alternatives The framework is valuable because it identifies posterior-stable symbolic descriptors whose chemical plausibility can be assessed a posteriori REFERENCE Bhattacharjee 1 Indo Korea Science and Technology Center, Bangalore (Dated: June 10, 2026) <ref:2606.04042#pg2> Bhattacharjee 2 The Sure Independence Screening and Sparsifying Operator (SISSO) framework is a powerful symbolic-regression method for extracting compact and interpretable descriptors from large nonlinear feature spaces <ref:2606.04042#pg2> However, standard SISSO is deterministic: it returns a single descriptor and point prediction, without quantifying uncertainty in descriptor selection, regression coefficients, or predictions <ref:2606.04042#pg2> Here we introduce a probabilistic extension in which the sure independence screening (SIS) stage is kept deterministic to preserve scalability, while the sparsifying operator (SO) stage is reformulated as Bayesian inference over the SIS-screened support space <ref:2606.04042#pg2> The resulting deterministic-SIS/Bayesian-SO framework yields posterior probabilities for competing descriptor supports, feature-inclusion probabilities, Bayesian-model-averaged predictions, and predictive credible intervals, while recovering the deterministic SO descriptor of standard SISSO in the maximuma-posteriori limit <ref:2606.04042#pg2> Applied to an X2Y Z Heusler-alloy magnetic-moment dataset, the approach gives modest improvements in five-fold cross-validation RMSE and near-nominal empirical coverage of the 95% predictive intervals <ref:2606.04042#pg2> More importantly, the posterior exposes competing, physically related symbolic descriptor families that would appear artificially unique in a deterministic analysis <ref:2606.04042#pg2> These results suggest that deterministic-SIS/Bayesian-SO can be used as an uncertainty-aware diagnostic extension of SISSO: a tool for assessing descriptor confidence, stability, and non-uniqueness in small-data materials regression problems <ref:2606.04042#pg2> Keywords: Symbolic regression, SISSO, Bayesian, Heusler alloys, magnetic moments I.

Title and authors: Kai: We’ve just talked about how they use this framework to find competing symbolic structures, and now let’s look at what the paper actually claims is happening under the hood.

Mira: Basically, they keep that initial screening stage deterministic to keep things manageable, but they switch out the sparse optimization step with a Bayesian inference over all the candidate supports that pass that first screen.

Mira: That's because that's what you do when you have a prior over symbolic supports; you’re using Bayes’ theorem to update that prior into a posterior distribution after the data are observed.

The paper's summary: Kai: We’ve covered what they found, but now let’s talk about what these improvements actually mean for how we use this technique in practice. What are the practical benefits?

Mira: So the main improvement is that we get uncertainty-aware descriptor selection. This means instead of a single answer, you get posterior probabilities for competing descriptor supports and feature inclusion probabilities, and predictive credible intervals.

Lev: That’s the operational side. It allows you to quantify exactly how much confidence you have in any given set of features or a final prediction without relying on just one deterministic result.

Kai: And beyond that, they can detect non-uniqueness in the symbolic expressions themselves, which means if a deterministic method picks one descriptor, it might actually be missing an entire family of competing structures.

Mira: That’s huge for small-data problems because it lets you see that a single deterministic support is just one representative of a broader family of statistically competitive expressions.

Lev: For someone running this on real hardware, knowing that the overhead lands on the posterior covariance and not just a single deterministic result is important for running simulations.

Kai: And they can even tell you if using some prior like relevance diversity or Slater–Pauling makes a difference in accuracy, which tells us something about how we should weight our data.

Mira: That suggests that the improvement comes from the uncertainty quantification itself rather than having a better guide on which supports to look at first.

Lev: The paper notes that they can even use priors like Slater–Pauling as a diagnostic tool for organizing those electron count based families rather than just a way to chase better accuracy.

Kai: So what this means is that we've got a tool to assess descriptor confidence and stability when we only have small amounts of data.

The paper's improvements: Kai: Alright, so to wrap up this discussion on "Descriptor Non-Uniqueness in Symbolic Regression: Conditional Bayesian Analysis of SISSO Supports," we’ve covered everything from the core method to the practical implications for small data problems.

Mira: We’ve seen how this approach uses a Bayesian framework over the SISSO support space to expose hidden families in Heusler alloys.

Lev: The main thing here is that they're giving us calibrated predictive intervals alongside posterior probabilities for competing supports and feature inclusion probabilities.

Kai: That means we get to see uncertainty in the selection of the symbolic descriptor itself, not just the final prediction error.

Mira: Right. So we’re seeing that a single deterministic support is just one representative of a broader family of statistically competitive expressions, which helps you gauge how certain you should be about your chosen descriptor.

Mira: So we're done with this one, but we’ve seen how Bayesian inference over the SISSO support space can expose hidden descriptor families in those Heusler alloys.

Conclusion: Kai: So we’ve been looking at "Descriptor Non-Uniqueness in Symbolic Regression: Conditional Bayesian Analysis of SISSO Supports." Basically, they took the standard SISSO method and added some Bayesian uncertainty quantification to see if there are actually competing symbolic structures for a given material property.

Mira: Right. They keep the initial screening stage deterministic, which keeps things manageable, but they switch out that sparse optimization step with a Bayesian inference over all the candidate supports that pass that first screen.

Lev: So instead of just picking one best descriptor and coefficients deterministically, they’re looking at a whole distribution of possibilities for each potential support and figuring out which ones are actually likely given the data.

Kai: It sounds like they’re trying to figure out if that single best descriptor found by standard SISSO is really unique or if there are other, competing symbolic expressions that perform just as well.

Mira: That’s the core idea. They use a Gaussian linear model for each candidate support, and then they calculate posterior probabilities for those supports, feature inclusion probabilities, and predictive credible intervals.

Lev: The paper shows this framework can recover the standard SISSO descriptor in the maximuma-posteriori limit, which means it still gets that single best answer when you want it.

Kai: But more importantly, they found that this approach reveals competing descriptor families that a purely deterministic analysis would just miss because it only picks one winner.

Mira: They tested this on an X2Y Z Heusler-alloy magnetic-moment dataset and saw modest improvements in the validation error compared to the standard SISSO plus sparse optimization baseline.

Lev: The numbers they show, for instance, they reduce the root mean square error from zero point five six zero nine down to zero point five three one four when using a uniform prior on a two dimensional descriptor.

Kai: But you have to remember that this improvement isn't just because of some weird prior choice. They show that the validation gains are pretty similar regardless of whether they use the uniform, relevance diversity, or Slater–Pauling priors for weighting those candidate supports.

Mira: That’s an interesting finding. It suggests that the improvement comes from the uncertainty quantification itself rather than having a better guide on which supports to look at first.

Lev: The posterior support probability calculation is where things get interesting because it allows you to quantify how much confidence you have in any given descriptor support.

Kai: So what does this mean for us when we’re trying to select a descriptor for some materials problem? It suggests that uncertainty isn't just about the final prediction error; it’s also about which symbolic structure is actually physically plausible.

Mira: That’s right. The posterior feature stability plots show that features like one zero one, two zero one, two zero two, and two zero three are forming the main competing descriptor family in a three dimensional case.

Lev: And they suggest that if you use the Slater–Pauling prior, it acts more like a diagnostic tool for organizing those electron count based families rather than just a way to chase better accuracy.

Kai: So to wrap up this paper, it gives us a tool to assess descriptor confidence and stability when we only have small amounts of data.

Mira: It lets us see that a single deterministic support is just one representative of a broader family of statistically competitive expressions, which helps you gauge how certain you should be about your chosen descriptor.

Lev: In short, it provides calibrated predictive intervals alongside the posterior probabilities for competing supports and feature inclusion probabilities.

Kai: And because it recovers the standard SISSO result in the maximuma-posteriori limit, it’s a conservative extension that keeps the computational efficiency while adding this layer of uncertainty awareness.

Mira: It’s a useful diagnostic tool for assessing descriptor stability in materials regression problems where data is limited.

Lev: I think if you're building real hardware, knowing the overhead lands on the posterior covariance and not just a single deterministic result is important for running simulations.

Kai: Exactly. This paper shows that uncertainty is localized within chemically similar symbolic alternatives, which makes it useful because you can assess chemical plausibility after the fact.

Mira: So we're done with this one, but we’ve seen how Bayesian inference over the SISSO support space can expose hidden descriptor families in those Heusler alloys.

Indo Korea Science and Technology Center, Bangalore

cond-mat.mtrl-sci

Submitted: 2026-06-02

Updated: 2026-11-06

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 81/100

The gist: The deterministic-SIS/Bayesian-SO framework introduces an uncertainty-aware extension to Symbolic Regression by keeping the screening stage deterministic while reformulating the sparsifying operator…

Key concepts

Sure Independence Screening (SIS)
This is a deterministic first stage in Symbolic Regression that ranks features based on their relevance to the target property. It reduces the huge initial library of possible symbolic expressions down to a much smaller, manageable subset of features before any probabilistic analysis begins.
Bayesian Sparsifying Operator (SO)
This replaces the standard deterministic sparse optimization stage with Bayesian inference over the screened feature space. Instead of picking one best descriptor, it calculates posterior probabilities for various candidate descriptors and provides predictive credible intervals based on this uncertainty.
Support Priors
These are different mathematical assumptions used to weight or prioritize potential sets of features (supports) when performing the Bayesian inference. Examples include a uniform prior (equal probability for all), a relevance-diversity prior (favoring relevant features while discouraging redundancy), and a Slater–Pauling prior related to electron counts.
Descriptor Non-Uniqueness
This is the key finding where the framework shows that multiple, chemically related symbolic descriptors can be statistically competitive. This means a single deterministic analysis might only find one descriptor, but the Bayesian approach reveals an entire family of equally plausible expressions.

Terminology

Summary

The deterministic-SIS/Bayesian-SO framework introduces an uncertainty-aware extension to Symbolic Regression by keeping the screening stage deterministic while reformulating the sparsifying operator as Bayesian inference over the screened support space This approach yields posterior probabilities and predictive credible intervals, revealing competing descriptor families that deterministic analysis might miss

Methodological Framework

The framework retains the Sure Independence Screening (SIS) stage as a deterministic step to maintain scalability, while the sparsifying operator (SO) is replaced by Bayesian inference over the SIS-screened support space The standard SISSO pipeline involves recursively applying algebraic and functional operators to generate a symbolic library, followed by deterministic SIS screening and sparse optimization (SO) Specifically, the deterministic SIS stage reduces the combinatorially large feature library to a manageable subset, yielding a reduced design matrix ΦI The Bayesian SO stage then performs inference over this reduced space using a Gaussian linear model for each candidate support γ

Support Prior Engineering

The Bayesian SO framework requires a prior p(γ) over the candidate supports, and three distinct priors are compared to probe different organizational structures 1. A uniform prior assigns equal probability to every admissible support, serving as the generic default choice 2. p. 2 The relevance-diversity prior favors supports containing individually relevant SIS features while discouraging redundant, highly correlated components 3. p. 2 A weak Slater–Pauling prior encourages a two-dimensional descriptor organized around an electron-count backbone and a residual correction These priors are illustrative choices designed to test generic, redundancy-aware, and weakly physics-guided support weighting

Results on Descriptor Stability

The analysis on the X2Y Z Heusler-alloy magnetic-moment dataset showed that Bayesian model averaging (BMA) modestly lowers the average validation RMSE compared to the deterministic SIS+SO baseline across both descriptor dimensions For d = 2, BMA reduces RMSE from 0.5609 to 0.5314 under the uniform prior, and similar results are observed for the relevance-diversity and Slater–Pauling priors The posterior reveals descriptor nonuniqueness by showing that a single deterministic support may only be one representative of a broader family of statistically competitive expressions

Interpretability and Diagnostic Utility

The comparison between the priors indicates that the validation improvement is not primarily driven by prior-specific performance gains, as the results under uniform, relevance-diversity, and Slater–Pauling priors are practically indistinguishable The posterior feature stability plots show that features 101, 201, 202, and 203 form the main competing descriptor family in d = 3 The Slater–Pauling prior is best viewed as a diagnostic prior that organizes this family in an electron-count-based way rather than a route to improved accuracy This makes the approach useful as a diagnostic tool for assessing descriptor stability in small-data materials problems

Conclusion

The deterministic-SIS/Bayesian-SO construction is a conservative extension of standard SISSO that preserves scalability while adding uncertainty quantification at the descriptor-selection stage It successfully recovers the deterministic SO support in the MAP limit and supplies calibrated predictive intervals, demonstrating that uncertainty is localized within chemically similar symbolic alternatives The framework is valuable because it identifies posterior-stable symbolic descriptors whose chemical plausibility can be assessed a posteriori

REFERENCE

Bhattacharjee 1

Indo Korea Science and Technology Center, Bangalore (Dated: June 10, 2026)

<ref:2606.04042#pg2>

Bhattacharjee 2

The Sure Independence Screening and Sparsifying Operator (SISSO) framework is a powerful symbolic-regression method for extracting compact and interpretable descriptors from large nonlinear feature spaces <ref:2606.04042#pg2> However, standard SISSO is deterministic: it returns a single descriptor and point prediction, without quantifying uncertainty in descriptor selection, regression coefficients, or predictions <ref:2606. p. 004042#pg2> Here we introduce a probabilistic extension in which the sure independence screening (SIS) stage is kept deterministic to preserve scalability, while the sparsifying operator (SO) stage is reformulated as Bayesian inference over the SIS-screened support space <ref:2606. p. 004042#pg2> The resulting deterministic-SIS/Bayesian-SO framework yields posterior probabilities for competing descriptor supports, feature-inclusion probabilities, Bayesian-model-averaged predictions, and predictive credible intervals, while recovering the deterministic SO descriptor of standard SISSO in the maximuma-posteriori limit <ref:2606. p. 004042#pg2> Applied to an X2Y Z Heusler-alloy magnetic-moment dataset, the approach gives modest improvements in five-fold cross-validation RMSE and near-nominal empirical coverage of the 95% predictive intervals <ref:2606. p. 004042#pg2> More importantly, the posterior exposes competing, physically related symbolic descriptor families that would appear artificially unique in a deterministic analysis <ref:2606. p. 004042#pg2> These results suggest that deterministic-SIS/Bayesian-SO can be used as an uncertainty-aware diagnostic extension of SISSO: a tool for assessing descriptor confidence, stability, and non-uniqueness in small-data materials regression problems <ref:2606. p. 004042#pg2>

Keywords: Symbolic regression, SISSO, Bayesian, Heusler alloys, magnetic moments

I. INTRODUCTION

Descriptor-based learning has become a central strategy in materials science because it balances predictive performance, data efficiency, and physical interpretability [1] <ref:2606.04042#pg3> More broadly, the growth of materials informatics has also motivated automated approaches for extracting structured material-property information from the literature, including entity–relation extraction frameworks for constructing materials knowledge bases [2] <ref:2606. p. 004042#pg3> In many realistic materials problems, datasets are not large enough to justify purely black-box models, and the scientific credential of a model depends not only on its accuracy but also on whether it reveals an intelligible descriptor-property relationship <ref:2606. p. 004042#pg3> Symbolic regression is especially attractive in this setting because it searches for closed-form analytical expressions, typically involving only a few physically meaningful variables—that can be inspected, interpreted, and transferred by the respective domain experts <ref:2606. p. 004042#pg3> Among symbolic-regression methods, SISSO is one of the most successful frameworks for navigating extremely large nonlinear feature spaces while retaining interpretability [1] <ref:2606. p. 004042#pg3> Starting from primary features, it constructs an enormous symbolic library through algebraic and functional operators, then applies sure independence screening (SIS) followed by sparse optimization (SO) to identify a low-dimensional descriptor <ref:2606. p. 004042#pg3> The practical impact of this framework is already evident across a broad range of materials problems [3–7] <ref:2606. p. 004042#pg3> SISSO-based descriptors have been used to guide the discovery of acid-stable oxides for electrocatalysis, rationalize Curie-temperature trends in low-dimensional magnetic materials, and derive interpretable predictors for materials hardness [8–10] <ref:2606. p. 004042#pg3> These successes make SISSO particularly compelling for applications where one wants not just a predictor, but a compact analytical model that highlights the dominant physics <ref:2606. p. 004042#pg3>

II. METHODOLOGY

A. Standard SISSO Framework

Following Ouyang et al. [1], SISSO starts from a set of primary features and recursively applies algebraic and functional operators to generate a very large candidate feature space for symbolic regression <ref:2606. p. 104042#pg3> For a dataset of N samples with targets yi, the resulting symbolic library can be written as

M

j=1, (1) <ref:2606.04042#pg3> where M may be enormous <ref:2606. p. 004042#pg3> In a regression setting, the target vector is approximated as

y ≈ Φc, (2) <ref:2606.04042#pg3> with sensing matrix Φ ∈ R

N×M and sparse coefficient vector c <ref:2606.04042#pg3> Direct optimization over all M candidates is generally intractable, so SISSO proceeds in two stages [1] <ref:2606. p. 104042#pg3> First, sure independence screening (SIS) ranks features according to their relevance to the target, or to the residuals from the previous descriptor dimension, and retains only a small screened subset <ref:2606. p. 104042#pg3> Second, the sparsifying operator (SO) performs an L0-style search within that reduced space to identify the best d-dimensional descriptor <ref:2606. p. 104042#pg3> The standard SISSO procedure therefore returns a single descriptor support and its associated regression coefficients <ref:2606. p. 104042#pg3> Throughout this manuscript, standard SISSO denotes this full deterministic SIS+SO pipeline, whereas deterministic SO denotes only the second-stage sparse search performed on a fixed SIS-screened feature set <ref:2606. p. 104042#pg3>

B. Deterministic SIS Stage

Let sj denote the SIS relevance score for feature Φj,for example the absolute correlation with the target or with the residual at a given descriptor dimension <ref:2606.04042#pg3> The screened index set is

ISIS = TopK(sj) M j=1; K

, ISIS = K, K ≪ M, (3) <ref:2606.04042#pg3> yielding a reduced design matrix ΦI ∈ R

N×K. (4) <ref:2606. p. 004042#pg3> No probabilistic model is assigned to the discarded features <ref:2606. p. 104042#pg3> This is the central computational approximation that keeps the symbolic-regression problem tractable <ref:2606. p. 104042#pg3>

C. Bayesian Sparsifying Operator

Bayesian inference is performed only on the SISscreened space. For a candidate support γ ⊂ (1,. p. 1.., K), γ = d, (5) <ref:2606. p. 004042#pg3> we use the Gaussian linear model

y = Φ(γ) I βγ + ε, ε ∼ N (0, σ2 I), (6) <ref:2606.04042#pg3> where Φ(γ) I denotes the screened columns indexed by γ <ref:2606. p. 204042#pg3> Active coefficients are assigned the prior

βγ ∼ N (0, τ 2 I). (7) Bayes’ theorem gives

p(γ, βγ DI) ∝ p(y γ, βγ, σ2)p(βγ τ 2)p(γ), (8) where DI = ΦI, y <ref:2606.04042#pg3> Integrating out coefficients yields the closed-form marginal likelihood

p(y γ) = Z

p(y γ, βγ, σ2)p(βγ τ 2)dβγ. (9) The posterior support probability is therefore [15, 16], p(γ DI) = p(y γ)p(γ') P

γ′ p(y γ')p(γ') <ref:2606.04042#pg3> In the implementation used for the cross-validation calculations, Bayesian inference is performed on the SISSOscreened feature values read from the standard SISSO output; no additional variance standardization of the symbolic features is applied <ref:2606. p. 204042#pg3> For each candidate support in a training fold, active feature columns and target are mean-centered when evaluating the marginal likelihood, which is equivalent to including an intercept <ref:2606. p. 204042#pg3> The intercept is restored as ¯y − ϕ¯T γ βγ, and validation predictions are then reported on the original magneticmoment scale using the corresponding screened feature columns <ref:2606. p. 204042#pg3> The parameter σ 2 is fixed globally to the fulldata standard-SISSO RMSE squared for the corresponding descriptor dimension: σ 2 = 0. p. 226518 for d = 2 and

σ 2 = 0.16937 for d = 3 <ref:2606. p. 004042#pg3> The coefficient-prior scale is fixed globally to the target variance divided by d, using var(y) = 4. p. 271578, giving τ 2 = 2. p. 235789 for d = 2 and

τ 2 = 1.57193 for d = 3 <ref:2606. p. 004042#pg3> These scales are not optimized on validation folds <ref:2606. p. 204042#pg3> Thus, the CV prediction errors are evaluated strictly on held-out targets, but the reported interval calibration should be interpreted conditional on these preset global variance scales rather than as the result of a fully nested variance-estimation procedure <ref:2606. p. 204042#pg3> The predictive variance for each support includes the observation-noise term and posterior coefficient covariance, and Bayesian model averaging incorporates support uncertainty through the posterior mixture over supports <ref:2606. p. 204042#pg3>

D. Support Priors and Predictions

For a fixed descriptor dimension d, we consider supports γ ⊂ (1,..., K) with γ = d, (5) <ref:2606. p. 004042#pg3> The BayesianSO framework itself only requires that a prior p(γ) be specified on this support space <ref:2606. p. 204042#pg3> The uniform prior below is the generic default, while the relevance-diversity and Slater–Pauling priors are optional examples used to probe how redundancy-aware and weakly physics-guided support weighting affect the Heusler-alloy results <ref:2606. p. 204042#pg3> The first is a uniform prior, which assigns equal probability to every admissible support and serves as the method’s generic, dataset-agnostic choice:

punif(γ) = (K d −1

, γ = d, 0, otherwise. (11) <ref:2606. p. 004042#pg3> This prior expresses no preference among screened features beyond the deterministic SIS reduction itself <ref:2606. p. 204042#pg3> It should be noted here that although the uniform prior assigns equal prior probability to all SIS-screened supports of size d, Bayesian SO is not equivalent to deterministic SO <ref:2606. p. 204042#pg3> Deterministic SO selects the single support with the best optimization criterion, whereas uniformprior Bayesian SO converts the marginal likelihoods of all screened supports into posterior probabilities <ref:2606. p. 204042#pg3> Thus, the uniform prior removes prior preference among supports but still allows the data likelihood to quantify support competition, descriptor non-uniqueness, and modelaveraged prediction uncertainty <ref:2606. p. 204042#pg3> The second is the relevance-diversity prior, which favors supports containing individually relevant SIS features while discouraging redundant, highly correlated descriptor components:

pRD(γ) ∝ exph

λSISX

k∈γ log sk − λcorr X

k,l∈γ corr(Φk, Φl) i, γ = d, (12) <ref:2606.04042#pg3> and pRD(γ) = 0 for supports of any other size <ref:2606. p. 204042#pg3> Here sk is the SIS score of screened feature k, λSIS ≥ 0 controls how strongly the prior rewards high-scoring features, and λcorr ≥ 0 penalizes supports whose members are strongly correlated with one another <ref:2606. p. 204042#pg3> The reported relevance-diversity calculations use

λSIS = 1 and λcorr = 5 <ref:2606.04042#pg3> These values were chosen as weak diagnostic weights: the SIS term preserves the deterministic screening order, while the correlation term discourages nearly collinear supports without excluding them <ref:2606. p. 204042#pg3> The third is a weak Slater–Pauling prior for two-dimensional Heusler descriptors

For full-Heusler alloys X2Y Z, the total valence electron count is Nv = 2NX + NY + NZ. (13) <ref:2606. p. 004042#pg3> For full-Heusler alloys, the Slater-Pauling rule is commonly written as Mt = Zt − 24, reflecting the occupation of 12 minority-spin states <ref:2606. p. 304042#pg3> We therefore keep the electron-count slope fixed at unity and allow only familydependent offsets for Co-, Fe-, and Ni-based compounds <ref:2606. p. 304042#pg3> In each cross-validation fold, the Slater–Pauling baseline is fit on the training data only as

MSP i = (Nv,i − 24) + bXi, (14) <ref:2606.04042#pg3> where Xi ∈

Xsite family and bX = ⟨Mi − (Nv,i − 24)⟩ i∈X, train. (15) The residual is then

rSP i = Mi − MSP i. (16) For a two-dimensional support γ, the Slater–Pauling prior is

pSP(γ) ∝ exph

λNvQNv(γ) + λresQres(γ) + λsplitBsplit(γ) − λcorrQcorr(γ) i, (17) with QNv

N v (g) = max k∈γ corr(Φk, Nv), (18) Qres

Qres(g) = max k∈γ corr(Φk, rSP), (19) and Qcorr

Qcorr(g) = X sum k,l∈γ k<l corr(Φk, Φl). (20) Here Bsplit(γ) = 1 when the feature most aligned with Nv differs from the feature most aligned with rSP, and is zero otherwise <ref:2606. p. 304042#pg3> This prior is optional and is used only for d = 2 because a two-dimensional support has a clear interpretation as an electron-count backbone plus one symbolic correction term <ref:2606. p. 304042#pg3>

III. DATASET: X2YZ HEUSLER ALLOYS

The dataset used for the SISSO analys…

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Uncertainty-Aware Descriptor Selection: The improved system can quantify uncertainty in descriptor selection, regression coefficients, and predictions by yielding posterior probabilities for competing descriptor supports, feature-inclusion probabilities, Bayesian-model-averaged predictions, and predictive credible intervals.

  2. Nonuniqueness Detection: The system can expose competing, physically related symbolic descriptor families that would appear artificially unique in a deterministic analysis, allowing researchers to assess descriptor confidence, stability, and non-uniqueness in small-data materials regression problems.

  3. Uncertainty-Aware Diagnostics: The framework functions as an uncertainty-aware diagnostic extension of SISSO: a tool for assessing descriptor confidence, stability, and non-uniqueness in small-data materials regression problems.

  4. Robustness to Prior Choice: By showing that the validation improvement is not primarily a consequence of prior engineering across different priors, the system provides assurance that Bayesian SO replaces a single deterministic SO descriptor by a posterior distribution over a small family of statistically competitive symbolic descriptors.

Related papers