Learning to Crawl

Web crawling is the problem of keeping a cache of webpages fresh, i.e., having the most recent copy available when a page is requested. This problem is usually coupled with the natural restriction that the bandwidth available to the web crawler is limited. The corresponding optimization problem was solved optimally by Azar et al. [2018] under the assumption that, for each webpage, both the elapsed time between two changes and the elapsed time between two requests follow a Poisson distribution with known parameters. In this paper, we study the same control problem but under the assumption that the change rates are unknown a priori, and thus we need to estimate them in an online fashion using only partial observations (i.e., single-bit signals indicating whether the page has changed since the last refresh). As a point of departure, we characterise the conditions under which one can solve the problem with such partial observability. Next, we propose a practical estimator and compute confidence intervals for it in terms of the elapsed time between the observations. Finally, we show that the explore-and-commit algorithm achieves an $\mathcal{O}(\sqrt{T})$ regret with a carefully chosen exploration horizon. Our simulation study shows that our online policy scales well and achieves close to optimal performance for a wide range of the parameters.Comment: Published at AAAI 202

An Extension of ETF Arbitrage to Sector Trading Using ANN

We design and deploy a trading strategy that mirrors the Exchange Traded Fund (ETF) arbitrage technique for sector trading. Artificial Neural Networks (ANNs) are used to capture pricing relationships within a sector using intra-day trade data. The fair price of a target security is learnt by the ANN. Significant deviations of the true price from the computed price (ANN predicted price) are exploited. To facilitate arbitrage, output function of the trained ANN is locally linearly approximated. The strategy has been backtested on intra-day data from September 2005. Results are very promising, with a high percentage of profitable trades. With low average trade durations and ease of computation, this strategy is well suited for algorithmic trading systems

Top-Down vs Bottom-Up Model-Based Methodologies for Distributed Control: A Comparative Experimental Study

Model-based synthesis of distributed controllers for multi-robot systems is commonly approached in either a top-down or bottom-up fashion. In this paper, we investigate the experimental challenges of both approaches, with a special emphasis on resource-constrained miniature robots. We make our comparison through a case study in which a group of 2-cm-sized mobile robots screen the environment for undesirable features, and destroy or neutralize them. First, we solve this problem using a top-down approach that relies on a graph-based representation of the system, allowing for direct optimization using numerical techniques (e.g., linear and non-linear convex optimization) under very unrealistic assumptions (e.g., infinite number of robots, perfect localization, global communication, etc.). We show how one can relax these assumptions in the context of resource-constrained robots, and explain the resulting impact on system performance. Second, we solve the same problem using a bottom-up approach, i.e., we build up computationally efficient and accurate models at multiple abstraction levels, and use them to optimize the robots' controller using evolutionary algorithms. Finally, we outline the differences between the top-down and bottom-up approaches, and experimentally compare their performance

How Visual Stimuli Evoked P300 is Transforming the Brain–Computer Interface Landscape: A PRISMA Compliant Systematic Review

Non-invasive Visual Stimuli evoked-EEGbased P300 BCIs have gained immense attention in recent years due to their ability to help patients with disability using BCI-controlled assistive devices and applications. In addition to the medical field, P300 BCI has applications in entertainment, robotics, and education. The current article systematically reviews 147 articles that were published between 2006-2021*. Articles that pass the pre-defined criteria are included in the study. Further, classification based on their primary focus, including article orientation, participants’ age groups, tasks given, databases, the EEG devices used in the studies, classification models, and application domain, is performed. The application-based classification considers a vast horizon, including medical assessment, assistance, diagnosis, applications, robotics, entertainment, etc. The analysis highlights an increasing potential for P300 detection using visual stimuli as a prominent and legitimate research area and demonstrates a significant growth in the research interest in the field of BCI spellers utilizing P300. This expansion was largely driven by the spread of wireless EEG devices, advances in computational intelligence methods, machine learning, neural networks and deep learning

Stochastic Optimal Control of Epidemic Processes in Networks

We approach the development of models and control strategies of susceptible-infected-susceptible (SIS) epidemic processes from the perspective of marked temporal point processes and stochastic optimal control of stochastic differential equations (SDEs) with jumps. In contrast to previous work, this novel perspective is particularly well-suited to make use of fine-grained data about disease outbreaks and lets us overcome the shortcomings of current control strategies. Our control strategy resorts to treatment intensities to determine who to treat and when to do so to minimize the amount of infected individuals over time. Preliminary experiments with synthetic data show that our control strategy consistently outperforms several alternatives. Looking into the future, we believe our methodology provides a promising step towards the development of practical data-driven control strategies of epidemic processes