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,742 papers · 148 categories

Trend · papers per month

1223 · Oct 202219922001200920172026
48 results for method-of-moments

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.

Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…

2018-10-17abs ↗pdf ↗

Study uses machine learning to estimate effective policies in settings with hidden individual actions.

problem Estimating effective policies in settings with hidden individual actions.
method Instrumental Regression and Generalized Method of Moments (GMM) estimator.
result Demonstrates how to estimate a good contract in principal-agent problems.

This article investigates parameter estimation of affine term structure models by means of the generalized method of moments. Exact moments of the affine latent process as well as of the yields are obtained by using results derived for p-polynomial processes. Then the generalized method of moments, combined with Quasi-…

2015-08-07abs ↗pdf ↗

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.

Paper develops methods for estimating GLMs and SNR under proportional asymptotics.

problem Estimation of regression coefficients and SNR in high-dimensional GLMs.
method Method-of-Moments type estimators that bypass nuisance function estimation.
result Consistent and asymptotically normal estimators derived for targets of inference.

We address the problem of estimating the parameters of a time-homogeneous Markov chain given only noisy, aggregate data. This arises when a population of individuals behave independently according to a Markov chain, but individual sample paths cannot be observed due to limitations of the observation process or the need…

2016-04-14abs ↗pdf ↗

New SGMM algorithm for efficient estimation of moment restriction models.

problem Estimation and inference on overidentified moment restriction models.
method Stochastic Approximation to Generalized Method of Moments (SGMM).
result SGMM offers fast and scalable implementation with streaming dataset handling.

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.

Develops a robust GMM estimator for outlier-tolerant inference.

problem Sensitive GMM estimation to outliers in inference problems.
method Robustified GMM estimator with computational efficiency and recovery guarantees.
result First computationally efficient GMM estimator for εε fraction of adversarial outliers with O(ε)O(\sqrtε) recovery guarantee.

New framework assesses value of labeled vs unlabeled data in latent variable models.

problem Determining the optimal use of labeled and unlabeled data in latent variable models.
method Developed a bias-variance decomposition of the generalization error for method-of-moments latent variable estimation, and introduced a correction for misspecification.
result Labeled data is more valuable than unlabeled data when models are misspecified, but this value can be reduced with correction.

Transformer learns to estimate negative binomial parameters efficiently.

problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.

Mixture models are a fundamental tool in applied statistics and machine learning for treating data taken from multiple subpopulations. The current practice for estimating the parameters of such models relies on local search heuristics (e.g., the EM algorithm) which are prone to failure, and existing consistent methods …

2012-03-03abs ↗pdf ↗

New algorithm learns permutations mixtures with optimal sample complexity.

problem Learning mixtures of permutations in high-dimensional settings.
method Combining groups of pairwise comparisons and combinatorial method of moments.
result Optimal sample complexity proportional to log(n) for high-dimensional data.

Proposes a robust IV estimator using optimal transport for corrupted or adversarial data.

problem Lack of robustness in traditional IV estimators for corrupted or adversarial data.
method Integrates data-derivative information through optimal transport to address geometric aspects of data.
result Improves robustness against data corruption and adversarial attacks.

New method for ancestral inference in branching processes with random environments.

problem Determining ancestor distribution parameters in branching processes with random environments.
method Generalized method of moments for ancestral inference.
result Limiting distribution of ancestor and offspring estimators decouple and converge to independent Gaussian variables under certain conditions.

This work estimates edge weights of edge-reinforced random walks using observed data.

problem Statistical estimation of edge weights in edge-reinforced random walks.
method Proposes an estimator based on the generalized method of moments using the magic formula and hyperbolic Gaussian structure.
result Analyzes the sample complexity of the proposed estimator.

Efficient policy learning from observational data using weighted classification reductions.

problem Efficient policy evaluation does not necessarily lead to efficient estimation of policy parameters.
method Proposed an estimation approach based on generalized method of moments, efficient for policy parameters.
result Demonstrated empirical efficiency and regret benefits of a proposed method.

Generative adversarial networks are a novel method for statistical inference that have achieved much empirical success; however, the factors contributing to this success remain ill-understood. In this work, we attempt to analyze generative adversarial learning -- that is, statistical inference as the result of a game b…

2018-09-12abs ↗pdf ↗

