The following pages link to (Q2896069):
Displaying 17 items.
- Generalization bounds for metric and similarity learning (Q255367) (← links)
- Adaptive regularization of weight vectors (Q374184) (← links)
- Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (SGD) (Q493732) (← links)
- Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning (Q669277) (← links)
- Iterative 3D shape classification by online metric learning (Q1632342) (← links)
- Dyad ranking using Plackett-Luce models based on joint feature representations (Q1640577) (← links)
- Fuzzy collaborative clustering-based ranking approach for complex objects (Q1665820) (← links)
- Ground metric learning on graphs (Q2033291) (← links)
- Learning a distance metric from relative comparisons between quadruplets of images (Q2187430) (← links)
- Online Bayesian max-margin subspace learning for multi-view classification and regression (Q2303668) (← links)
- Online regularized learning with pairwise loss functions (Q2361154) (← links)
- The information-theoretic treatment of spinless particles with the assorted diatomic molecular potential (Q2668477) (← links)
- Low-Rank Online Metric Learning (Q3449325) (← links)
- (Q5053187) (← links)
- Guaranteed Classification via Regularized Similarity Learning (Q5378332) (← links)
- Online Pairwise Learning Algorithms (Q5380417) (← links)
- Optimistic reinforcement learning by forward Kullback-Leibler divergence optimization (Q6077011) (← links)