aiqbench analysis
This research proposes using tensor completion as a surrogate model to accelerate the design of optimal lattice structures, specifically addressing challenges posed by non-uniformly sampled experimental data. The study demonstrates that this approach outperforms classic machine learning methods like Gaussian Processes and XGBoost in scenarios with biased sampling while maintaining comparable performance under uniform conditions. By improving efficiency in materials discovery where training data is unevenly distributed, the work offers a practical advancement for computational design workflows reliant on AI techniques.
Surrogate Modeling for the Design of Optimal Lattice Structures using Tensor Completion
arXiv:2510.07474v2 Announce Type: replace Abstract: When designing new materials, it is often necessary to design a material with specific desired properties. Unfortunately, as new design variables are added, the search space grows exponentially, which makes synthesizing and validating the properties of each material very impractical and time-consuming. In this work, we focus on the design of optimal lattice structures with regard to mechanical performance. Computational approaches, including the use of machine learning (ML) methods, have shown improved success in accelerating materials design. However, these ML methods are still lacking in scenarios when training data (i.e. experimentally validated materials) come from a non-uniformly random sampling across the design space. For example, an experimentalist might synthesize and validate certain materials more frequently because of convenience. For this reason, we suggest the use of tensor completion as a surrogate model to accelerate the design of materials in these atypical supervised learning scenarios. In our experiments, we show that tensor completion is superior to classic ML methods such as Gaussian Process and XGBoost with biased sampling of the search space, with around 5\% increased $R^2$. Furthermore, tensor completion still gives comparable performance with a uniformly random sampling of the entire search space.
Abstract:When designing new materials, it is often necessary to design a material with specific desired properties. Unfortunately, as new design variables are added, the search space grows exponentially, which makes synthesizing and validating the properties of each material very impractical and time-consuming. In this work, we focus on the design of optimal lattice structures with regard to mechanical performance. Computational approaches, including the use of machine learning (ML) methods, have shown improved success in accelerating materials design. However, these ML methods are still lacking in scenarios when training data (i.e. experimentally validated materials) come from a non-uniformly random sampling across the design space. For example, an experimentalist might synthesize and validate certain materials more frequently because of convenience. For this reason, we suggest the use of tensor completion as a surrogate model to accelerate the design of materials in these atypical supervised learning scenarios. In our experiments, we show that tensor completion is superior to classic ML methods such as Gaussian Process and XGBoost with biased sampling of the search space, with around 5\% increased $R^2$. Furthermore, tensor completion still gives comparable performance with a uniformly random sampling of the entire search space.
Machine Learning (cs.LG)
arXiv:2510.07474 [cs.LG]
(or arXiv:2510.07474v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2510.07474 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 285 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

D - Wave Said Classical Computers Could Not Match Its Quantum Chip . A Laptop Just Did .
techtimes.com · Jul 21, 2026
Constraint-Aware Discrete Black-Box Optimization Using Tensor Decomposition
arXiv · Sep 10, 2026