Graph-Structured Hyperdimensional Computing for Data-Efficient and Explainable Process-Structure-Property Prediction
Jingzhan Ge, Ajeeth Vellore, Ajinkya Palwe, Ahsan Khan, David Gorsich, Matthew P. Castanier, SeungYeon Kang, and Farhad Imani

TL;DR
The paper introduces PSP-HDC, a graph-structured hyperdimensional computing framework that improves process-structure-property prediction by encoding complex PSP graphs, enabling accurate, data-efficient, and explainable predictions.
Contribution
It presents a novel graph-structured hyperdimensional computing method that encodes PSP graphs for better prediction and intrinsic explanations, outperforming existing baselines.
Findings
Achieves 0.910 accuracy on sheet-resistance prediction
Outperforms strong baselines in regime prediction
Provides intrinsic explanations at multiple levels
Abstract
Multiphoton photoreduction enables high-fidelity fabrication of complex 3D microstructures, yet reliable process-structure-property (PSP) prediction remains difficult because the available data are sparse, heterogeneous, and interaction-dominated. In this regime, conventional feature-vector models are statistically underdetermined, making them prone to spurious correlations, poor regime transfer, and unstable post hoc explanations, whereas mechanistic pipelines depend on calibrated submodels that are rarely available during early process development. We present PSP-HDC, a graph-structured hyperdimensional computing framework that encodes a directed PSP graph as an internal prior for representation, inference, and explanation. A trainable scalar-to-hypervector encoder learns parameter-specific embeddings on a fixed hyperdimensional basis to accommodate heterogeneous scales and noise.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
