It's The Best Only When It Fits You Most: Finding Related Models For Serving Based On Dynamic Locality Sensitive Hashing

Abstract

In recent, deep learning has become the most popular direction in machine learning and artificial intelligence. However, preparation of training data is often a bottleneck in the lifecycle of deploying a deep learning model for production or research. Reusing models for inferencing a dataset can greatly save the human costs required for training data creation. Although there exist a number of model sharing platform such as TensorFlow Hub, PyTorch Hub, DLHub, most of these systems require model uploaders to manually specify the details of each model and model downloaders to screen keyword search results for selecting a model. They are in lack of an automatic model searching tool. This paper proposes an end-to-end process of searching related models for serving based on the similarity of the target dataset and the training datasets of the available models. While there exist many similarity measurements, we study how to efficiently apply these metrics without pair-wise comparison and comp

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyzhou2020it

Related papers

• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Experimental Analysis Of Machine Learning Techniques For Finding Search Radius In Locality Sensitive Hashing (2022)0.00
• Joint Modeling And Optimization Of Search And Recommendation (2018)0.00
• Deep Hashing Network For Unsupervised Domain Adaptation (2017)6.77
• A Survey On Deep Hashing Methods (2020)16.84
• Dual-level Semantic Transfer Deep Hashing For Efficient Social Image Retrieval (2020)12.33
• Sketches Image Analysis: Web Image Search Engine Usinglsh Index And DNN Inceptionv3 (2021)0.00
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26