AI4X 2025 Papers

International Conference on AI for X

Decision breakdown

236papers

Counted from the official paper list; may differ slightly from the number the conference announced.

  • Oral
    14461.0%
  • Poster
    9239.0%

Top 10 topics (click to filter)

No topic data yet.

Trends for all 207 research topics

Browse all papers

Machine Learned Potential for High-Throughput Phonon Calculations of Metal–-Organic Frameworks

Prathami Divakar Kamath, Alin Marin Elena, Theo Jaffrelot inizan, Andrew Scott Rosen, Federica Zanca, Kristin Persson

Expand abstract

Abstract Metal–organic frameworks (MOFs) are highly porous and versatile materials studied extensively for applications such as carbon capture and water harvesting. However, computing phonon-mediated properties in MOFs, like thermal expansion and mechanical stability, remains challenging due to the large number of atoms per unit cell, making traditional Density Functional Theory (DFT) methods impractical for high-throughput screening. Recent advances in machine learning potentials have led to foundation atomistic models, such as MACE-MP-0, that accurately predict equilibrium structures but struggle with phonon properties of MOFs. In this work, we developed a workflow for computing phonons in MOFs within the quasi-harmonic approximation with a fine-tuned MACE model, MACE-MP-MOF0. The model was trained on a curated dataset of 127 representative and diverse MOFs. The fine-tuned MACE-MP-MOF0 improves the accuracy of phonon density of states and corrects the imaginary phonon modes of MACE-MP-0, enabling high-throughput phonon calculations with state-of-the-art precision. The model successfully predicts thermal expansion and bulk moduli in agreement with DFT and experimental data for several well-known MOFs. These results highlight the potential of MACE-MP-MOF0 in guiding MOF design for applications in energy storage and thermoelectrics.

Poster
Cross-dataset Evaluation of Dementia Longitudinal Progression Prediction Models

Chen Zhang, B.T. Thomas Yeo

Expand abstract

Accurately predicting Alzheimer's Disease (AD) progression is useful for clinical care. The 2019 TADPOLE (The Alzheimer's Disease Prediction Of Longitudinal Evolution) challenge evaluated 92 algorithms from 33 teams worldwide. Unlike typical clinical prediction studies, TADPOLE accommodates (1) a variable number of observed time points across patients, (2) missing data across modalities and visits, and (3) prediction over an open-ended time horizon, which better reflects real-world data. However, TADPOLE only used the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset, so how well top algorithms generalize to other cohorts remains unclear. We tested five algorithms in three external datasets covering 2312 participants and 13,200 time points. The algorithms included FROG, the overall TADPOLE winner, which utilized a unique Longitudinal-to-Cross-sectional (L2C) transformation to convert variable-length longitudinal histories into feature vectors of the same length across participants (i.e., same-length feature vectors). We also considered two FROG variants. One variant unified all XGBoost models from the original FROG with a single feedforward neural network (FNN), which we referred to as L2C-FNN. We also included minimal recurrent neural networks (MinimalRNN), which were ranked second at publication time, as well as AD Course Map (AD-Map), which outperformed MinimalRNN at publication time. All five models-three FROG variants, MinimalRNN, and AD-Map-were trained on ADNI and tested on the external datasets. L2C-FNN performed the best overall. In the case of predicting cognition and ventricle volume, L2C-FNN and AD-Map were the best. For clinical diagnosis prediction, L2C-FNN was the best, while AD-Map was the worst. L2C-FNN also maintained its edge over other models, regardless of the number of observed time points and regardless of the prediction horizon from 0 to 6 years into the future. L2C-FNN shows strong potential for both short-term and long-term dementia progression prediction. Pretrained ADNI models are available: https://github.com/ThomasYeoLab/CBIG/tree/master/stable_projects/predict_phenotypes/Zhang2025_L2CFNN.

Poster
Large Language Models for Cybersecurity: New Opportunities

Dinil Mon Divakaran, Sai Teja Peddinti

Expand abstract

With the emergence of powerful, versatile, and beneficial large language models (LLMs), we take a fresh look at cybersecurity, specifically exploring and summarizing the potential of LLMs in addressing challenging problems in the security and safety domains.

Oral
Quantum Networks in 6G Communications: Technologies, Challenges, and Applications

Liangxin Qian, Jun Zhao

Expand abstract

Quantum networking represents a significant advancement in communication technology. As 6G networks emerge, integrating quantum principles—such as quantum key distribution (QKD) and entanglement-based communications—will be essential for achieving secure and efficient systems. This paper provides a brief survey of the state-of-the-art technology in quantum networks, focusing on their potential application within the 6G ecosystem. We explore recent advancements in quantum communication technologies, their challenges, and their potential for the future of ultra-secure, high-speed networks.

Oral
Utility-Cost Ratio Maximization in Quantum Networks for Secure Quantum Key Distribution

Liangxin Qian, Jun Zhao

Expand abstract

In this paper, we study the utility-cost ratio (UCR) maximization problem in quantum networks, with a particular focus on secure quantum key distribution (QKD). We propose the Quantum Utility-Cost Optimization (QUCO) algorithm to address the challenge of balancing network utility with operational and infrastructure costs. The utility of the network is measured based on the secret key fraction, a key performance metric in QKD, while the costs considered include operational and maintenance expenses, transceiver deployment, auxiliary equipment, and wavelength channel usage. The QUCO algorithm transforms the original non-convex problem into a convex optimization through a series of transformations, enabling efficient resource allocation across quantum network routes. Our simulation results, conducted on a realistic quantum network topology, demonstrate the algorithm’s ability to improve the utility-cost ratio while maintaining high network performance. The QUCO algorithm strikes a balance between minimizing costs and maintaining high end-to-end entanglement fidelity, which is effective for optimizing UCR in quantum networks.

Poster
Multi-objective synthesis optimization and kinetics of a sustainable terpolymer

Jin Da Tan, Andre KY Low, Shannon Thoi Rui Ying, Sze Yu Tan, Wenguang Zhao, Yee-Fun Lim, Qianxiao Li, Saif A. Khan, Balamurugan Ramalingam, Kedar Hippalgaonkar

Expand abstract

We employed multi-objective Bayesian optimization to achieve Pareto optimal solutions for sustainable terpolymer synthesis, targeting a high glass transition temperature and increased incorporation of renewable monomers.

Oral