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

1122 · Sep 202019922001200920172026
8 results for MNTS

Optimizes cryptocurrency portfolios using MNTS GARCH model.

problem Optimizing cryptocurrency portfolios with non-Gaussian return dynamics.
method Multivariate normal tempered stable (MNTS) GARCH model for non-Gaussian returns, Foster-Hart risk optimization.
result Foster-Hart optimization yields a more profitable portfolio with better risk-return balance.

The paper optimizes portfolios using a new GARCH model with regime switching and tempered stable innovations.

problem Mitigating left tail risk in multi-asset portfolios.
method Proposes a Markov regime-switching GARCH model with multivariate normal tempered stable innovation (MRS-MNTS-GARCH) for portfolio optimization.
result Optimal portfolios with tail risk measures outperform standard deviation-based portfolios and equally weighted portfolios in various performance metrics.

The paper estimates CoVaR with various models for financial risk analysis.

problem Estimating conditional value-at-risk with financial time series data.
method Fitting multivariate parametric models and copula functions to capture stylized facts of equity returns.
result Backtesting shows that certain models provide better risk estimates than others.

Algorithm improves movie recommendation efficiency with fairness constraints.

problem Improving movie recommendation efficiency with fairness constraints in combinatorial semi-bandits.
method Adopted Thompson Sampling with beta priors and Bernoulli likelihoods to handle fairness constraints.
result Time-averaged regret upper bounded by $\frac{N}{2η} + O\left(\frac{\sqrt{mNT\ln T}}{T} ight)$, with fairness constraints satisfied.

Paper proves short-time existence for network flow, providing detailed insights.

problem Short-time existence for the flow of a network of curves in the plane.
method Direct PDE approach, handling singularities at vertices using self-similar expanding solutions.
result Substantially more detailed information about network resolution into a regular one.

Optimal algorithm for latent bandits with cluster structure reduces regret to nearly optimal.

problem Maximizing cumulative rewards in a multi-armed bandit problem with latent clusters.
method LATTICE algorithm exploiting cluster structure and arm information.
result Minimax optimal regret of O((M+N)T)O(\sqrt{(\mathsf{M}+\mathsf{N})\mathsf{T}}) with O(logT)O(\log{\mathsf{T}}) calls to matrix completion oracle.

We study a stylized dynamic assortment planning problem during a selling season of finite length TT. At each time period, the seller offers an arriving customer an assortment of substitutable products and the customer makes the purchase among offered products according to a discrete choice model. The goal of the selle…

2018-06-27abs ↗pdf ↗

The multi-armed bandit (MAB) model has been widely adopted for studying many practical optimization problems (network resource allocation, ad placement, crowdsourcing, etc.) with unknown parameters. The goal of the player here is to maximize the cumulative reward in the face of uncertainty. However, the basic MAB model…

2019-01-15abs ↗pdf ↗