mlsanityData to 7 Oct 2026

Generalization within in silico screening

arXiv 2307.09379 ↗First posted 18 Jul 2023stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In silico screening uses predictive models to select a batch of compounds with favorable properties from a library for experimental validation. Unlike conventional learning paradigms, success in this context is measured by the performance of the predictive model on the selected subset of compounds rather than the entire set of predictions. By extending learning theory, we show that the selectivity of the selection policy can significantly impact generalization, with a higher risk of errors occurring when exclusively selecting predicted positives and when targeting rare properties. Our analysis suggests a way to mitigate these challenges. We show that generalization can be markedly enhanced when considering a model's ability to predict the fraction of desired outcomes in a batch. This is promising, as the primary aim of screening is not necessarily to pinpoint the label of each compound individually, but rather to assemble a batch enriched for desirable compounds. Our theoretical insights are empirically validated across diverse tasks, architectures, and screening scenarios, underscoring their applicability.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 54 references that are in the map. First posted on arXiv 18 Jul 2023.

Builds on

28 of 54 references.

References · 28

  1. 2017On Calibration of Modern Neural Networkscited by 4,860
  2. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  4. 2018A Tutorial on Bayesian Optimizationcited by 734
  5. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  6. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  7. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  8. 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
  9. 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
  10. 2018Sensitivity and Generalization in Neural Networks: an Empirical Studycited by 187
  11. 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 125
  12. 2016Robust Large Margin Deep Neural Networkscited by 117
16 more
  1. 2022Accelerating Bayesian Optimization for Biological Sequence Design with Denoising Autoencoderscited by 99
  2. 2017Data-Dependent Stability of Stochastic Gradient Descentcited by 90
  3. 2019Distribution Calibration for Regressioncited by 88
  4. 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 75
  5. 2020On the role of data in PAC-Bayes boundscited by 64
  6. 2019No-Regret Bayesian Optimization with Unknown Hyperparameterscited by 50
  7. 2013A PAC-Bayesian Tutorial with A Dropout Boundcited by 43
  8. 2018Regret bounds for meta Bayesian optimization with an unknown Gaussian process priorcited by 31
  9. 2020A Limitation of the PAC-Bayes Frameworkcited by 24
  10. 2021Measuring Generalization with Optimal Transportcited by 24
  11. 2018Tight Regret Bounds for Bayesian Optimization in One Dimensioncited by 20
  12. 2019Knowing The What But Not The Where in Bayesian Optimizationcited by 20
  13. 2022On the generalization of learning algorithms that do not convergecited by 9
  14. 2021What training reveals about neural network complexitycited by 5
  15. 2022Forecasting labels under distribution-shift for machine-guided sequence designcited by 4
  16. 2023Set Learning for Accurate and Calibrated Modelscited by 2

Built on by

Not cited yet.