Search arXivSearch

arXiv · 2411.15221

Reflections from the 2024 Large Language Model (LLM) Hackathon for Applications in Materials Science and Chemistry

Yoel Zimmermann·Adib Bazgir·Zartashia Afzal·Fariha Agbere·Qianxiang Ai·Nawaf Alampara·Alexander Al-Feghali·Mehrad Ansari·Dmytro Antypov·Amro Aswad·Jiaru Bai·Viktoriia Baibakova·Devi Dutta Biswajeet·Erik Bitzek·Joshua D. Bocarsly·Anna Borisova·Andres M Bran·L. Catherine Brinson·Marcel Moran Calderon·Alessandro Canalicchio·Victor Chen·Yuan Chiang·Defne Circi·Benjamin Charmes·Vikrant Chaudhary·Zizhang Chen·Min-Hsueh Chiu·Judith Clymo·Kedar Dabhadkar·Nathan Daelman·Archit Datar·Wibe A. de Jong·Matthew L. Evans·Maryam Ghazizade Fard·Giuseppe Fisicaro·Abhijeet Sadashiv Gangan·Janine George·Jose D. Cojal Gonzalez·Michael Götte·Ankur K. Gupta·Hassan Harb·Pengyu Hong·Abdelrahman Ibrahim·Ahmed Ilyas·Alishba Imran·Kevin Ishimwe·Ramsey Issa·Kevin Maik Jablonka·Colin Jones·Tyler R. Josephson·Greg Juhasz·Sarthak Kapoor·Rongda Kang·Ghazal Khalighinejad·Sartaaj Khan·Sascha Klawohn·Suneel Kuman·Alvin Noe Ladines·Sarom Leang·Magdalena Lederbauer·Sheng-Lun·Liao·Hao Liu·Xuefeng Liu·Stanley Lo·Sandeep Madireddy·Piyush Ranjan Maharana·Shagun Maheshwari·Soroush Mahjoubi·José A. Márquez·Rob Mills·Trupti Mohanty·Bernadette Mohr·Seyed Mohamad Moosavi·Alexander Moßhammer·Amirhossein D. Naghdi·Aakash Naik·Oleksandr Narykov·Hampus Näsström·Xuan Vu Nguyen·Xinyi Ni·Dana O'Connor·Teslim Olayiwola·Federico Ottomano·Aleyna Beste Ozhan·Sebastian Pagel·Chiku Parida·Jaehee Park·Vraj Patel·Elena Patyukova·Martin Hoffmann Petersen·Luis Pinto·José M. Pizarro·Dieter Plessers·Tapashree Pradhan·Utkarsh Pratiush·Charishma Puli·Andrew Qin·Mahyar Rajabi·Francesco Ricci

Abstract

Here, we present the outcomes from the second Large Language Model (LLM) Hackathon for Applications in Materials Science and Chemistry, which engaged participants across global hybrid locations, resulting in 34 team submissions. The submissions spanned seven key application areas and demonstrated the diverse utility of LLMs for applications in (1) molecular and material property prediction; (2) molecular and material design; (3) automation and novel interfaces; (4) scientific communication and education; (5) research data management and automation; (6) hypothesis generation and evaluation; and (7) knowledge extraction and reasoning from scientific literature. Each team submission is presented in a summary table with links to the code and as brief papers in the appendix. Beyond team results, we discuss the hackathon event and its hybrid format, which included physical hubs in Toronto, Montreal, San Francisco, Berlin, Lausanne, and Tokyo, alongside a global online hub to enable local and virtual collaboration. Overall, the event highlighted significant improvements in LLM capabilities since the previous year's hackathon, suggesting continued expansion of LLMs for applications in materials science and chemistry research. These outcomes demonstrate the dual utility of LLMs as both multipurpose models for diverse machine learning tasks and platforms for rapid prototyping custom applications in scientific research.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yoel Zimmermann, Adib Bazgir, Zartashia Afzal, Fariha Agbere, Qianxiang Ai, Nawaf Alampara, Alexander Al-Feghali, Mehrad Ansari, Dmytro Antypov, Amro Aswad, Jiaru Bai, Viktoriia Baibakova, Devi Dutta Biswajeet, Erik Bitzek, Joshua D. Bocarsly, Anna Borisova, Andres M Bran, L. Catherine Brinson, Marcel Moran Calderon, Alessandro Canalicchio, Victor Chen, Yuan Chiang, Defne Circi, Benjamin Charmes, Vikrant Chaudhary, Zizhang Chen, Min-Hsueh Chiu, Judith Clymo, Kedar Dabhadkar, Nathan Daelman, Archit Datar, Wibe A. de Jong, Matthew L. Evans, Maryam Ghazizade Fard, Giuseppe Fisicaro, Abhijeet Sadashiv Gangan, Janine George, Jose D. Cojal Gonzalez, Michael Götte, Ankur K. Gupta, Hassan Harb, Pengyu Hong, Abdelrahman Ibrahim, Ahmed Ilyas, Alishba Imran, Kevin Ishimwe, Ramsey Issa, Kevin Maik Jablonka, Colin Jones, Tyler R. Josephson, Greg Juhasz, Sarthak Kapoor, Rongda Kang, Ghazal Khalighinejad, Sartaaj Khan, Sascha Klawohn, Suneel Kuman, Alvin Noe Ladines, Sarom Leang, Magdalena Lederbauer, Sheng-Lun, Liao, Hao Liu, Xuefeng Liu, Stanley Lo, Sandeep Madireddy, Piyush Ranjan Maharana, Shagun Maheshwari, Soroush Mahjoubi, José A. Márquez, Rob Mills, Trupti Mohanty, Bernadette Mohr, Seyed Mohamad Moosavi, Alexander Moßhammer, Amirhossein D. Naghdi, Aakash Naik, Oleksandr Narykov, Hampus Näsström, Xuan Vu Nguyen, Xinyi Ni, Dana O'Connor, Teslim Olayiwola, Federico Ottomano, Aleyna Beste Ozhan, Sebastian Pagel, Chiku Parida, Jaehee Park, Vraj Patel, Elena Patyukova, Martin Hoffmann Petersen, Luis Pinto, José M. Pizarro, Dieter Plessers, Tapashree Pradhan, Utkarsh Pratiush, Charishma Puli, Andrew Qin, Mahyar Rajabi, Francesco Ricci. 2025-01-03. Reflections from the 2024 Large Language Model (LLM) Hackathon for Applications in Materials Science and Chemistry. https://arxiv.org/abs/2411.15221

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG