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

Trend · papers per month

143286428571 · Jun 202019922001200920172026
48 results for efficient frontier

Neural network approximates weakly efficient frontier of convex vector optimization problems.

problem Approximating the weakly efficient frontier of convex vector optimization problems.
method Designing a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition.
result The proposed algorithm effectively approximates the true weakly efficient frontier of CVOPs, even for large problems.

The paper develops methods to estimate the high-dimensional efficient frontier without distributional assumptions.

problem Estimating the mean-variance efficient frontier in high-dimensional settings.
method Random matrix theory and asymptotic analysis for high-dimensional data.
result Developed consistent estimators for the mean, variance, and covariance of the efficient frontier.

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.

A new asset allocation model uses Markov states from clustered efficient frontier coefficients.

problem Characterizing market regimes using efficient frontiers for better asset allocation.
method Hierarchical clustering of monthly efficient frontier coefficients to define states, then a Markov process on these states for portfolio optimization.
result The model significantly outperforms benchmark portfolios empirically.

GeMA learns latent manifolds to benchmark complex systems.

problem Benchmarking complex systems like rail networks and economies with classical methods.
method Geometric Manifold Analysis (GeMA) using a productivity-manifold variational autoencoder (ProMan-VAE).
result GeMA provides more nuanced efficiency evaluations in complex systems.

A simplified model for fixed income portfolio optimisation.

problem Modeling interest rates and credit risk in fixed income portfolios.
method Proposes a two-factor model for the time evolution of the efficient frontier.
result The efficient frontier is mainly controlled by linear constraints, with standard deviation less important.

It is well established that in a market with inclusion of a risk-free asset the single-period mean-variance efficient frontier is a straight line tangent to the risky region, a fact that is the very foundation of the classical CAPM. In this paper, it is shown that in a continuous-time market where the risky prices are …

2009-06-04abs ↗pdf ↗

The paper introduces a machine learning method to forecast market direction using efficient frontier coefficients.

problem Improving asset return estimation for portfolio optimization.
method Monthly directional market forecast using an online decision tree trained on efficient frontier coefficients.
result The method outperforms baseline portfolios and other feature sets.

The p-index improves investment performance for NYSE stocks but not for SSE stocks.

problem Improving investment performance for stocks using the p-index.
method Comparing different p-ratio strategies and empirical efficient frontiers for SSE and NYSE stocks.
result The p-index enhances investment performance for NYSE stocks but not for SSE stocks.

We consider the problem of finding the efficient frontier associated with the risk-return portfolio optimization model. We derive the analytical expression of the efficient frontier for a portfolio of N risky assets, and for the case when a risk-free asset is added to the model. Also, we provide an R implementation, an…

2013-07-01abs ↗pdf ↗

A power-law fit to the empirical inference-compute frontier in LOB prediction suggests a scaling-law-style frontier.

problem Limit order book prediction
method Using a suite of models ranging from small decision trees to neural LOB architectures
result A power-law fit to the low- and mid-compute non-MLPLOB frontier extrapolates across multiple orders of magnitude and attains R2=0.941R^2=0.941 on the excluded high-compute MLPLOB target frontier.

Blockchain funds balance risk and return for various investors.

problem Creating diversified portfolios with risk parity for different risk appetites.
method Developed three funds (Alpha, Beta, Gamma) with distinct risk and return profiles, setting weights inversely proportional to risk.
result Blockchain enables investors to select their preferred risk-return combination and allocate wealth accordingly.

New algorithm reduces regret in online portfolio and quantum state learning.

problem Efficiently learning portfolios and quantum states online with minimal regret.
method BISONS algorithm for online portfolio selection, SCHRODINGER'S BISONS for quantum states, with polylogarithmic regret.
result First efficient algorithm with polylogarithmic regret for online portfolio selection and quantum states.

Proposes Pareto efficient fairness for supervised learning models.

problem Ensuring fairness in machine learning models without sacrificing accuracy.
method Formulates a bilevel optimization problem to find Pareto efficient classifiers.
result Guaranteed solution on Pareto frontier for convex and non-convex objectives.

New tools quantify deep generative models' performance.

problem Measuring the quality-diversity trade-off in deep generative models.
method Established non-asymptotic bounds on sample complexity and introduced frontier integrals.
result Smoothed estimators improve convergence rates of divergence frontiers.

The paper tackles fair policy targeting by optimizing allocation rules to minimize unfairness.

problem Discrimination in individualized treatments of social welfare programs.
method Formulated as a mixed-integer linear program, solved using off-the-shelf algorithms, derived regret bounds and small sample guarantees.
result Designs fair and efficient treatment allocation rules within the Pareto frontier.

Investigates risk measures for DC pension decumulation.

problem Develop optimal decumulation strategies for DC plan holders.
method Formulates decumulation as a control problem, studies risk measures (expected shortfall, linear shortfall, probability of shortfall).
result Optimal controls for expected reward and expected shortfall are identical to those for expected reward and linear shortfall.

U-Cast simplifies AI weather forecasting with a standard U-Net and efficient training.

problem Complex AI models limit accessibility and cost for weather forecasting.
method Simple U-Net backbone, deterministic pre-training, and probabilistic fine-tuning with Monte Carlo Dropout.
result U-Cast matches or exceeds state-of-the-art models in accuracy while reducing training and inference costs.

