Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

72144216288 · May 202619922001200920172026
48 results for global minimum variance

Improved portfolio optimization method yields better risk-adjusted returns.

problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted kk-BAHC covariance cleaning procedure for correlation matrices.
result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.

DLNs dynamics change with variance, leading to saddle-to-saddle training phases.

problem Understanding the dynamics of DLNs with varying initialization variance.
method Analyzing the phase transition of DLNs' dynamics as variance changes.
result Gradient descent visits a sequence of saddles, reaching a sparse global minimum.

Investigates the long-only minimum variance portfolio in factor models.

problem Understanding the long-only minimum variance portfolio in factor models.
method Investigates the long-only global minimum variance portfolio in a factor model of returns, providing explicit and geometric descriptions for different factor models.
result Provides rigorous and explicit descriptions of the long-only solution in terms of covariance matrix parameters and geometric descriptions for multiple factors.

Develops a neural network for global minimum variance portfolio optimization.

problem Minimizing portfolio variance for large equity covariance matrices.
method Rotation-invariant neural network that learns lag-transformed returns and covariance regularization.
result End-to-end trained model outperforms competitors in realized volatility and Sharpe ratios.

The study analyzes how covariance estimation errors affect the global minimum-variance portfolio under heavy-tailed distributions.

problem The impact of covariance estimation errors on the global minimum-variance portfolio under heavy-tailed distributions.
method Characterization of covariance-estimation error's effect on GMVP suboptimality, derivation of regret identity and bound, application to heavy-tailed returns.
result The decision geometry of GMVP regret is invariant to a (p-1)-dimensional projection of the error matrix, with invariance to the covariance-scale direction as an exact special case.

Paper uses DFL to optimize portfolio risk and outperforms conventional methods.

problem Optimizing portfolio risk and return under uncertainty.
method Decision-focused learning (DFL) to derive global minimum variance portfolio (GMVP).
result DFL-based methods consistently deliver superior decision performance in portfolio optimization.

Study optimal adjustment sets for causal policies with hidden variables.

problem Estimating dynamic treatment regimes with hidden variables.
method Developed criteria for graphs without hidden variables to compare estimators, extended to dynamic policies and hidden variables.
result Existence and computation of optimal minimal and globally optimal adjustment sets.

We estimate the global minimum variance (GMV) portfolio in the high-dimensional case using results from random matrix theory. This approach leads to a shrinkage-type estimator which is distribution-free and it is optimal in the sense of minimizing the out-of-sample variance. Its asymptotic properties are investigated a…

2014-06-02abs ↗pdf ↗

ML helps select variables for minimum-variance portfolios, reducing risk and improving performance.

problem Optimizing minimum-variance portfolios with relevant predictors.
method Parameterized minimum-variance portfolio weights using a large pool of firm-level characteristics and their transformations.
result ML-selected predictors lead to lower risk and better performance in minimum-variance portfolios.

Improved portfolio optimization method reduces risk and improves performance.

problem Minimizing risk in large portfolios with limited data.
method Combines Tikhonov regularization and direct shrinkage of portfolio weights.
result Significantly reduces out-of-sample variance and Sharpe ratio compared to existing methods.

A new framework for bilevel optimization tackles stochastic and global variance reduction.

problem Bilevel optimization challenges in large-scale empirical risk minimization.
method Introducing a novel framework where inner and main variables evolve simultaneously, leading to unbiased estimates and global variance reduction algorithms.
result SABA algorithm achieves $O( rac{1}{T})$ convergence rate and linear convergence under Polyak-Lojasciewicz assumption.

Study introduces AMVP and AMRR for dynamic portfolio optimization in volatile markets.

problem Optimizing portfolios in volatile and nonstationary financial markets.
method Adaptive Minimum-Variance Portfolio (AMVP) framework with ARFIMA-FIGARCH processes and non-Gaussian innovations.
result Demonstrated superior performance in risk reduction and portfolio stability during market breaks.

Paper connects two portfolio methods, HRP and Minimum Variance, revealing their underlying similarity.

problem Inability to universally adopt optimization-based portfolio construction methods.
method Unifies Hierarchical Risk Parity and Minimum Variance approaches.
result Schur complementary allocation reveals the connection between HRP and Minimum Variance.

New shrinkage estimator for GMV portfolio reduces risk in high-dimensional asset settings.

problem Estimating the global minimum variance portfolio in high-dimensional settings with limited data.
method Dynamic shrinkage of the GMV portfolio using previous data as a target.
result The new estimator outperforms traditional methods in high-dimensional asset settings.

The only input to attain the portfolio weights of global minimum variance portfolio (GMVP) is the covariance matrix of returns of assets being considered for investment. Since the population covariance matrix is not known, investors use historical data to estimate it. Even though sample covariance matrix is an unbiased…

2020-01-09abs ↗pdf ↗

New framework for DNN training guarantees convergence to global minimum.

problem Training deep neural networks to converge to global minimum.
method Reformulated minimization problem with recursive algorithmic framework, using bounded style assumptions.
result Convergence to an ε-(global) minimum with O(1/ε^3) gradient computations.

The paper identifies the minimum mean-variance spanning set and its importance in asset evaluation.

problem Estimating the minimum subset of assets that span the efficient frontier.
method Established identification conditions and developed a novel procedure for MSS estimation and inference.
result The MSS estimator accurately covers the true MSS and converges to it at any desired confidence level.

