Related papers: Average search time bound in cue based search stra…
The problem of finding a resource residing in a network node (the \emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially…
Let $a\in\mathbb{R}$ denote an unknown stationary target with a known distribution $\mu\in\mathcal{P(\mathbb{R}})$, the space of probability measures on $\mathbb{R}$. A diffusive searcher $X(\cdot)$ sets out from the origin to locate the…
Tree search is a fundamental tool for planning, as many sequential decision-making problems can be framed as searching over tree-structured spaces. We propose an uncertainty-guided tree search algorithm for settings where the reward…
We find a general formula for the distribution of time-averaged observables for systems modeled according to the sub-diffusive continuous time random walk. For Gaussian random walks coupled to a thermal bath we recover ergodicity and…
The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…
The performance of algorithmic decision rules is largely dependent on the quality of training datasets available to them. Biases in these datasets can raise economic and ethical concerns due to the resulting algorithms' disparate treatment…
An additive noise channel is considered, in which the distribution of the noise is nonparametric and unknown. The problem of learning encoders and decoders based on noise samples is considered. For uncoded communication systems, the problem…
In this work, we study the generalization capability of algorithms from an information-theoretic perspective. It has been shown that the expected generalization error of an algorithm is bounded from above by a function of the relative…
In previous work, we presented a novel information-theoretic privacy criterion for query forgery in the domain of information retrieval. Our criterion measured privacy risk as a divergence between the user's and the population's query…
Many events in biology are triggered when a diffusing searcher finds a target, which is called a first passage time (FPT). The overwhelming majority of FPT studies have analyzed the time it takes a single searcher to find a target. However,…
Gathering the most information by picking the least amount of data is a common task in experimental design or when exploring an unknown environment in reinforcement learning and robotics. A widely used measure for quantifying the…
Many foraging animals find food using composite random search strategies, which consist of intensive and extensive search modes. Models of composite search can generate predictions about how optimal foragers should behave in each search…
Efficiency of search for randomly distributed targets is a prominent problem in many branches of the sciences. For the stochastic process of L\'evy walks, a specific range of optimal efficiencies was suggested under variation of search…
We consider the problem of search of an unstructured list for a marked element, when one is given advice as to where this element might be located, in the form of a probability distribution. The goal is to minimise the expected number of…
The mean completion time of a stochastic process may be rendered finite and minimised by a judiciously chosen restart protocol, which may either be stochastic or deterministic. Here we study analytically an arbitrary stochastic search…
We give lower bounds for various natural node- and edge-based local strategies for exploring a graph. We consider this problem both in the setting of an arbitrary graph as well as the abstraction of a geometric exploration of a space by a…
Open-world egocentric activity recognition poses a fundamental challenge due to its unconstrained nature, requiring models to infer unseen activities from an expansive, partially observed search space. We introduce ProbRes, a Probabilistic…
Let $X_1,X_2,\ldots $ be independent random variables observed sequentially and such that $X_1,\ldots,X_{\theta-1}$ have a common probability density $p_0$, while $X_\theta,X_{\theta+1},\ldots $ are all distributed according to $p_1\neq…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
We introduce a search problem generalizing the typical setting of Binary Search on the line. Similar to the setting for Binary Search, a target is chosen adversarially on the line, and in response to a query, the algorithm learns whether…