EUVIMEDEUVIMED entdecken
Crossref

Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach

Difeng Cai, Edmond Chow, Yuanzhe Xi

Numerical Linear Algebra with Applications · 2023-12 · 30 (6)

DOI: 10.1002/nla.2519 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Linear Algebra with Applications, online erschienen am 04.07.2023. Verfasst von Difeng Cai und 2 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 60 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A general, rectangular kernel matrix may be defined as where is a kernel function and where and are two sets of points. In this paper, we seek a low‐rank approximation to a kernel matrix where the sets of points and are large and are arbitrarily distributed, such as away from each other, “intermingled”, identical, and so forth. Such rectangular kernel matrices may arise, for example, in Gaussian process regression where corresponds to the training data and corresponds to the test data. In this case, the points are often high‐dimensional. Since the point sets are large, we must exploit the fact that the matrix arises from a kernel function, and avoid forming the matrix, and thus ruling out most algebraic techniques. In particular, we seek methods that can scale linearly or nearly linearly with respect to the size of data for a fixed approximation rank. The main idea in this paper is to geometrically select appropriate subsets of points to construct a low rank approximation. An analysis in this paper guides how this selection should be performed.

Zitieren

APA

Cai, D., Chow, E., & Xi, Y. (2023). Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach. Numerical Linear Algebra with Applications, 30(6). https://doi.org/10.1002/nla.2519

Vancouver

Cai D, Chow E, Xi Y. Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach. Numerical Linear Algebra with Applications. 2023;30(6). doi:10.1002/nla.2519

BibTeX
@article{Cai2023,
  author = {Cai, Difeng and Chow, Edmond and Xi, Yuanzhe},
  title = {Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach},
  journal = {Numerical Linear Algebra with Applications},
  year = {2023},
  volume = {30},
  number = {6},
  doi = {10.1002/nla.2519}
}
Kostenlos starten →