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

1122 · Oct 202319922001200920172026
20 results for MVP

Multivariate Pattern (MVP) classification can map different cognitive states to the brain tasks. One of the main challenges in MVP analysis is validating the generated results across subjects. However, analyzing multi-subject fMRI data requires accurate functional alignments between neuronal activities of different sub…

2016-11-25abs ↗pdf ↗

In this paper, we consider equilibrium strategies under Volterra processes and time-inconsistent preferences embracing mean-variance portfolio selection (MVP). Using a functional Itô calculus approach, we overcome the non-Markovian and non-semimartingale difficulty in Volterra processes. The equilibrium strategy is the…

2019-07-26abs ↗pdf ↗

The multivariate probit model (MVP) is a popular classic model for studying binary responses of multiple entities. Nevertheless, the computational challenge of learning the MVP model, given that its likelihood involves integrating over a multidimensional constrained space of latent variables, significantly limits its a…

2018-03-22abs ↗pdf ↗

SHA improves fMRI alignment for cognitive state discovery.

problem Optimal functional alignment in MVP analysis for multi-subject fMRI data.
method Supervised Hyperalignment (SHA) method that maximizes correlation within same categories and minimizes between distinct categories.
result SHA achieves up to 19% better performance for multi-class problems.

We solve the paradox of score-based methods by minimizing path variance.

problem Score-based methods are path-dependent, leading to inaccurate and unstable estimators.
method Propose MVP Principle to minimize path variance, derive closed-form expression, and use flexible Kumaraswamy Mixture Model.
result Establishes new state-of-the-art results on challenging benchmarks.

This study compares three portfolio design approaches for stock selection.

problem Designing a profitable portfolio with precise stock returns and risks.
method Three portfolio design approaches: mean-variance portfolio, hierarchical risk parity, and autoencoder-based portfolio.
result Autoencoder portfolios outperform MVP on annual returns, but MVP is best on risk-adjusted returns.

New algorithm reduces reinforcement learning complexity, approaching contextual bandits.

problem Episodic reinforcement learning's difficulty compared to contextual bandits.
method Proposes MVP algorithm with a new Bernstein-type bonus for episodic reinforcement learning.
result Achieves near-optimal regret bound of $O\left(\left(\sqrt{SAK} + S^2A ight) \poly\log \left(SAHK ight) ight)$, improving state-of-the-art results.

The Lagrangian representation of multi-Hamiltonian PDEs has been introduced by Y. Nutku and one of us (MVP). In this paper we focus on systems which are (at least) bi-Hamiltonian by a pair A1A_1, A2A_2, where A1A_1 is a hydrodynamic-type Hamiltonian operator. We prove that finding the Lagrangian representation is equiv…

2016-10-06abs ↗pdf ↗

This study compares three portfolio optimization methods on Indian stocks.

problem Comparing portfolio optimization methods on Indian stocks.
method Mean-Variance, Hierarchical Risk Parity, and Reinforcement Learning approaches.
result Reinforcement Learning outperformed other methods in terms of Sharpe ratio.

New algorithms reduce regret in both stochastic and deterministic environments.

problem Designing algorithms that perform well in both types of MDPs.
method Proposed new environment norms and algorithms with variance-dependent regret bounds.
result First algorithm with simultaneously optimal bounds for both stochastic and deterministic MDPs.

Improved reinforcement learning for episodes with varying action sets.

problem Reinforcement learning with context-dependent action sets.
method Extends MVP algorithm to handle adversarial and stochastic contexts.
result Established minimax regret bounds of O(SAH3KlogL)O(\sqrt{SAH^3K\log L}) for adversarial contexts.

End-to-end framework optimizes financial metrics using neural networks.

problem Difficult portfolio optimization in financial markets due to non-stationarity and high costs.
method Directly optimizes differentiable financial metrics via neural networks, incorporating realistic costs and rebalancing.
result Best model achieves +7.86% total return, outperforming S&P 500 by 12.38 percentage points.

Study benchmarks cryptocurrency risk using GBM, revealing Lognormal limitations.

problem Tackles limitations of Lognormal assumption in modeling cryptocurrency volatility and VaR.
method Applies Geometric Brownian Motion (GBM) with Maximum Likelihood Estimation and correlated Monte Carlo Simulation.
result Observed limitations of Lognormal assumption in cryptocurrency volatility and VaR calculations.