High-Order Tensor Regularization with Application to Attribute Ranking
Abstract
When learning functions on manifolds, we can improve performance by regularizing with respect to the intrinsic manifold geometry rather than the ambient space. However, when regularizing tensor learning, calculating the derivatives along this intrinsic geometry is not possible, and so existing approaches are limited to regularizing in Euclidean space. Our new method for intrinsically regularizing and learning tensors on Riemannian manifolds introduces a surrogate object to encapsulate the geometric characteristic of the tensor. Regularizing this instead allows us to learn non-symmetric and high-order tensors. We apply our approach to the relative attributes problem, and we demonstrate that explicitly regularizing high-order relationships between pairs of data points improves performance.
Cite
Text
Kim et al. "High-Order Tensor Regularization with Application to Attribute Ranking." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018. doi:10.1109/CVPR.2018.00457Markdown
[Kim et al. "High-Order Tensor Regularization with Application to Attribute Ranking." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018.](https://mlanthology.org/cvpr/2018/kim2018cvpr-highorder/) doi:10.1109/CVPR.2018.00457BibTeX
@inproceedings{kim2018cvpr-highorder,
title = {{High-Order Tensor Regularization with Application to Attribute Ranking}},
author = {Kim, Kwang In and Park, Juhyun and Tompkin, James},
booktitle = {Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2018},
doi = {10.1109/CVPR.2018.00457},
url = {https://mlanthology.org/cvpr/2018/kim2018cvpr-highorder/}
}