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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for moment control

Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.

problem Time-inconsistent stochastic control problems with mean and higher-order moments.
method Developed closed-loop and open-loop Nash equilibrium controls using PDEs and maximum principles.
result Identical closed-loop and open-loop Nash equilibria controls, independent of state value and random path.

New algorithm solves mean-field control problems using actor-critic learning with moment neural networks.

problem Solving mean-field control problems in continuous time reinforcement learning.
method Gradient-based policy and value function learning with moment neural networks on the Wasserstein space.
result Effective solution for diverse mean-field control problems, including multi-dimensional and nonlinear settings.

Paper characterizes equilibrium strategies for stochastic control with higher-order moments.

problem Stochastic control problems with higher-order moments.
method Novel characterization of time-consistent control problems, deriving equilibrium conditions via BSDEs.
result Derives sufficient and necessary conditions for an open-loop Nash equilibrium control (ONEC) in a novel way.

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.

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.

New method approximates diffusion process posteriors using moment functions.

problem Approximating posteriors of stochastic differential equations.
method Constructs variational process as controlled prior, approximates posterior with moment functions, uses natural gradient descent.
result Richer variational approximations for state-dependent diffusion terms.

A method learns representations for conditional moment models with controlled ill-posedness.

problem Efficient estimation of nonparametric conditional moment models with flexible models is challenging.
method Proposes a procedure that learns spectral representations with controlled measures of ill-posedness.
result The proposed method can efficiently estimate representations from data and is L2 consistent.

New algorithm for risk-sensitive reinforcement learning with natural policy gradients.

problem Risk-sensitive reinforcement learning with downside risk constraints.
method Introduce a new Bellman equation to estimate the lower partial moment of returns, use natural policy gradients, and extend Reward Constrained Policy Optimization.
result Sample-efficient estimation of partial moments and effective risk-sensitive control.

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.

Study how neural networks learn from non-Gaussian data models.

problem Understanding neural network learning dynamics with non-Gaussian data.
method Developed a two-layer neural network with Hermite polynomial activations to control high-order cumulants.
result Neural networks progressively learn high-order cumulants after capturing low-order statistics.

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.

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.

Learning rate needs to decrease with higher data moments for effective ICA in high dimensions.

problem Slower convergence of ICA in high-dimensional data with high-order moments.
method High-dimensional ODE analysis of ICA algorithm under controlled moment structure.
result Critical learning rate threshold for effective ICA when moments are high.

We prove explicit upper and lower bounds for the L1L^1-moment spectra for the Brownian motion exit time from extrinsic metric balls of submanifolds PmP^m in ambient Riemannian spaces NnN^{n}. We assume that PP and NN both have controlled radial curvatures (mean curvature and sectional curvature, respectively) as view…

2010-09-07abs ↗pdf ↗

We develop DTs for PDE models using KL-NN and TL, analyzing TL's moment equations and one-shot learning for exactness.

problem Creating accurate digital twins for systems governed by PDEs under changing conditions.
method We use KL-NN surrogate models and transfer learning to construct DTs, analyzing the moment equations and proposing one-shot and few-shot learning methods.
result For linear PDEs, one-shot TL is exact; for nonlinear PDEs, some parameters can be transferred with minimal error.

Optimal control of reserve assets for stablecoins to maintain peg stability.

problem Balancing immediate liquidity and yield on reserve assets for stablecoin peg maintenance.
method Developed a stochastic model predictive control framework with moment closure for event intensities, incorporating a soft-thresholding structure for rebalancing.
result Optimal policy shifts predictably toward cash as expected outflows intensify or windows lengthen, preserving most bill carry in calm markets and quickly building cash during stress.

Paper tackles online control of linear systems with unbounded noise.

problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and established O(mpoly(logT)) O({ m poly} (\log T)) regret bound for strongly convex costs and sub-Gaussian noise.
result Achieved ildeO(T) ilde{O}(\sqrt{T}) high-probability regret under unbounded noise, and O(mpoly(logT)) O({ m poly} (\log T)) regret bound for specific noise and cost conditions.

Instrumental variable analysis is a powerful tool for estimating causal effects when randomization or full control of confounders is not possible. The application of standard methods such as 2SLS, GMM, and more recent variants are significantly impeded when the causal effects are complex, the instruments are high-dimen…

2019-05-29abs ↗pdf ↗

