Low-rank kernel learning with Bregman matrix divergences
From MaRDI portal
Recommendations
Cited in
(47)- Multivariate GARCH estimation via a Bregman-proximal trust-region method
- Optimal Bayesian minimax rates for unconstrained large covariance matrices
- Estimation and empirical performance of non-scalar dynamic conditional correlation models
- Low-rank decomposition meets kernel learning: a generalized Nyström method
- Generalization of clustering agreements and distances for overlapping clusters and network communities
- Infinite-dimensional log-determinant divergences between positive definite trace class operators
- Online multiple kernel classification
- On foundation of statistical inference by C R Rao relating to information inequality
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Alpha-beta log-determinant divergences between positive definite trace class operators
- Efficient learning of supervised kernels with a graph-based loss function
- Metrics induced by Jensen-Shannon and related divergences on positive definite matrices
- Calmness of partial perturbation to composite rank constraint systems and its applications
- Riemannian preconditioning
- Coordinate Coding on the Riemannian Manifold of Symmetric Positive-Definite Matrices for Image Classification
- From covariance matrices to covariance operators: data representation from finite to infinite-dimensional settings
- Averaging symmetric positive-definite matrices
- Matrix Nearness Problems with Bregman Divergences
- Learning low-rank kernel matrices with column-based methods
- Geometry preserving multi-task metric learning
- Variational Gaussian approximation for Poisson data
- Likelihood geometry of correlation models
- Relative entropy optimization and its applications
- scientific article; zbMATH DE number 7523740 (Why is no real title available?)
- On farthest Bregman Voronoi cells
- Graph refinement via simultaneously low-rank and sparse approximation
- Learning data-adaptive non-parametric kernels
- Quantum entropic regularization of matrix-valued optimal transport
- Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
- Online learning in the embedded manifold of low-rank matrices
- Optimal Self-Concordant Barriers for Quantum Relative Entropies
- Unsupervised concept drift detection for time series on Riemannian manifolds
- Nonnegative Matrix Factorization and Log-Determinant Divergences
- Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem
- On the f-divergences between densities of a multivariate location or scale family
- Preconditioner design via Bregman divergences
- Penalized spline estimation of principal components for sparse functional data: rates of convergence
- Cross-sectional versus longitudinal designs for function estimation, with an application to cerebral cortex development
- On the partial convexification of the low-rank spectral optimization: rank bounds and algorithms
- On the partial convexification for low-rank spectral optimization: rank bounds and algorithms
- A Generalized Mean Approach for Distributed-PCA
- Infinite-dimensional distances and divergences between positive definite operators, Gaussian measures, and Gaussian processes
- Connecting Kaporin's condition number and the Bregman log determinant divergence
- Foundations of bare-simulation optimization of distances
- Distributed sketching on data partitions for OLS regression
- Optimal rates of convergence for sparse covariance matrix estimation
- Fast Gaussian kernel learning for classification tasks based on specially structured global optimization
This page was built for publication: Low-rank kernel learning with Bregman matrix divergences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880885)
