MétaCan
Menu
Back to cohort
Record W3165962888 · doi:10.48550/arxiv.2105.07246

An End-to-End Framework for Molecular Conformation Generation via\n Bilevel Programming

2021· preprint· W3165962888 on OpenAlexaff
Minkai Xu, Wujie Wang, Shitong Luo, Chence Shi, Yoshua Bengio, Rafael Gómez‐Bombarelli, Jian Tang

Bibliographic record

VenuearXiv (Cornell University) · 2021
Typepreprint
Language
FieldMathematics
TopicMathematical Biology Tumor Growth
Canadian institutionsHEC MontréalMila - Quebec Artificial Intelligence InstituteUniversité de Montréal
Fundersnot available
KeywordsBilevel optimizationEnd-to-end principleComputer scienceBusinessAlgorithmArtificial intelligenceOptimization problem

Abstract

fetched live from OpenAlex

Predicting molecular conformations (or 3D structures) from molecular graphs\nis a fundamental problem in many applications. Most existing approaches are\nusually divided into two steps by first predicting the distances between atoms\nand then generating a 3D structure through optimizing a distance geometry\nproblem. However, the distances predicted with such two-stage approaches may\nnot be able to consistently preserve the geometry of local atomic\nneighborhoods, making the generated structures unsatisfying. In this paper, we\npropose an end-to-end solution for molecular conformation prediction called\nConfVAE based on the conditional variational autoencoder framework.\nSpecifically, the molecular graph is first encoded in a latent space, and then\nthe 3D structures are generated by solving a principled bilevel optimization\nprogram. Extensive experiments on several benchmark data sets prove the\neffectiveness of our proposed approach over existing state-of-the-art\napproaches. Code is available at https://github.com/MinkaiXu/ConfVAE-ICML21\n

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.115
GPT teacher head0.251
Teacher spread0.136 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2021
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicMathematical Biology Tumor GrowthFrench-language works237,207