{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:55:32Z","timestamp":1742961332551,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031306778"},{"type":"electronic","value":"9783031306785"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30678-5_35","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T09:03:17Z","timestamp":1681376597000},"page":"477-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["AntTune: An Efficient Distributed Hyperparameter Optimization System for\u00a0Large-Scale Data"],"prefix":"10.1007","author":[{"given":"Jun","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Qitao","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Longfei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"key":"35_CR1","unstructured":"Bergstra, J., Yamins, D., Cox, D.: Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures. In: ICML, pp. 115\u2013123. PMLR (2013)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: Xgboost: a scalable tree boosting system. In: SIGKDD, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, H.T., Koc, L., Harmsen, J., et al.: Wide & deep learning for recommender systems. In: DLRS, pp. 7\u201310 (2016)","DOI":"10.1145\/2988450.2988454"},{"key":"35_CR4","unstructured":"Erickson, N., Mueller, J., Shirkov, A., et al.: Autogluon-tabular: robust and accurate automl for structured data. arXiv preprint arXiv:2003.06505 (2020)"},{"key":"35_CR5","series-title":"The Springer Series on Challenges in Machine Learning","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-05318-5_6","volume-title":"Automated Machine Learning","author":"M Feurer","year":"2019","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J.T., Blum, M., Hutter, F.: Auto-sklearn: efficient and robust automated machine learning. In: Hutter, F., Kotthoff, L., Vanschoren, J. (eds.) Automated Machine Learning. TSSCML, pp. 113\u2013134. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05318-5_6"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Jin, H., Song, Q., Hu, X.: Auto-keras: an efficient neural architecture search system. In: SIGK, pp. 1946\u20131956 (2019)","DOI":"10.1145\/3292500.3330648"},{"key":"35_CR8","unstructured":"Kandasamy, K., Vysyaraju, K.R., Neiswanger, W., et al.: Tuning hyperparameters without grad students: scalable and robust bayesian optimisation with dragonfly. arXiv preprint arXiv:1903.06694 (2019)"},{"issue":"1","key":"35_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/bioinformatics\/btz470","volume":"36","author":"TT Le","year":"2020","unstructured":"Le, T.T., Fu, W., Moore, J.H.: Scaling tree-based automated machine learning to biomedical big data with a feature set selector. Bioinformatics 36(1), 250\u2013256 (2020)","journal-title":"Bioinformatics"},{"key":"35_CR10","first-page":"230","volume":"2","author":"L Li","year":"2020","unstructured":"Li, L., Jamieson, K., Rostamizadeh, A., et al.: A system for massively parallel hyperparameter tuning. MLSys 2, 230\u2013246 (2020)","journal-title":"MLSys"},{"issue":"1","key":"35_CR11","first-page":"6765","volume":"18","author":"L Li","year":"2017","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., et al.: Hyperband: a novel bandit-based approach to hyperparameter optimization. JMLR 18(1), 6765\u20136816 (2017)","journal-title":"JMLR"},{"key":"35_CR12","unstructured":"Microsoft: Neural Network Intelligence. https:\/\/github.com\/microsoft\/nni, Accessed 30 July 2022"},{"key":"35_CR13","unstructured":"Salesforce: Transmogrifai\u2019s documentation. https:\/\/transmogrif.ai\/. Accessed 8 July 2022"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Thornton, C., Hutter, F., Hoos, H.H., et al.: Auto-weka: combined selection and hyperparameter optimization of classification algorithms. In: SIGKDD, pp. 847\u2013855 (2013)","DOI":"10.1145\/2487575.2487629"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Yu, Y., Qian, H., Hu, Y.Q.: Derivative-free optimization via classification. In: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10289"},{"key":"35_CR16","unstructured":"Zhou, J., Velichkevich, A., Prosvirov, K., Garg, A., Oshima, Y., Dutta, D.: Katib: a distributed general automl platform on kubernetes. In: OpML, pp. 55\u201357 (2019)"},{"issue":"9","key":"35_CR17","doi-asserted-by":"publisher","first-page":"3079","DOI":"10.1109\/TPAMI.2021.3067763","volume":"43","author":"L Zimmer","year":"2021","unstructured":"Zimmer, L., Lindauer, M., Hutter, F.: Auto-pytorch: multi-fidelity metalearning for efficient and robust autodl. IEEE TPAMI 43(9), 3079\u20133090 (2021)","journal-title":"IEEE TPAMI"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30678-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:35:58Z","timestamp":1709818558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30678-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306778","9783031306785"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30678-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}