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

4080120160 · May 202619922001200920172026
48 results for MVP Principle

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.

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 ↗

Hyperalignment has been widely employed in Multivariate Pattern (MVP) analysis to discover the cognitive states in the human brains based on multi-subject functional Magnetic Resonance Imaging (fMRI) datasets. Most of the existing HA methods utilized unsupervised approaches, where they only maximized the correlation be…

2020-01-09abs ↗pdf ↗

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.

The paper establishes maximum principles and stochastic completeness for pseudo-Hermitian manifolds.

problem Maximum principles and stochastic completeness for pseudo-Hermitian manifolds.
method Established generalized maximum principles and proved stochastic completeness equivalence.
result Stochastic completeness for the heat semigroup is equivalent to generalized maximum principles.

The h-principle helps solve complex geometric problems.

problem Solving complex geometric problems using the h-principle.
method Developed from the Oka-Grauert principle and Gromov's theory, the h-principle is applied to Oka manifolds and maps.
result Recent developments and applications of the h-principle in complex analysis and geometry.

The study establishes uncertainty principles on harmonic manifolds of rank one.

problem Developing uncertainty principles for harmonic manifolds of rank one.
method Derivation of various uncertainty principles including Heisenberg, Morgen, Schrödinger, and Hömanders principles.
result Generalization of Hausdorff-Young inequality to harmonic manifolds of rank one.

A new method to break down insurance costs into risk and uncertainty.

problem Understanding and quantifying insurance costs in uncertain environments.
method An axiomatic approach to decompose premium principles into risk and deviation measures.
result Maximal risk and minimal deviation measures can be uniquely identified in decompositions.

Study on maximum principles for nonlinear equations on Riemannian manifolds.

problem Investigating strong maximum principles for fully nonlinear equations on Riemannian manifolds.
method Analyzing scaling conditions and applying to various nonlinear operators.
result Established new strong comparison principles for second order uniformly elliptic problems.

Derives Fredholm criteria for isotypical components from a Simonenko principle.

problem Finding Fredholm conditions for isotypical components of invariant pseudodifferential operators.
method General Simonenko's local principle and equivariant local principle for restriction to isotypical components.
result Full proof of equivariant local principle and extension of results.

A pricing principle is introduced for non-attainable claims in incomplete markets.

problem Pricing non-attainable contingent claims in incomplete markets.
method Distorted Radon-Nikodym derivative and Tsallis relative entropy over a family of equivalent martingale measures.
result The pricing principle is closely related to backward stochastic differential equations and is arbitrage-free and time-consistent.

In this paper, we develop a new mathematical technique which allows us to express the joint distribution of a Markov process and its running maximum (or minimum) through the marginal distribution of the process itself. This technique is an extension of the classical reflection principle for Brownian motion, and it is o…

2013-08-09abs ↗pdf ↗

Along with fruitful applications of Deep Neural Networks (DNNs) to realistic problems, recently, some empirical studies of DNNs reported a universal phenomenon of Frequency Principle (F-Principle): a DNN tends to learn a target function from low to high frequencies during the training. The F-Principle has been very use…

2019-06-21abs ↗pdf ↗

New principle for harmonic maps helps study higher-dimensional submanifolds.

problem Understanding unboundedness of totally geodesic projections in higher codimension.
method Introducing a flexible notion of convexity and applying it to harmonic and conformal maps.
result New maximum principle for harmonic maps applicable to various geometric settings.

In this paper we give three applications of a method to prove h-principles on closed manifolds. Under weaker conditions this method proves a homological h-principle, under stronger conditions it proves a homotopical one. The three applications are as follows: a homotopical version of Vassiliev's h-principle, the contra…

2017-01-24abs ↗pdf ↗

We present a new statistical learning paradigm for Boltzmann machines based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from Jaynes maximum entropy principle and from standard maximum likelihood estimation.We demonstrate the LME principle BY deriving …

2012-10-19abs ↗pdf ↗

New equivalences found linking parabolicity, comparison principle, and capacity on Riemannian manifolds.

problem Understanding parabolicity and related concepts on Riemannian manifolds.
method Establishing new equivalences between parabolicity, comparison principle, and capacity.
result Equivalence between pp-parabolicity and the comparison principle for the pp-Laplace equation.