[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-127945-en":3,"doc-seo-127945-105":30,"detail-sidebar-cat-0-en-105":92},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":27,"seo_description":14,"update_tm":28,"read_time":29},127945,687207024643,"Oliver","https://ap-avatar.wpscdn.com/davatar_3d24733baf745e90a7e4bdd5f77d97b2",8,"Research & Report","Scalable and Efficient Comparison-based Search without Features - LEARN2SEARCH 框架与噪声比较检索方法","研究利用成对比较获取目标对象 t：通过“在一对对象(i,j)中，哪个更接近 t”的对比提问，oracle 基于潜在特征空间给出带噪声的回答。首先在非盲设定中，特征可见，提出一种具有低计算复杂度且查询高效的贝叶斯比较检索算法，并证明最优查询形式及几乎必然收敛。随后在盲设定中，特征隐藏于算法之外，结合新的分布式三元组嵌入学习，构建可扩展框架 LEARN2SEARCH，并在两个真实数据集上展示查询复杂度与非盲相当的效果；同时通过用户检索电影演员实验验证有效性。","Scalable and Efficient Comparison-based Search without Features  \nDaniyar Chumbalov 1 Lucas Maystre 2 Matthias Grossglauser 1  \nAbstract  \nWe consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i; j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generates noisy answers. First, we consider the non-blind setting where these features are accessible. We propose a new Bayesian comparison-based search algorithm with noisy answers; it has low computational complexity yet is efficient in the number of queries. We provide theoretical guarantees, deriving the form of the optimal query and proving almost sure convergence to the target t. Second, we consider the blind setting, where the object features are hidden from the search algorithm.  \nIn this setting, we combine our search method and a new distributional triplet embedding algorithm into one scalable learning framework called LEARN2SEARCH. We show that the query complexity of our approach on two real-world datasets is on par with the non-blind setting, which is not achievable using any of the current state-of-theart embedding methods. Finally, we demonstrate the efficacy of our framework by conducting an experiment with users searching for movie actors.  \n1. Introduction  \nFinding a target object among a large collection of n objects is the central problem addressed in information retrieval (IR) . For example, in web search, one finds relevant webpages through a query expressed as one or several keywords. Of course, the form of the query depends on the object type; other forms of search queries in the literature include finding images similar to a query image (Datta et al., 2008), and finding subgraphs of a large network isomorphic to a query graph (Sun et al., 2012) . A common feature of this classic  \n1 School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland. 2 Spotify. Correspondence to: Daniyar Chumbalov \u003Cdaniyar.chumbalov@epfl.ch> .  \nProceedings of the 37th International Conference on Machine Learning, Online, PMLR 119, 2020 . Copyright 2020 by the author(s) .  \nformulation of the search problem is the need to express a meaningful query. However, this is often a non-trivial task for a human user. For example, most people would struggle to draw the face of a friend accurately enough that it could be used as a query image. But they would be able to confirm with near-total certainty whether a photograph is of their friend—we have no real doppelgängers in the world. In other words, comparing is cognitively much easier than formulating a query. This is true for many complex or unstructured types of data, such as music, abstract concepts, images, videos, flavors, etc.  \nIn this work, we develop models and algorithms for searching a large database by comparing a sequence of sample objects relative to the target, thereby obviating the need for any explicit query. The central problem concerns the choice of the sequence of samples (e.g., pairs of faces that the user compares with a target face she remembers) . These query objects have to be chosen in such a way that we learn as much as possible about the target, i.e., shrink the set of potential targets as quickly as possible. This is closely related to a classic problem in active learning (Settles, 2012; MacKay, 1992), assuming we have a meaningful set of features available for each object in the database.  \nIt is natural to assume that the universe of objects lives in some low-dimensional latent feature space, even thoughthe raw objects might be high-dimensional (images, videos, sequences of musical notes, etc.) . For example, a human face, for the purposes of a similarity comparison, could be quite accurately described by a few tens of features, capturing head shape, eye color, fullness of lips, gender, age, and the like (Chang & Tsao, 2017) .  \nThe key component of our framework is a n","cbCaiur6PyV37RG5","https://ap.wps.com/l/cbCaiur6PyV37RG5","pdf",646046,1,11,"English","en",105,"# Abstract\n# Introduction","[{\"question\":\"该研究如何通过比较问题来定位目标对象 t？\",\"answer\":\"通过向 oracle 询问“在对象(i,j)中哪个更接近目标 t”的成对比较问题，利用目标与对象在潜在特征空间中的相对相似性来逐步缩小候选集合。\"},{\"question\":\"非盲设定中提出的检索算法有哪些理论保证？\",\"answer\":\"在特征可见的非盲设定下，算法给出最优查询形式，并证明与目标 t 的几乎必然收敛；同时还强调其具有低计算复杂度与高查询效率。\"},{\"question\":\"盲设定下如何在特征不可见时仍提升检索效率？\",\"answer\":\"将搜索方法与分布式三元组嵌入算法结合，构建 LEARN2SEARCH，通过利用历史搜索逐步学习并改进对象的潜在嵌入，使后续搜索所需查询次数更少。\"}]","Scalable and Efficient Comparison-based Search without Features - LEARN2SEARCH 框架与噪声比较检索方法 | PDF",1785943158,28,{"code":4,"msg":31,"data":32},"ok",{"site_id":24,"language":23,"slug":33,"title":13,"keywords":34,"description":14,"schema_data":35,"social_meta":87,"head_meta":89,"extra_data":91,"updated_unix":28},"scalable-and-efficient-comparison-based-search-without-features-learn2search-framework-and-noisy-comparison-search-method","",{"@graph":36,"@context":86},[37,54,69],{"@type":38,"itemListElement":39},"BreadcrumbList",[40,44,48,51],{"item":41,"name":42,"@type":43,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":45,"name":46,"@type":43,"position":47},"https://docshare.wps.com/document/","Document",2,{"item":49,"name":12,"@type":43,"position":50},"https://docshare.wps.com/document/research-report/",3,{"item":52,"name":13,"@type":43,"position":53},"https://docshare.wps.com/document/scalable-and-efficient-comparison-based-search-without-features-learn2search-framework-and-noisy-comparison-search-method/127945/",4,{"url":52,"name":13,"@type":55,"author":56,"headline":13,"publisher":58,"fileFormat":61,"inLanguage":23,"description":14,"dateModified":62,"datePublished":63,"encodingFormat":61,"isAccessibleForFree":64,"interactionStatistic":65},"DigitalDocument",{"name":9,"@type":57},"Person",{"url":41,"name":59,"@type":60},"DocShare","Organization","application/pdf","2026-08-25","2026-08-05",true,{"@type":66,"interactionType":67,"userInteractionCount":20},"InteractionCounter",{"@type":68},"ViewAction",{"@type":70,"mainEntity":71},"FAQPage",[72,78,82],{"name":73,"@type":74,"acceptedAnswer":75},"该研究如何通过比较问题来定位目标对象 t？","Question",{"text":76,"@type":77},"通过向 oracle 询问“在对象(i,j)中哪个更接近目标 t”的成对比较问题，利用目标与对象在潜在特征空间中的相对相似性来逐步缩小候选集合。","Answer",{"name":79,"@type":74,"acceptedAnswer":80},"非盲设定中提出的检索算法有哪些理论保证？",{"text":81,"@type":77},"在特征可见的非盲设定下，算法给出最优查询形式，并证明与目标 t 的几乎必然收敛；同时还强调其具有低计算复杂度与高查询效率。",{"name":83,"@type":74,"acceptedAnswer":84},"盲设定下如何在特征不可见时仍提升检索效率？",{"text":85,"@type":77},"将搜索方法与分布式三元组嵌入算法结合，构建 LEARN2SEARCH，通过利用历史搜索逐步学习并改进对象的潜在嵌入，使后续搜索所需查询次数更少。","https://schema.org",{"og:url":52,"og:type":88,"og:title":13,"og:site_name":59,"og:description":14},"article",{"robots":90,"canonical":52},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":93},[94,98,102,106,111,116,121,124,129,132,136],{"id":20,"doc_module":4,"doc_module_name":46,"category_name":95,"show_sort_weight":96,"slug":97},"Story & Novel",90,"story-novel",{"id":47,"doc_module":4,"doc_module_name":46,"category_name":99,"show_sort_weight":100,"slug":101},"Literature",80,"literature",{"id":53,"doc_module":4,"doc_module_name":46,"category_name":103,"show_sort_weight":104,"slug":105},"Exam",70,"exam",{"id":107,"doc_module":4,"doc_module_name":46,"category_name":108,"show_sort_weight":109,"slug":110},5,"Comic",60,"comic",{"id":112,"doc_module":4,"doc_module_name":46,"category_name":113,"show_sort_weight":114,"slug":115},6,"Technology",50,"technology",{"id":117,"doc_module":4,"doc_module_name":46,"category_name":118,"show_sort_weight":119,"slug":120},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":46,"category_name":12,"show_sort_weight":122,"slug":123},30,"research-report",{"id":125,"doc_module":4,"doc_module_name":46,"category_name":126,"show_sort_weight":127,"slug":128},9,"Religion & Spirituality",20,"religion-spirituality",{"id":127,"doc_module":4,"doc_module_name":46,"category_name":130,"show_sort_weight":127,"slug":131},"World Cup","world-cup",{"id":133,"doc_module":4,"doc_module_name":46,"category_name":134,"show_sort_weight":133,"slug":135},10,"Lifestyle","lifestyle",{"id":137,"doc_module":4,"doc_module_name":46,"category_name":138,"show_sort_weight":107,"slug":139},19,"General","general"]