Olfactory Label Prediction on Aroma-Chemical Pairs
Not on the map. Why?
Abstract (arXiv)
The application of deep learning techniques on aroma-chemicals has resulted in models more accurate than human experts at predicting olfactory qualities. However, public research in this domain has been limited to predicting the qualities of single molecules, whereas in industry applications, perfumers and food scientists are often concerned with blends of many molecules. In this paper, we apply both existing and novel approaches to a dataset we gathered consisting of labeled pairs of molecules. We present graph neural network models capable of accurately predicting the odor qualities arising from blends of aroma-chemicals, with an analysis of how variations in architecture can lead to significant differences in predictive power.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 15 of its 34 references that are in the map. First posted on arXiv 26 Dec 2023.
Builds on
15 of 34 references.
References · 15
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
- 2017Molecular De Novo Design through Deep Reinforcement Learningcited by 267
- 2016Molecular Graph Convolutions: Moving Beyond Fingerprintscited by 238
- 2015Order Matters: Sequence to sequence for setscited by 237
- 2015A Deep Architecture for Semantic Matching with Multiple Positional Sentence Representationscited by 32
3 more
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.