Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider interactive algorithms in the pool-based setting, and in the stream-based setting. Interactive algorithms observe suggested elements (representing actions or queries), and interactively select some of them and receive responses. Pool-based algorithms can select elements at any order, while stream-based algorithms observe elements in sequence, and can only select elements immediately after observing them.  assume that the suggested elements are generated independently from some source distribution, and ask what is the stream size required for emulating a pool algorithm with a given pool size.  provide algorithms and matching lor bounds for general pool algorithms, and for utility-based pool algorithms.  further show that a maximal gap beten the two settings exists also in the special case of active learning for binary classification.
['Sivan Sabato', 'Tom Hess']
I am writing a research paper on a idea Interactive algorithms: from pool to stream
[{"from": "human", "value": "I am writing a research paper on a idea Interactive algorithms: from pool to stream"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider interactive algorithms in the pool-based setting, and in the stream-based setting. Interactive algorithms observe suggested elements (representing actions or queries), and interactively select some of them and receive responses. Pool-based algorithms can select elements at any order, while stream-based algorithms observe elements in sequence, and can only select elements immediately after observing them.  assume that the suggested elements are generated independently from some source distribution, and ask what is the stream size required for emulating a pool algorithm with a given pool size.  provide algorithms and matching lor bounds for general pool algorithms, and for utility-based pool algorithms.  further show that a maximal gap beten the two settings exists also in the special case of active learning for binary classification."}]