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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920182026
48 results for Mixed Fourth Moments

We propose a new method of measuring the third and fourth moments of return distribution based on quadratic variation method when the return process is assumed to have zero drift. The realized third and fourth moments variations computed from high frequency return series are good approximations to corresponding actual …

2013-11-20abs ↗pdf ↗

Study on Gaussian ensemble of matrix products with mixed moments computed.

problem Understanding the statistical properties of matrix products of Gaussian matrices.
method Analysis of a multi-Wishart ensemble and enumeration of non-crossing pairings.
result Mixed moments of the product matrix are computed and found to be weighted by Fuss-Catalan numbers at large NN.

Study fourth order Schrödinger equation on Cartan-Hadamard manifolds, proving existence, scattering, and blow-up results.

problem Fourth order Schrödinger equation with mixed dispersion on Cartan-Hadamard manifolds.
method Fourier transform for hyperbolic space, weighted Strichartz estimates for rotationally symmetric manifolds, localized virial argument.
result Existence, scattering, and blow-up results for the equation.

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this paper, we provide a novel framework to obtain uniform deviation bounds for loss…

2017-02-27abs ↗pdf ↗

The paper examines higher moments in insurance, focusing on coskewness and its impact on actuarial quantities.

problem The impact of higher-order moments on actuarial applications, particularly expected shortfall and life annuity valuation.
method Derives analytical bounds for mixed moments under unspecified dependence structure, applies copula-based mixture model.
result Coskewness and odd-order mixed moments exhibit a monotonic relationship with expected shortfall and annuity premiums.

MOMENT selects and estimates mixed-effects models using moment identities.

problem Selecting and estimating random-effects covariance matrix and fixed-effects coefficients in multiresponse linear mixed-effects models.
method MOMENT is a stage-wise moment-based framework that reduces the random-effects selection problem to a smooth constrained convex optimization problem.
result MOMENT performs competitively and can outperform separate univariate analyses for correlated responses.

We extend the notion of multi-moment map to geometries defined by closed forms of arbitrary degree. We give fundamental existence and uniqueness results and discuss a number of essential examples, including geometries related to special holonomy. For forms of degree four, multi-moment maps are guaranteed to exist and a…

2011-10-29abs ↗pdf ↗

This paper introduces generalized betas accounting for higher order co-moment effects.

problem Financial returns data often deviate from normal assumptions in terms of higher order moments and contain outliers.
method Introduces CAPI and PP framework to calculate generalized betas optimizing the CAPI objective.
result Generalized betas optimize the CAPI objective, accounting for higher order co-moment effects.

Study on estimating rank-one tensors in noisy data with heavy tails.

problem Estimating rank-one spiked tensors in the presence of heavy tailed errors.
method Analysis of spectral norm of random tensors with iid entries.
result Signal strength requirements for optimal estimation are similar for heavy tailed and Gaussian noise, but vanish for noise with finite fourth moment.

Independent component analysis (ICA) is the problem of efficiently recovering a matrix ARn×nA \in \mathbb{R}^{n\times n} from i.i.d. observations of X=ASX=AS where SRnS \in \mathbb{R}^n is a random vector with mutually independent coordinates. This problem has been intensively studied, but all existing efficient algorithms w…

2015-09-02abs ↗pdf ↗

Paper proposes an efficient algorithm to handle high-order portfolio moments.

problem Designing portfolios with high-order moments (skewness and kurtosis) is computationally challenging.
method Proposes a SCA algorithm framework for solving high-order portfolios efficiently.
result Demonstrates the efficiency of the proposed algorithm through numerical experiments.

Study nearest-neighbor radii under dependent sampling, finding they remain informative.

problem Analyzing nearest-neighbor radii under dependent sampling.
method Consider strong mixing dependent observations, establish distribution-free almost sure convergence and sharp non-asymptotic moment bounds.
result Nearest-neighbor geometry remains informative under dependence sampling.

Study finds the minimum number of finite Gaussian mixtures for best approximation.

problem Finding the minimum number of finite Gaussian mixtures for best approximation.
method Local moment matching for upper bound and spectral analysis for lower bound.
result Corrects a previous lower bound in the case of Gaussian mixing distributions.

