We introduce two new approaches to compute the Persistent Homology (PH) of a sequence of simplicial complexes.

We consider a node where packets of fixed size are generated at arbitrary intervals.

In this talk, we will revisit the classical regret-minimization problem in the multi-armed bandit setting.

Mitigating the effect of tail risk has gained prominence in a variety of applications where safety is of paramount importance.