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

Trend · papers per month

156313469625 · Jun 202019922001200920172026
48 results for Gaussian Framework

New framework uses dynamics to justify Gaussian process for turbulent flows.

problem Lack of rigorous justification for Gaussian process priors in turbulent flows.
method Introduces a dynamics-informed Gaussian process framework based on quasi-Gaussianity.
result Provides a principled, long-time dynamical justified GP prior for turbulent flows.

Unified Skew-Gaussian process framework for various regression and classification tasks.

problem Handling multiple types of regression and classification problems.
method Generalization of Skew-Gaussian processes to handle various types of data and likelihoods.
result Closed-form posterior distributions for multiple tasks.

Unified framework improves robust causal inference, overcoming Gaussian barriers and optimization issues.

problem Improving robust causal inference in non-Gaussian settings.
method Combines gamma-Divergence, GNC, and Gatekeeper mechanism.
result Enhanced robustness and global optimization in causal effect estimation.

Novel CMG framework improves financial sentiment forecasting.

problem Challenges in short-term sentiment forecasting of financial OHLC data.
method Integrates chaos theory, Markov chains, and Gaussian processes with transformer models.
result Consistently outperforms traditional models in accuracy and efficiency.

Graph Gaussian processes use Matérn models for better function learning.

problem Lack of Gaussian process models for graph input spaces.
method Stochastic partial differential equation characterization of Matérn Gaussian processes.
result Graph Matérn Gaussian processes inherit properties of Euclidean and Riemannian models and can be trained efficiently.

Study utility maximization with delayed information in continuous time Gaussian markets.

problem Maximizing utility with delayed information in continuous time Gaussian markets.
method Purely probabilistic approach based on Radon-Nikodym derivatives of Gaussian measures.
result Solution for optimal control and value in a specific Gaussian framework.

Additive Gaussian process framework handles monotonicity constraints in high dimensions.

problem Handling monotonicity constraints in high-dimensional data.
method Additive Gaussian process framework with MaxMod algorithm for dimension reduction.
result Framework enables to satisfy monotonicity constraints everywhere in the input space.

The paper proposes a new framework for accurate uncertainty representation and propagation.

problem Inaccurate representation and propagation of uncertainty in measurement systems.
method The paper introduces a comprehensive framework using Gaussian Mixture Models (GMMs) for representing and propagating quantitative attributes in measurement systems.
result GMMs offer improved accuracy in representing and propagating measurement uncertainty compared to traditional Gaussian methods, while maintaining computational tractability.

Study uses SABR model to create implied volatilities from sparse quotes.

problem Creating accurate implied volatility surfaces from limited market data.
method Multitask Gaussian process with SABR model embeddings and hierarchical regularization.
result Model produces more accurate volatilities than single-task methods.

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.

Unified framework for Gaussian process methods in differential equations.

problem Fragmented approaches to Gaussian process methods in differential equations.
method Unified Bayesian perspective integrating differential equation constraints.
result Consolidation of existing methods and foundation for future research.

We propose deep convolutional Gaussian processes, a deep Gaussian process architecture with convolutional structure. The model is a principled Bayesian framework for detecting hierarchical combinations of local features for image classification. We demonstrate greatly improved image classification performance compared …

2018-10-06abs ↗pdf ↗

A Gaussian Process Ordinary Differential Equation framework for large continuous dynamical systems

problem Forecasting complex dynamical systems
method Kernel autonomous ODE approach based on Gaussian Processes and Quadratic Order Model Reduction
result Full model outperforms ROM methods in terms of accuracy or computational costs

Unified framework for ensemble transport-based smoothing of non-Gaussian time series.

problem Bayesian time series re-analysis with non-Gaussian distributions.
method Measure transport approach to derive consistent prior-to-posterior transformations.
result General ensemble framework for transport-based smoothing of state-space models.

Polynomial-time DP algorithm for learning Gaussians with matching sample complexity.

problem Learning Gaussian distributions while maintaining privacy.
method General framework for reducing DP estimation to non-private, polynomial-time algorithm for Gaussian learning.
result Matching sample complexity to information-theoretic upper bound for Gaussian learning.

Gaussian-SVGD dynamics converge to Gaussian distributions under certain conditions.

problem Understanding the theoretical properties of SVGD, especially for Gaussian targets.
method Detailed theoretical study of Gaussian-SVGD dynamics, considering both mean-field PDE and discrete particle systems.
result Gaussian-SVGD dynamics converge linearly to the Gaussian distribution closest to the target in KL divergence.

This work studies Gaussian geometry under entropy-regularized 2-Wasserstein distance.

