{"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/label-distribution-learning-forests","title":"Label Distribution Learning Forests","arxiv_id":"1702.06086","date":"2017-02-20","proceeding":"NeurIPS 2017 12","authors":["Wei Shen","Kai Zhao","Yilu Guo","Alan Yuille"],"abstract":"Label distribution learning (LDL) is a general learning framework, which\nassigns to an instance a distribution over a set of labels rather than a single\nlabel or multiple labels. Current LDL methods have either restricted\nassumptions on the expression form of the label distribution or limitations in\nrepresentation learning, e.g., to learn deep features in an end-to-end manner.\nThis paper presents label distribution learning forests (LDLFs) - a novel label\ndistribution learning algorithm based on differentiable decision trees, which\nhave several advantages: 1) Decision trees have the potential to model any\ngeneral form of label distributions by a mixture of leaf node predictions. 2)\nThe learning of differentiable decision trees can be combined with\nrepresentation learning. We define a distribution-based loss function for a\nforest, enabling all the trees to be learned jointly, and show that an update\nfunction for leaf node predictions, which guarantees a strict decrease of the\nloss function, can be derived by variational bounding. The effectiveness of the\nproposed LDLFs is verified on several LDL tasks and a computer vision\napplication, showing significant improvements to the state-of-the-art LDL\nmethods.","url_abs":"http://arxiv.org/abs/1702.06086v4","url_pdf":"http://arxiv.org/pdf/1702.06086v4.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":"age-estimation","task_name":"Age Estimation"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/age-estimation-on-morph-album2-caucasian","task":"Age Estimation","dataset":"MORPH album2 (Caucasian)","model":"dLDLF","rank_in_archive_order":11,"of":11,"metrics":{"MAE":"3.02"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.06086","atlas_url":"https://app.syntology.ai/?focus=1702.06086","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.06086"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.06086\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.06086"},"call":"get_concepts_for_paper(arxiv_id=\"1702.06086\")"}],"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":"589d30de9d763d0a9b19b49c9bdfcc562237fdd5cf7053ee187ff26c8ce1edac","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}