paper-with-me

홈 › Papers

Modelling Stopping Criteria for Search Results using Poisson Processes

2019-09-13 · IJCNLP 2019 11 · Alison Sneyd, Mark Stevenson

Text retrieval systems often return large sets of documents, particularly when applied to large collections. Stopping criteria can reduce the number of these documents that need to be manually evaluated for relevance by predicting when a suitable level of recall has been achieved. In this work, a novel method for determining a stopping criterion is proposed that models the rate at which relevant documents occur using a Poisson process. This method allows a user to specify both a minimum desired level of recall to achieve and a desired probability of having achieved it. We evaluate our method on a public dataset and compare it with previous techniques for determining stopping criteria.

📄 PDF Abstract BibTeX arXiv:1909.06239

Code (1)

alisonsneyd/poisson_stopping_method 공식 구현

Tasks

RetrievalText Retrieval

Similar Papers 제목 키워드 기반

Quantitative Performance Analysis of Stopping Criteria for CMA-ES

2026-06-08 · Ryoji Tanabe arxiv

Covariance matrix adaptation evolution strategy (CMA-ES) is a state-of-the-art black-box optimization algorithm. In general, CMA-ES uses a portfolio of multiple stopping criteria to automatically determine when to stop t…

Hitting the Target: Stopping Active Learning at the Cost-Based Optimum

2021-10-07 · Zac Pullar-Strecker, Katharina Dost, Eibe Frank, Jörg Wicker

Active learning allows machine learning models to be trained using fewer labels while retaining similar performance to traditional supervised learning. An active learner selects the most informative data points, requests…

Active Learning

Stopping Criteria for, and Strong Convergence of, Stochastic Gradient Descent on Bottou-Curtis-Nocedal Functions

2020-04-01 · Vivak Patel

Stopping criteria for Stochastic Gradient Descent (SGD) methods play important roles from enabling adaptive step size schemes to providing rigor for downstream analyses such as asymptotic inference. Unfortunately, curren…

Open-Ended Question Answering

Unsure When to Stop? Ask Your Semantic Neighbors

2017-06-19 · Ivo Gonçalves, Sara Silva, Carlos M. Fonseca, Mauro Castelli

In iterative supervised learning algorithms it is common to reach a point in the search where no further induction seems to be possible with the available data. If the search is continued beyond this point, the risk of o…

Regret-Based $(ε,δ)$-optimal Stopping Criteria for Bayesian Optimization

2026-05-21 · Haowei Wang, Jingyi Wang, Qiyu Wei arxiv

Bayesian optimization (BO) is a widely used iterative black-box optimization method that utilizes Gaussian process (GP) surrogate models. In practice, BO is typically terminated after a fixed evaluation budget is exhaust…