Research map / Label-efficient and robust learning / Recognition and long-tail
The Dilemma of TriHard Loss and an Element-Weighted TriHard Loss for Person Re-Identification
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Mathematical Justification of Hard Negative Mining via Isometric Approximation Theorem (ICLR 2024 · similarity 0.86)
- Beyond Triplet Loss: A Deep Quadruplet Network for Person Re-Identification (CVPR 2017 · similarity 0.83)
- Hierarchical Clustering With Hard-Batch Triplet Loss for Person Re-Identification (CVPR 2020 · similarity 0.82)
- A Theoretically Sound Upper Bound on the Triplet Loss for Improving the Efficiency of Deep Distance Metric Learning (CVPR 2019 · similarity 0.82)
- Adaptive Sparse Pairwise Loss for Object Re-Identification (CVPR 2023 · similarity 0.82)
- Thumb on the Scale: Optimal Loss Weighting in Last Layer Retraining (NeurIPS 2025 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.