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

197393590786 · Jun 202019922001200920172026
48 results for quadratic Gaussian mean estimation

The paper models asset pricing in a partially observed market using mean field game theory and exponential quadratic Gaussian framework.

problem Asset pricing in a market with partial observation and heterogeneous agents.
method Mean field game theory, exponential quadratic Gaussian framework, Kalman-Bucy filtering theory.
result Characterization of equilibrium risk premium through mean field BSDE and construction of unobservable risk premium process.

Optimizes sliding window approach for tracking Gaussian densities.

problem Improving tracking performance of Gaussian density estimation.
method Theoretical analysis of sliding window Gaussian Kernel Density Estimators.
result Empirical evidence shows improved tracking performance with optimal weight sequence.

The study classifies parallel mean curvature spheres in a sphere-hyperbolic product space.

problem Understanding surfaces with parallel mean curvature in a specific Riemannian product space.
method Analyzing the holomorphic quadratic differential and topological constraints.
result Classification of all parallel mean curvature spheres with vanishing differential.

FastMuyGPs speeds up GP predictions for large datasets.

problem High cost of Gaussian process predictions for large data.
method Combines cross-validation, batching, nearest neighbors sparsification, and precomputation.
result Superior accuracy and competitive runtime compared to other methods.

New method solves constrained stochastic optimization problems efficiently.

problem Online statistical inference of constrained stochastic nonlinear optimization problems.
method Stochastic Sequential Quadratic Programming (StoSQP) with iterative sketching solver.
result The rescaled primal-dual sequence converges to a mean-zero Gaussian distribution.

LqgOpt learns optimal control in unknown LQG systems with minimal regret.

problem Adaptive control in partially observable linear quadratic Gaussian systems with unknown dynamics.
method Optimism in the face of uncertainty, predictor state evolution, closed-loop system identification, confidence bounds.
result Proves a regret upper bound of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) for LQG systems.

The reparameterization trick is widely used in variational inference as it yields more accurate estimates of the gradient of the variational objective than alternative approaches such as the score function method. Although there is overwhelming empirical evidence in the literature showing its success, there is relative…

2018-09-27abs ↗pdf ↗

MuyGPs efficiently estimates GP hyperparameters using local cross-validation.

problem Efficiently estimating GP hyperparameters for large datasets.
method Uses nearest neighbors structure and leave-one-out cross-validation.
result Outperforms state-of-the-art competitors in time and prediction accuracy.

Study high codimension mean curvature flow in Riemannian manifolds, proving limiting flow in Euclidean space.

problem Analyzing mean curvature flow in high codimension Riemannian manifolds.
method Establishing codimension estimate, using quadratic pinching condition, gradient estimates.
result Existence of limiting flow in Euclidean space under cylindrical pinching condition.

Improved HGF networks avoid negative precision errors in volatility updates.

problem Negative posterior precision errors in volatility-coupled nodes of HGF networks.
method Introduced a modified quadratic approximation to variational energy.
result Robust update equations across parameter space that track posterior faithfully.

Quantum UCB algorithm reduces reinforcement learning regret exponentially.

problem Episodic reinforcement learning with quantum state evolution.
method Upper Confidence Bound (UCB) quantum algorithm with quantum mean estimation.
result Exponential improvement in regret from $\Tilde{\mathcal{O}}(\sqrt{K})$ to $\Tilde{\mathcal{O}}(1)$.

The study sets limits on how well systems can be controlled adaptively.

problem Learning to control unknown linear Gaussian systems with quadratic costs.
method Combining ideas from experiment design, estimation theory, and perturbation bounds of information matrices.
result Regret lower bounds of the order of T\sqrt{T} in the time horizon TT accurately capture control-theoretic parameters.

This paper presents a novel one-factor stochastic volatility model where the instantaneous volatility of the asset log-return is a diffusion with a quadratic drift and a linear dispersion function. The instantaneous volatility mean reverts around a constant level, with a speed of mean reversion that is affine in the in…

2019-08-20abs ↗pdf ↗

Study shows neural networks trained with GD converge to Gaussian processes with polynomial decay.

problem Understanding convergence of neural networks to Gaussian processes during training.
method Explicit upper bounds on quadratic Wasserstein distance between trained networks and Gaussian approximations.
result Polynomial decay of approximation error with network width and training time.

Study mean curvature flow of high codimension submanifolds in complex projective space.

problem Analyse mean curvature flow of high codimension submanifolds in complex projective space.
method Establish codimension estimate, prove convergence to smooth limiting flow, and prove decay estimate.
result Prove existence of limiting flow under cylindrical type pinching.

FlowSDR learns a low-dimensional projection preserving the response's conditional distribution.

problem Learning a low-dimensional projection that captures the response's conditional distribution.
method FlowSDR uses conditional log-likelihood maximization with monotone rational-quadratic spline flows to learn the projection and conditional density.
result FlowSDR outperforms existing SDR methods in various simulation settings and a face-age prediction task.

Optimal Gaussian noise mechanisms achieve nearly optimal error in unbiased mean estimation.

problem Efficiently estimating the mean of high-dimensional data while preserving privacy.
method Differential privacy mechanisms with Gaussian noise, focusing on optimal covariance.
result Gaussian noise mechanisms achieve nearly optimal error among all private unbiased mean estimation mechanisms.

Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as walk-summability, that guarantee the convergence and correctness of GaBP are kn…

2012-12-02abs ↗pdf ↗

The study uncovers the breakdown of Gaussian universality in high-dimensional empirical risk minimization.

problem Understanding the breakdown of Gaussian universality in high-dimensional empirical risk minimization.
method Extending the Convex Gaussian Min-Max Theorem to non-Gaussian settings, deriving asymptotic min-max characterizations, and proving asymptotic equivalence of regularizers.
result The projection of the ERM estimator onto a test covariate approximately follows a Gaussian convolution under certain conditions.

Sharp curvature estimates for mean curvature flow in spheres.

problem Understanding the behavior of surfaces evolving under mean curvature flow in spheres.
method Proving asymptotically sharp curvature pinching estimates and using them to derive derivative and convexity estimates.
result Partial classification of singularity models and new rigidity results for ancient solutions.

Study on estimating Gaussian mean from coarse data, resolving identifiability and computational efficiency questions.

problem Estimating the mean of a Gaussian distribution from coarse data (sets containing true samples rather than exact values).
method Analyzes the conditions for mean identifiability and computable estimation under convex partitions.
result Resolves the identifiability and computational efficiency questions for Gaussian mean estimation from coarse data.

This work improves texture segmentation by automatically tuning hyperparameters for Total-Variation.

problem The challenge is to automatically select hyperparameters for Total-Variation texture segmentation.
method The approach involves extending Stein's unbiased gradient estimator to handle correlated Gaussian noise, leading to an automatic tuning method.
result The method provides an automatic way to select hyperparameters for Total-Variation texture segmentation.

New study shows mean estimation algorithms can't beat sub-Gaussian rate in general.

problem Improving mean estimation beyond worst-case scenarios.
method Constructing counterexamples and introducing neighborhood optimality.
result No reasonable estimator can achieve better than sub-Gaussian error rate for any distribution.

New estimator accurately estimates mean of real-valued distributions without variance knowledge.

problem Estimating the mean of real-valued distributions without prior variance knowledge.
method Introduces a novel estimator that converges sub-Gaussian and works across distributions with bounded variance.
result The estimator achieves accuracy of σ·(1+o(1))√(2log(1/δ)/n) with parameters n, δ, and σ².