Ordinal classification tasks are present in a large number of different domains. However, common losses for deep neural networks, such as cross-entropy, do not properly weight the relative ordering between classes. For that reason, many have been proposed literature, which model output probabilities following unimodal distribution. This manuscript reviews these on three datasets and suggests po...

Several statistics-based detectors, based on unimodal matrix models, for determining the number of sources in a field are designed. A new variance ratio statistic is proposed, and its asymptotic distribution analyzed. The detector shown to outperform alternatives. It that further improvements achievable via optimally selected rotations. Numerical experiments demonstrate performance gains our de...

Bayesian nonparametric inference for unimodal and multimodal random probability measures on a finite dimensional Euclidean space is examined. After a short discussion on several concepts of multivatiate unimodality, we introduce and study a new class of nonparametric prior distributions on the subspace of random multivariate multimodal distributions. This class in a way generalizes the very res...

We consider stochastic bandit problems with a continuum set of arms and where the expected re-ward is a continuous and unimodal function of the arm. No further assumption is made regarding thesmoothness and the structure of the expected reward function. We propose Stochastic Pentachotomy(SP), an algorithm for which we derive finite-time regret upper bounds. In particular, we sho...

The Fibonacci recurrence of the critical orbit appeared in the work of Branner and Hubbard on complex cubic polynomials [BH, §12] and in Yoccoz's work [Yl, Y2] on quadratic ones, as the "worst" pattern of recurrence. On the other hand, a real quadratic Fibonacci map was suggested by Hofbauer and Keller [HK] as a possible candidate for a map having a "wild" attractor (that is, a set A which is t...

This paper deals with optimal learning and provides a uniied viewpoint of most signiicant results in the eld. The focus is on the problem of local minima in the cost function that is likely to aaect more or less any learning algorithm. We give some intriguing links between optimal learning and the computational complexity of loading problems. We exhibit a computational model such that the solut...

We review recent results that lead to a very precise understanding of the dynamics of typical unimodal maps from the statistical point of view. We also describe the (generalized) renormalization approach to the study of the statistical properties of typical unimodal maps.