In this paper, we investigate the popular deep learning optimization routine, Adam, from the perspective of statistical moments. While Adam is an adaptive lower-order moment based (of the stochastic gradient) method, we propose an extension namely, HAdam, which uses higher order moments of the stochastic gradient. Our …
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.
Trend · papers per month
Improved GAN performance using higher-order Wasserstein moments.
Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.
Paper characterizes equilibrium strategies for stochastic control with higher-order moments.
Sharp inequalities in unit ball with constraints on moments.
Paper provides Edgeworth expansions for network moments, improving accuracy of sampling distributions.
The moments of spatial probabilistic systems are often given by an infinite hierarchy of coupled differential equations. Moment closure methods are used to approximate a subset of low order moments by terminating the hierarchy at some order and replacing higher order terms with functions of lower order ones. For a give…
Betas are possibly the most frequently applied tool to analyze how securities relate to the market. While in very widespread use, betas only express dynamics derived from second moment statistics. Financial returns data often deviate from normal assumptions in the sense that they have significant third and fourth order…
Paper tackles non-convex optimization for higher moments in portfolio management.
The paper improves CR Sobolev inequalities and classifies minimizers.
The paper examines higher moments in insurance, focusing on coskewness and its impact on actuarial quantities.
New proof of Sobolev inequality with constraints on sphere.
New method quantifies uncertainty in denoising models.
Approximates discounted moments for financial products using polynomial expansions.
The learning of domain-invariant representations in the context of domain adaptation with neural networks is considered. We propose a new regularization method that minimizes the discrepancy between domain-specific latent feature representations directly in the hidden activation space. Although some standard distributi…
Proposes DWMD for better matching of hidden representations across domains.
Framework predicts nonlinear system responses using GFDT and generative models.
Spectral learning extends matrix methods to tensors for better latent variable modeling.
A classical result of Aubin states that the constant in Moser-Trudinger-Onofri inequality on can be imporved for furnctions with zero first order moments of the area element. We generalize it to higher order moments case. These new inequalities bear similarity to a sequence of Lebedev-Milin type inequa…
Many nonlinear extensions of the Kalman filter, e.g., the extended and the unscented Kalman filter, reduce the state densities to Gaussian densities. This approximation gives sufficient results in many cases. However, this filters only estimate states that are correlated with the observation. Therefore, sequential esti…
We develop and implement a novel fast bootstrap for dependent data. Our scheme is based on the i.i.d. resampling of the smoothed moment indicators. We characterize the class of parametric and semi-parametric estimation problems for which the method is valid. We show the asymptotic refinements of the proposed procedure,…
Study improves BN TTA under distribution shift using higher-order asymptotics.
Expectation Propagation (EP) provides a framework for approximate inference. When the model under consideration is over a latent Gaussian field, with the approximation being Gaussian, we show how these approximations can systematically be corrected. A perturbative expansion is made of the exact but intractable correcti…
Any optimization algorithm based on the risk parity approach requires the formulation of portfolio total risk in terms of marginal contributions. In this paper we use the independence of the underlying factors in the market to derive the centered moments required in the risk decomposition process when the modified vers…
In the first part of the paper, comprising section 1 through 6, we introduce a sequence of functions in the tangent bundle TM of any smooth two-dimensional manifold M with smooth Riemannian metric g that correspond to the higher order Schwarzians of the linearized geodesic flow. With these functions and a classical the…
DGMM improves Gaussian mixture modeling efficiency and stability.
New VAE models reveal hierarchical visual cortex computations.
To deepen our understanding of graph neural networks, we investigate the representation power of Graph Convolutional Networks (GCN) through the looking glass of graph moments, a key property of graph topology encoding path of various lengths. We find that GCNs are rather restrictive in learning graph moments. Without c…
Extracts representative scenarios from large data panels.
Realized moments of higher order computed from intraday returns are introduced in recent years. The literature indicates that realized skewness is an important factor in explaining future asset returns. However, the literature mainly focuses on the whole market and on the monthly or weekly scale. In this paper, we cond…
A method to estimate high order derivatives of data distributions from samples.
The paper analyzes multivariate payments in multi-state life insurance using Markovian state processes.
Polynomial-time algorithm learns ReLU networks without assumptions.
Roy's `Safety First' criterion for selecting one risky asset from many is adapted to the case of non-normal returns, via Cornish Fisher expansion. The resulting investment objective is consistent with first order stochastic dominance, and is equal to the Sharpe ratio for the case of normal returns. An investor selectin…
In this paper we propose a semi-Markov modulated model of interest rates. We assume that the switching process is a semi-Markov process with finite state space E and the modulated process is a diffusive process. We derive recursive equations for the higher order moments of the discount factor and we describe a Monte Ca…
This paper presents hedging strategies for European and exotic options in a Levy market. By applying Taylor's Theorem, dynamic hedging portfolios are con- structed under different market assumptions, such as the existence of power jump assets or moment swaps. In the case of European options or baskets of European optio…
Algorithm tackles large-scale portfolio optimization with higher moments, improving computational efficiency.
Proposes a new method for big portfolio selection using graph-based conditional moments.
Parameters defined via General Estimating Equations (GEE) can be estimated by maximizing the Empirical Likelihood (EL). Newey and Smith (2004) have recently shown that this EL estimator exhibits desirable higher-order asymptotic properties, namely, that its O(n^-1) bias is small and that bias-corrected EL is higher-ord…
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…
Parameters defined via general estimating equations (GEE) can be estimated by maximizing the empirical likelihood (EL). Newey and Smith [Econometrica 72 (2004) 219--255] have recently shown that this EL estimator exhibits desirable higher-order asymptotic properties, namely, that its bias is small and that …
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…
In an efficient stock market, the log-returns and their time-dependent variances are often jointly modelled by stochastic volatility models (SVMs). Many SVMs assume that errors in log-return and latent volatility process are uncorrelated, which is unrealistic. It turns out that if a non-zero correlation is included in …
A novel approach for unsupervised domain adaptation for neural networks is proposed. It relies on metric-based regularization of the learning process. The metric-based regularization aims at domain-invariant latent feature representations by means of maximizing the similarity between domain-specific activation distribu…
Paper examines risk measure expansions under FGM dependence, improving accuracy at extreme levels.
Overcomplete latent representations have been very popular for unsupervised feature learning in recent years. In this paper, we specify which overcomplete models can be identified given observable moments of a certain order. We consider probabilistic admixture or topic models in the overcomplete regime, where the numbe…
We evaluate the average waiting time between observing the price of financial markets and the next price change, especially in an on-line foreign exchange trading service for individual customers via the internet. Basic technical idea of our present work is dependent on the so-called renewal-reward theorem. Assuming th…
New method identifies structural parameters without assuming uncorrelated errors.