mlsanityData to 7 Oct 2026

Tanimoto Random Features for Scalable Molecular Machine Learning

arXiv 2306.14809 ↗First posted 26 Jun 2023cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

The Tanimoto coefficient is commonly used to measure the similarity between molecules represented as discrete fingerprints, either as a distance metric or a positive definite kernel. While many kernel methods can be accelerated using random feature approximations, at present there is a lack of such approximations for the Tanimoto kernel. In this paper we propose two kinds of novel random features to allow this kernel to scale to large datasets, and in the process discover a novel extension of the kernel to real-valued vectors. We theoretically characterize these random features, and provide error bounds on the spectral norm of the Gram matrix. Experimentally, we show that these random features are effective at approximating the Tanimoto coefficient of real-world datasets and are useful for molecular property prediction and optimization tasks.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 17 of its 75 references that are in the map. First posted on arXiv 26 Jun 2023.

Builds on

17 of 75 references.

References · 17

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  3. 2018GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Accelerationcited by 603
  4. 2013Gaussian Processes for Big Datacited by 377
  5. 2018GuacaMol: Benchmarking Models for De Novo Molecular Designcited by 294
  6. 2022Sample Efficiency Matters: A Benchmark for Practical Molecular Optimizationcited by 151
  7. 2020Efficiently Sampling Functions from Gaussian Process Posteriorscited by 125
  8. 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 107
  9. 2017Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Spacecited by 76
  10. 2015Optimal approximate matrix product in terms of stable rankcited by 37
  11. 2021Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Informationcited by 33
  12. 2021DOCKSTRING: easy molecular docking yields better benchmarks for ligand designcited by 33
5 more
  1. 2016A note on the triangle inequality for the Jaccard distancecited by 32
  2. 2021Scaling Neural Tangent Kernels via Sketching and Random Featurescited by 32
  3. 2021Further Generalizations of the Jaccard Indexcited by 26
  4. 2022Improved Random Features for Dot Product Kernelscited by 11
  5. 2022Complex-to-Real Sketches for Tensor Products with Applications to the Polynomial Kernelcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 6; 2026: 4.

15 papers.

Sort: