{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-fashion-compatibility-with","title":"Learning Fashion Compatibility with Bidirectional LSTMs","arxiv_id":"1707.05691","date":"2017-07-18","proceeding":null,"authors":["Xintong Han","Zuxuan Wu","Yu-Gang Jiang","Larry S. Davis"],"abstract":"The ubiquity of online fashion shopping demands effective recommendation\nservices for customers. In this paper, we study two types of fashion\nrecommendation: (i) suggesting an item that matches existing components in a\nset to form a stylish outfit (a collection of fashion items), and (ii)\ngenerating an outfit with multimodal (images/text) specifications from a user.\nTo this end, we propose to jointly learn a visual-semantic embedding and the\ncompatibility relationships among fashion items in an end-to-end fashion. More\nspecifically, we consider a fashion outfit to be a sequence (usually from top\nto bottom and then accessories) and each item in the outfit as a time step.\nGiven the fashion items in an outfit, we train a bidirectional LSTM (Bi-LSTM)\nmodel to sequentially predict the next item conditioned on previous ones to\nlearn their compatibility relationships. Further, we learn a visual-semantic\nspace by regressing image features to their semantic representations aiming to\ninject attribute and category information as a regularization for training the\nLSTM. The trained network can not only perform the aforementioned\nrecommendations effectively but also predict the compatibility of a given\noutfit. We conduct extensive experiments on our newly collected Polyvore\ndataset, and the results provide strong qualitative and quantitative evidence\nthat our framework outperforms alternative methods.","url_abs":"http://arxiv.org/abs/1707.05691v1","url_pdf":"http://arxiv.org/pdf/1707.05691v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-fashion-compatibility-with","repo_url":"https://github.com/AemikaChow/DATASOURCE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"learning-fashion-compatibility-with","repo_url":"https://github.com/xthan/polyvore","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"attribute","task_name":"Attribute"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[{"slug":"polyvore","name":"Polyvore","full_name":"Polyvore Outfits"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1707.05691","atlas_url":"https://app.syntology.ai/?focus=1707.05691","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1707.05691"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1707.05691\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1707.05691"},"call":"get_concepts_for_paper(arxiv_id=\"1707.05691\")"}],"by_repo":[{"repo":"AemikaChow/DATASOURCE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xthan/polyvore","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"553c6171c65d6bca79c62c8c0b6f149d81e3683ca8e178393948903657af4d42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}