The paper proposes a method to ensure fairness in machine learning models.

problem Ensuring fairness in machine learning models powered by supervised learning.
method Optimal affine transport and Wasserstein-2 barycenter to characterize the Pareto frontier between prediction error and statistical disparity.
result The proposed method effectively balances prediction accuracy and fairness, as demonstrated by numerical simulations.

This paper compares classical shadows and direct quantum measurement for efficient information extraction.

problem Efficiently extracting classical information from quantum states with limited classical post-processing.
method Quantitative resource analysis comparing classical shadows and direct quantum measurement.
result An efficiency frontier between classical shadows and direct quantum measurement is identified.

A new energy-efficient pruning method for federated learning.

problem Energy inefficiency in gradient sparsification for federated learning.
method Formalized energy-constrained projection problem and proposed Cost-Weighted Magnitude Pruning (CWMP).
result CWMP optimally balances performance and energy efficiency in federated learning.

A new method for multi-objective Bayesian optimization using entropy search and variational lower bound maximization.

problem Efficiently optimizing multiple objectives in continuous domains.
method Approximates the Pareto-frontier using a mixture distribution and optimizes the balance through variational lower bound maximization.
result Demonstrated effectiveness especially with many objective functions.

Algorithm maps trade-off between clustering fidelity and representation size.

problem Optimizing trade-off between clustering fidelity and representation size.
method Introduces primal Deterministic Information Bottleneck (DIB) problem for discrete search spaces.
result Shows richer Pareto frontier over Lagrangian relaxation.

Efficiently solves large portfolio optimization problems by reducing and sparsifying covariance matrices.

problem Large and dense covariance matrices limit efficient portfolio optimization.
method Dimension reduction and increased sparsity based on machine learning predictions.
result Improved portfolio performance and reduced runtime compared to full dense covariance matrices.

We introduce performance-based regularization (PBR), a new approach to addressing estimation risk in data-driven optimization, to mean-CVaR portfolio optimization. We assume the available log-return data is iid, and detail the approach for two cases: nonparametric and parametric (the log-return distribution belongs in …

2011-11-09abs ↗pdf ↗

Study benchmarks mutual funds in India using DEA, finding efficiency metrics.

problem Benchmark mutual funds in India based on efficiency metrics.
method Data Envelopment Analysis (DEA) model incorporating risk, cost, return, and information ratio.
result DEA model identifies efficiency frontier and compares results with traditional metrics.

The paper simplifies hedging and portfolio allocation in markets without a risk-free asset.

problem Optimal hedging and portfolio allocation in markets without a risk-free asset.
method Establishes equivalence between hedging with and without numeraire change, uses oblique projections.
result Explicit expressions for optimal strategies and efficient frontier computation.

We analyze correlations among stock returns via a series of widely adopted parameters which we refer to as explanatory variables. We subsequently exploit the results to propose a long only quantitative adaptive technique to construct a profitable portfolio of assets which exhibits minor drawdowns and higher recoveries …

2018-06-13abs ↗pdf ↗

RL optimizes trading algorithms to reduce market impact and costs.

problem Optimizing sophisticated trading algorithms to minimize market impact and costs.
method Reinforcement learning framework within a market simulator.
result RL-derived strategies consistently outperform baselines and operate near the efficient frontier.

Researchers study fairness-accuracy tradeoffs in predictive models for multiple groups.

problem Understanding the tradeoff between fairness and accuracy in models serving multiple demographic groups.
method Characterizing the fairness-accuracy (FA) Pareto frontier, approximating it from limited data, and bounding the worst-case gap.
result Derivation of worst-case-optimal estimators and uniform finite-sample bounds for the entire FA frontier.

The profitability of CPMMs is significantly impacted by mint and burn fees.

problem Understanding the profitability of decentralized exchanges.
method Formalized liquidity providers' profitability conditions, studied the effect of mint and burn fees, and compiled a large data set from Uniswap V2 transactions.
result The profitability of liquidity provision is severely affected by mint and burn costs.

We identify and optimize the fairness-accuracy tradeoff through TAF Curves and FAUC metrics.

problem Balancing fairness and accuracy in machine learning models for high-stakes decisions.
method Developed TAF Curves and FAUC metric to quantify the tradeoff, and introduced FairStacks framework to expand the Pareto frontier.
result FairStacks framework expands the empirical Pareto frontier and improves the FAUC for model ensembles.

This paper introduces a new scalarization method for multi-objective optimization.

problem Efficiently optimizing multiple conflicting objectives in black box settings.
method Introduces a novel hypervolume scalarization function and uses it to approximate the hypervolume indicator metric.
result Provable convergence to the entire Pareto frontier using random scalarizations and Bayesian optimization.

In this paper Portfolio Optimization techniques were used to determine the most favorable investment portfolio. In particular, stock indices of three companies, namely Microsoft Corporation, Christian Dior Fashion House and Shevron Corporation were evaluated. Using this data the amounts invested in each asset when a po…

2015-05-19abs ↗pdf ↗

The paper introduces MRVaR and MRCov for elliptical and log-elliptical distributions.

problem Risk management of regulation and investment purposes.
method Proposes MRVaR and MRCov as risk measures for elliptical and log-elliptical distributions.
result Explicit expressions of MRVaR and MRCov derived for multivariate (log-)elliptical distributions.