Sergei Kliavinek

Sergei Kliavinek

Auto-generated profile, based on publicly available information

Sergei Kliavinek

California Institute of Technology

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2021 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
PDF file
RCRose K Cersonsky
Rose K Cersonsky
BHBenjamin A Helfrecht
Benjamin A Helfrecht
EEEdgar A Engel
Edgar A Engel
SKSergei Kliavinek
Sergei Kliavinek
MCMichele Ceriotti
Michele Ceriotti
Selecting the most relevant features and samples out of a large set of candidates is a task that occurs very often in the context of automated data analysis, where it improves the computational performance and often the transferability of a model. Here we focus on two popular subselection schemes applied to this end: CUR decomposition, derived from a low-rank approximation of the feature matrix, and farthest point sampling (FPS), which relies on the iterative identification of the most diverse samples and discriminating features. We modify these unsupervised approaches, incorporating a supervised component following the same spirit as the principal covariates (PCov) regression method. We show how this results in selections that perform better in supervised tasks, demonstrating with models of increasing complexity, from ridge regression to kernel ridge regression and finally feed-forward neural networks. We also present adjustments to minimise the impact of any subselection when performing unsupervised tasks. We demonstrate the significant improvements associated with PCov-CUR and PCov-FPS selections for applications to chemistry and materials science, typically reducing by a factor of two the number of features and samples required to achieve a given level of regression accuracy.

16 September 2025 in Physical Review Letters
Verified
Journal Article
Closed access
YLYao Luo
Yao Luo
DMDhruv Mangtani
Dhruv Mangtani
SPShiyu Peng
Shiyu Peng
JYJia Yao
Jia Yao
SKSergei Kliavinek
Sergei Kliavinek
MBMarco Bernardi
Marco Bernardi
Phonon interactions from lattice anharmonicity govern thermal properties and heat transport in materials. These interactions are described by nth order interatomic force constants (nIFCs), which can be viewed as high-dimensional tensors correlating the motion of n atoms, or equivalently encoding n-phonon scattering processes in momentum space. Here, we introduce a tensor decomposition to efficiently compress nIFCs for arbitrary order n. Using tensor learning, we find optimal low-rank approximations of nIFCs by solving the resulting optimization problem. Our approach reveals the inherent low dimensionality of phonon-phonon interactions and allows compression of the three- and four-IFC tensors by factors of up to 10^{3}-10^{4} while retaining high accuracy in calculations of phonon scattering rates and thermal conductivity. Calculations of thermal conductivity using the compressed nIFCs achieve a speedup by nearly 3 orders of magnitude with >98% accuracy relative to the reference uncompressed solution. These calculations include both three- and four-phonon scattering and are shown for a diverse range of materials (Si, HgTe, MgO, TiNiSn, and ZrO_{2}). In addition to accelerating state-of-the-art thermal transport calculations, the method shown here paves the way for modeling strongly anharmonic materials and higher-order phonon interactions.