{"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/efficient-modeling-of-latent-information-in","title":"Efficient Modeling of Latent Information in Supervised Learning using Gaussian Processes","arxiv_id":"1705.09862","date":"2017-05-27","proceeding":"NeurIPS 2017 12","authors":["Zhenwen Dai","Mauricio A. Álvarez","Neil D. Lawrence"],"abstract":"Often in machine learning, data are collected as a combination of multiple\nconditions, e.g., the voice recordings of multiple persons, each labeled with\nan ID. How could we build a model that captures the latent information related\nto these conditions and generalize to a new one with few data? We present a new\nmodel called Latent Variable Multiple Output Gaussian Processes (LVMOGP) and\nthat allows to jointly model multiple conditions for regression and generalize\nto a new condition with a few data points at test time. LVMOGP infers the\nposteriors of Gaussian processes together with a latent space representing the\ninformation about different conditions. We derive an efficient variational\ninference method for LVMOGP, of which the computational complexity is as low as\nsparse Gaussian processes. We show that LVMOGP significantly outperforms\nrelated Gaussian process methods on various tasks with both synthetic and real\ndata.","url_abs":"http://arxiv.org/abs/1705.09862v1","url_pdf":"http://arxiv.org/pdf/1705.09862v1.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":"efficient-modeling-of-latent-information-in","repo_url":"https://github.com/rsedgwick/tl_doe_4_dna","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"efficient-modeling-of-latent-information-in","repo_url":"https://github.com/rsedgwick/tlgps","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"gaussian-processes","task_name":"Gaussian Processes"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[{"method_slug":"gaussian-process","method_name":"Gaussian Process"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.09862","atlas_url":"https://app.syntology.ai/?focus=1705.09862","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":"1705.09862"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.09862\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.09862"},"call":"get_concepts_for_paper(arxiv_id=\"1705.09862\")"}],"by_repo":[{"repo":"rsedgwick/tl_doe_4_dna","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rsedgwick/tlgps","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":"4bc4b4baed694ebc5bc3144117c85892289ee255881e3b1893b67917e18f4efc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}