{"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/the-power-of-log-sum-exp-sequential-density","title":"The Power of Log-Sum-Exp: Sequential Density Ratio Matrix Estimation for Speed-Accuracy Optimization","arxiv_id":"2105.13636","date":"2021-05-28","proceeding":null,"authors":["Taiki Miyagawa","Akinori F. Ebihara"],"abstract":"We propose a model for multiclass classification of time series to make a prediction as early and as accurate as possible. The matrix sequential probability ratio test (MSPRT) is known to be asymptotically optimal for this setting, but contains a critical assumption that hinders broad real-world applications; the MSPRT requires the underlying probability density. To address this problem, we propose to solve density ratio matrix estimation (DRME), a novel type of density ratio estimation that consists of estimating matrices of multiple density ratios with constraints and thus is more challenging than the conventional density ratio estimation. We propose a log-sum-exp-type loss function (LSEL) for solving DRME and prove the following: (i) the LSEL provides the true density ratio matrix as the sample size of the training set increases (consistency); (ii) it assigns larger gradients to harder classes (hard class weighting effect); and (iii) it provides discriminative scores even on class-imbalanced datasets (guess-aversion). Our overall architecture for early classification, MSPRT-TANDEM, statistically significantly outperforms baseline models on four datasets including action recognition, especially in the early stage of sequential observations. Our code and datasets are publicly available at: https://github.com/TaikiMiyagawa/MSPRT-TANDEM.","url_abs":"https://arxiv.org/abs/2105.13636v2","url_pdf":"https://arxiv.org/pdf/2105.13636v2.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":"the-power-of-log-sum-exp-sequential-density","repo_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"action-recognition-in-videos","task_name":"Action Recognition"},{"task_slug":"density-ratio-estimation","task_name":"Density Ratio Estimation"},{"task_slug":"early-classification","task_name":"Early  Classification"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2105.13636","atlas_url":"https://app.syntology.ai/?focus=2105.13636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13636"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.13636"},"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":"2105.13636"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.13636\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2105.13636"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2105.13636\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2105.13636"},"call":"get_concepts_for_paper(arxiv_id=\"2105.13636\")"}],"by_repo":[{"repo":"TaikiMiyagawa/MSPRT-TANDEM","kind":"official","samples":6,"ran":2,"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/2105.13636.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/2105.13636.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/TaikiMiyagawa/MSPRT-TANDEM","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":2,"unverified":4},"n_samples":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"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":6,"ran":2,"n_ran_checked":2,"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":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-25","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"},"samples":[{"code_sha256":"fcda594cb6795f6d","code_sha256_prefix":"fcda594cb6795f6d","entry":"read_tfrecords_UCF101","repo":"TaikiMiyagawa/MSPRT-TANDEM","repo_kind":"official","path":"datasets/data_processing.py","file_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM/blob/HEAD/datasets/data_processing.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"record_file_tr:str/0/str, record_file_va:str/0/str, record_file_te:str/0/str, batch_size:int/0/int, flag_shuffle:bool/0/bool, shuffle_buffer_size:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fcda594cb6795f6d"}},{"code_sha256":"37711c4b2ac3a76f","code_sha256_prefix":"37711c4b2ac3a76f","entry":"which_dataset_UCF101","repo":"TaikiMiyagawa/MSPRT-TANDEM","repo_kind":"official","path":"datasets/data_processing.py","file_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM/blob/HEAD/datasets/data_processing.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"duration:int/0/int, height:int/0/int, width:int/0/int, split:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T10:06:43.451432+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"37711c4b2ac3a76f"}},{"code_sha256":"61d078878105d29d","code_sha256_prefix":"61d078878105d29d","entry":"get_batch_norm_layer","repo":"TaikiMiyagawa/MSPRT-TANDEM","repo_kind":"official","path":"models/backbones_fe.py","file_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM/blob/HEAD/models/backbones_fe.py","link_basis":"first_harvest_node","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":"61d078878105d29d"}},{"code_sha256":"93f9562775b33b2c","code_sha256_prefix":"93f9562775b33b2c","entry":"get_ressize_dependent_params","repo":"TaikiMiyagawa/MSPRT-TANDEM","repo_kind":"official","path":"models/backbones_fe.py","file_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM/blob/HEAD/models/backbones_fe.py","link_basis":"first_harvest_node","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":"93f9562775b33b2c"}},{"code_sha256":"c761d6a6ea580871","code_sha256_prefix":"c761d6a6ea580871","entry":"np_to_tfr_nosaic_mnist","repo":"TaikiMiyagawa/MSPRT-TANDEM","repo_kind":"official","path":"data-directory/make_nmnist-100f.py","file_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM/blob/HEAD/data-directory/make_nmnist-100f.py","link_basis":"first_harvest_node","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":"c761d6a6ea580871"}},{"code_sha256":"4af3235ea62f0a85","code_sha256_prefix":"4af3235ea62f0a85","entry":"read_tfrecords_nosaic_mnist","repo":"TaikiMiyagawa/MSPRT-TANDEM","repo_kind":"official","path":"datasets/data_processing.py","file_url":"https://github.com/TaikiMiyagawa/MSPRT-TANDEM/blob/HEAD/datasets/data_processing.py","link_basis":"first_harvest_node","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":"4af3235ea62f0a85"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d85ccf07ac40ed4809cbab856ac1b6af73761892218fcba62f0bb2c2951a6fbc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}