This paper proposes a Lasso-type estimator for a high-dimensional sparse parameter identified by a single index conditional moment restriction (CMR). In addition to this parameter, the moment function can also depend on a nuisance function, such as the propensity score or the conditional choice probability, which we es…
Modern statistical inference tasks often require iterative optimization methods to compute the solution. Convergence analysis from an optimization viewpoint only informs us how well the solution is approximated numerically but overlooks the sampling nature of the data. In contrast, recognizing the randomness in the dat…
Improved GAN performance using higher-order Wasserstein moments.
problem Stabilizing and enhancing GANs for better mode coverage and stability.
method Deriving and training a GAN with a modified Wasserstein distance using higher-order moments.
result Training a GAN with higher-order Wasserstein moments improves performance, even with increased computational cost.
A model explains why 4% is a safe retirement withdrawal rate.
problem Determining a safe withdrawal rate for American retirees.
method Discrete-time model of stochastic returns on assets and their moments.
result The 4% rule emerges from adjusting high expected rates of return for various risks.
This paper considers the problem of implementing large-scale gradient descent algorithms in a distributed computing setting in the presence of {\em straggling} processors. To mitigate the effect of the stragglers, it has been previously proposed to encode the data with an erasure-correcting code and decode at the maste…
We analyze the practical consequences of the bilateral counterparty risk adjustment. We point out that past literature assumes that, at the moment of the first default, a risk-free closeout amount will be used. We argue that the legal (ISDA) documentation suggests in many points that a substitution closeout should be u…
This note is concerned with accurate and computationally efficient approximations of moments of Gaussian random variables passed through sigmoid or softmax mappings. These approximations are semi-analytical (i.e. they involve the numerical adjustment of parametric forms) and highly accurate (they yield 5% error at most…
As a consequence of the dependence experienced in loan portfolios, the standard binomial test which is based on the assumption of independence does not appear appropriate for validating probabilities of default (PDs). The model underlying the new rules for minimum capital requirements (Basle II) is taken as a point of …
AdamNX improves Adam's stability by adjusting its learning rate.
problem Adam's tendency to converge to non-flat minima in large-scale models.
method Proposes a novel exponential decay mechanism for Adam's second-order moment estimate.
result AdamNX outperforms Adam and its variants in stability and performance.
Enhances flexibility in data reweighting with optimal transport and maximum entropy principles.
problem Adapting empirical distributions to predefined constraints on moments, tail behavior, etc.
method Nonparametric distributional constraints, maximum entropy principle, optimal transport.
result Maximum entropy weight adjusted empirical distribution close to a specified distribution in optimal transport metric.
This paper demonstrates the efficiency of using Edgeworth and Gram-Charlier expansions in the calibration of the Libor Market Model with Stochastic Volatility and Displaced Diffusion (DD-SV-LMM). Our approach brings together two research areas; first, the results regarding the SV-LMM since the work of Wu and Zhang (200…
We describe a simple Importance Sampling strategy for Monte Carlo simulations based on a least squares optimization procedure. With several numerical examples, we show that such Least Squares Importance Sampling (LSIS) provides efficiency gains comparable to the state of the art techniques, when the latter are known to…
HMC with leapfrog integrator mixes faster than MALA under certain smoothness conditions.
problem Analyzing the mixing time of HMC and MALA for sampling from smooth distributions.
method Bounding gradient complexity and leveraging invariance of joint distribution.
result Metropolized HMC with more leapfrog steps outperforms MALA in total variation distance.
Debiased learners estimate heterogeneous treatment effects in observational studies.
problem Estimating heterogeneous treatment effects in observational studies with unmeasured confounders.
method Debiased Front-Door (FD) learners, FD-DR-Learner and FD-R-Learner, under specific assumptions.
result Debiased learners satisfy error bounds and stage-error decompositions, delivering reliable HTE estimates.
Models with many signals, high-dimensional models, often impose structures on the signal strengths. The common assumption is that only a few signals are strong and most of the signals are zero or close (collectively) to zero. However, such a requirement might not be valid in many real-life applications. In this article…
The paper tackles fVaR prediction methods in finance.
problem Predicting future values at risk (fVaR) in finance.
method Various methods including Nested MC-empirical quantile, percentiles from distributions, quantile regressions, and limited inner simulations.
result Improved methods for predicting fVaRs, including those that are computationally efficient.
Estimates proxy-based inference adjustments for distribution shifts.
problem Imperfect proxy data leads to biased inference.
method Empirical calibration of proxy-primary metric discrepancy as a random effect.
result Empowers inference without individual-level response data.
This article presents a new model for demographic simulation which can be used to forecast and estimate the number of people in pension funds (contributors and retirees) as well as workers in a public institution. Furthermore, the model introduces opportunities to quantify the financial ows coming from future populatio…
The paper explores how control variates can reduce variance in Monte Carlo simulations, especially for Sobolev functions.
problem Efficiency of control variates in reducing variance for Monte Carlo simulations.
method Study of a specific quadrature rule using nonparametric regression-adjusted control variates.
result A specific quadrature rule can improve the Monte Carlo rate and achieve the minimax optimal rate under sufficient smoothness assumptions.
A new causal graph framework identifies treatment effects without adjusting for confounders.
problem Invalid identification of causal effects due to unmeasured confounders.
method Developed the Napkin graph to identify causal effects through a ratio of g-formulas, using influence-function-based estimators.
result Demonstrated substantial efficiency gains in estimating causal effects using the Napkin graph.
New algorithm speeds up sampling from complex distributions.
problem Efficiently sampling from non-log-concave distributions.
method Stochastic Proximal Samplers (SPS) based on SGLD and MALA.
result SPS-SGLD and SPS-MALA achieve faster sampling with reduced gradient complexity.
High frequency data in finance have led to a deeper understanding on probability distributions of market prices. Several facts seem to be well stablished by empirical evidence. Specifically, probability distributions have the following properties: (i) They are not Gaussian and their center is well adjusted by Levy dist…
A new method calculates fractional moments using the moment-generating function.
problem Computing fractional moments from probability densities.
method Integral framework based on moment-generating function.
result Exact integral expressions for various types of moments.
Study compares weak and homotopy moment maps in multisymplectic geometry.
problem Existence and equivariance of moment maps in multisymplectic geometry.
method Comparison of weak and homotopy moment maps.
result Analysis of existence and equivariance phenomena.
A method estimates causal parameters using a latent variable recovery.
problem Estimating causal parameters in contexts with multiple causes and unobserved confounding.
method Substitute adjustment via recovery of latent variables.
result Substitute adjustment estimates adjusted regression parameters under certain conditions.
This article provides a new representation for pricing adjustments in derivatives.
problem Derivative pricing adjustments and XVA (Expected Value of All Risk) models.
method An Ito SDE/parabolic PDE framework to encapsulate pricing adjustments.
result A new representation that encompasses various past adjustments.
A new method for analyzing adaptive experiments using kernel treatment effects.
problem Efficiently analyzing adaptive experiments that adjust treatment assignments based on outcomes.
method Kernel Treatment Effects (KTE) framework combining RKHS scores and witness functions.
result Effective for both mean shifts and higher-moment differences, outperforming adaptive baselines.
For a GJR-GARCH specification with a generic innovation distribution we derive analytic expressions for the first four conditional moments of the forward and aggregated returns and variances. Moment for the most commonly used GARCH models are stated as special cases. We also the limits of these moments as the time hori…
Confounding bias, missing data, and selection bias are three common obstacles to valid causal inference in the data sciences. Covariate adjustment is the most pervasive technique for recovering casual effects from confounding bias. In this paper, we introduce a covariate adjustment formulation for controlling confoundi…
New graphical criteria for efficient covariate adjustment in non-parametric causal models.
problem Estimating population average treatment effects in observational studies using non-parametric causal graphical models.
method Developed new graphical criteria to determine efficient covariate adjustment sets for estimating treatment effects in non-parametric causal graphical models.
result Graphical criteria for efficient covariate adjustment can be applied in both linear and non-parametric causal models.
This paper identifies and bounds ICE central moments using PO marginal central moments.
problem Identifying and characterizing treatment effect heterogeneity.
method Using only marginal central moments of potential outcomes, the paper identifies and bounds central moments of individual causal effects.
result Identification and bounding of central moments of ICE using marginal moments of POs.
We tackle causal inference under conditional moment restrictions using importance weighting.
problem Challenges in causal inference under conditional moment restrictions, especially in high-dimensional settings.
method Transform conditional moment restrictions to unconditional moment restrictions through importance weighting.
result Successfully estimate nonparametric functions defined under conditional moment restrictions.
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.
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.
Stiefel-Whitney classes of moment-angle manifolds are trivial.
problem Analyzing the topological properties of moment-angle manifolds.
method Proving triviality of Stiefel-Whitney classes for moment-angle manifolds, including partial quotients.
result Stiefel-Whitney classes of moment-angle manifolds are trivial.
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.
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.
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.
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.
Constructs a moment map flow for isotropic maps on surfaces.
problem Understanding isotropic maps on surfaces and their properties.
method Develops a Kähler moment map geometry and a modified moment map flow.
result Polyhedral modified moment map flow induces a strong deformation retraction.
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.
Moment Pooling reduces latent space dimensions in machine learning models.
problem High-dimensional latent spaces in machine learning models are hard to interpret.
method Moment Pooling extends Deep Sets networks to arbitrary multivariate moments.
result Latent dimensions as small as 1 can achieve similar performance to higher dimensions.
Deformation quantization yields a new moment map on symplectic diffeomorphisms.
problem Formalizing moment maps on diffeomorphism groups of symplectic manifolds.
method Deformation quantization framework applied to extrmDiff0(M). result Obtained a deformation of the Donaldson moment map.
This study links blockchain design to cryptos' distributional characteristics.
problem Understanding the relationship between blockchain design and cryptos' distributional characteristics.
method Used spectral clustering to cluster cryptos based on their blockchain mechanisms and operational features.
result Clusters of cryptos share similar blockchain mechanisms, supporting the hypothesis.
The paper derives formulas for moments of a Student t distribution and applies them to quantify Lp-quantiles.
problem Understanding the moments and quantiles of a Student t distribution.
method Developed formulas for partial and complete moments, and derived relationships between Lp-quantiles. result For a Student t distribution, the Ln−j+1-quantile and Lj-quantile coincide at any confidence level. We propose a method of moments (MoM) algorithm for training large-scale implicit generative models. Moment estimation in this setting encounters two problems: it is often difficult to define the millions of moments needed to learn the model parameters, and it is hard to determine which properties are useful when specif…
We consider the class of self-similar Gaussian stochastic volatility models, and compute the small-time (near-maturity) asymptotics for the corresponding asset price density, the call and put pricing functions, and the implied volatilities. Unlike the well-known model-free behavior for extreme-strike asymptotics, small…
We propose a method to infer causal structures containing both discrete and continuous variables. The idea is to select causal hypotheses for which the conditional density of every variable, given its causes, becomes smooth. We define a family of smooth densities and conditional densities by second order exponential mo…