Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Bucketing Ranking-Based Losses For Efficient Training of Object Detectors
Download
MS_Thesis___Feyza_Yavuz-8.pdf
Date
2025-1-10
Author
Yavuz, Feyza
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
44
views
20
downloads
Cite This
Object detection is a fundamental computer vision task that focuses on classifying and locating objects in an image. Classification and localization of objects are commonly supervised with score-based loss functions, e.g., Cross-entropy Loss for classification and L1 Loss for localization. On the other hand, ranking-based loss functions, such as Average Precision Loss and Rank&Sort Loss, better align with the evaluation criteria, have fewer hyperparameters, and offer robustness against the imbalance between positive and negative samples. However, they require pairwise comparisons among P positive and N negative predictions, introducing a time complexity of O(PN), which is prohibitive since N is often large. Despite their advantages, the widespread adoption of ranking-based losses has been hindered by their high time and space complexities. In this thesis, we focus on improving the efficiency of ranking-based loss functions. To this end, we propose Bucketed Ranking-based (BR) Losses which group negatives into B buckets to reduce the number of pairwise comparisons. Thanks to bucketing, our method reduces the time complexity to O(Nlog(N)). To validate our approach, we conducted experiments on two different tasks, three different datasets, seven different detectors. We show that BR Losses yield the same accuracy with their unbucketed versions and provide 2x faster training on average. Lower complexity of BR Losses enable us to train, for the first time, transformer-based object detectors using a ranking-based loss. When we train CoDETR, a state-of-the-art transformer-based object detector, we consistently outperform its original results over several different backbones.
Subject Keywords
Object Detection
,
Detection Transformers
,
Deep Learning
,
Ranking-based Loss Functions
,
Loss Functions
URI
https://hdl.handle.net/11511/113453
Collections
Graduate School of Natural and Applied Sciences, Thesis
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. Yavuz, “Bucketing Ranking-Based Losses For Efficient Training of Object Detectors,” M.S. - Master of Science, Middle East Technical University, 2025.