Abstract: A possibilistic portfolio choice problem using expected utility operators.

problem A possibilistic portfolio choice problem in the framework of expected utility operators.
method Using expected utility operators, the paper formulates a possibilistic choice problem and derives two approximate calculation formulas for optimization.
result Two approximate calculation formulas for optimization of possibilistic portfolio choice problem.

Many scientific and engineering challenges -- ranging from pharmacokinetic drug dosage allocation and personalized medicine to marketing mix (4Ps) recommendations -- require an understanding of the unobserved heterogeneity in order to develop the best decision making-processes. In this paper, we develop a hypothesis te…

2017-08-14abs ↗pdf ↗

Independent Component Analysis (ICA) - one of the basic tools in data analysis - aims to find a coordinate system in which the components of the data are independent. Most popular ICA methods use kurtosis as a metric of non-Gaussianity to maximize, such as FastICA and JADE. However, their assumption of fourth-order mom…

2018-02-14abs ↗pdf ↗

Classical scaling is shown to be optimal under various noisy conditions.

problem Consistency of classical scaling under general noise conditions.
method Established using finite fourth moments of noise, derived convergence rates, and matching minimax lower bounds.
result Classical scaling achieves minimax optimality in recovering true configuration from noisy dissimilarities.

The paper explores tail diversification in financial markets using entropy and mutual information.

problem Tail diversification in financial time series.
method Statistical independence through differential entropy and mutual information, using moments as contrast functions.
result Tail covariance matrix is a key driver of tail diversification.

Signals coming from multivariate higher order conditional moments as well as the information contained in exogenous covariates, can be effectively exploited by rational investors to allocate their wealth among different risky investment opportunities. This paper proposes a new flexible dynamic copula model being able t…

2016-01-20abs ↗pdf ↗

Proposes Moment Exchange to use moments in image recognition models, improving generalization.

problem Discarding moments in image recognition models reduces stability and training time.
method Moment Exchange: replaces moments of learned features with another image's moments and interpolates labels.
result Improves generalization of recognition models across multiple datasets.

The asymptotic distribution of the Markowitz portfolio is derived, for the general case (assuming fourth moments of returns exist), and for the case of multivariate normal returns. The derivation allows for inference which is robust to heteroskedasticity and autocorrelation of moments up to order four. As a side effect…

2013-12-02abs ↗pdf ↗

The paper optimizes estimating high-dimensional Gaussian mixtures without separation conditions.

problem Estimating the mixing distribution in high-dimensional Gaussian mixtures without separation conditions.
method The method of moments and careful application of moment tensors.
result The minimax rate of estimating the mixing distribution in Wasserstein distance is Θ((d/n)1/4+n1/(4k2))Θ((d/n)^{1/4} + n^{-1/(4k-2)}).

Study free energy in spherical spin glasses, proving universality dichotomy.

problem Analyzing free energy in spherical spin glass models with different tail exponents.
method Introduced a tail-adapted normalization and used universality dichotomy.
result Sharp universality dichotomy for free energy across different tail exponents.

Optimizes mixture models without parametrizing distributions using tensor decomposition.

problem Estimating conditionally-independent mixture models in high dimensions.
method Alternating least squares optimization scheme for tensor decomposition.
result Competitive performance and applicability to various models and applications.

This paper uses HCR to predict bid-ask spreads from accessible data.

problem Predicting bid-ask spreads from incomplete data.
method Hierarchical correlation reconstruction (HCR) to model conditional distributions.
result Accurate predictions of bid-ask spreads with interpretable coefficients.

Study of asymmetric rank-one tensor models with non-Gaussian noise.

problem Analyzing maximum-likelihood estimators for asymmetric rank-one tensor models.
method Spectrally separated branch analysis, resolvent methods, cumulant expansions, Efron-Stein-type variance bounds.
result Asymptotic singular value and mode-wise alignments are robust to non-Gaussian noise.

Independent Component Analysis (ICA) is the problem of learning a square matrix AA, given samples of X=ASX=AS, where SS is a random vector with independent coordinates. Most existing algorithms are provably efficient only when each SiS_i has finite and moderately valued fourth moment. However, there are practical appli…

2017-02-22abs ↗pdf ↗