{"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-to-navigate-the-energy-landscape","title":"Learning to Navigate the Energy Landscape","arxiv_id":"1603.05772","date":"2016-03-18","proceeding":null,"authors":["Julien Valentin","Angela Dai","Matthias Nießner","Pushmeet Kohli","Philip Torr","Shahram Izadi","Cem Keskin"],"abstract":"In this paper, we present a novel and efficient architecture for addressing\ncomputer vision problems that use `Analysis by Synthesis'. Analysis by\nsynthesis involves the minimization of the reconstruction error which is\ntypically a non-convex function of the latent target variables.\nState-of-the-art methods adopt a hybrid scheme where discriminatively trained\npredictors like Random Forests or Convolutional Neural Networks are used to\ninitialize local search algorithms. While these methods have been shown to\nproduce promising results, they often get stuck in local optima. Our method\ngoes beyond the conventional hybrid architecture by not only proposing multiple\naccurate initial solutions but by also defining a navigational structure over\nthe solution space that can be used for extremely efficient gradient-free local\nsearch. We demonstrate the efficacy of our approach on the challenging problem\nof RGB Camera Relocalization. To make the RGB camera relocalization problem\nparticularly challenging, we introduce a new dataset of 3D environments which\nare significantly larger than those found in other publicly-available datasets.\nOur experiments reveal that the proposed method is able to achieve\nstate-of-the-art camera relocalization results. We also demonstrate the\ngeneralizability of our approach on Hand Pose Estimation and Image Retrieval\ntasks.","url_abs":"http://arxiv.org/abs/1603.05772v1","url_pdf":"http://arxiv.org/pdf/1603.05772v1.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":[],"tasks":[{"task_slug":"camera-relocalization","task_name":"Camera Relocalization"},{"task_slug":"hand-pose-estimation","task_name":"Hand Pose Estimation"},{"task_slug":"image-retrieval","task_name":"Image Retrieval"},{"task_slug":"navigate","task_name":"Navigate"},{"task_slug":"pose-estimation","task_name":"Pose Estimation"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[{"slug":"12-scenes","name":"12 Scenes","full_name":""}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.05772","atlas_url":"https://app.syntology.ai/?focus=1603.05772","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":"1603.05772"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.05772\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.05772"},"call":"get_concepts_for_paper(arxiv_id=\"1603.05772\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d86a7ba9ea813a3c266b50e3db997f43ec8e5269e63dedd99af8708aa5ab3431","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}