DistDNAS: Search Efficient Feature Interactions within 2 Hours
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908281746751488 |
|---|---|
| author | Zhang, Tunhou Wen, Wei Fedorov, Igor Liu, Xi Zhang, Buyun Han, Fangqiu Chen, Wen-Yen Han, Yiping Yan, Feng Li, Hai Chen, Yiran |
| author_facet | Zhang, Tunhou Wen, Wei Fedorov, Igor Liu, Xi Zhang, Buyun Han, Fangqiu Chen, Wen-Yen Han, Yiping Yan, Feng Li, Hai Chen, Yiran |
| contents | Search efficiency and serving efficiency are two major axes in building feature interactions and expediting the model development process in recommender systems. On large-scale benchmarks, searching for the optimal feature interaction design requires extensive cost due to the sequential workflow on the large volume of data. In addition, fusing interactions of various sources, orders, and mathematical operations introduces potential conflicts and additional redundancy toward recommender models, leading to sub-optimal trade-offs in performance and serving cost. In this paper, we present DistDNAS as a neat solution to brew swift and efficient feature interaction design. DistDNAS proposes a supernet to incorporate interaction modules of varying orders and types as a search space. To optimize search efficiency, DistDNAS distributes the search and aggregates the choice of optimal interaction modules on varying data dates, achieving over 25x speed-up and reducing search cost from 2 days to 2 hours. To optimize serving efficiency, DistDNAS introduces a differentiable cost-aware loss to penalize the selection of redundant interaction modules, enhancing the efficiency of discovered feature interactions in serving. We extensively evaluate the best models crafted by DistDNAS on a 1TB Criteo Terabyte dataset. Experimental evaluations demonstrate 0.001 AUC improvement and 60% FLOPs saving over current state-of-the-art CTR models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_00231 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | DistDNAS: Search Efficient Feature Interactions within 2 Hours Zhang, Tunhou Wen, Wei Fedorov, Igor Liu, Xi Zhang, Buyun Han, Fangqiu Chen, Wen-Yen Han, Yiping Yan, Feng Li, Hai Chen, Yiran Information Retrieval Machine Learning Search efficiency and serving efficiency are two major axes in building feature interactions and expediting the model development process in recommender systems. On large-scale benchmarks, searching for the optimal feature interaction design requires extensive cost due to the sequential workflow on the large volume of data. In addition, fusing interactions of various sources, orders, and mathematical operations introduces potential conflicts and additional redundancy toward recommender models, leading to sub-optimal trade-offs in performance and serving cost. In this paper, we present DistDNAS as a neat solution to brew swift and efficient feature interaction design. DistDNAS proposes a supernet to incorporate interaction modules of varying orders and types as a search space. To optimize search efficiency, DistDNAS distributes the search and aggregates the choice of optimal interaction modules on varying data dates, achieving over 25x speed-up and reducing search cost from 2 days to 2 hours. To optimize serving efficiency, DistDNAS introduces a differentiable cost-aware loss to penalize the selection of redundant interaction modules, enhancing the efficiency of discovered feature interactions in serving. We extensively evaluate the best models crafted by DistDNAS on a 1TB Criteo Terabyte dataset. Experimental evaluations demonstrate 0.001 AUC improvement and 60% FLOPs saving over current state-of-the-art CTR models. |
| title | DistDNAS: Search Efficient Feature Interactions within 2 Hours |
| topic | Information Retrieval Machine Learning |
| url | https://arxiv.org/abs/2311.00231 |