SearcharxivSearch

arXiv subjects

Javier Peña

Publications and source records attributed to Javier Peña.

9 recordsLinked to original sources

Fragility of Minimum-Variance Portfolios

Minimum-variance portfolios are well known to be highly sensitive to covariance estimation error. In this paper, we show that by imposing a block diagonal correlation structure, we can derive closed-form expressions for long-only minimum-variance portfolios that make this fragility explicit. These analytical solutions reveal that fragility is driven by threshold effects arising from the interaction between correlation structure and the assets' volatilities. Motivated by the latter insight, we propose robustification approaches that can be interpreted as structured shrinkage schemes that selectively attenuate unstable coupling while preserving the dominant risk structure. Unlike global shrinkage techniques, the proposed corrections are analytically grounded, require minimal tuning, and remain closely aligned with the minimum-variance solution. The framework extends naturally to general covariance matrices through clustering-based approximations. Empirical results on controlled simulations highlight a clear regime dependence. In homogeneous volatility settings, correlation-oblivious shrinkage achieves the best trade-off between risk and stability. In contrast, under heterogeneous volatility, correlation-aware shrinkage performs best by inducing sparsity and avoiding exposure to high-risk assets. Across regimes, the proposed methods consistently reduce out-of-sample variance and turnover relative to classical and clustering-based benchmarks, providing a principled and practical approach to robust portfolio construction.

math.OC

Adaptive Open-Loop Step-Sizes for Accelerated Convergence Rates of the Frank-Wolfe Algorithm

Recent work has shown that in certain settings, the Frank-Wolfe algorithm (FW) with open-loop step-sizes $η_t = \frac{\ell}{t+\ell}$ for a fixed parameter $\ell \in \mathbb{N},\, \ell \geq 2$, attains a convergence rate faster than the traditional $O(t^{-1})$ rate. In particular, when a strong growth property holds, the convergence rate attainable with open-loop step-sizes $η_t = \frac{\ell}{t+\ell}$ is $O(t^{-\ell})$. In this setting there is no single value of the parameter $\ell$ that prevails as superior. This paper shows that FW with log-adaptive open-loop step-sizes $η_t = \frac{2+\log(t+1)}{t+2+\log(t+1)}$ attains a convergence rate that is at least as fast as that attainable with fixed-parameter open-loop step-sizes $η_t = \frac{\ell}{t+\ell}$ for any value of $\ell \in \mathbb{N},\,\ell\geq 2$. To establish our main convergence results, we extend our previous affine-invariant accelerated convergence results for FW to more general open-loop step-sizes of the form $η_t = g(t)/(t+g(t))$, where $g:\mathbb{N}\to\mathbb{R}_{\geq 0}$ is any non-decreasing function such that the sequence of step-sizes $(η_t)$ is non-increasing. This covers in particular the fixed-parameter case by choosing $g(t) = \ell$ and the log-adaptive case by choosing $g(t) = 2+ \log(t+1)$. To facilitate adoption of log-adaptive open-loop step-sizes, we have incorporated this rule into the {\tt FrankWolfe.jl} software package.

math.OC

An easily computable upper bound on the Hoffman constant for homogeneous inequality systems

Let $A\in \mathbb{R}^{m\times n}\setminus \{0\}$ and $P:=\{x:Ax\le 0\}$. This paper provides a procedure to compute an upper bound on the following homogeneous Hoffman constant: \[ H_0(A) := \sup_{u\in \mathbb{R}^n \setminus P} \frac{\text{dist}(u,P)}{\text{dist}(Au, \mathbb{R}^m_-)}. \] In sharp contrast to the intractability of computing more general Hoffman constants, the procedure described in this paper is entirely tractable and easily implementable.

math.OC

Linear convergence of the Douglas-Rachford algorithm via a generic error bound condition

