The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
Low-Rank Kernel Learning with Bregman Matrix Divergences
Abstract
In this paper, we study low-rank matrix nearness problems, with a focus on learning low-rank positive semidefinite (kernel) matrices for machine learning applications. We propose efficient algorithms that scale linearly in the number of data points and quadratically in the rank of the input matrix. Existing algorithms for learning kernel matrices often scale poorly, with running times that are cubic in the number of data points. We employ Bregman matrix divergences as the measures of nearness—these divergences are natural for learning low-rank kernels since they preserve rank as well as positive semidefiniteness. Special cases of our framework yield faster algorithms for various existing learning problems, and experimental results demonstrate that our algorithms can effectively learn both low-rank and full-rank kernel matrices.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Cited by
Large Scale Online Learning of Image Similarity through Ranking
Chechik, G., Sharma, V., Shalit, U., & Bengio, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02172-5_2 · Cited by 722
Locally Aligned Feature Transforms across Views
Li, W., & Wang, X. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.461 · Cited by 574
Kulis, B. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601986979 · Cited by 482
Self-citationLearning With Augmented Features for Supervised and Semi-Supervised Heterogeneous Domain Adaptation
Li, W., Duan, L., Xu, D., & Tsang, I. W. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.167 · Cited by 449
Vector field-based support vector regression for building energy consumption prediction
Zhong, H., Wang, J., Jia, H., Mu, Y., & Lv, S. (2019) · Applied Energy · doi:10.1016/j.apenergy.2019.03.078 · Cited by 386
Metadata
- Authors
- Kulis, B., Sustik, M. A., & Dhillon, I. S.
- Published
- 2009-12-01
- Volume
- 10
- Issue
- 13
- Pages
- 341-376
- DOI
- 10.5555/1577069.1577082
- OpenAlex
- W2097939965
- Cited by
- 222
- References
- 1
- FWCI
- 17.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Rank Kernel Learning with Bregman Matrix Divergences. https://app.cochat.ai/papers/10.5555/1577069.1577082
- The paper
- Kulis, B., Sustik, M. A., & Dhillon, I. S. (2009). Low-Rank Kernel Learning with Bregman Matrix Divergences. https://doi.org/10.5555/1577069.1577082
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.