Light Agents Searching for Hot Information
Authors: Dariusz R. Kowalski, Dominik Pajak
IJCAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Ours is the first such agent with rigorous analysis and a complementary almost-matching lower bound.Finally, it is also light and well-scalable (as we analyze formally in Section 3), in the sense that it uses only polylogarithmic time per operation and returning a hot element while using only O(log3n/ϵ) local memory. |
| Researcher Affiliation | Academia | 1School of Computer and Cyber Sciences, Augusta University 2Wrocław University of Science and Technology |
| Pseudocode | Yes | Algorithm 1: Handling 2 1/γ consecutive operations.Algorithm 2: Extracting hot elements at step t.Procedure Process(op(x), C,γ, t) |
| Open Source Code | No | The paper does not provide any statement or link for open-source code for the methodology described. |
| Open Datasets | No | The paper describes a theoretical model of data streams and does not mention the use of any specific public or open dataset for training or evaluation. |
| Dataset Splits | No | The paper presents a theoretical algorithm and its analysis and does not discuss dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper describes a theoretical algorithm and its analysis and does not mention any specific hardware used for experiments. |
| Software Dependencies | No | The paper describes a theoretical algorithm and its analysis and does not provide specific software dependencies with version numbers. |
| Experiment Setup | No | The paper describes a theoretical algorithm and its analysis and does not include details about an experimental setup, hyperparameters, or training configurations. |