ACAntonio Cuevas

Antonio Cuevas

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Antonio Cuevas has a total of 38 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Una antología personal de literatura estadística

    by Antonio Cuevas

    Cuevas, A. (2026). Una antología personal de literatura estadística. Boletín de Estadística e Investigación Operativa. 42(2), 64–80. https://doi.org/10.63552/beio.2026.42.2.07

  • Open Access

    A probabilistic characterization of k-means uniqueness

    by Javier Cárcamo, Antonio Cuevas, Luis-Alberto Rodríguez

    We provide necessary and sufficient conditions for the uniqueness of the k-means set of a probability distribution on a separable Banach space. This property is closely related to the choice of the parameter k, since some values may lead to multiple optimal clusterings, thereby complicating interpretation and affecting algorithmic stability. Within a risk minimization framework and under standard Donsker-type conditions, we derive the asymptotic distribution of the empirical within-cluster sum of squares (WCSS). This yields a probabilistic characterization of k-means uniqueness in terms of the limiting behavior of the empirical WCSS. Building on this characterization, we construct a bootstrap test for assessing k-means uniqueness. The finite-sample performance of the procedure is investigated through a simulation study.

  • Open Access

    On the functional regression model and its finite-dimensional approximations

    by José R. Berrendero, Alejandro Cholaquidis, Antonio Cuevas

    The problem of linearly predicting a scalar response Y from a functional (random) explanatory variable $$X=X(t),\ t\in I$$ X = X ( t ) , t ∈ I is considered. It is argued that the term “linearly” can be interpreted in several meaningful ways. Thus, one could interpret that (up to a random noise) Y could be expressed as a linear combination of a finite family of marginals $$X(t_i)$$ X ( t i ) of the process X, or a limit of a sequence of such linear combinations. This simple point of view (which has some precedents in the literature) leads to a formulation of the linear model in terms of the RKHS space generated by the covariance function of the process X(t). It turns out that such RKHS-based formulation includes the standard functional linear model, based on the inner product in the space $$L^2[0,1]$$ L 2 [ 0 , 1 ] , as a particular case. It includes as well all models in which Y is assumed to be (up to an additive noise) a linear combination of a finite number of linear projections of X. Some consistency results are proved which, in particular, lead to an asymptotic approximation of the predictions derived from the general (functional) linear model in terms of finite-dimensional models based on a finite family of marginals $$X(t_i)$$ X ( t i ) , for an increasing grid of points $$t_j$$ t j in I. We also include a discussion on the crucial notion of coefficient of determination (aimed at assessing the fit of the model) in this setting. A few experimental results are given.


  • Open Access

    On functional logistic regression: some conceptual issues

    by José R. Berrendero, Beatriz Bueno-Larraz, Antonio Cuevas

    The main ideas behind the classic multivariate logistic regression model make sense when translated to the functional setting, where the explanatory variableXis a function and the responseYis binary. However, some important technical issues appear (or are aggravated with respect to those of the multivariate case) due to the functional nature of the explanatory variable. First, the mere definition of the model can be questioned: While most approaches so far proposed rely on the $$L^2$$L2 -based model, we explore an alternative (in some sense, more general) approach, based on the theory of reproducing kernel Hilbert spaces (RKHS). The validity conditions of such RKHS-based model, and their relation with the $$L^2$$L2 -based one, are investigated and made explicit in two formal results. Some relevant particular cases are considered as well. Second, we show that, under very general conditions, the maximum likelihood of the logistic model parameters fails to exist in the functional case, although some restricted versions can be considered. Third, we check (in the framework of binary classification) the practical performance of some RKHS-based procedures, well-suited to our model: They are compared to several competing methods via Monte Carlo experiments and the analysis of real data sets.


  • Open Access

    Set estimation under biconvexity restrictions

    by Alejandro Cholaquidis, Antonio Cuevas

    A set in the Euclidean plane is said to be biconvex if, for some angle θ ∈ [0, π∕2), all its sections along straight lines with inclination angles θ and θ + π∕2 are convex sets (i.e., empty sets or segments). Biconvexity is a natural notion with some useful applications in optimization theory. It has also be independently used, under the name of “rectilinear convexity”, in computational geometry. We are concerned here with the problem of asymptotically reconstructing (or estimating) a biconvex set S from a random sample of points drawn on S. By analogy with the classical convex case, one would like to define the “biconvex hull” of the sample points as a natural estimator for S. However, as previously pointed out by several authors, the notion of “hull” for a given set A (understood as the “minimal” set including A and having the required property) has no obvious, useful translation to the biconvex case. This is in sharp contrast with the well-known elementary definition of convex hull. Thus, we have selected the most commonly accepted notion of “biconvex hull” (often called “rectilinear convex hull”): we first provide additional motivations for this definition, proving some useful relations with other convexity-related notions. Then, we prove some results concerning the consistent approximation of a biconvex set S and the corresponding biconvex hull. An analogous result is also provided for the boundaries. A method to approximate, from a sample of points on S, the biconvexity angle θ is also given.

  • Open Access

    Directional differentiability for supremum-type functionals: statistical applications

    by Javier Cárcamo, Luis-Alberto Rodríguez, Antonio Cuevas

    We show that various functionals related to the supremum of a real function defined on an arbitrary set or a measure space are Hadamard directionally differentiable. We specifically consider the supremum norm, the supremum, the infimum, and the amplitude of a function. The (usually non-linear) derivatives of these maps adopt simple expressions under suitable assumptions on the underlying space. As an application, we improve and extend to the multidimensional case the results in \cite{Raghavachari} regarding the limiting distributions of Kolmogorov-Smirnov type statistics under the alternative hypothesis. Similar results are obtained for analogous statistics associated with copulas. We additionally solve an open problem about the Berk-Jones statistic proposed by \cite{Jager-Wellner-2004}. Finally, the asymptotic distribution of maximum mean discrepancies over Donsker classes of functions is derived.

  • An RKHS model for variable selection in functional linear regression

    by José R. Berrendero, Beatriz Bueno-Larraz, Antonio Cuevas


  • Classification methods for functional data

    by Amparo Baillo, Antonio Cuevas, Ricardo Fraiman

    This article reviews the literature concerning supervised and unsupervised classification of functional data. It first explains the meaning of unsupervised classification vs. supervised classification before discussing the supervised classification problem in the infinite-dimensional case, showing that its formal statement generally coincides with that of discriminant analysis in the classical multivariate case. It then considers the optimal classifier and plug-in rules, empirical risk and empirical minimization rules, linear discrimination rules, the k nearest neighbor (k-NN) method, and kernel rules. It also describes classification based on partial least squares, classification based on reproducing kernels, and depth-based classification. Finally, it examines unsupervised classification methods, focusing on K-means for functional data, K-means for data in a Hilbert space, and impartial trimmed K-means for functional data. Some practical issues, in particular real-data examples and simulations, are reviewed and some selected proofs are given.