RAME adapts learning rates using recent first moment of gradients.
problem Training deep neural networks efficiently and adaptively.
method RAME computes individual learning rates using the most recent first moment of gradients.
result RAME outperforms SHB, Adam, and RMSprop in convergence speed and generalization performance.
This paper proves injectivity and support theorems for tensor fields on Riemannian manifolds.
problem Injectivity and support theorems for integral moments of m-tensor fields.
method Generalized Helgason's support theorem and used first m+1-integral moments of m-tensor fields.
result Injectivity and support theorems for integral moments of m-tensor fields.
Analyzes GJR-GARCH moments for efficient predictive distributions.
problem Estimating moments of GARCH processes for accurate predictions.
method Derives analytic expressions for GJR-GARCH moments and their limits.
result Analytic moments provide excellent approximate predictive distributions.
Method detects confounders in high-dimensional linear models using spectral measure first moments.
problem Detecting confounders in high-dimensional linear models.
method Uses the first moment of the spectral measure of the regression coefficient vector.
result Statistical asymmetry in first moments of spectral measures indicates the presence of confounders.
Developed moment estimators for affine stochastic volatility models.
problem Estimating parameters of affine stochastic volatility models.
method Introduced recursive equations for moments and proposed moment estimators.
result Established a central limit theorem and derived asymptotic covariance matrix.
In this paper we will study the statistics of the unit geodesic flow normal to the boundary of a hyperbolic manifold with non-empty totally geodesic boundary. Viewing the time it takes this flow to hit the boundary as a random variable, we derive a formula for its moments in terms of the orthospectrum. The first moment…
Generalizes moment-matching for exponential families with conditioning or hidden data.
problem Generalizing moment-matching conditions for exponential families with conditioning or hidden data.
method First-principles explanation and self-contained derivation of generalized moment-matching conditions.
result Derives generalized moment-matching conditions for conditional exponential families and hidden data.
New KSDs control moments in approximations, improving diagnostics and tests.
problem Inability of standard KSDs to control moment convergence.
method Developed alternative diffusion KSDs under sufficient conditions.
result First KSDs to exactly characterize q-Wasserstein convergence.
Introduces generalized moment maps for almost Hermitian settings.
problem Extending classical moment map theory to almost Hermitian settings.
method Introduces momentumly closed forms and proves a variant of the Darboux-Weinstein theorem.
result Establishes convexity property and constructs reduction space for generalized moment maps.
JME continually estimates data moments privately and accurately.
problem Private and accurate continual estimation of data moments.
method Uses matrix mechanism and joint sensitivity analysis.
result Improves accuracy in estimating mean and covariance with reduced noise.
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.
Paper provides Edgeworth expansions for network moments, improving accuracy of sampling distributions.
problem Accurate descriptions of sampling distributions of network moment statistics.
method Edgeworth expansion applied to studentized network moment statistics.
result Higher-order accurate approximation to sampling CDF of network moment statistics.
Polynomial-time algorithm learns high-dimensional halfspaces without labels.
problem Learning high-dimensional halfspaces with margins in polynomial time.
method Contrastive moments and polynomial-time algorithm.
result Establishes the unique and efficient identifiability of the hidden halfspace.
We derive expressions for the first three moments of the decision time (DT) distribution produced via first threshold crossings by sample paths of a drift-diffusion equation. The "pure" and "extended" diffusion processes are widely used to model two-alternative forced choice decisions, and, while simple formulae for ac…
New method unfolds distribution moments directly from data without binning.
problem Deconvolving detector distortions in particle physics.
method Uses machine learning, inspired by GANs, to unfold moments directly.
result More precise than bin-based approaches and comparable to unbinned methods.
A new method of moments estimator goes beyond data reweighting.
problem Estimation of moment restrictions and conditional moment restrictions.
method Kernel Method of Moments (KMM) based on maximum mean discrepancy.
result KMM achieves competitive performance on conditional moment restriction tasks.
The paper trivializes moment maps for various geometric structures.
problem Trivializing moment maps for different geometric structures.
method General framework of a reductive group G acting on a smooth affine variety, using Kempf-Ness theory, Morse theory, and ideas from Nakajima and Kronheimer. result Locally trivial fibration of moment maps over a regular locus of the center of the Lie algebra of a maximal compact subgroup.
Method learns moments for large implicit models, improving image generation quality.
problem Difficulty in defining and selecting moments for training large implicit models.
method Introduced moment network and used asymptotic theory to define and learn better moments.
result MoLM-trained generators outperform other methods in quality and diversity of generated images.
Proof of a simpler orthogonal double machine learning method.
problem Consistency and asymptotic normality of machine learning estimates.
method Alternative proof for Z-estimator in simpler setting.
result Orthogonal moments and consistency imply asymptotic normality.
New proof of Sobolev inequality with constraints on sphere.
problem Improving Sobolev inequality on sphere with constraints.
method Careful study of extremal problem on sphere.
result Explicit determination of constant in second order moments case.
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.
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.
The paper proposes a method to estimate complex models using machine learning.
problem Estimating the impact of welfare reform on women's welfare participation.
method Regularized orthogonal machine learning for non-linear semiparametric models.
result The proposed Lasso estimator converges at the oracle rate, preserving the single index property.
Unified framework for imitation learning via moment matching.
problem Closing the gap between imitation and real-world performance.
method Classifying imitation learning algorithms based on reward or action-value moment matching, considering adversarial divergences.
result Derivation of bounds on policy performance for all algorithms in each class, and introduction of moment recoverability.
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…
Normal distributions ensure asymptotic variance reduction in moment matching Monte Carlo.
problem Asymptotic variance reduction in general integration problems.
method Characterization of conditions for asymptotic variance reduction using normal distributions.
result Asymptotic variance reduction is guaranteed for normal distributions in moment matching Monte Carlo.
We select n stocks traded in the New York Stock Exchange and we form a statistical ensemble of daily stock returns for each of the k trading days of our database from the stock price time series. We analyze each ensemble of stock returns by extracting its first four central moments. We observe that these moments are fl…
The paper analyzes extreme risk measures with limited distributional information.
problem Investigating risk measures under partial knowledge of distribution moments and shape.
method Employing probability inequalities and modified Schwarz inequality to derive bounds on distortion risk measures.
result Unified framework for calculating best- and worst-case scenarios of distortion risk measures.
The paper examines how market trade values and volumes affect price autocorrelation.
problem Understanding the impact of market trade values and volumes on price autocorrelation.
method Derives the dependence of price statistical moments and volatility on trade values and volumes, and assesses statistical moments and correlations by conventional frequency-based probabilities.
result Highlights the impact of market trade randomness on price statistical moments and autocorrelation.
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.
Market-based asset price probability depends on trade volumes and values, improving forecasts and reliability.
problem Limited accuracy of frequency-based asset price statistical moments.
method Derive market-based variance and 3rd statistical moment from trade values and volumes, accounting for trade volume randomness.
result Market-based statistical moments improve price probability forecasts and reliability.
The paper calculates moments and conditional risks for skewed elliptical distributions.
problem Estimating moments and tail conditional risks for skewed elliptical distributions.
method Derives explicit expressions for multivariate doubly truncated moments and conditional risks for generalized skew-elliptical distributions.
result Explicit formulas for multivariate doubly truncated moments and conditional risks are derived for various skewed elliptical distributions.
We consider moment matching techniques for estimation in Latent Dirichlet Allocation (LDA). By drawing explicit links between LDA and discrete versions of independent component analysis (ICA), we first derive a new set of cumulant-based tensors, with an improved sample complexity. Moreover, we reuse standard ICA techni…
Study compares eigenvalues and moment spectra of geodesic balls in Riemannian manifolds.
problem Comparing eigenvalues and moment spectra of geodesic balls in Riemannian manifolds.
method Explicit upper and lower bounds for Poisson hierarchy and torsional rigidity.
result Equality of eigenvalues and moment spectra characterizes the model space.
Study compares optimal vs. naive diversification in crypto markets, finds time-varying moments improve performance.
problem Optimizing portfolio construction in volatile crypto markets.
method Examines time-varying moments and transaction costs, incorporates turnover penalty.
result Time-varying moment estimators outperform conventional estimators in practical portfolio construction.
Enhances binomial and trinomial models for equity options pricing.
problem Improving accuracy of equity option pricing models.
method Develops time-dependent binomial model and introduces a risk-neutral trinomial tree.
result Equates moments of pricing tree increments to geometric Brownian motion.
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…
Study resolvent convergence for random matrices with general covariance profiles.
problem Analyzing resolvent convergence for random matrices with non-identically distributed columns.
method Using moments of quadratic forms and deterministic equivalents, the study provides bounds on the trace of matrix products.
result The trace of matrix products is close to the trace of a deterministic equivalent, controlled by matrix norms.
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.
DGMM improves Gaussian mixture modeling efficiency and stability.
problem Efficiently estimating Gaussian mixtures in high dimensions.
method Diagonally-weighted generalized method of moments (DGMM).
result DGMM achieves smaller estimation errors with shorter runtime.
Paper proposes a new method for density estimation using squared Hellinger distance.
problem Density estimation using moment methods is sensitive to the choice of functions.
method Proposes a non-classical parametrization using squared Hellinger distance for density estimation.
result The proposed method does not require choosing functions and can be solved by convex optimization.
The scalar curvature is redefined in generalized Kahler geometry as a moment map.
problem Defining scalar curvature in generalized Kahler geometry.
method Introducing a moment map in generalized Kahler geometry to define a generalized scalar curvature.
result Infinitesimal deformations of generalized Kahler structures with constant generalized scalar curvature are finite-dimensional.
Improved Moser-Trudinger-Onofri inequality with constraints on sphere.
problem Improving constant in Moser-Trudinger-Onofri inequality with constraints.
method Generalization to higher order moments and perturbation method.
result New inequalities with similarity to Lebedev-Milin type inequalities.
Unified framework for FDR control in knockoffs, validating Gaussian knockoffs.
problem Asymptotic FDR control in knockoffs with user-specified distributions.
method Unified theoretical framework, three conditions on approximate knockoff statistics, Gaussian knockoffs generator based on moments matching.
result Gaussian knockoffs generator achieves asymptotic FDR control.
Study of generalized almost-Kähler-Ricci solitons and their implications.
problem Existence of first-Chern-Einstein almost-Kähler metrics on compact symplectic Fano manifolds.
method Generalization of Kähler-Ricci solitons to almost-Kähler setting, study of moment map and Lie algebra of holomorphic vector fields.
result Existence of generalized almost-Kähler-Ricci solitons as obstructions and implications for symplectic Fano manifolds.
The paper derives risk measures for metalog distributions.
problem Deriving risk measures for metalog distributions.
method Closed-form expressions for Conditional Value at Risk and first-order partial moments.
result First-order partial moments are convex with respect to metalog parameters.
We characterise the actions, by holomorphic isometries on a Kähler manifold with zero first Betti number, of an abelian Lie group of dim\geq 2, for which the moment map is horizontally weakly conformal (with respect to some Euclidean structure on the Lie algebra of the group). Furthermore, we study the hyper-Kähler mom…
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…