RESUMEN
Based on a rough path foundation, we develop a model-free approach to stochastic portfolio theory (SPT). Our approach allows to handle significantly more general portfolios compared to previous model-free approaches based on Föllmer integration. Without the assumption of any underlying probabilistic model, we prove a pathwise formula for the relative wealth process, which reduces in the special case of functionally generated portfolios to a pathwise version of the so-called master formula of classical SPT. We show that the appropriately scaled asymptotic growth rate of a far reaching generalization of Cover's universal portfolio based on controlled paths coincides with that of the best retrospectively chosen portfolio within this class. We provide several novel results concerning rough integration, and highlight the advantages of the rough path approach by showing that (nonfunctionally generated) log-optimal portfolios in an ergodic Itô diffusion setting have the same asymptotic growth rate as Cover's universal portfolio and the best retrospectively chosen one.
RESUMEN
Cover's celebrated theorem states that the long-run yield of a properly chosen "universal" portfolio is almost as good as that of the best retrospectively chosen constant rebalanced portfolio. The "universality" refers to the fact that this result is model-free, that is, not dependent on an underlying stochastic process. We extend Cover's theorem to the setting of stochastic portfolio theory: the market portfolio is taken as the numéraire, and the rebalancing rule need not be constant anymore but may depend on the current state of the stock market. By fixing a stochastic model of the stock market this model-free result is complemented by a comparison with the numéraire portfolio. Roughly speaking, under appropriate assumptions the asymptotic growth rate coincides for the three approaches mentioned in the title of this paper. We present results in both discrete and continuous time.
RESUMEN
A new explanation of the geometric nature of the reservoir computing (RC) phenomenon is presented. RC is understood in the literature as the possibility of approximating input-output systems with randomly chosen recurrent neural systems and a trained linear readout layer. Light is shed on this phenomenon by constructing what is called strongly universal reservoir systems as random projections of a family of state-space systems that generate Volterra series expansions. This procedure yields a state-affine reservoir system with randomly generated coefficients in a dimension that is logarithmically reduced with respect to the original system. This reservoir system is able to approximate any element in the fading memory filters class just by training a different linear readout for each different filter. Explicit expressions for the probability distributions needed in the generation of the projected reservoir system are stated, and bounds for the committed approximation error are provided.