Papers › Learning the Optimal Stopping for Early Classification within Finite Horizons via...

Learning the Optimal Stopping for Early Classification within Finite Horizons via Sequential Probability Ratio Test

29 Jan 2025arXiv:2501.18059archive 2025-07-28

Akinori F. Ebihara, Taiki Miyagawa, Kazuyuki Sakurai, Hitoshi Imaoka

Time-sensitive machine learning benefits from Sequential Probability Ratio Test (SPRT), which provides an optimal stopping time for early classification of time series. However, in finite horizon scenarios, where input lengths are finite, determining the optimal stopping rule becomes computationally intensive due to the need for backward induction, limiting practical applicability. We thus introduce FIRMBOUND, an SPRT-based framework that efficiently estimates the solution to backward induction from training data, bridging the gap between optimal stopping theory and real-world deployment. It employs density ratio estimation and convex function learning to provide statistically consistent estimators for sufficient statistic and conditional expectation, both essential for solving backward induction; consequently, FIRMBOUND minimizes Bayes risk to reach optimality. Additionally, we present a faster alternative using Gaussian process regression, which significantly reduces training time while retaining low deployment overhead, albeit with potential compromise in statistical consistency. Experiments across independent and identically distributed (i.i.d.), non-i.i.d., binary, multiclass, synthetic, and real-world datasets show that FIRMBOUND achieves optimalities in the sense of Bayes risk and speed-accuracy tradeoff. Furthermore, it advances the tradeoff boundary toward optimality when possible and reduces decision-time variance, ensuring reliable decision-making. Code is publicly available at https://github.com/Akinori-F-Ebihara/FIRMBOUND

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 1 repository linked to this paper: 5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 4 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 8 samples from 1 repository, 5 ran (1 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

akinori-f-ebihara/firmbound officialmentioned in paperpytorchMITSyntology: 8 samples, 5 ran (4 instrument-failed) · 3 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested: 5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · violated contract
4ran · our draft was wrong
3unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from akinori-f-ebihara/firmbound. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives 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” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

akinori-f-ebihara/firmbound official repository 8 samples, 5 ran (4 instrument-failed) · 3 unverified
G_st models/backward_induction_utils.py ran · our draft was wrong fingerprinted MIT (permissive) · 61d33dbc0647c14f · report fixture: signature posteriors:Tensor/3/float, penalty:float/0/float · returned tuple · level recorded 2026-09-22
conditional_expectation_G_given_lmbda models/backward_induction_utils.py ran · our draft was wrong MIT (permissive) · bc9c95cd0ae7e727 · report fixture: signature model:callable/0/?, likelihood:callable/0/?, stat:Tensor/2/float · returned tuple · level recorded 2026-09-24
get_upper_triangle models/backward_induction_utils.py ran · violated contract fingerprinted MIT (permissive) · e1acdf086039d22b · report fixture: signature scores_full:Tensor/5/float · returned Tensor · level recorded 2026-09-22
initialize_Gaussian_process_model models/backward_induction_utils.py ran · our draft was wrong fingerprinted MIT (permissive) · db081f74285f8953 · report fixture: signature stat:Tensor/2/float, num_inducing_points:int/0/int · returned tuple · level recorded 2026-09-22
retrieve_posteriors_from_llrm models/backward_induction_utils.py ran · our draft was wrong fingerprinted MIT (permissive) · 96b1d9ff0aeefc1c · report fixture: signature llrm:Tensor/4/float, prior_ratio_matrix:Tensor/2/float · returned Tensor · level recorded 2026-09-22
GPModel models/backward_induction_utils.py unverified MIT (permissive) · 7bd697acf5186bd8 · report
backward_induction models/backward_induction_utils.py unverified MIT (permissive) · 4b98560231473fe6 · report
stochastic_variational_ELBO_maximization models/backward_induction_utils.py unverified MIT (permissive) · e76952a6c06e3205 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for FIRMBOUND (graph method: FIRMBOUND). 8 bricks; individually on a fixture: 5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. The assembly has not been run end-to-end.

  1. backward_induction entry · level 0 · unverified · 4b98560231473fe6
  2. G_st metric · level 1 · ran · our draft was wrong · 61d33dbc0647c14f
  3. conditional_expectation_G_given_lmbda model · level 1 · ran · our draft was wrong · bc9c95cd0ae7e727
  4. get_upper_triangle helper · level 1 · ran · violated contract · e1acdf086039d22b
  5. initialize_Gaussian_process_model model · level 1 · ran · our draft was wrong · db081f74285f8953
  6. retrieve_posteriors_from_llrm helper · level 1 · ran · our draft was wrong · 96b1d9ff0aeefc1c
  7. stochastic_variational_ELBO_maximization update_rule · level 0 · unverified · e76952a6c06e3205
  8. GPModel model · level 0 · unverified · 7bd697acf5186bd8

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2501.18059") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Density Ratio EstimationEarly Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Gaussian Process

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections