{"paper_id":"2504.13501","title":"Target search optimization by threshold resetting","authors":["Arup Biswas","Satya N Majumdar","Arnab Pal"],"paper_date":"2025-04-18","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2504.13501v2","page_url":"https://thequant.space/flowcharts/target-search-optimization-by-threshold-resetting/","scores":{"empirical_rigor":2,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a new class of first‑passage‑time optimization driven by threshold resetting, providing a unified analytical framework for correlated multi‑agent search processes.","quote":"We introduce a new class of first passage time optimization driven by threshold resetting, inspired by many natural processes where crossing a critical limit triggers failure, degradation or transition. We develop a unified framework to compute search times for these correlated stochastic processes, with ballistic- and diffusive searchers as key examples uncovering diverse optimization behaviors.","summary":"We introduce a new class of first passage time optimization driven by threshold resetting, inspired by many natural processes where crossing a critical limit triggers failure, degradation or transition. In here, search agents are collectively reset when a threshold is reached, creating…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Instantaneous information transfer among searchers: when one reaches the threshold, all reset simultaneously; when one finds the target, all are immediately informed and the search ends.","type":"model","stated":"explicit","quote":"Note that the model assumes instanta-neous information transfer among searchers: whenever one reaches the threshold, all reset simultaneously; like-wise, when one finds the target, all are immediately in-formed and the search ends.","support":"full"},{"assumption":"Searchers are reset collectively to the initial position x0 whenever any searcher hits the threshold L.","type":"model","stated":"explicit","quote":"The TR mechanism is introduced by placing another boundary at L, which hereafter is referred to as the threshold (see Fig. 1). Whenever one of the searchers hits the threshold, all of them are collectively reset to the initial position x0 from where the search is renewed – for a higher dimensional embedding interpretation, see [64].","support":"full"},{"assumption":"Each ballistic searcher draws its initial velocity from a prescribed distribution ϕ(v).","type":"model","stated":"explicit","quote":"We assume that each ballistic searcher moves with a random initial velocity drawn from a distribution ϕ(v).","support":"full"},{"assumption":"When the threshold is encountered before the target, all searchers are simultaneously reset and draw new velocities from the same distribution.","type":"model","stated":"explicit","quote":"However, if the resetting threshold is encountered prior to the target, all the searchers are simultaneously reset to x0 following which they draw new random velocities from the same distribution.","support":"full"},{"assumption":"The velocity distribution satisfies ϕ(v) → 0 as v → 0 so that the integral in Eq. (7) converges.","type":"statistical","stated":"explicit","quote":"Notably, the integral in Eq. (7) converges only when ϕ(v) →0 as v →0 so that ϕ(v)/v becomes integrable around v = 0.","support":"full"},{"assumption":"For analytical tractability, the velocity distribution is taken as ϕ(v)= (1/2v0) e^{-|v|/v0}.","type":"model","stated":"explicit","quote":"MFPT for multiple searchers (N > 1): To continue the analysis for multiple searchers, we will assume that the velocities are chosen from a probability distribution given by ϕ(v) = 1 2v0 e−|v|/v0.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"Despite strong correlations, the mean first‑passage time (MFPT) can be computed exactly and exhibits non‑trivial optimization due to threshold resetting.","kind":"theoretical","quote":"We show that despite the presence of strong correlations, the mean search/first-passage time (MFPT) can be exactly calculated and fur-thermore, a nontrivial optimization is discovered due to the threshold resetting and the emerging collective nature of the searchers.","support":"full"},{"finding":"The MFPT for a single ballistic searcher diverges, but for two or more searchers the collective MFPT becomes finite.","kind":"theoretical","quote":"While the MFPT for a single searcher is diverging, as evident from Eq. (7), the MFPT for the collective walkers e.g., N ≥2 turns out to be a finite quantity.","support":"full"},{"finding":"The cost function attains a minimum at an optimal normalized threshold u*; the optimal u* varies with the number of searchers N.","kind":"theoretical","quote":"The cost attains a minimum at an optimal u∗– the variation of which as a function of N is shown in the inset panel.","support":"full"},{"finding":"For both ballistic and diffusive searchers, threshold resetting reduces the MFPT compared to the reset‑free case for N ≥ 2, with the greatest reduction when the threshold is close to the initial position (u → 1).","kind":"performance","quote":"It should be noted that for N = 1 and N = 2, the TR mechanism always reduces the search time. It is observed from Fig. 4 that TR can facilitate the search process while compared to the same in the absence of TR as for intermediate values of u, the MFPT curves go below their respective dashed lines—each representing the reset-free case for different N—clearly indicating that threshold resetting enhances search","support":"full"},{"finding":"In the diffusive case, an optimal resetting threshold exists in the range 0 < u < 1 for all N ≥ 2, further accelerating target search.","kind":"performance","quote":"Although it is known that the MFPT for diffusive searchers is fi-nite only for N ≥3 (see [74, 85, 86]), the introduction of the TR mechanism enables a further reduction by opti-mally constraining the searchers’ trajectories, leading to an optimal resetting threshold in the range 0 < u < 1 for all N ≥2.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":20,"citations":{"cited_by_in_corpus":1,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":1},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:50:55Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}