{"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-expectation-of-label-distribution","title":"Learning Expectation of Label Distribution for Facial Age and Attractiveness Estimation","arxiv_id":"2007.01771","date":"2020-07-03","proceeding":null,"authors":["Bin-Bin Gao","Xin-Xin Liu","Hong-Yu Zhou","Jianxin Wu","Xin Geng"],"abstract":"Facial attributes (\\eg, age and attractiveness) estimation performance has been greatly improved by using convolutional neural networks. However, existing methods have an inconsistency between the training objectives and the evaluation metric, so they may be suboptimal. In addition, these methods always adopt image classification or face recognition models with a large amount of parameters, which carry expensive computation cost and storage overhead. In this paper, we firstly analyze the essential relationship between two state-of-the-art methods (Ranking-CNN and DLDL) and show that the Ranking method is in fact learning label distribution implicitly. This result thus firstly unifies two existing popular state-of-the-art methods into the DLDL framework. Second, in order to alleviate the inconsistency and reduce resource consumption, we design a lightweight network architecture and propose a unified framework which can jointly learn facial attribute distribution and regress attribute value. The effectiveness of our approach has been demonstrated on both facial age and attractiveness estimation tasks. Our method achieves new state-of-the-art results using the single model with 36$\\times$ fewer parameters and 3$\\times$ faster inference speed on facial age/attractiveness estimation. Moreover, our method can achieve comparable results as the state-of-the-art even though the number of parameters is further reduced to 0.9M (3.8MB disk storage).","url_abs":"https://arxiv.org/abs/2007.01771v2","url_pdf":"https://arxiv.org/pdf/2007.01771v2.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-expectation-of-label-distribution","repo_url":"https://github.com/gaobb/DLDL-v2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"age-estimation","task_name":"Age Estimation"},{"task_slug":"attractiveness-estimation","task_name":"Attractiveness Estimation"},{"task_slug":"attribute","task_name":"Attribute"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/age-estimation-on-chalearn-2015","task":"Age Estimation","dataset":"ChaLearn 2015","model":"DLDL-v2 (ThinAgeNet)","rank_in_archive_order":5,"of":7,"metrics":{"MAE":"3.135","e-error":"0.272"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-chalearn-2016","task":"Age Estimation","dataset":"ChaLearn 2016","model":"DLDL-v2 (ThinAgeNet)","rank_in_archive_order":2,"of":4,"metrics":{"MAE":"3.452","e-error":"0.267"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-morph-album2","task":"Age Estimation","dataset":"MORPH Album2","model":"DLDL-v2 (ThinAgeNet)","rank_in_archive_order":3,"of":9,"metrics":{"MAE":"1.969"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2007.01771","atlas_url":"https://app.syntology.ai/?focus=2007.01771","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":"2007.01771"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2007.01771\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2007.01771"},"call":"get_concepts_for_paper(arxiv_id=\"2007.01771\")"}],"by_repo":[{"repo":"gaobb/DLDL-v2","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":"0f16d0baf3c591e8ed6b90a4b75098f93973e6803db125cf9924083a3ca34e00","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}