A new histogram-based mutual information estimator using data-driven tree-structured partitions (TSP) is presented in this paper. The derived TSP is a solution to a complexity regularized empirical information maximization, ...

Graph databases are currently one of the most popular paradigms for storing data. One of the key conceptual differences between graph and relational databases is the focus on navigational queries that ask whether some nodes ...

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices ...

In this paper, we will regularize the holographic entanglement entropy, holographic complexity and fidelity susceptibility for a configuration of D3-branes. We will also study the regularization of the holographic complexity ...

This work responds to a criticism of effective complexity made by James McAllister, according to which such a notion is not an appropriate measure for information content. Roughly, effective complexity is focused on the ...

We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs ...

We describe and analyze a randomized algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence outside a given hypersurface. We show that its bit complexity is roughly quadratic ...