Materials Science · arXiv:2611.16792 v1 · submitted 12 Nov 2026 · 28 references
Systematic Evaluation of Training Data Generation Strategies for Machine Learning-Based Molecular and Materials Property Prediction
The paper says
“Machine-learning (ML) models for molecular and materials property prediction are often trained on large datasets curated through arbitrary or generic sampling strategies.”
more of the abstract
Such approaches can lead to the over- or under-representation of regions of chemical and materials space that are most relevant to the prediction task. An important challenge is therefore how to efficiently curate training data to maximize predictive performance while minimising the number of labelled examples required. Here, we systematically compare training data acquisition strategies for molecular and materials property prediction, ranging from random sampling to various active learning approaches. We evaluate their performance across different model classes, representations, datasets, and target properties. Our results show that the effectiveness of data acquisition strategies depend strongly on the interplay between the model, dataset, and prediction task, although uncertainty-based sampling generally outperforms alternative strategies. Based on these findings, we derive guidelines for selecting data acquisition strategies under a given labelling budget.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. Useful benchmark with a clear limitation: the central claim about uncertainty sampling rests on the weaker model class, and the paper is honest about it. This line is wrong
3 major objections · 11 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 28 references say.
The paper says, at Table III, Section III.E
The review did not quote this passage.
Pith says: Objection 1 of 3 · major
The central quantitative claim (13-30% reduction in labels via uncertainty sampling) is derived entirely from the descriptor-based ensemble experiments (Table III). For SchNet, which is the more accurate model on both large datasets (RMSE 0.090 vs 0.339 eV on QM9; 0.070 vs 0.268 eV/atom on Matbench MP), no strategy reaches the 10% threshold within the budget, so N10% cannot be computed.
more of objection 1
The paper acknowledges this (Section III.E, Limitations) and notes that SchNet was run only once per configuration. However, the practical recommendation for users who can afford structure-aware models (SchNet or similar) is therefore unsupported: the 13-30% savings are demonstrated only for a model class that is substantially less accurate at every budget tested. The paper's own Figure 6 shows that the ensemble is never competitive with SchNet in absolute error, so a practitioner choosing SchNet would have no evidence from this study about which sampling strategy to use. The claim that 'uncertainty-based sampling generally outperforms alternative strategies' is thus true only for the weaker model class, and the paper does not establish that this finding transfers to the model class that matters most for accuracy. This is a load-bearing limitation because the abstract and conclusions present the finding as general without sufficiently qualifying the model class.
The paper says, at Section III.E, Limitations
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.93):
“Consequently, we are unable to report standard devia- tions for the SchNet learning curves, which hinders a rig- orous assessment of the model’s statistical variance across different random weight initializations.”
Pith says: Objection 2 of 3 · major
The SchNet experiments were performed with only a single random seed per configuration. The authors acknowledge this limitation, but the consequence is that the SchNet learning curves lack error bars, and the relative ranking of sampling strategies for SchNet (e.g., US vs DS vs RS) may be affected by random initialization variance that is not quantified.
more of objection 2
Given that the differences between strategies for SchNet are small (e.g., final RMSE 0.114 vs 0.119 vs 0.126 eV on QM9), the ranking could plausibly change with additional runs. This undermines the reliability of any SchNet-specific conclusions, including the observation that DS outperforms RS on Matbench MP (Fig. 4b). The paper should either provide multiple runs or explicitly state that no reliable conclusions can be drawn for SchNet regarding strategy ranking.
The paper says, at Section II.C, Equation (1)
The review did not quote this passage.
Pith says: Objection 3 of 3 · major
The uncertainty sampling (US) strategy uses query-by-committee with a committee of three different models (RF, KRR, XGB) for the ensemble, but for SchNet the committee is formed by bootstrap resampling of the same model. This asymmetry means that the US signal is qualitatively different between the two model classes: for the ensemble, disagreement reflects model class diversity; for SchNet, it reflects training data stochasticity.
more of objection 3
The paper does not discuss how this difference might affect the comparison of US effectiveness across model classes. Since the central claim about US superiority is based on the ensemble experiments, this is not a fatal flaw, but it should be acknowledged as a confound when interpreting the SchNet results.
11 minor objections
The paper says, at Abstract
Pith says: minor objection 1 of 11
The abstract states that 'uncertainty-based sampling generally outperforms alternative strategies' without specifying that this conclusion is drawn from descriptor-based ensemble models. Consider adding a qualifier such as 'for descriptor-based models' to avoid overgeneralization.
The paper says, at Section III.B.1, Figure 2
Pith says: minor objection 2 of 11
Figure 2b (SchNet on QM9) shows that no strategy reaches the 10% threshold, but the y-axis range is truncated near the threshold. Consider extending the y-axis to show the full range of errors or adding a horizontal line at the threshold for clarity.
This objection may describe the copy Pith gave the reviewer, not the paper.
show 9 more
The paper says, at Table III
Pith says: minor objection 3 of 11
The footnote states that N10% is rounded to the nearest 1000 labels (100 for small datasets) and that percentages are computed from unrounded crossings. This is fine, but the table would benefit from including the unrounded values or confidence intervals (e.g., from the five seeds) for the ensemble experiments to convey uncertainty.
The paper says, at Section II.C
Pith says: minor objection 4 of 11
The description of diversity sampling (TypiClust) uses k-means clustering in descriptor space for classical models and in learned latent space for SchNet. The number of clusters is set to |L(t)| + b, which grows with iterations. This choice is not justified; a brief rationale would help.
The paper says, at Section III.D, Figure 6
Pith says: minor objection 5 of 11
Figure 6 compares ensemble vs SchNet using the 'best strategy per dataset and model.' For Matbench MP, the ensemble uses US and SchNet uses DS. This is an asymmetric comparison; consider also showing the ensemble with DS or SchNet with US to illustrate the range of outcomes.
The paper says, at Section II.B
Pith says: minor objection 6 of 11
The descriptor-based ensemble uses Morgan fingerprints and MACCS keys for QM9, but the scalar properties (μ, α, ZPVE, etc.) are also included. It is unclear whether these scalar properties are used as features or only for stratification. Please clarify.
The paper says, at Appendix A, Table IV
Pith says: minor objection 7 of 11
The hyperparameters for RF, KRR, and XGB are listed for each dataset. It would be helpful to note whether these were selected via cross-validation on the full training pool or on the initial labeled set L(0).
The paper says, at Section II.A
Pith says: minor objection 8 of 11
The Pourbaix stability dataset is described as having 6,870 samples, but the training pool is 5,496 (80% of 6,870). The paper states that 'structural relaxations were not performed at the HSE06 level for curating this dataset.' This is a minor point, but it would be useful to clarify whether the structures are experimental or from a different DFT level.
The paper says, at Section III.C
Pith says: minor objection 9 of 11
The redundancy analysis states that 'even for RS, only 15-25% of the pool is sufficient on QM9 and Matbench MP datasets.' This is consistent with prior work (Li et al.). The paper could strengthen this point by directly comparing the N10% fractions to those reported in Li et al. for similar models.
The paper says, at Section IV (Conclusions)
Pith says: minor objection 10 of 11
The conclusion states that 'uncertainty sampling was the most label-efficient strategy for the descriptor-based models on all four datasets, reducing the number of labels required by roughly 13-30% relative to random sampling.' This is accurate, but the 13-30% range should be explicitly tied to the values in Table III (e.g., QM9: 25% to 17% = 32% reduction; QM9small: 46% to 40% = 13% reduction; Matbench MP: 15% to 13% = 13% reduction; Pourbaix: 77% to 54% = 30% reduction).
more of objection 10
The paper currently states '13-30%' without showing the calculation.
The paper says, at General
Pith says: minor objection 11 of 11
The paper uses 'N10%' as a metric for data efficiency. It is defined as the minimum number of labels such that RMSE ≤ 1.1 × RMSE_full. This metric is reasonable, but it is a relative measure that depends on the model's own full-data performance. The paper correctly notes that N10% values are not comparable across model classes (Section III.D). However, the abstract and conclusions sometimes imply that N10% reductions are universally beneficial without emphasizing that they are model-specific.
What would settle it
Run the SchNet active learning experiments on QM9 and Matbench MP with at least 3 random seeds (as was done for the ensemble). Compute N10% for each seed and report the mean and standard deviation. If the relative ordering of strategies (US vs RS vs DS) is consistent across seeds and the 13–30% savings are observed for SchNet, the concern is resolved. If the ordering is inconsistent or the savings are smaller, the paper's central claim should be restricted to descriptor-based models.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up, with conditions
- Skeptic partly agrees
- Editor wrote the verdict above
- Referee major revision: 3 major objections, 11 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
The paper is a systematic benchmark of three sampling strategies (random, uncertainty, diversity) across two model classes (descriptor-based ensemble, SchNet) and four datasets. The main finding—that uncertainty sampling reduces labels by 13–30% relative to random for the descriptor-based ensemble—is cleanly demonstrated with five random seeds and is a useful quantitative result for practitioners using composition-based models. The inclusion of the Pourbaix stability dataset (HSE06 labels) is a nice addition; it's the kind of small, expensive dataset where active learning matters most, and the savings there are the largest (22% of the pool).
The paper is well-executed and the authors are transparent about limitations. The SchNet experiments were run only once per configuration, so the learning curves lack error bars. The authors state this explicitly in Section III.E. The stress-test concern—that the central claim does not transfer to SchNet, which is the more accurate model on both large datasets—is correct but the paper does not overclaim. The authors note that N10% could not be computed for SchNet and that the best strategy for SchNet changed with the dataset. The practical recommendation for users of structure-aware models is therefore unsupported by this study, but the paper does not pretend otherwise.
The soft spot is real: the 13–30% savings are demonstrated only for the descriptor-based ensemble, which is substantially less accurate than SchNet at every budget. A practitioner choosing SchNet gets no evidence from this study about which sampling strategy to use. This is a limitation of scope, not a flaw in execution. The paper would be stronger if it included error bars for SchNet or used a cheaper structure-aware model that allows multiple runs, but the authors acknowledge the constraint.
Who this is for: practitioners using descriptor-based models (composition-based features) who want quantitative guidance on sampling strategies. The paper delivers that. For users of graph neural networks, the results are suggestive at best.
Recommendation: Accept with minor revision. The single-run SchNet limitation should be stated more prominently in the abstract or conclusions, not just in a dedicated limitations section. The authors should also clarify that the 13–30% savings apply to the ensemble, not to SchNet. The paper deserves a serious referee; it is a solid empirical contribution that will be useful to the community.
The strongest objection
The central claim—that uncertainty-based sampling reduces labels by 13–30% relative to random sampling—rests entirely on the descriptor-based ensemble experiments (Table III). For SchNet, which is the more accurate model on both large datasets (RMSE 0.090 vs 0.339 eV on QM9; 0.070 vs 0.268 eV/atom on Matbench MP), no strategy reaches the 10% threshold within the budget, so N10% cannot be computed. The paper acknowledges this (Section III.E, Limitations) and notes that SchNet was run only once per configuration. However, the practical recommendation for users who can afford structure-aware models (SchNet or similar) is therefore unsupported: the 13–30% savings are demonstrated only for a model class that is substantially less accurate at every budget tested. The paper's own Figure 6 shows that the ensemble is never competitive with SchNet in absolute error, so a practitioner choosing SchNet would have no evidence from this study about which sampling strategy to use. The claim that 'uncertainty-based sampling generally outperforms alternative strategies' is thus true only for the weaker model class, and the paper does not establish that this finding transfers to the model class that matters most for accuracy.
The reader's weakest_assumption correctly identifies the single-run SchNet experiments as a weakness. However, the reader frames this as a statistical-variance issue that could be fixed by adding error bars. I see a deeper structural issue: the central claim (13–30% label savings from US) is demonstrated only for the descriptor-based ensemble, which is the less accurate model class. The paper's own results show that SchNet is superior at every budget, so the practical recommendation for users of structure-aware models is unsupported. The reader's verdict (CONDITIONAL) is appropriate, but the condition should be stronger: the paper should either (a) provide evidence that the US advantage holds for SchNet, or (b) explicitly restrict the central claim to descriptor-based models. The agreement is 'partial' because the reader focuses on statistical reliability of SchNet results, whereas I focus on the mismatch between the claim and the model class for which it is demonstrated.
The referee's report
If the results hold, the paper provides practical guidelines for data acquisition in computational materials science, particularly for descriptor-based models where uncertainty sampling offers modest but consistent savings. The benchmark is thorough in terms of datasets and model classes, and the code is provided. However, the main practical finding is limited to the weaker model class (ensemble), and the most practically relevant model (SchNet) yields no actionable N10% values. The paper's strength is its systematic experimental design with stratified splits, multiple seeds for ensemble, and hyperparameter tuning via cross-validation.
Pith's reading of the paper (a machine's summary, not the authors')
This paper systematically compares strategies for selecting training data when building machine-learning models that predict properties of molecules and materials. The central finding is that uncertainty-based sampling—choosing the next examples to label based on how much the model's predictions disagree—consistently reduces the number of labeled examples required to reach a target accuracy by 13–30% relative to random sampling, across four datasets and several model types. However, the paper also shows that the effectiveness of any sampling strategy depends strongly on the interplay between the model architecture, the representation of the input data, and the specific prediction task. The authors derive practical guidelines for choosing a data acquisition strategy under a given labeling budget, emphasizing that no single strategy is universally optimal.
What carries the argument. The central experimental apparatus is a pool-based active learning framework where models are iteratively retrained on growing labeled sets. Three acquisition strategies are compared: random sampling (baseline), uncertainty sampling using query-by-committee (variance of predictions from three different regressors for the ensemble, or from bootstrap-resampled SchNet models), and diversity sampling using TypiClust (k-means clustering followed by typicality scoring). Performance is measured by the N10% metric—the smallest training set size at which test RMSE falls within 10% of the model's full-data RMSE—and by absolute RMSE at each budget.
Core claim. The paper establishes that for descriptor-based ensemble models (random forest, kernel ridge regression, gradient boosting), uncertainty sampling via query-by-committee is the most label-efficient strategy across all four datasets tested (QM9, QM9small, Matbench MP, Pourbaix stability). It reduces the number of labeled examples needed to reach within 10% of the full-data error by roughly 13–30% compared to random sampling, with the largest gains on the smallest and most expensive dataset (Pourbaix stability). Diversity sampling (TypiClust) gives no consistent advantage over random sampling. For the deep-learning model SchNet, the relative ranking of strategies changes with the dataset, and no strategy reaches the 10% threshold within the labeling budget. The paper also quantifies dataset redundancy: under random sampling, only 15–25% of the pool is needed for the two large datasets (QM9, Matbench MP), whereas the smaller datasets require 46–77%.
The premise it rests on. The SchNet models were trained with only one random seed per configuration, so the learning curves for SchNet lack error bars and the reported rankings of sampling strategies for SchNet may be affected by unquantified random initialization variance.
If the paper is right (Pith's inferences, not the authors')
If the findings hold generally, researchers with limited labeling budgets (e.g., expensive DFT calculations) should prioritize uncertainty-based acquisition over random or diversity sampling when using descriptor-based ensemble models.
The high redundancy observed in large datasets (QM9, Matbench MP) suggests that many published models could be trained on far fewer examples without substantial accuracy loss, potentially reducing computational and data-generation costs.
For deep-learning models like SchNet, the choice of sampling strategy matters less than the model's intrinsic accuracy; the paper implies that investing in better representations or architectures may yield larger gains than optimizing the sampling strategy.
The paper's guidelines—use uncertainty sampling for ensembles, consider dataset size and redundancy when planning acquisition, and evaluate the model's starting accuracy before deploying active learning—provide a practical decision framework for practitioners.
The paper's finding that diversity sampling underperforms uncertainty sampling for descriptor-based models suggests that coverage of input space without feedback from model errors is a weak signal for label efficiency. A natural extension would be to test hybrid strategies that combine uncertainty and diversity criteria.
Because the SchNet results lack error bars (single seed per configuration), the observed differences between strategies for SchNet may not be statistically significant. A replication with multiple seeds would clarify whether the dataset-dependent ranking is robust.
The N10% metric, while useful, conflates two distinct quantities: the model's absolute accuracy and the data efficiency. The paper's cross-model comparisons using absolute errors partially address this, but a normalized efficiency metric (e.g., relative reduction in labels to reach a fixed absolute error) could sharpen comparisons across model classes.
The Pourbaix stability dataset, being small and expensive, represents the regime where active learning is most valuable. The 22% reduction in labels achieved by uncertainty sampling suggests that similar gains may be attainable for other high-fidelity materials properties computed with hybrid functionals or correlated wavefunction methods.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Machine-learning (ML) models for molecular and materials property prediction are often trained on large datasets curated through arbitrary or generic sampling strategies. Such approaches can lead to the over- or under-representation of regions of chemical and materials space that are most relevant to the prediction task. An important challenge is therefore how to efficiently curate training data to maximize predictive performance while minimising the number of labelled examples required. Here, we systematically compare training data acquisition strategies for molecular and materials property prediction, ranging from random sampling to various active learning approaches. We evaluate their performance across different model classes, representations, datasets, and target properties. Our results show that the effectiveness of data acquisition strategies depend strongly on the interplay between the model, dataset, and prediction task, although uncertainty-based sampling generally outperforms alternative strategies. Based on these findings, we derive guidelines for selecting data acquisition strategies under a given labelling budget.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 1.00
“Our results show that the effectiveness of data acquisition strategies depend strongly on the interplay between the model, dataset, and prediction task, although uncertainty-based sampling generally outperforms alternative strategies.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.52 · human participants 0.03 · controlled comparison 0.81 · randomized assignment 0.03 · states quantitative result 0.05 · compares with prior results 0.82 · mentions code or data availability 0.03
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Machine-learning (ML) models for molecular and materials property prediction are often trained on large datasets curated through arbitrary or generic sampling strategies. | background 1.00 | 0.05 | 0.02 | asserted 0.92 |
| Such approaches can lead to the over- or under-representation of regions of chemical and materials space that are most relevant to the prediction task. | background 0.97 | 0.06 | 0.02 | hedged possibility 0.90 |
| An important challenge is therefore how to efficiently curate training data to maximize predictive performance while minimising the number of labelled examples required. | background 0.58 | 0.04 | 0.03 | asserted 0.99 |
| Here, we systematically compare training data acquisition strategies for molecular and materials property prediction, ranging from random sampling to various active learning approaches. | contribution 0.88 | 0.94 | 0.03 | asserted 0.96 |
| We evaluate their performance across different model classes, representations, datasets, and target properties. | method 0.87 | 0.93 | 0.03 | asserted 0.88 |
| Our results show that the effectiveness of data acquisition strategies depend strongly on the interplay between the model, dataset, and prediction task, although uncertainty-based sampling generally outperforms alternative strategies. | result 0.99 | 0.97 | 0.88 | asserted 1.00 |
| Based on these findings, we derive guidelines for selecting data acquisition strategies under a given labelling budget. | interpretation 0.64 | 0.95 | 0.18 | asserted 0.98 |
What kind of paper the classifier reports this is: empirical study 0.99 · evidence from simulation or computation 0.71
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 5,502 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (6)
Figures are the authors', reproduced from the paper.
References (28)
- [1] K. Li, D. Persaud, K. Choudhary,et al., Nat. Commun. 14, 7283 (2023) on Pith
- [2] E. Moerman, I. Poltavsky, A. Charkin-Gorbulin, and A. Tkatchenko, “Atoms that Matter: Largest Mate- rials Datasets Are 99% Redundant, and Local Chem- istry Can Guide the Required 1%,”arXiv preprint arXiv:2610.14392, 2026 on PithPith's reviewarXiv
- [3] Q. Li, N. Fu, S. S. Omee, J. Hu, npj Comput. Mater.10, 245 (2024) on Pith
- [4] M. Kulichenko, B. Nebgen, N. Lubbers,et al., Chem. Rev.124, 13681 (2024) on Pith
- [5] J. Bi, Y. Xu, F. Conrad, H. Wiemer, S. Ihlenfeldt, Sci. Rep.15, 37167 (2025) on Pith
- [6] A. S. Nair and L. Foppa, Digit. Discov.5, 2366 (2026) on Pith
- [7] K. T. Sch¨ utt, P.-J. Kindermans, H. E. Sauceda, S. Chmiela, A. Tkatchenko, K.-R. M¨ uller, Adv. Neural Inf. Process. Syst.30, 991–1001 (2017) on Pith
- [8] R. Ramakrishnan, P. O. Dral, M. Rupp, O. A. von Lilien- feld, Sci. Data1, 140022 (2014) on Pith
- [9] A. Jain, S. P. Ong, G. Hautier, W. Chen,et al., APL Mater.1, 011002 (2013) on Pith
- [10] A. Dunn, Q. Wang, A. Ganose, D. Dopp, A. Jain, npj Comput. Mater.6, 138 (2020) on Pith
- [11] D. D. Lewis, “A sequential algorithm for training text classifiers: Corrigendum and additional data,”ACM SI- GIR Forum, vol. 29, pp. 13–19, 1995 on Pith
- [12] A. S. Nair, L. Foppa, M. Scheffler, npj Comput. Mater. 11, 150 (2025) on Pith
- [13] H. L. Morgan, J. Chem. Doc.5, 107 (1965) on Pith
- [14] D. Rogers and M. Hahn, J. Chem. Inf. Model.50, 742 (2010) on Pith
- [15] J. L. Durant, B. A. Leland, D. R. Henry, J. G. Nourse, J. Chem. Inf. Comput. Sci.42, 1273 (2002) on Pith
- [16] G. Landrum, RDKit: Open-source cheminformatics, https://www.rdkit.org on Pith
- [17] L. Ward, A. Agrawal, A. Choudhary, C. Wolverton, npj Comput. Mater.2, 16028 (2016) on Pith
- [18] L. Ward, A. Dunn, A. Faghaninia,et al., Comput. Mater. Sci.152, 60 (2018) on Pith
- [19] L. Breiman, Mach. Learn.45, 5 (2001) on Pith
- [20] J. H. Friedman, Ann. Stat.29, 1189 (2001) on Pith
show 8 more
- [21] C. K. I. Williams and M. Seeger, Adv. Neural Inf. Pro- cess. Syst.13(2000) on Pith
- [22] A. H. Larsen, J. J. Mortensen, J. Blomqvist,et al., J. Phys.: Condens. Matter29, 273002 (2017) on Pith
- [23] B. Settles,Active Learning Literature Survey, Computer Sciences Technical Report 1648, University of Wisconsin– Madison (2009) on Pith
- [24] H. S. Seung, M. Opper, H. Sompolinsky, inProc. 5th Annu. Workshop Comput. Learn. Theory(ACM, 1992), pp. 287–294 on Pith
- [25] G. Hacohen, A. Dekel, D. Weinshall, inProc. ICML (2022) on Pith
- [26] M. Herde, M. T. Pham, D. Kottke,et al., scikit-activeml: A comprehensive and user-friendly active learning li- brary, J. Mach. Learn. Res.27(184), 1–20 (2026) on Pith
- [27] S. P. Lloyd, IEEE Trans. Inf. Theory28, 129 (1982) on Pith
- [28] T. Cover and P. Hart, IEEE Trans. Inf. Theory13, 21 (1967). 10 TABLE IV: Hyperparameters of the ensemble members (QM9, QM9small, Matbench MP and Pourbaix stability), selected by five-fold cross-validation on the training subset. Model Parameter QM9 QM9small MP HSE06 RF n estim... on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment