A MCMC-type simple probabilistic approach for determining optimal progressive censoring schemes

04/08/2021
by   Ritwik Bhattacharya, et al.
0

We present here a simple probabilistic approach for determining an optimal progressive censoring scheme by defining a probability structure on the set of feasible solutions. Given an initial solution, the new updated solution is computed within the probabilistic structure. This approach will be especially useful when the cardinality of the set of feasible solutions is large. The validation of the proposed approach is demonstrated by comparing the optimal scheme with these obtained by exhaustive numerical search.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2022

A rate-compatible solution to the set reconciliation problem

We consider a set reconciliation setting in which two parties hold simil...
research
11/20/2021

Oblivious Online Contention Resolution Schemes

Contention resolution schemes (CRSs) are powerful tools for obtaining "e...
research
12/26/2022

ProS: Data Series Progressive k-NN Similarity Search and Classification with Probabilistic Quality Guarantees

Existing systems dealing with the increasing volume of data series canno...
research
11/03/2016

Probabilistic Modeling of Progressive Filtering

Progressive filtering is a simple way to perform hierarchical classifica...
research
07/01/2019

The Constrained L_p-L_q Basis Pursuit Denoising Problem

In this paper, we consider the constrained L_p-L_q basis pursuit denoisi...
research
11/27/2017

Probabilistic solution of Yao's millionaires' problem

We offer a probabilistic solution of Yao's millionaires' problem that gi...

Please sign up or login with your details

Forgot password? Click here to reset