New bounds on generalization error using information density moments.

problem Bounding the generalization error of randomized learning algorithms.
method Derives bounds on average and tail probabilities of generalization error using mth central moments of the information density.
result Explicit bounds on generalization error are derived, showing better dependence on confidence level with higher-order information density moments.

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.

We describe a general framework -- compressive statistical learning -- for resource-efficient large-scale learning: the training collection is compressed in one pass into a low-dimensional sketch (a vector of random empirical generalized moments) that captures the information relevant to the considered learning task. A…

2017-06-22abs ↗pdf ↗

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.

Unified framework for distribution shift estimation, explanation, and improvement.

problem Estimating, explaining, and improving model performance on target domains with distribution shift.
method Entropic Projection Alignment (EPA) aligns source and target distributions by matching moments and minimizing KL divergence.
result EPA consistently outperforms state-of-the-art baselines while offering computational efficiency.

This paper analyzes and improves the effectiveness of BN techniques in controlling Internal Covariate Shift.

problem The effectiveness of BN techniques in reducing Internal Covariate Shift (ICS) is limited, especially for high-dimensional outputs and noise.
method The paper introduces a measure for ICS using the Earth Mover (EM) distance, derives bounds for this measure, and proposes a unitization algorithm to further bound ICS.
result The unitization algorithm effectively bounds ICS, especially for low-dimensional outputs and small noise, and can be tuned to control ICS.

Action-bisimulation learns long-horizon controllability for reinforcement learning.

problem Learning relevant state features in high-dimensional observations for robust reinforcement learning.
method Action-bisimulation encoding, inspired by bisimulation invariance, extends single-step controllability to multi-step.
result Action-bisimulation pretraining improves sample efficiency in various environments.

This paper compares VaR estimation methods under tail misspecification, finding importance sampling underestimates VaR.

problem Tail misspecification in VaR estimation.
method Importance sampling and moment-based VaR bracketing.
result Importance sampling underestimates VaR under heavy-tailed returns, while moment-based methods are robust.

We propose some machine-learning-based algorithms to solve hedging problems in incomplete markets. Sources of incompleteness cover illiquidity, untradable risk factors, discrete hedging dates and transaction costs. The proposed algorithms resulting strategies are compared to classical stochastic control techniques on s…

2019-02-14abs ↗pdf ↗

Suppose kk centers are fit to mm points by heuristically minimizing the kk-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p4p\geq 4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with $…

2013-11-08abs ↗pdf ↗

A new model for generating point processes with complex geometries.

problem Difficulties in modeling point processes with large numbers of particles and complex geometries.
method Gradient descent algorithm applied to a phase harmonic operator on wavelet transforms of point patterns.
result The model allows for fast sampling of new configurations that match the statistics of observed point processes.

We consider a connected compact Lie group K acting on a symplectic manifold M such that a moment map m exists. A pull-back function via m Poisson commutes with all K-invariants. Guillemin-Sternberg raised the problem to find a converse. In this paper, we solve this problem by determining the Poisson commutant of the al…

1997-12-20abs ↗pdf ↗

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.

Fast risk assessment for autonomous vehicles using learned agent futures.

problem Risk assessment for autonomous vehicles given probabilistic predictions of other agents' futures.
method Non-sampling based methods using deep neural networks for probabilistic predictions, with Gaussian and non-Gaussian mixture models for agent positions and controls.
result Effective risk assessment for low probability events using learned models of agent futures.

The paper analyzes stability of random matrix products with Markovian noise.

problem Analyzing stability of random matrix products with Markovian noise.
method Using a super-Lyapunov drift condition and controlled growth of matrix-valued functions, the paper provides an exponential stability result for the p-th moment of random matrix product.
result Finite-time p-th moment bounds for linear stochastic approximation and TD learning algorithms.

Develops neural network framework for risk-reward optimization problems.

problem Multi-period risk-reward optimization with constrained policies.
method Neural network framework with two coupled feedforward networks, parametrizing two-step policies.
result Empirical optimum converges to true optimal value as network capacity and training size increase.

Kernel methods estimate causal effects with a single proxy for deterministic confounders.

problem Estimating causal effects with a single proxy for an unobserved confounder.
method Two kernel-based methods: two-stage regression and maximum moment restriction.
result Both kernel methods can consistently estimate the causal effect.