{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T20:34:58Z","timestamp":1776112498817,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T00:00:00Z","timestamp":1500508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26240027, 26-8574"],"award-info":[{"award-number":["26240027, 26-8574"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2017,8,31]]},"abstract":"<jats:p>\n            Parameter tweaking is a common task in various design scenarios. For example, in color enhancement of photographs, designers tweak multiple parameters such as \"brightness\" and \"contrast\" to obtain the best visual impression. Adjusting one parameter is easy; however, if there are multiple correlated parameters, the task becomes much more complex, requiring many trials and a large cognitive load. To address this problem, we present a novel extension of\n            <jats:italic>Bayesian optimization<\/jats:italic>\n            techniques, where the system decomposes the entire parameter tweaking task into a sequence of one-dimensional\n            <jats:italic>line search<\/jats:italic>\n            queries that are easy for human to perform by manipulating a single slider. In addition, we present a novel concept called\n            <jats:italic>crowd-powered visual design optimizer<\/jats:italic>\n            , which queries crowd workers, and provide a working implementation of this concept. Our\n            <jats:italic>single-slider manipulation<\/jats:italic>\n            microtask design for crowdsourcing accelerates the convergence of the optimization relative to existing comparison-based microtask designs. We applied our framework to two different design domains: photo color enhancement and material BRDF design, and thereby showed its applicability to various design domains.\n          <\/jats:p>","DOI":"10.1145\/3072959.3073598","type":"journal-article","created":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T12:24:07Z","timestamp":1500639847000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Sequential line search for efficient visual design optimization by crowds"],"prefix":"10.1145","volume":"36","author":[{"given":"Yuki","family":"Koyama","sequence":"first","affiliation":[{"name":"The University of Tokyo"}]},{"given":"Issei","family":"Sato","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]},{"given":"Daisuke","family":"Sakamoto","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]},{"given":"Takeo","family":"Igarashi","sequence":"additional","affiliation":[{"name":"The University of Tokyo"}]}],"member":"320","published-online":{"date-parts":[[2017,7,20]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Proc. NIPS '10","author":"Azimi Javad","unstructured":"Javad Azimi , Alan Fern , and Xiaoli Z. Fern . 2010. Batch Bayesian Optimization via Simulation Matching . In Proc. NIPS '10 . 109--117. http:\/\/papers.nips.cc\/paper\/4083-batch-bayesian-optimization-via-simulation-matching.pdf Javad Azimi, Alan Fern, and Xiaoli Z. Fern. 2010. Batch Bayesian Optimization via Simulation Matching. In Proc. NIPS '10. 109--117. http:\/\/papers.nips.cc\/paper\/4083-batch-bayesian-optimization-via-simulation-matching.pdf"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2047196.2047201"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/2334029"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.2312\/SCA\/SCA10\/103-112"},{"key":"e_1_2_2_5_1","unstructured":"Eric Brochu Vlad M. Cora and Nando de Freitas. 2010b. A Tutorial on Bayesian Optimization of Expensive Cost Functions with Application to Active User Modeling and Hierarchical Reinforcement Learning. (2010). arXiv:1012.2599.  Eric Brochu Vlad M. Cora and Nando de Freitas. 2010b. A Tutorial on Bayesian Optimization of Expensive Cost Functions with Application to Active User Modeling and Hierarchical Reinforcement Learning. (2010). arXiv:1012.2599."},{"key":"e_1_2_2_6_1","volume-title":"Proc. NIPS '07","author":"Brochu Eric","year":"2007","unstructured":"Eric Brochu , Nando de Freitas , and Abhijeet Ghosh . 2007 . Active Preference Learning with Discrete Choice Data . In Proc. NIPS '07 . 409--416. http:\/\/papers.nips.cc\/paper\/3219-active-preference-learning-with-discrete-choice-data.pdf Eric Brochu, Nando de Freitas, and Abhijeet Ghosh. 2007. Active Preference Learning with Discrete Choice Data. In Proc. NIPS '07. 409--416. http:\/\/papers.nips.cc\/paper\/3219-active-preference-learning-with-discrete-choice-data.pdf"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995413"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501988.2502008"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2078245.2078246"},{"key":"e_1_2_2_10_1","first-page":"4053","article-title":"Parallelizing Exploration-Exploitation Tradeoffs in Gaussian Process Bandit Optimization","volume":"15","author":"Desautels Thomas","year":"2014","unstructured":"Thomas Desautels , Andreas Krause , and Joel W. Burdick . 2014 . Parallelizing Exploration-Exploitation Tradeoffs in Gaussian Process Bandit Optimization . Journal of Machine Learning Research 15 (2014), 4053 -- 4103 . http:\/\/jmlr.org\/papers\/v15\/desautels14a.html Thomas Desautels, Andreas Krause, and Joel W. Burdick. 2014. Parallelizing Exploration-Exploitation Tradeoffs in Gaussian Process Bandit Optimization. Journal of Machine Learning Research 15 (2014), 4053--4103. http:\/\/jmlr.org\/papers\/v15\/desautels14a.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601131"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2231816.2231817"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964965"},{"key":"e_1_2_2_14_1","volume-title":"Clustering Crowds. In Proc. AAAI '13","author":"Kajino Hiroshi","year":"2013","unstructured":"Hiroshi Kajino , Yuta Tsuboi , and Hisashi Kashima . 2013 . Clustering Crowds. In Proc. AAAI '13 . 1120--1127. http:\/\/dl.acm.org\/citation.cfm?id=2891460.2891616 Hiroshi Kajino, Yuta Tsuboi, and Hisashi Kashima. 2013. Clustering Crowds. In Proc. AAAI '13. 1120--1127. http:\/\/dl.acm.org\/citation.cfm?id=2891460.2891616"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642918.2647386"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858036.2858111"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.2312\/pg.20161326"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866029.1866040"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766898"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766929"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258887"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2343483.2343493"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383894.2383945"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964958"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601110"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979148"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556288.2557052"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/lnms\/1215456182"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2019627.2019628"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2980242"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/col.20070"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/127719.122752"},{"key":"e_1_2_2_35_1","volume-title":"Proc. NIPS '12","author":"Snoek Jasper","year":"2012","unstructured":"Jasper Snoek , Hugo Larochelle , and Ryan P Adams . 2012 . Practical Bayesian Optimization of Machine Learning Algorithms . In Proc. NIPS '12 . 2951--2959. http:\/\/papers.nips.cc\/paper\/4522-practical-bayesian-optimization-of-machine-learning-algorithms.pdf Jasper Snoek, Hugo Larochelle, and Ryan P Adams. 2012. Practical Bayesian Optimization of Machine Learning Algorithms. In Proc. NIPS '12. 2951--2959. http:\/\/papers.nips.cc\/paper\/4522-practical-bayesian-optimization-of-machine-learning-algorithms.pdf"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897824.2925981"},{"key":"e_1_2_2_37_1","volume-title":"Gupta","author":"Tsukida Kristi","year":"2011","unstructured":"Kristi Tsukida and Maya R . Gupta . 2011 . How to Analyze Paired Comparison Data. Technical Report. University of Washington . https:\/\/www2.ee.washington.edu\/techsite\/papers\/refer\/UWEETR-2011-0004.html Kristi Tsukida and Maya R. Gupta. 2011. How to Analyze Paired Comparison Data. Technical Report. University of Washington. https:\/\/www2.ee.washington.edu\/techsite\/papers\/refer\/UWEETR-2011-0004.html"},{"key":"e_1_2_2_39_1","volume-title":"Proc. HCOMP '14","author":"Wilber Michael J.","unstructured":"Michael J. Wilber , Iljung S. Kwak , and Serge J. Belongie . 2014. Cost-Effective HITs for Relative Similarity Comparisons . In Proc. HCOMP '14 . http:\/\/www.aaai.org\/ocs\/index.php\/HCOMP\/HCOMP14\/paper\/view\/8954 Michael J. Wilber, Iljung S. Kwak, and Serge J. Belongie. 2014. Cost-Effective HITs for Relative Similarity Comparisons. In Proc. HCOMP '14. http:\/\/www.aaai.org\/ocs\/index.php\/HCOMP\/HCOMP14\/paper\/view\/8954"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979147"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766908"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661229.2661287"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3072959.3073598","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3072959.3073598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:37:23Z","timestamp":1750217843000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3072959.3073598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,20]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8,31]]}},"alternative-id":["10.1145\/3072959.3073598"],"URL":"https:\/\/doi.org\/10.1145\/3072959.3073598","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,20]]},"assertion":[{"value":"2017-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}