{"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-deep-nearest-neighbor","title":"Learning Deep Nearest Neighbor Representations Using Differentiable Boundary Trees","arxiv_id":"1702.08833","date":"2017-02-28","proceeding":null,"authors":["Daniel Zoran","Balaji Lakshminarayanan","Charles Blundell"],"abstract":"Nearest neighbor (kNN) methods have been gaining popularity in recent years\nin light of advances in hardware and efficiency of algorithms. There is a\nplethora of methods to choose from today, each with their own advantages and\ndisadvantages. One requirement shared between all kNN based methods is the need\nfor a good representation and distance measure between samples.\n  We introduce a new method called differentiable boundary tree which allows\nfor learning deep kNN representations. We build on the recently proposed\nboundary tree algorithm which allows for efficient nearest neighbor\nclassification, regression and retrieval. By modelling traversals in the tree\nas stochastic events, we are able to form a differentiable cost function which\nis associated with the tree's predictions. Using a deep neural network to\ntransform the data and back-propagating through the tree allows us to learn\ngood representations for kNN methods.\n  We demonstrate that our method is able to learn suitable representations\nallowing for very efficient trees with a clearly interpretable structure.","url_abs":"http://arxiv.org/abs/1702.08833v1","url_pdf":"http://arxiv.org/pdf/1702.08833v1.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-deep-nearest-neighbor","repo_url":"https://github.com/thadikari/differentiable-boundary-trees","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.08833","atlas_url":"https://app.syntology.ai/?focus=1702.08833","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":"1702.08833"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.08833\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.08833"},"call":"get_concepts_for_paper(arxiv_id=\"1702.08833\")"}],"by_repo":[{"repo":"thadikari/differentiable-boundary-trees","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":"1692228ea215c80366ad4e2d58f05fed472848522f026527c72f8ce9d3ac698d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}