We show that the moment explosion time in the rough Heston model [El Euch, Rosenbaum 2016, arxiv:1609.02108] is finite if and only if it is finite for the classical Heston model. Upper and lower bounds for the explosion time are established, as well as an algorithm to compute the explosion time (under some restrictions…
The paper proves that Gaussian field critical points have finite moments.
problem Proving the finiteness of moments for Gaussian field critical points.
method General approach not specific to critical points, using Taylor polynomial non-degeneracy.
result The finiteness of moments of the number of critical points of Gaussian fields.
A new method for estimating causal parameters from observables reduces the need for finite moment conditions.
problem Estimating causal parameters from observational data with unknown or infinite moment conditions.
method Variational Method of Moments (VMM) for a general class of estimators, including kernel and neural net-based methods.
result VMM estimators are consistent, asymptotically normal, and semiparametrically efficient.
Moment polytope of toric exponential families is a projection of a simplex.
problem Understanding the geometry of exponential families in finite sample spaces.
method Toric torification and projection of higher-dimensional simplices.
result Moment polytope is a projection of a higher-dimensional simplex.
Revisits Lee's Moment Formula, relaxing moment assumptions for implied volatility.
problem Implied volatility constraints under finite log-moments.
method Analyzes stock price martingale with finite log-moments, derives new bounds and proof.
result New bounds on implied volatility growth, relaxes moment assumptions.
Paper provides unbiased spectral moment estimates from finite data.
problem Challenges in estimating spectral moments from limited data.
method Dynamic programming approach to estimate spectral moments of kernel integral operator.
result Demonstrates consistency with theoretical spectra and practical utility in neural networks.
The study of random walks on hyperbolic spaces and Teichmüller spaces, proving central limit theorems and geodesic tracking.
problem Analyzing random walks on hyperbolic and Teichmüller spaces.
method Proving central limit theorems and geodesic tracking using finite moments and logarithmic moments.
result Translation lengths of random isometries satisfy a central limit theorem if and only if the random walk has finite second moment.
We consider a class of finite Markov moment problems with arbitrary number of positive and negative branches. We show criteria for the existence and uniqueness of solutions, and we characterize in detail the non-unique solution families. Moreover, we present a constructive algorithm to solve the moment problems numeric…
This study shows the moment-SOS hierarchy converges in polynomial optimization over product of spheres.
problem Minimizing multihomogeneous polynomials over product of spheres.
method Moment-SOS hierarchy, local optimality conditions, differential geometry, Morse theory.
result The moment-SOS hierarchy has finite convergence for generic multihomogeneous objective functions.
The paper connects moment maps to the stability of holomorphic fibrations.
problem Stability of holomorphic fibrations.
method Use of moment maps and K-stability criteria.
result Existence of optimal symplectic connections implies stability of fibrations.
Investigates properties of moment maps and stratifications on Lie groups.
problem Understanding moment maps and stratifications on real reductive Lie groups.
method Functorial, algebraic approach to moment map and Kirwan-Ness stratification.
result Properties and properties of moment maps and stratifications established.
Q-MMR evaluates policies using reweighted rewards and moment matching.
problem Off-policy evaluation in finite-horizon MDPs.
method Q-MMR learns scalar weights for data points via a moment matching objective against a value-function discriminator class.
result Data-dependent finite-sample guarantee with a dimension-free error bound.
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.
The paper improves PAC-Bayes bounds for losses with finite moments.
problem Bounding generalization for losses with heavy tails and finite moments.
method Truncation method and PAC-Bayes bounds for unbounded losses with heavy tails and bounded variance.
result Bounds interpolate between slow and fast rates depending on the moment.
We consider the dynamics of a linear stochastic approximation algorithm driven by Markovian noise, and derive finite-time bounds on the moments of the error, i.e., deviation of the output of the algorithm from the equilibrium point of an associated ordinary differential equation (ODE). We obtain finite-time bounds on t…
New KCM tests improve specification testing via RKHS.
problem Improving specification tests for econometric models.
method Kernel conditional moment (KCM) tests based on RKHS.
result KCM tests have better finite-sample performance than existing tests.
Study on eigenvalue distribution of correlated time series, showing deformation of Marchenko-Pastur distribution.
problem Eigenvalue distribution of Wishart matrix with temporal correlation.
method Analysis of moments and convergence to deformed Marchenko-Pastur distribution for Gaussian process with temporal correlation.
result Eigenvalue distribution converges to deformed Marchenko-Pastur distribution with longer tail and higher peak.
Expands newsvendor model with moment constraints using Wasserstein distance.
problem Optimizing order quantity under distributional ambiguity.
method Formulates infinite dimensional primal problem, derives finite dimensional dual problem using problem of moments duality.
result Distributional ambiguity affects optimal order quantity and profits/costs.
Independent component analysis (ICA) is the problem of efficiently recovering a matrix A∈Rn×n from i.i.d. observations of X=AS where S∈Rn is a random vector with mutually independent coordinates. This problem has been intensively studied, but all existing efficient algorithms w…
New method tightens sub-Gaussian concentration inequalities.
problem Estimating variance-type parameters of sub-Gaussian distributions.
method Using sub-Gaussian intrinsic moment norm to maximize normalized moments.
result Provides tighter sub-Gaussian concentration inequalities.
We consider a stochastic volatility model where the moment generating function of the logarithmic price is finite only on part of the real line. Using a new Tauberian result obtained in [1] and [2], we show that the knowledge of the moment generating function near its critical moment gives a sharp asymptotic expansion …
Optimal Transport (OT) problems arise in a wide range of applications, from physics to economics. Getting numerical approximate solution of these problems is a challenging issue of practical importance. In this work, we investigate the relaxation of the OT problem when the marginal constraints are replaced by some mome…
Empower efficient representation of distributions through moment-preserving methods.
problem Representing high-dimensional probability measures efficiently and accurately.
method Empower efficient representation of distributions through moment-preserving methods.
result Empowers efficient and accurate representation of high-dimensional probability measures.
This paper examines how data affects risk measures in uncertain distributions.
problem How does distributional ambiguity affect risk measures?
method Formulated and derived simpler dual problems for infinite and finite dimensional robust moment problems.
result Developed theory and conducted experiments in inventory control and portfolio management.
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.
In this paper we consider finite volume hyperbolic manifolds X with non-empty totally geodesic boundary. We consider the distribution of the times for the geodesic flow to hit the boundary and derive a formula for the moments of the associated random variable in terms of the orthospectrum. We show that the the first tw…
We discuss various aspects of moment map geometry in symplectic and hyperKähler geometry. In particular, we classify complete hyperKähler manifolds of dimension 4n with a tri-Hamiltonian action of a torus of dimension n, without any assumption on the finiteness of the Betti numbers. As a result we find that the hyp…
Corrected moment-based methods improve inference in topic model regression.
problem Inferential difficulties in topic model plug-in workflow for regression.
method Corrected spectral moment methods for LDA, response-weighted word moments.
result Direct identification of regression coefficients without estimating topic shares.
Many inference problems involving questions of optimality ask for the maximum or the minimum of a finite set of unknown quantities. This technical report derives the first two posterior moments of the maximum of two correlated Gaussian variables and the first two posterior moments of the two generating variables (corre…
The study proves the finiteness of moments for Gaussian field zeros and critical points.
problem Finiteness of moments for Gaussian field zeros and critical points.
method Definition and study of multijets, construction of p-multijet bundles.
result Linear statistics of Gaussian field zeros have finite p-th moments for p ≥ 1.
The paper analyzes distances and volumes in lens spaces using recursion and formulas.
problem The problem of moments for distances between points on lens spaces.
method Derivation of recursion relations, formulas for moments and moment generating function, explicit formula for ball volumes.
result Explicit formulas for the volume of balls of all radii in lens spaces.
We introduce a class of probability measure-valued diffusions, coined polynomial, of which the well-known Fleming--Viot process is a particular example. The defining property of finite dimensional polynomial processes considered by Cuchiero et al. (2012) and Filipovic and Larsson (2016) is transferred to this infinite …
Infinite dimensional measure-valued processes modeled as polynomial diffusions.
problem Modeling term structure in energy markets using measure-valued polynomial diffusions.
method Introduced measure-valued polynomial diffusions, derived moment formulas, and characterized infinitesimal generators.
result Recovery of measure-valued affine diffusions as a special case.
In a recent paper [\textit{M. Cristelli, A. Zaccaria and L. Pietronero, Phys. Rev. E 85, 066108 (2012)}], Cristelli \textit{et al.} analysed relation between skewness and kurtosis for complex dynamical systems and identified two power-law regimes of non-Gaussianity, one of which scales with an exponent of 2 and the oth…
Unified framework for mean testing under truncation bias.
problem High-dimensional mean testing under arbitrary truncation.
method Characterizes fundamental limits and develops a simple second-order test.
result Unified framework connects finite-moment, sub-Gaussian, and median-regular structural regimes.
This thesis studies domain adaptation under minimal distribution similarity assumptions using moments.
problem Learning from samples with distributions different from training samples.
method Uses minimal similarity assumptions modeled by moments.
result Establishes learning bounds and algorithms for domain adaptation.
The moment-angle complex Z_K is cell complex with a torus action constructed from a finite simplicial complex K. When this construction is applied to a triangulated sphere K or, in particular, to the boundary of a simplicial polytope, the result is a manifold. Moment-angle manifolds and complexes are central objects in…
New method finds closest martingale to Brownian motion.
problem Finding optimal martingale interpolating marginals.
method Martingale Sinkhorn algorithm, iterative scheme.
result Algorithm yields Bass potential in arbitrary dimension.
The paper explores how market-based returns depend on past trade values.
problem Improving accuracy in forecasting market-based average and volatility of returns.
method Derives the dependence of market-based volatility and higher statistical moments of returns on statistical moments and correlations of current and past trade values.
result Market-based statistical moments can be approximated by a finite number of moments, improving forecast reliability.
We develop a scale-invariant truncated Lévy (STL) process to describe physical systems characterized by correlated stochastic variables. The STL process exhibits Lévy stability for the probability density, and hence shows scaling properties (as observed in empirical data); it has the advantage that all moments are fini…
Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a random walk on such G converges to the Gromov boundary almost surely. We apply the co…
New stability framework relaxes boundedness assumptions for generalization bounds.
problem Overly restrictive assumptions for modern learning settings with heavy-tailed or unbounded losses.
method Develops a stability-based framework requiring only finite Lp moment conditions. result Sharp generalization bounds derived for various learning paradigms.
Study on SA with heavy-tailed and LRD noise, establishing finite-time bounds.
problem Analyzing stochastic approximation under heavy-tailed and LRD noise.
method Noise-averaging argument to regularize impact of non-classical noise.
result Established first finite-time moment bounds for SA under heavy-tailed and LRD noise.
We prove that in metric measure spaces where the entropy functional is K-convex along every Wasserstein geodesic any optimal transport between two absolutely continuous measures with finite second moments lives on a non-branching set of geodesics. As a corollary we obtain that in these spaces there exists only one opti…
MGD combines maximum entropy and diffusion methods for efficient sampling.
problem Generating samples from limited information in high dimensions.
method Moment Guided Diffusion (MGD) using stochastic differential equations.
result MGD efficiently samples maximum entropy distributions in finite time.
Volterra square-root process boundary behavior and martingale measures
problem Boundary behavior of the Volterra square-root process
method Comparison principles for Volterra integral equations and generalized Riemann-Liouville fractional equations
result Finiteness of negative p-moments and atom at the boundary for rough kernels The paper improves generalization bounds for domain adaptation.
problem Improving generalization bounds for domain adaptation under practical conditions.
method Derives generalization bounds for domain adaptation based on finitely many moments and smoothness conditions.
result Obtains generalization bounds for domain adaptation.
A pairs trading model with time-varying volatility using stochastic control.
problem Optimizing pairs trading strategies with fluctuating asset volatilities.
method Stochastic control techniques, Finite Difference method, Generalized Method of Moments.
result Optimal trading strategies maximizing expected power utility from terminal wealth.