Mixture modeling is a general technique for making any simple model more expressive through weighted combination. This generality and simplicity in part explains the success of the Expectation Maximization (EM) algorithm, in which updates are easy to derive for a wide class of mixture models. However, the likelihood of…

2016-03-28abs ↗pdf ↗

Optimal ability estimation in adaptive testing with binary responses.

problem Estimating a continuous ability parameter from sequential binary responses.
method Adaptive selection of questions to maximize Fisher information, updating estimate using method-of-moments, and deciding accuracy with a test statistic.
result Fisher-tracking strategy achieves optimal performance in fixed-confidence and fixed-budget regimes.

New estimator improves statistical validity of synthetic data integration.

problem Combining synthetic data generated by large language models with real data for valid inference.
method Generalized method of moments estimator with theoretical guarantees.
result Improves estimates of target parameter through interactions between synthetic and real data.

The Kalman filter and Heston model are used to estimate asset prices and trading performance.

problem Estimating asset prices using stochastic models.
method Kalman filter applied to mean-reverting processes and Heston model with method of moments.
result The Kalman filter and Heston model provide effective methods for estimating asset prices and trading performance.

Adaptive t-distribution estimates nonstationary time series using moving moments.

problem Nonstationary time series with varying dependence structure.
method Moving estimator optimizing a weighted log-likelihood, using exponential moving averages for moments.
result Evolution of ν parameter in Student's t-distribution, capturing tail behavior and extreme events.

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)}).

A tensor model for meta-learning adapts to task-specific features.

problem Learning shared representations for diverse tasks without task-specific observable information.
method Modeling meta-parameters as an order-3 tensor, estimating through tensor regression and method of moments.
result Tensor-based approach improves meta-learning performance with fewer samples.

We present an approximated maximum likelihood method for the multifractal random walk processes of [E. Bacry et al., Phys. Rev. E 64, 026103 (2001)]. The likelihood is computed using a Laplace approximation and a truncation in the dependency structure for the latent volatility. The procedure is implemented as a package…

2011-12-01abs ↗pdf ↗

Paper tackles non-identifiability of mixture models in partial order datasets.

problem Non-identifiability of mixture models in datasets with partial orders.
method Proved non-identifiability conditions and proposed GMM algorithms.
result GMM algorithms for learning mixtures of two Plackett-Luce models are consistent.

Many interesting real world domains involve reinforcement learning (RL) in partially observable environments. Efficient learning in such domains is important, but existing sample complexity bounds for partially observable RL are at least exponential in the episode length. We give, to our knowledge, the first partially …

2016-05-25abs ↗pdf ↗

Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a large random graph using only three or four parameters. Those parameters have however proved difficult to choose in specific applications. This article looks at method of moments estimators…

2011-06-08abs ↗pdf ↗

We develop a behavioral asset pricing model in which agents trade in a market with information friction. Profit-maximizing agents switch between trading strategies in response to dynamic market conditions. Due to noisy private information about the fundamental value, the agents form different evaluations about heteroge…

2018-02-11abs ↗pdf ↗

We present an efficient algorithm for learning mixed membership models when the number of variables pp is much larger than the number of hidden components kk. This algorithm reduces the computational complexity of state-of-the-art tensor methods, which require decomposing an O(p3)O\left(p^3\right) tensor, to factorizing…

2017-02-25abs ↗pdf ↗

We demonstrate that a number of sociology models for social network dynamics can be viewed as continuous time Bayesian networks (CTBNs). A sampling-based approximate inference method for CTBNs can be used as the basis of an expectation-maximization procedure that achieves better accuracy in estimating the parameters of…

2012-05-09abs ↗pdf ↗

We present a semi-supervised learning algorithm for learning discrete factor analysis models with arbitrary structure on the latent variables. Our algorithm assumes that every latent variable has an "anchor", an observed variable with only that latent variable as its parent. Given such anchors, we show that it is possi…

2015-11-10abs ↗pdf ↗

Agents' heterogeneity is recognized as a driver mechanism for the persistence of financial volatility. We focus on the multiplicity of investment strategies' horizons, we embed this concept in a continuous time stochastic volatility framework and prove that a parsimonious, two-scale version effectively captures the lon…

2012-05-31abs ↗pdf ↗