We provide new insight into the convergence properties of the Douglas-Rachford algorithm for the problem $\min_x \{f(x)+g(x)\}$, where $f$ and $g$ are convex functions. Our approach relies on and highlights the natural primal-dual symmetry between the above problem and its Fenchel dual $\min_{u} \{ f^*(u) + g_*(u)\}$ where $g_*(u):=g^*(-u)$. Our main development is to show the linear convergence of the algorithm when a natural error bound condition on the Douglas-Rachford operator holds. We leverage our error bound condition approach to show and estimate the algorithm's linear rate of convergence for three special classes of problems. The first one is when $f$ or$g$ and $f^*$ or $g_*$ are strongly convex relative to the primal and dual optimal sets respectively. The second one is when~$f$ and~$g$ are piecewise linear-quadratic functions. The third one is when~$f$ and~$g$ are the indicator functions of closed convex cones. In all three cases the rate of convergence is determined by a suitable measure of well-posedness of the problem. In the conic case, if the two closed convex cones are a linear subspace $L$ and $\mathbb{R}^n_+$, we establish the following stronger {\em finite termination} result: the Douglas-Rachford algorithm identifies the {\em maximum support sets} for $L\cap \mathbb{R}^n_+$ and $L^{\perp}\cap\mathbb{R}^n_+$ in finitely many steps. Our developments have straightforward extensions to the more general linearly constrained problem $\min_{x,y} \{f(x) + g( y):Ax + By = b\}$ thereby highlighting a direct and straightforward relationship between the Douglas-Rachford algorithm and the alternating direction method of multipliers (ADMM).

math.OC

Towards A Deeper Geometric, Analytic and Algorithmic Understanding of Margins

Given a matrix $A$, a linear feasibility problem (of which linear classification is a special case) aims to find a solution to a primal problem $w: A^Tw > \textbf{0}$ or a certificate for the dual problem which is a probability distribution $p: Ap = \textbf{0}$. Inspired by the continued importance of "large-margin classifiers" in machine learning, this paper studies a condition measure of $A$ called its \textit{margin} that determines the difficulty of both the above problems. To aid geometrical intuition, we first establish new characterizations of the margin in terms of relevant balls, cones and hulls. Our second contribution is analytical, where we present generalizations of Gordan's theorem, and variants of Hoffman's theorems, both using margins. We end by proving some new results on a classical iterative scheme, the Perceptron, whose convergence rates famously depends on the margin. Our results are relevant for a deeper understanding of margin-based learning and proving convergence rates of iterative schemes, apart from providing a unifying perspective on this vast topic.

math.OC

Margins, Kernels and Non-linear Smoothed Perceptrons

We focus on the problem of finding a non-linear classification function that lies in a Reproducing Kernel Hilbert Space (RKHS) both from the primal point of view (finding a perfect separator when one exists) and the dual point of view (giving a certificate of non-existence), with special focus on generalizations of two classical schemes - the Perceptron (primal) and Von-Neumann (dual) algorithms. We cast our problem as one of maximizing the regularized normalized hard-margin ($ρ$) in an RKHS and %use the Representer Theorem to rephrase it in terms of a Mahalanobis dot-product/semi-norm associated with the kernel's (normalized and signed) Gram matrix. We derive an accelerated smoothed algorithm with a convergence rate of $\tfrac{\sqrt {\log n}}ρ$ given $n$ separable points, which is strikingly similar to the classical kernelized Perceptron algorithm whose rate is $\tfrac1{ρ^2}$. When no such classifier exists, we prove a version of Gordan's separation theorem for RKHSs, and give a reinterpretation of negative margins. This allows us to give guarantees for a primal-dual algorithm that halts in $\min\{\tfrac{\sqrt n}{|ρ|}, \tfrac{\sqrt n}ε\}$ iterations with a perfect separator in the RKHS if the primal is feasible or a dual $ε$-certificate of near-infeasibility.

cs.LG

Solving second-order conic systems with variable precision

We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of arithmetic operations and the finest precision required are exhibited.

math.NA

A Complementarity Partition Theorem for Multifold Conic Systems

Consider a homogeneous multifold convex conic system $$ Ax = 0, \; x\in K_1\times...\times K_r $$ and its alternative system $$ A\transp y \in K_1^*\times...\times K_r^*, $$ where $K_1,..., K_r$ are regular closed convex cones. We show that there is canonical partition of the index set ${1,...,r}$ determined by certain complementarity sets associated to the most interior solutions to the two systems. Our results are inspired by and extend the Goldman-Tucker Theorem for linear programming.

math.OC

Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games

We develop an approach of variational analysis and generalized differentiation to conditioning issues for two-person zero-sum matrix games. Our major results establish precise relationships between a certain condition measure of the smoothing first-order algorithm proposed by Gilpin et al. [Proceedings of the 23rd AAAI Conference (2008) pp. 75-82] and the exact bound of metric regularity for an associated set-valued mapping. In this way we compute the aforementioned condition measure in terms of the initial matrix game data.

math.OC