Geometry preserving multi-task metric learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 1391247 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A course in metric geometry
- Clustering with Bregman divergences.
- Completely positive maps and entropy inequalities
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convex Analysis on the Hermitian Matrices
- Convex multi-task feature learning
- Distance metric learning for large margin nearest neighbor classification
- Distance metric learning with eigenvalue optimization
- Distinguishing quantum operations having few Kraus operators
- Flexible latent variable models for multi-task learning
- From joint convexity of quantum relative entropy to a concavity theorem of Lieb
- Inequalities: theory of majorization and its applications
- Joint and separate convexity of the Bregman distance.
- Low-rank kernel learning with Bregman matrix divergences
- Matrix Analysis
- Matrix Nearness Problems with Bregman Divergences
- Pathwise coordinate optimization
- Quantum computation and quantum information. 10th anniversary edition
Cited in
(4)
This page was built for publication: Geometry preserving multi-task metric learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374164)