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

Trend · papers per month

153307460613 · Jun 202019922001200920172026
48 results for Gaussian Stochastic Factor

IPGP framework improves psychological assessment by integrating shared and unique traits.

problem Tackles the debate on shared vs unique personality traits across individuals.
method Uses Gaussian process coregionalization model for non-Gaussian ordinal data, with stochastic variational inference for scalability.
result Improves prediction and estimation of individualized factor structures compared to existing methods.

We add size factor to CAPM and normalize residuals by Volatility Index.

problem Capturing the size effect in CAPM and making residuals Gaussian.
method Insert size effect, normalize residuals by Volatility Index, and fit model to real-world data.
result The new model shows long-term stability and connects to Stochastic Portfolio Theory.

We introduce stochastic variational inference for Gaussian process models. This enables the application of Gaussian process (GP) models to data sets containing millions of data points. We show how GPs can be vari- ationally decomposed to depend on a set of globally relevant inducing variables which factorize the model …

2013-09-26abs ↗pdf ↗

Paper solves robust convex problems with heavy-tailed noise.

problem Solving convex compositional problems with heavy-tailed noise.
method Sub-Gaussian confidence bounds under weak heavy-tailed noise assumptions, using boosting strategy.
result Achieves nearly optimal high probability convergence result.

The paper improves boundary detection and density estimation on noisy data.

problem Detecting boundary points and estimating density on noisy data from compact manifolds.
method Doubly stochastic scaling of the Gaussian heat kernel via Sinkhorn iterations.
result The new estimates of boundary points and density outperform standard methods, especially under noise.

We consider the problem of learning a Gaussian variational approximation to the posterior distribution for a high-dimensional parameter, where we impose sparsity in the precision matrix to reflect appropriate conditional independence structure in the model. Incorporating sparsity in the precision matrix allows the Gaus…

2016-05-18abs ↗pdf ↗

New method predicts dynamic relationships in terrorist networks.

problem Dynamic co-evolution of multiplex graphs and nodal attributes in terrorism networks.
method Time-varying stochastic latent factor models with neural network Gaussian processes.
result Superior performance in predicting unobserved dynamic relationships.

A new model fits SPX and VIX volatility surfaces and term structures efficiently.

problem Calibrating SPX and VIX volatility models to market data.
method Gaussian polynomial volatility models, joint calibration, functional quantization, Neural Networks.
result A conventional one-factor Markovian model outperforms rough and non-rough models.

Improves BBVI for high-dimensional Gaussian approximations by using low-rank approximations.

problem Scalability issues with BBVI for high-dimensional multivariate Gaussian approximations.
method Extends BaM framework to handle full covariance matrices by integrating patch step for low-rank parameterization.
result Shows improved efficiency and scalability on synthetic and real-world high-dimensional inference problems.

Study compares two factor models for electricity spot prices across different periods.

problem Analyzing performance of factor models for electricity spot prices in various time periods.
method Developed a Markov Chain Monte Carlo method for model calibration and used simulations and posterior predictive checks for evaluation.
result 4-factor model outperforms 3-factor model in non-crisis times, but not in crises.

Proposes a nonparametric tensor factorization for sparse data.

problem Handling sparse tensor data with structural and interpretability benefits.
method Hierarchical Gamma processes and Poisson random measures for tensor-valued process, Dirichlet processes for sampling entry indices, Gaussian processes for values.
result Demonstrates superior performance on benchmark datasets.

Proposes a new Gaussian factor for probabilistic inference with degenerate settings.

problem Handling linear dependencies among random variables in Gaussian networks.
method Introduces a parametrised factor that relaxes the positive-definite constraint of the covariance matrix.
result Accurately accommodates degeneracies in probabilistic inference without significant computational overhead.

Efficiently models Wrong-Way Risk in FVA without full Monte Carlo.

problem Assessing Wrong-Way Risk in Funding Valuation Adjustments (FVA) without extensive simulations.
method Splitting exposure into independent and WWR-driven parts; approximating WWR-driven part using Gaussian stochastic factor.
result An efficient and robust method to include WWR in FVA modelling.

A new method for efficient Gaussian process inference using sparse approximations.

problem Scalable and accurate inference for latent Gaussian processes.
method Variational approximation with sparse inverse Cholesky factors and double Kullback-Leibler minimization.
result The proposed method can achieve highly accurate approximations with polylogarithmic time complexity.

The paper tackles best arm identification in contaminated bandits with optimal error guarantees and sample complexity.

problem Best arm identification in stochastic bandits with adversarial reward contamination.
method Proposes two algorithms: a gap-based algorithm and a successive elimination-based algorithm for sub-Gaussian bandits.
result Asymptotically optimal sample complexity for both algorithms.

Paper derives convergence rates and confidence intervals for LSA with Markovian noise.

