Related papers: Convex generalized Fr\'echet means in a metric tre…
Nonparametric regression problems with qualitative constraints such as monotonicity or convexity are ubiquitous in applications. For example, in predicting the yield of a factory in terms of the number of labor hours, the monotonicity of…
Let $(M,g)$ be a Riemannian manifold. If $\mu$ is a probability measure on $M$ given by a continuous density function, one would expect the Fr\'{e}chet means of data-samples $Q=(q_1,q_2,\dots, q_N)\in M^N$, with respect to $\mu$, to behave…
Many fundamental machine learning tasks can be formulated as a problem of learning with vector-valued functions, where we learn multiple scalar-valued functions together. Although there is some generalization analysis on different specific…
A modelling framework suitable for detecting shape shifts in functional profiles combining the notion of Fr\'echet mean and the concept of deformation models is developed and proposed. The generalized mean sense offered by the Fr\'echet…
The concentration of measure phenomenon in Gauss' space states that every $L$-Lipschitz map $f$ on $\mathbb R^n$ satisfies \[ \gamma_{n} \left(\{ x : | f(x) - M_{f} | \geqslant t \} \right) \leqslant 2 e^{ - \frac{t^2}{ 2L^2} }, \quad t>0,…
The notion of quasi-Fej\'er monotonicity has proven to be an efficient tool to simplify and unify the convergence analysis of various algorithms arising in applied nonlinear analysis. In this paper, we extend this notion in the context of…
This paper proposes a method to detect change points in dynamic social networks using Fr\'echet statistics. We address two main questions: (1) what metric can quantify the distances between graph Laplacians in a dynamic network and enable…
We propose a geometric algorithm for topic learning and inference that is built on the convex geometry of topics arising from the Latent Dirichlet Allocation (LDA) model and its nonparametric extensions. To this end we study the…
Monitoring and control of traffic networks represent alternative, inexpensive strategies to minimize traffic congestion. As the number of traffic sensors is naturally constrained by budgetary requirements, real-time estimation of traffic…
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…
In this study, we consider the realm of covariance matrices in machine learning, particularly focusing on computing Fr\'echet means on the manifold of symmetric positive definite matrices, commonly referred to as Karcher or geometric means.…
Generalization is a central aspect of learning theory. Here, we propose a framework that explores an auxiliary task-dependent notion of generalization, and attempts to quantitatively answer the following question: given two sets of patterns…
We consider the superiorization methodology, which can be thought of as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full fledged constrained minimization problem; rather, the task is…
The consistency of Fr\'echet medians is proved for probability measures in proper metric spaces. In the context of Riemannian manifolds, assuming that the probability measure has more than a half mass lying in a convex ball and verifies…
Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research. However, in a variety of situations we may have additional requirements or knowledge, distinct…
In this note, we give a generalization of Gossez's example of a maximally monotone multifunction such that the closure of its range is not convex, using more elementary techniques than in Gossez's original papers. We also discuss some new…
In this work, a mode of convergence for measurable functions is introduced. A related notion of Cauchy sequence is given and it is proved that this notion of convergence is complete in the sense that Cauchy sequences converge. Moreover, the…
The metric dimension of a graph $G$ is the minimal size of a subset $R$ of vertices of $G$ that, upon reporting their graph distance from a distingished (source) vertex $v^\star$, enable unique identification of the source vertex $v^\star$…
As machine learning becomes more and more available to the general public, theoretical questions are turning into pressing practical issues. Possibly, one of the most relevant concerns is the assessment of our confidence in trusting machine…
This work is about ME, the Method of Ellipcenters. ME was recently introduced by these very authors as a first order accelerated scheme for unconstrained minimization. Its iterates are all centers of ellipses carefully designed to somehow…