scientific article; zbMATH DE number 6276110
From MaRDI portal
Publication:5405107
zbMath1283.68309MaRDI QIDQ5405107
Publication date: 1 April 2014
Full work available at URL: http://www.jmlr.org/papers/v13/ying12a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convex optimizationeigenvalue optimizationsemi-definite programmingface verificationmatrix factorizationmetric learningfirst-order methods
Related Items (20)
Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators ⋮ Online regularized learning with pairwise loss functions ⋮ A nearest-neighbor search model for distance metric learning ⋮ Software defect prediction model based on distance metric learning ⋮ Geometry preserving multi-task metric learning ⋮ Multi-manifold discriminant Isomap for visualization and classification ⋮ \(\mathrm{OPM^2L}\): an optimal instance partition-based multi-metric learning method for heterogeneous dataset classification ⋮ A fast diagonal distance metric learning approach for large-scale datasets ⋮ NN-EVCLUS: neural network-based evidential clustering ⋮ Error analysis of kernel regularized pairwise learning with a strongly convex loss ⋮ An efficient method for clustered multi-metric learning ⋮ Online Pairwise Learning Algorithms ⋮ Stability and optimization error of stochastic gradient descent for pairwise learning ⋮ Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction ⋮ Robust pairwise learning with Huber loss ⋮ Model-aware categorical data embedding: a data-driven approach ⋮ Supervised distance metric learning through maximization of the Jeffrey divergence ⋮ Joint distance and similarity measure learning based on triplet-based constraints ⋮ Online regularized pairwise learning with least squares loss ⋮ Generalization bounds for metric and similarity learning
This page was built for publication:
