{"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/moving-window-regression-a-novel-approach-to","title":"Moving Window Regression: A Novel Approach to Ordinal Regression","arxiv_id":"2203.13122","date":"2022-03-24","proceeding":"CVPR 2022 1","authors":["Nyeong-Ho Shin","Seon-Ho Lee","Chang-Su Kim"],"abstract":"A novel ordinal regression algorithm, called moving window regression (MWR), is proposed in this paper. First, we propose the notion of relative rank ($\\rho$-rank), which is a new order representation scheme for input and reference instances. Second, we develop global and local relative regressors ($\\rho$-regressors) to predict $\\rho$-ranks within entire and specific rank ranges, respectively. Third, we refine an initial rank estimate iteratively by selecting two reference instances to form a search window and then estimating the $\\rho$-rank within the window. Extensive experiments results show that the proposed algorithm achieves the state-of-the-art performances on various benchmark datasets for facial age estimation and historical color image classification. The codes are available at https://github.com/nhshin-mcl/MWR.","url_abs":"https://arxiv.org/abs/2203.13122v1","url_pdf":"https://arxiv.org/pdf/2203.13122v1.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":"moving-window-regression-a-novel-approach-to","repo_url":"https://github.com/nhshin-mcl/mwr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"age-and-gender-classification","task_name":"Age And Gender Classification"},{"task_slug":"age-estimation","task_name":"Age Estimation"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-classification","task_name":"image-classification"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/age-and-gender-classification-on-adience-age","task":"Age And Gender Classification","dataset":"Adience Age","model":"MWR","rank_in_archive_order":7,"of":16,"metrics":{"Accuracy (5-fold)":"62.6"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-cacd","task":"Age Estimation","dataset":"CACD","model":"MWR","rank_in_archive_order":11,"of":13,"metrics":{"MAE":"4.41"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-chalearn-2015","task":"Age Estimation","dataset":"ChaLearn 2015","model":"MWR","rank_in_archive_order":7,"of":7,"metrics":{"MAE":"2.95"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-fgnet","task":"Age Estimation","dataset":"FGNET","model":"MWR","rank_in_archive_order":1,"of":8,"metrics":{"MAE":"2.23"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-morph-album2","task":"Age Estimation","dataset":"MORPH Album2","model":"MWR","rank_in_archive_order":4,"of":9,"metrics":{"CS":"95.0","MAE":"2.00"},"uses_additional_data":true},{"leaderboard":"/sota/age-estimation-on-morph-album2-caucasian","task":"Age Estimation","dataset":"MORPH album2 (Caucasian)","model":"MWR","rank_in_archive_order":1,"of":11,"metrics":{"MAE":"2.13"},"uses_additional_data":false},{"leaderboard":"/sota/age-estimation-on-utkface","task":"Age Estimation","dataset":"UTKFace","model":"MWR","rank_in_archive_order":5,"of":14,"metrics":{"MAE":"4.37"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2203.13122","atlas_url":"https://app.syntology.ai/?focus=2203.13122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13122"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.13122"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.13122"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.13122\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2203.13122"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2203.13122\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2203.13122"},"call":"get_concepts_for_paper(arxiv_id=\"2203.13122\")"}],"by_repo":[{"repo":"nhshin-mcl/mwr","kind":"official","samples":7,"ran":3,"instrument":0,"unverified":4}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2203.13122.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2203.13122.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nhshin-mcl/mwr","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3,"unverified":4},"n_samples":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"official":{"samples":7,"ran":3,"n_ran_checked":3,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"50af8a4a1dddff4c","code_sha256_prefix":"50af8a4a1dddff4c","entry":"get_age_bounds","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"test_code/DataLoader.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/test_code/DataLoader.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"age:int/0/int, age_unique:ndarray/1/int, tau:float/0/float, mode:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"50af8a4a1dddff4c"}},{"code_sha256":"7496dcf92dc09c78","code_sha256_prefix":"7496dcf92dc09c78","entry":"get_optimizer","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"train_code/network/optimizer_utils.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/train_code/network/optimizer_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"cfg:Config/0/?, net:callable/0/?","fixture_out_type":"Adam","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":"/code/get-optimizer","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7496dcf92dc09c78"}},{"code_sha256":"c8dd3939501836d5","code_sha256_prefix":"c8dd3939501836d5","entry":"get_scheduler","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"train_code/network/optimizer_utils.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/train_code/network/optimizer_utils.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"cfg:Config/0/?, optimizer:SGD/0/?","fixture_out_type":"LambdaLR","level_recorded_at":"2026-09-24T21:23:57.672461+00:00","code_page":"/code/get-scheduler","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c8dd3939501836d5"}},{"code_sha256":"a0223a1315a27749","code_sha256_prefix":"a0223a1315a27749","entry":"data_select","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"test_code/DataSelector.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/test_code/DataSelector.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a0223a1315a27749"}},{"code_sha256":"7192072d06fba16f","code_sha256_prefix":"7192072d06fba16f","entry":"feature_extraction_global_regression","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"test_code/Utils.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/test_code/Utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7192072d06fba16f"}},{"code_sha256":"0bf1c092d67a67b6","code_sha256_prefix":"0bf1c092d67a67b6","entry":"feature_extraction_local_regression","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"test_code/Utils.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/test_code/Utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0bf1c092d67a67b6"}},{"code_sha256":"4af99705637377d8","code_sha256_prefix":"4af99705637377d8","entry":"select_reference_global_regression","repo":"nhshin-mcl/mwr","repo_kind":"official","path":"test_code/Utils.py","file_url":"https://github.com/nhshin-mcl/mwr/blob/HEAD/test_code/Utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4af99705637377d8"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a4b226a64d6f74def7fbe546f43247d7842aa19cbe91f729a59c657c188d626b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}