{"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":"/task/age-estimation/papers/ran/1","list_of":"/task/age-estimation","task":"Age Estimation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,10],"of":10,"counts":{"archive_papers_tagged":254,"with_a_code_link":85,"where_syntology_ran_a_sample":10,"not_listed_spam_title":0,"listed":254,"listed_where_code_ran":10,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/age-estimation/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/faceptor-a-generalist-model-for-face","slug":"faceptor-a-generalist-model-for-face","title":"Faceptor: A Generalist Model for Face Perception","date":"2024-03-14","arxiv_id":"2403.09500","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/faceptor-a-generalist-model-for-face#ran","syntology_url":"https://syntology.ai/paper/2403.09500","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09500"}},"official":{"repos":["lxq1000/faceptor"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-step-towards-understanding-why","slug":"a-step-towards-understanding-why","title":"A step towards understanding why classification helps regression","date":"2023-08-21","arxiv_id":"2308.10603","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":13,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":14,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-step-towards-understanding-why#ran","syntology_url":"https://syntology.ai/paper/2308.10603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10603"}},"official":{"repos":["silvialaurapintea/reg-cls"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mivolo-multi-input-transformer-for-age-and","slug":"mivolo-multi-input-transformer-for-age-and","title":"MiVOLO: Multi-input Transformer for Age and Gender Estimation","date":"2023-07-10","arxiv_id":"2307.04616","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mivolo-multi-input-transformer-for-age-and#ran","syntology_url":"https://syntology.ai/paper/2307.04616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.04616"}},"official":{"repos":["wildchlamydia/mivolo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-rank-meets-language-boosting-1","slug":"learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","arxiv_id":"2306.13856","repositories_listed":2,"syntology":{"n":23,"n_ran":18,"n_constructed":0,"n_ran_checked":11,"n_instrument":7,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-to-rank-meets-language-boosting-1#ran","syntology_url":"https://syntology.ai/paper/2306.13856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.13856"}},"official":{"repos":["raywang335/l2rclip"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/daa-a-delta-age-adain-operation-for-age","slug":"daa-a-delta-age-adain-operation-for-age","title":"DAA: A Delta Age AdaIN operation for age estimation via binary code transformer","date":"2023-03-14","arxiv_id":"2303.07929","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/daa-a-delta-age-adain-operation-for-age#ran","syntology_url":"https://syntology.ai/paper/2303.07929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.07929"}},"official":{"repos":["redcping/Delta_Age_AdaIN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/discrete-constrained-regression-for-local","slug":"discrete-constrained-regression-for-local","title":"Discrete-Constrained Regression for Local Counting Models","date":"2022-07-20","arxiv_id":"2207.09865","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/discrete-constrained-regression-for-local#ran","syntology_url":"https://syntology.ai/paper/2207.09865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09865"}},"official":{"repos":["xhp-hust-2018-2011/dcreg"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/moving-window-regression-a-novel-approach-to","slug":"moving-window-regression-a-novel-approach-to","title":"Moving Window Regression: A Novel Approach to Ordinal Regression","date":"2022-03-24","arxiv_id":"2203.13122","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/moving-window-regression-a-novel-approach-to#ran","syntology_url":"https://syntology.ai/paper/2203.13122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13122"}},"official":{"repos":["nhshin-mcl/mwr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-probabilistic-ordinal-embeddings-for","slug":"learning-probabilistic-ordinal-embeddings-for","title":"Learning Probabilistic Ordinal Embeddings for Uncertainty-Aware Regression","date":"2021-03-25","arxiv_id":"2103.13629","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":1,"n_ran_checked":1,"n_instrument":7,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"8 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-probabilistic-ordinal-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/2103.13629","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13629"}},"official":{"repos":["Li-Wanhua/POEs"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/consistent-rank-logits-for-ordinal-regression","slug":"consistent-rank-logits-for-ordinal-regression","title":"Rank consistent ordinal regression for neural networks with application to age estimation","date":"2019-01-20","arxiv_id":"1901.07884","repositories_listed":4,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/consistent-rank-logits-for-ordinal-regression#ran","syntology_url":"https://syntology.ai/paper/1901.07884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.07884"}},"official":{"repos":["Raschka-research-group/coral-cnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/face-aging-with-conditional-generative","slug":"face-aging-with-conditional-generative","title":"Face Aging With Conditional Generative Adversarial Networks","date":"2017-02-07","arxiv_id":"1702.01983","repositories_listed":2,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":1,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/face-aging-with-conditional-generative#ran","syntology_url":"https://syntology.ai/paper/1702.01983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.01983"}},"official":null}}],"record_sha256":"2977c108c527b002976aaf5fdb90e904712aaad878e19ed3bf9f5dce47a394f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}