Active Search in Intensionally Specified Structured Spaces

We consider an active search problem in intensionally specified structured spaces. The ultimate goal in this setting is to discover structures from structurally different partitions of a fixed but unknown target class. An example of such a process is that of computer-aided de novo drug design. In the past 20 years several Monte Carlo search heuristics have been developed for this process. Motivated by these hand-crafted search heuristics, we devise a Metropolis--Hastings sampling scheme where the acceptance probability is given by a probabilistic surrogate of the target property, modeled with a max entropy conditional model. The surrogate model is updated in each iteration upon the evaluation of a selected structure. The proposed approach is consistent and the empirical evidence indicates that it achieves a large structural variety of discovered targets.

[1]  François Laviolette,et al.  Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction , 2015, ICML.

[2]  Thorsten Joachims,et al.  Interactively optimizing information retrieval systems as a dueling bandits problem , 2009, ICML '09.

[3]  H. Shimodaira,et al.  Improving predictive inference under covariate shift by weighting the log-likelihood function , 2000 .

[4]  Paul M. Cohn.  INTRODUCTION TO ALGEBRA , 1983 .

[5]  Leslie Ann Goldberg,et al.  Randomly sampling molecules , 1997, SODA '97.

[6]  Roman Garnett,et al.  Bayesian Optimal Active Search and Surveying , 2012, ICML.

[7]  Gisbert Schneider,et al.  Computer-based de novo design of drug-like molecules , 2005, Nature Reviews Drug Discovery.

[8]  Venkatesan Guruswami.  Rapidly Mixing Markov Chains: A Comparison of Techniques (A Survey) , 2016, ArXiv.

[9]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[10]  Nicholas C. Wormald,et al.  Generating Random Unlabelled Graphs , 1987, SIAM J. Comput..

[11]  H. White.  Maximum Likelihood Estimation of Misspecified Models , 1982 .

[12]  John Langford,et al.  Search-based structured prediction , 2009, Machine Learning.

[13]  Thomas Gärtner,et al.  Probabilistic Structured Predictors , 2009, UAI.

[14]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[15]  Bernhard Schölkopf,et al.  Learning to Find Pre-Images , 2003, NIPS.

[16]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[17]  Thorsten Joachims,et al.  Learning Trajectory Preferences for Manipulators via Iterative Improvement , 2013, NIPS.

[18]  Thomas Hofmann,et al.  Active learning for misspecified generalized linear models , 2007 .

[19]  Nando de Freitas,et al.  An Introduction to MCMC for Machine Learning , 2004, Machine Learning.

[20]  Thorsten Joachims,et al.  Online Structured Prediction via Coactive Learning , 2012, ICML.

[21]  Herbert S. Wilf,et al.  The Random Selection of Unlabeled Graphs , 1983, J. Algorithms.

[22]  Mark Huber,et al.  Exact sampling and approximate counting techniques , 1998, STOC '98.

[23]  Katya Scheinberg,et al.  Efficient SVM Training Using Low-Rank Kernel Representations , 2002, J. Mach. Learn. Res..

[24]  B. Carl,et al.  Entropy, Compactness and the Approximation of Operators , 1990 .

[25]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[26]  John Langford,et al.  Importance weighted active learning , 2008, ICML '09.

[27]  J. Scannell,et al.  Diagnosing the decline in pharmaceutical R&D efficiency , 2012, Nature Reviews Drug Discovery.

[28]  Petra Schneider,et al.  De Novo Design at the Edge of Chaos. , 2016, Journal of medicinal chemistry.

[29]  Roman Garnett,et al.  Active search on graphs , 2013, KDD.

[30]  Thomas Gärtner,et al.  On Graph Kernels: Hardness Results and Efficient Alternatives , 2003, COLT.

[31]  H. Akaike,et al.  Information Theory and an Extension of the Maximum Likelihood Principle , 1973 .

[32]  Daniel Paurat.  Interactive Exploration of Larger Pattern Collections : A Case Study on a Cocktail Dataset , 2014 .

[33]  Thomas Hofmann,et al.  Exponential Families for Conditional Random Fields , 2004, UAI.

[34]  Nando de Freitas,et al.  Taking the Human Out of the Loop: A Review of Bayesian Optimization , 2016, Proceedings of the IEEE.

[35]  Nando de Freitas,et al.  A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning , 2010, ArXiv.

[36]  Grace Wahba,et al.  Spline Models for Observational Data , 1990 .

[37]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[38]  S. V. N. Vishwanathan,et al.  Graph kernels , 2007 .

[39]  Walter S. Woltosz.  If we designed airplanes like we design drugs… , 2011, Journal of Computer-Aided Molecular Design.

[40]  R. Bellman.  Calculus of Variations (L. E. Elsgolc) , 1963 .

[41]  Y. Altun,et al.  SVM Learning for Interdependent and Structured Output Spaces , 2022 .

[42]  Alan Fern,et al.  A Bayesian Approach for Policy Learning from Trajectory Preference Queries , 2012, NIPS.