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,742 papers · 148 categories

Trend · papers per month

52105157209 · Jun 202019922001200920172026
48 results for convex mean-variance optimisation

RL models outperform traditional methods in certain market conditions.

problem Traditional portfolio management methods rely on accurate forecasts and do not incorporate specific investor preferences.
method Deep reinforcement learning with specific investor preferences incorporated into reward functions, realistic transaction costs modelled.
result RL models can significantly outperform traditional methods in upward trending markets, but not in sideways trending markets.

Investigates portfolio optimization with and without gearing constraints.

problem Improving portfolio weights for better alignment with expected returns.
method Extends the alpha-weight angle bound to include gearing constraints and uses theoretical arguments and simulations.
result Equally weighted portfolios are not preferable to mean-variance portfolios even with poor forecast ability and a badly conditioned covariance matrix.

The portfolio optimisation problem, first raised by Harry Markowitz in 1952, has been a fundamental and central topic to understanding the stock market and making decisions. There has been plenty of works contributing to development of the mean-variance optimisation (MVO) so far. In this paper, one kind of them, namely…

2019-07-06abs ↗pdf ↗

Enhances traditional MV model for socially responsible investors.

problem Traditional MV models ignore ESG scores relevant to socially responsible investors.
method Implemented an amended MV model considering ESG scores.
result SR investors can achieve competitive SR portfolios with a trade-off between Sharpe Ratio and ESG scores.

Develops a kernel-based framework for dynamic trading strategies.

problem Optimizing portfolios with temporal dependencies in asset dynamics.
method Parameterizes trading strategies as functions in RKHS, enabling flexible, non-Markovian approaches.
result Significantly outperforms classical Markovian methods in synthetic and market-data examples.

A new method uses GATs to optimise portfolios of mid-cap firms, outperforming traditional methods.

problem Optimising portfolios of mid-cap firms considering interdependencies and firms at risk of default.
method Graph Attention Networks (GATs) applied to large-scale financial data.
result The GAT-based portfolio outperforms traditional benchmarks over a long period.

Study finds equivalence between MMV and MV preferences with conic constraints.

problem Monotone mean-variance portfolio selection under conic constraints.
method Closed-form solutions for optimal strategies under MMV and MV preferences.
result Optimal strategies coincide with and without the conic constraint.

A new method for portfolio optimization using signature signatures to incorporate path-dependencies.

problem Traditional portfolio optimization models struggle with path-dependencies and exogenous signals.
method Signature Trading framework using rough path signatures to represent trading strategies.
result Efficient incorporation of exogenous signals and drawdown control in optimal strategies.

This paper explores optimising acquisition functions in Bayesian optimisation.

problem Optimising acquisition functions in Bayesian optimisation is challenging due to their non-convex nature.
method The authors derive compositional forms for acquisition functions and use them to recast maximisation as a compositional optimisation problem.
result The compositional approach to maximising acquisition functions shows empirical advantages across various tasks.

The paper solves MMV and MV problems with random coefficients and finds shared optimal strategies.

problem Optimal trading strategies with random market coefficients.
method Backward stochastic differential equations (BSDEs) to find optimal strategies.
result MMV and MV problems share the same optimal portfolio and value under random coefficients.

This note finds closed-form solutions for mean-risk portfolios using a specific type of mixture distribution.

problem Finding optimal portfolios under mean-risk criteria for general distributions.
method Using normal mean-variance mixture (NMVM) distributions, the paper derives closed-form expressions for mean-risk frontiers by optimizing a Markowitz model with adjusted return vectors.
result Closed-form solutions for mean-risk portfolios are found for return vectors following NMVM distributions.

Optimal switching regret for all segmentations in online convex optimisation.

problem Non-stationary online convex optimisation problems.
method Developed an efficient algorithm to achieve optimal switching regret on every possible segmentation.
result Achieved asymptotically optimal switching regret on every possible segmentation simultaneously.

Unified high-probability regret bounds for online convex optimisation with randomised gradient estimators.

problem Online convex optimisation with randomised gradient estimators for q\ell_q-Lipschitz losses.
method FTRL with randomised two-point finite-difference gradient estimators based on cone-measure sampling from r\ell_r-spheres.
result Unified high-probability regret bounds for all p,q,r[1,]p,q,r \in [1,\infty].

New research shows shrinkage methods re-scale portfolio efficient frontiers under distributional misspecification.

problem Poor performance of mean-variance portfolio decisions under distributional assumptions.
method Investigation of shrinkage methods under different distributional assumptions (auto-correlation, skewness, excess kurtosis).
result Shrinkage methods re-scale the sample efficient frontier, implying standard comparison methods are flawed.

We solve a portfolio selection problem with four objectives, finding convex scalarizations for part of the Pareto front.

problem Portfolio selection with four objectives: mean, variance, skewness, and kurtosis.
method Linearly scalarize MVSK objectives into a convex polynomial FλF_λ over the probability simplex, compute optimizers for each λλ.
result Identify a set of hyper-parameters for which the scalarization is convex, allowing computation of part of the Pareto front.

Paper develops robust SGLD for solving non-convex DRO problems.

problem Solving non-convex distributionally robust optimisation problems with adversarially corrupted samples.
method Developed a Stochastic Gradient Langevin Dynamics (SGLD) algorithm with non-asymptotic convergence bounds.
result The robust SGLD estimator outperforms vanilla SGLD in terms of test accuracy.

