arXiv:2410.03969
공식 코드 · Papers with Code
Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky
원문 초록
Randomly pivoted Cholesky (RPCholesky) is an algorithm for constructing a low-rank approximation of a positive-semidefinite matrix using a small number of columns. This paper develops an accelerated version of RPCholesky that employs block matrix computations and rejection sampling to efficiently simulate the execution of the original algorithm. For the task of approximating a kernel matrix, the accelerated algorithm can run over $40\times$ faster. The paper contains implementation details, theoretical guarantees, experiments on benchmark data sets, and an application to computational chemistry.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Unlocking Chemical Insights: Superior Molecular Representations from Intermediate Encoder Layers
Efficient and Scalable Density Functional Theory Hamiltonian Prediction through Adaptive Sparsity
Towards Fast, Specialized Machine Learning Force Fields: Distilling Foundation Models via Energy Hessians
Mitigating Exposure Bias in Score-Based Generation of Molecular Conformations
Instruction-Based Molecular Graph Generation with Unified Text-Graph Diffusion Model
Physics-Informed Weakly Supervised Learning for Interatomic Potentials
토론
이 논문과 연결된 포럼 글이 아직 없습니다.