problem Analyzing convergence rates and constructing confidence intervals for LSA with Markovian noise.
method Derives non-asymptotic Berry-Esseen bounds and multiplier block bootstrap procedure.
result Provides O(n1/4)\mathcal{O}(n^{-1/4}) convergence rates and guarantees consistent inference.

New analysis shows SGD with noise doesn't leak more privacy with more iterations.

problem Privacy loss in noisy SGD with more iterations.
method Privacy Amplification by Iteration and Sampled Gaussian Mechanism.
result Privacy loss remains constant after a burn-in period, not increasing with more iterations.

GCNs improve multi-layer network classification by expanding the distance between means.

problem Improving multi-layer network classification with graphical information.
method Theoretical and empirical study of graph convolutions in multi-layer networks.
result Graph convolutions expand the classification regime by a factor of 1/Emdeg41/\sqrt[4]{\mathbb{E}{ m deg}}.

Robustly infers manifold density and geometry under high-dimensional noise.

problem Inaccurate kernel density estimation under high-dimensional noise.
method Doubly stochastic normalization of Gaussian kernel.
result Robust tools for density estimation, noise magnitude estimation, and distance approximation.

Efficiently simulates the Heston model with large time steps using a novel method.

problem Challenges in simulating the Heston model with large time steps.
method Implicit integrated variance scheme exploiting the near-linear nature between stochastic driver and conditional integrated variance process.
result Achieves near-exact accuracy with coarse discretizations, efficient for large time steps.

Gaussian copulas are widely used in the industry to correlate two random variables when there is no prior knowledge about the co-dependence between them. The perturbed Gaussian copula approach allows introducing the skew information of both random variables into the co-dependence structure. The analytical expression of…

2010-02-27abs ↗pdf ↗

New findings show Gaussian universality breaks down in high-dimensional linear factor mixtures.

problem The limitations of Gaussian universality in high-dimensional classification.
method Characterization of empirical risk minimization for classification under linear factor mixture models.
result Gaussian universality breaks down under high-dimensional linear factor mixtures.

Study pricing options on forward contracts using infinite-dimensional affine models.

problem Pricing European-style options on forward contracts in complex stochastic volatility models.
method Model forward price curves using stochastic partial differential equations modulated by stochastic volatility processes. Analyze two classes of affine stochastic volatility models: Gaussian and pure-jump. Derive conditions for existence of exponential moments and develop semi-closed pricing formulas.
result Developed semi-closed Fourier-based pricing formulas for vanilla call and put options in infinite-dimensional affine models.

Efficiently learns deep factor graphs using Gaussian belief propagation.

problem Learning in deep factor graphs with efficient inference.
method Treats all relevant quantities as random variables, uses belief propagation for inference.
result Efficiently solves training and prediction problems in deep factor graphs with belief propagation.

Improved sample complexity for Gaussian Mixture Models using Pair Correlation Factor.

problem Understanding the sample complexity of Gaussian Mixture Models.
method Introducing Pair Correlation Factor (PCF) to measure clustering of component means and improving sample complexity bounds.
result The Pair Correlation Factor (PCF) more accurately determines the difficulty of parameter recovery in Gaussian Mixture Models.

Paper revisits DP-SCO in Euclidean and pd\ell_p^d spaces, focusing on constrained and bounded sets.

problem Differentially private stochastic convex optimization in constrained and bounded sets in Euclidean and pd\ell_p^d spaces.
method Proposes methods achieving excess population risks dependent on Gaussian width of the constraint set, and novel algorithms for unconstrained and heavy-tailed data.
result Theoretical results for DP-SCO in pd\ell_p^d spaces, including optimal bounds for strongly convex functions.

Authors improve accuracy analysis for portfolio optimization with multiple timescale factors.

problem Asymptotic accuracy of portfolio optimization approximations for general utility functions and two timescale factors.
method Construct sub- and super-solutions to fully nonlinear problem.
result Rigorous justification of accuracy for portfolio optimization with general utility functions and two timescale factors.

This paper tackles robust growth maximization with stochastic factors, finding optimal strategies independent of the factor process.

problem Maximizing asymptotic growth under model uncertainty with stochastic factor processes.
method Combines techniques from partial differential equations, calculus of variations, and generalized Dirichlet forms.
result Optimal trading strategy is functionally generated and independent of the stochastic factor process.

Improved growth strategies by incorporating stochastic factors in asset returns.

problem Drift uncertainty in asset returns makes growth optimization strategies sensitive.
method Study robust growth-optimization in high-dimensional incomplete markets under drift uncertainty and ergodicity.
result Utilizing stochastic factors improves robust growth rates and optimal strategies.

Heteroscedastic regression considering the varying noises among observations has many applications in the fields like machine learning and statistics. Here we focus on the heteroscedastic Gaussian process (HGP) regression which integrates the latent function and the noise function together in a unified non-parametric B…

2018-11-03abs ↗pdf ↗