Data-driven optimization improves mean-variance portfolios by penalizing norms.

problem Estimation error in mean-variance optimization.
method Augment MVO with norm penalties, use neural networks for optimization, and compute derivatives implicitly.
result Data-driven optimization reduces portfolio risk compared to standard MVO.

Study optimal investment-reinsurance strategy for insurers under random coefficients and jumps.

problem Optimal investment-reinsurance strategy for insurers with random coefficients and jumps.
method Solves backward stochastic differential equations with jumps under a convex cone constraint.
result Optimal strategy and value remain the same even with random coefficients and jumps.

SOBER optimizes and quadrates efficiently in parallel for diverse tasks.

problem Scalability of batch Bayesian optimization and quadrature for expensive functions.
method Reformulates batch selection as a quadrature problem, balancing exploitation and exploration.
result SOBER outperforms 11 baselines on 12 tasks.

New model optimizes portfolios over multiple periods using predictive control.

problem Optimizing multi-period portfolios with risk and variance objectives.
method Model Predictive Control with Mean-Variance and Risk Parity.
result 30x faster and more robust solutions compared to single period models.

Introduces SMMV preferences to avoid inconsistency in portfolio selection.

problem Monotone mean-variance preferences fail to differentiate strictly dominant payoffs.
method Introduces strictly monotone mean-variance preferences and applies them to portfolio selection problems.
result SMMV preferences provide a more rational basis for assessing prospects and coincide with MV preferences under certain conditions.

A new framework for portfolio diversification is introduced which goes beyond the classical mean-variance approach and portfolio allocation strategies such as risk parity. It is based on a novel concept called portfolio dimensionality that connects diversification to the non-Gaussianity of portfolio returns and can typ…

2019-06-03abs ↗pdf ↗

New method optimizes multiple points in Bayesian optimization efficiently.

problem Optimizing multiple points in expensive black-box functions.
method Reformulated BO as probability measure optimization, using convex gradient flows.
result Demonstrated effectiveness on various benchmarks compared to state-of-the-art methods.

A new optimisation method efficiently scales Hessian-vector products for neural networks.

problem Challenges in applying second-order quasi-Newton methods due to large Hessian and non-convexity.
method Proposes an optimisation algorithm that asymptotically uses the exact inverse Hessian with modified eigenvalues.
result Demonstrates scalability and comparable performance to other optimisation methods in neural networks.

Novel algorithms for entropic optimal transport from an optimisation perspective.

problem Solving the entropic-regularised optimal transport problem.
method Developed novel methods inspired by mirror descent, solving semi-dual problems or non-convex constrained problems over joint distributions.
result Non-asymptotic rates of convergence for the proposed methods under minimal assumptions.

Quantum stochastic walks optimize portfolios by leveraging financial networks, improving Sharpe ratios and reducing turnover.

problem Optimizing portfolios in noisy financial markets with superior risk-adjusted returns.
method Embed assets in a weighted graph, using quantum stochastic walks to derive optimal portfolio weights from the stationary distribution.
result Quantum stochastic walks can lift Sharpe ratios by up to 27% and reduce turnover from 480% to 2-90%.

The paper introduces new portfolio rules beyond mean-variance, addressing asymmetry and uncertainty.

problem Optimizing portfolios with asymmetric returns and uncertainty in expected returns.
method Derives allocation rules for asymmetric Laplace distributed returns and random normal expected returns. Addresses singular covariance matrices and uncertainty in returns.
result Optimal worst-case scenario solution provides a convex alternative to risk parity, improving portfolio stability.

Comonotonic allocations are restored under certain constraints, improving risk-sharing.

problem Feasibility constraints can distort optimal risk-sharing allocations.
method Identified componentwise convex-order solidity as a sufficient condition to restore comonotonic allocations.
result Componentwise convex-order solidity ensures comonotonic improvements under feasible constraints.

New research challenges the independence assumption in neurosymbolic learning, leading to overconfident predictions and unrepresentable uncertainty.

problem The independence assumption in neurosymbolic learning systems can lead to overconfident predictions and hinder uncertainty quantification.
method The study proves the limitations of the independence assumption and introduces new loss functions that are non-convex and difficult to optimise.
result Neurosymbolic learning systems using the independence assumption are prone to overconfidence and cannot represent uncertainty over multiple valid options.

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 ↗

We investigate the application of two heuristic methods, genetic algorithms and tabu/scatter search, to the optimisation of realistic portfolios. The model is based on the classical mean-variance approach, but enhanced with floor and ceiling constraints, cardinality constraints and nonlinear transaction costs which inc…

2005-01-04abs ↗pdf ↗

New algorithm reduces regret in stochastic bandit convex optimization.

problem Optimizing decisions in uncertain environments with convex losses.
method Introduces a second-order method for zeroth-order stochastic convex bandits.
result Regret bound of (1+r/d)[d1.5n+d3]polylog(n,d,r)(1 + r/d)[d^{1.5} \sqrt{n} + d^3] polylog(n, d, r).

The vector of periodic, compound returns of a typical investment portfolio is almost never a convex combination of the return vectors of the securities in the portfolio. As a result the ex post version of Harry Markowitz's "standard mean-variance portfolio selection model" does not apply to compound return data. We pro…

2011-04-28abs ↗pdf ↗