New method finds minimum in noisy data, useful for model selection.

problem Finding the index of the minimum value in noisy observations.
method Developed an asymptotically normal test statistic integrating cross-validation and differential privacy.
result Achieves a favorable bias-variance trade-off in practical scenarios.

Stochastic gradient descent (SGD) has been found to be surprisingly effective in training a variety of deep neural networks. However, there is still a lack of understanding on how and why SGD can train these complex networks towards a global minimum. In this study, we establish the convergence of SGD to a global minimu…

2019-01-02abs ↗pdf ↗

Study long-only minimum variance portfolio in one-factor market with arbitrary sign betas.

problem Characterize the long-only minimum variance portfolio in a one-factor market with mixed-sign betas.
method Explicit solution for long-only minimum variance portfolio, explicit characterization of active set, asymptotic analysis in high-dimensional regime.
result Proportion of active assets in LOMV portfolio converges to F(β)F(β^*) in high-dimensional regime, with rate O(F(0)1/3)O(F(0)^{1/3}) when F(0)>0F(0) > 0.

We address the curse of dimensionality in dynamic covariance estimation by modeling the underlying co-volatility dynamics of a time series vector through latent time-varying stochastic factors. The use of a global-local shrinkage prior for the elements of the factor loadings matrix pulls loadings on superfluous factors…

2016-08-30abs ↗pdf ↗

This paper describes an empirical study of shortfall optimization with Barra Extreme Risk. We compare minimum shortfall to minimum variance portfolios in the US, UK, and Japanese equity markets using Barra Style Factors (Value, Growth, Momentum, etc.). We show that minimizing shortfall generally improves performance ov…

2011-02-04abs ↗pdf ↗

A scalable gradient-based framework for sparse portfolio selection.

problem Sparse minimum-variance portfolio selection with cardinality constraint.
method Gradient-based optimization with Boolean relaxation and tunable parameter.
result Matches commercial solvers in most instances, differing by a few assets with negligible error in portfolio variance.

This paper introduces a new market-based carbon risk measure for portfolio optimization.

problem The challenge of measuring and managing carbon risk in investment portfolios.
method Develops a market-based carbon risk measure and applies it to minimum variance portfolio construction.
result Market-based carbon risk measures can complement fundamental-based approaches in portfolio optimization.

Paper analyzes high-dimensional portfolio risks and finds empirical out-of-sample relative loss is more reliable.

problem Analyzing risks in high-dimensional portfolios using empirical variance.
method Derives asymptotic behavior of out-of-sample variance and relative loss in high-dimensional settings.
result Empirical out-of-sample relative loss is more reliable than variance in high-dimensional portfolios.

SGD converges to global minimum for structured non-convex functions.

problem Optimizing non-convex functions using SGD with slow convergence rates.
method Convergence theorems for SGD on structured non-convex functions, including Quasar and PL conditions.
result SGD converges to global minimum for specific non-convex functions under certain conditions.

Improved MLMC method for barrier options with non-Lipschitz coefficients.

problem Efficiency improvement for barrier option pricing with non-Lipschitz diffusion.
method Interpolated Drift Implicit Euler MLMC method, Lamperti transformation, Brownian bridge technique.
result Improved efficiency of MLMC for barrier options with non-Lipschitz coefficients.

Gradient flow in parameters equals linear interpolation in outputs.

problem Understanding and optimizing training algorithms in deep learning.
method Proving equivalence between gradient flow in parameter space and linear interpolation in output space, and deriving formulas for global minima.
result Gradient flow in parameters can be transformed into linear interpolation in outputs, leading to global minima.

Minimum attention improves reinforcement learning performance in high-dimensional dynamics.

problem Improving reinforcement learning performance in high-dimensional nonlinear dynamics.
method Applying minimum attention as a regularization technique in reinforcement learning, including model-based and model-free approaches.
result Minimum attention outperforms state-of-the-art algorithms in few-shot adaptation and variance reduction.

We propose convex relaxations for convolutional neural nets with one hidden layer where the output weights are fixed. For convex activation functions such as rectified linear units, the relaxations are convex second order cone programs which can be solved very efficiently. We prove that the relaxation recovers the glob…

2018-12-31abs ↗pdf ↗

Paper develops a robust hedging framework to reduce market risk and uncertainty.

problem Managing uncertainty and risk exposure in portfolio management.
method Combines high-frequency realized variance, covariance measures, and autoregressive models for multi-step volatility forecasting. Uses a box-uncertainty robust optimization scheme to derive a closed-form solution for the robust hedge ratio.
result Robust hedge ratios are more stable and entail lower turnover than standard dynamic hedges, improving downside protection and risk-adjusted performance.

New proof shows how to identify DAGs with weakly increasing errors.

problem Identifying the true DAG in models with weakly increasing error variances.
method Minimum-trace DAG method and hill climbing algorithm with R2R neighborhood.
result Hill climbing algorithm without strict local optima under weakly increasing error variances.

The discrete-time mean-variance portfolio selection formulation, a representative of general dynamic mean-risk portfolio selection problems, does not satisfy time consistency in efficiency (TCIE) in general, i.e., a truncated pre-committed efficient policy may become inefficient when considering the corresponding trunc…

2014-03-04abs ↗pdf ↗