problem Understanding Gaussian distributions in uncertainty quantification and diffusivity.
method Entropy-regularized 2-Wasserstein distance, closed-form solutions, fixed-point characterization.
result Closed-form expressions for the 2-Sinkhorn divergence and fixed-point barycenter.

This paper assesses Gaussian and Exponential mechanisms for certifying adversarial robustness.

problem Certifying adversarial robustness using randomized smoothing mechanisms.
method Proposes a generic framework to assess the appropriateness of randomized smoothing mechanisms.
result Gaussian mechanism is an appropriate option for certifying both 2\ell_2-norm and \ell_\infty-norm robustness.

We utilize copulas to constitute a unified framework for constructing and optimizing variational proposals in hierarchical Bayesian models. For models with continuous and non-Gaussian hidden variables, we propose a semiparametric and automated variational Gaussian copula approach, in which the parametric Gaussian copul…

2015-06-19abs ↗pdf ↗

Active learning improves GP regression on complex, high-dimensional data.

problem Improving Gaussian Process regression in high-dimensional spaces with discontinuous functions.
method Combines manifold learning with active learning to optimize data selection and reduce dimensionality.
result Superior performance over random learning in synthetic data experiments.

A new TwinGP framework for efficient large-scale GP modeling.

problem Efficiently modeling large-scale Gaussian processes with computational constraints.
method Combines global and local approximations using a subset-of-data approach.
result TwinGP framework performs on par or better than state-of-the-art methods at a fraction of the computational cost.

We introduce a framework for analyzing transductive combination of Gaussian process (GP) experts, where independently trained GP experts are combined in a way that depends on test point location, in order to scale GPs to big data. The framework provides some theoretical justification for the generalized product of GP e…

2015-11-24abs ↗pdf ↗

Advanced kernels improve Gaussian process accuracy by incorporating domain knowledge.

problem Improving function approximation accuracy in Gaussian processes.
method Advanced kernel designs that enforce specific function properties (symmetry, periodicity) and non-stationarity.
result Advanced kernels significantly enhance function approximation accuracy and relevance.

Unified deep framework for personalized recommendations with uncertainty.

problem Uncertainty in user preferences in recommendation systems.
method Gaussian embeddings, Monte-Carlo sampling, convolutional neural networks.
result Superior performance in recommendation accuracy compared to state-of-the-art models.

Improved vector quantization using Gaussian mixtures for better codebook utilization.

problem Training instability and information loss in discrete vector quantization.
method Generalized vector quantization with Gaussian mixture model and aggregated categorical posterior evidence lower bound.
result GM-VQ improves codebook utilization and reduces information loss without heuristics.

NOGaP uses neural operators and GPs to solve PDEs with uncertainty quantification.

problem Lack of uncertainty measures in neural operator solutions for PDEs.
method NOGaP combines neural operators with Gaussian Processes to provide probabilistic solutions.
result NOGaP offers improved prediction accuracy and uncertainty quantification.

Bayesian framework for sphere regression using Gaussian fields.

problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.

A novel online GP model captures long-term memory in sequential data.

problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.

BITS for GAPS uses Bayesian methods to improve surrogate model accuracy in complex systems.

problem Improving surrogate model accuracy in complex physical systems with uncertainty.
method Bayesian Information-Theoretic Sampling for hierarchical Gaussian Process Surrogates.
result Increased expected information gain and predictive accuracy by targeting high-uncertainty regions.

Study challenges the Gaussian pre-activations assumption in neural networks.

problem Challenges the assumption that pre-activations are Gaussian in neural networks.
method Constructs pairs of activation functions and initialization distributions to ensure Gaussian pre-activations.
result Discovered constraints for ensuring Gaussian pre-activations in neural networks.

GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.

problem Avoiding obstacles in trajectory planning for real-world systems.
method GP-ND models negative data pairs using Gaussian distributions and maximizes their KL divergence from the GP to avoid them.
result GP-ND outperforms traditional GP learning in obstacle-aware trajectory planning.

Unified framework for efficient Gaussian process inference.

problem Efficient inference in non-conjugate Gaussian process models.
method Combines expectation propagation with linearization for improved efficiency.
result Unified view of various inference schemes, including classical smoothers and EP.

GGMPs improve non-Gaussian conditional density estimation.

problem Multimodality, heteroscedasticity, and strong non-Gaussianity in conditional density estimation.
method GGMP combines local Gaussian mixture fitting, cross-input component alignment, and per-component heteroscedastic GP training.
result GGMPs improve distributional approximation on synthetic and real-world datasets.