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

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for mean parametrization

We solve the mean parametrization of von Mises-Fisher distribution.

problem No closed-form normalization function for mean parameters exists.
method Derived a second-order ODE for mean normalizer and provided approximations.
result Rapid evaluation of densities and natural parameters in terms of mean parameters.

The study compares parametric and nonparametric models for estimating mean-variance mixtures and finds that nonparametric models perform better.

problem Estimating the distribution of a normal mean-variance mixture under uncertainty.
method Comparison of six parametric mixing laws with a grid nonparametric maximum likelihood estimator, using a paired block bootstrap for score comparison.
result Nonparametric models outperform parametric models in estimating the distribution of a normal mean-variance mixture.

We introduce performance-based regularization (PBR), a new approach to addressing estimation risk in data-driven optimization, to mean-CVaR portfolio optimization. We assume the available log-return data is iid, and detail the approach for two cases: nonparametric and parametric (the log-return distribution belongs in …

2011-11-09abs ↗pdf ↗

Study examines surfaces with bounded fractional mean curvature, proving control over local parametrization.

problem Understanding surfaces with bounded fractional mean curvature.
method Investigates bounded L^p-norm of fractional mean curvature, proving control over local parametrization.
result Proves control over local parametrization, leading to lower Ahlfors-regularity, weak Michael-Simon type inequality, and stability application.

We derive parametrizations of the Delaunay constant mean curvature surfaces of revolution that follow directly from parametrizations of the conics that generate these surfaces via the corresponding roulette. This uniform treatment exploits the natural geometry of the conic (parabolic, elliptic or hyperbolic) and leads …

2013-05-24abs ↗pdf ↗

Markov jump processes (MJPs) are used to model a wide range of phenomena from disease progression to RNA path folding. However, maximum likelihood estimation of parametric models leads to degenerate trajectories and inferential performance is poor in nonparametric models. We take a small-variance asymptotics (SVA) appr…

2015-03-01abs ↗pdf ↗

New method for estimating counterfactual means in adaptive experiments.

problem Inference for counterfactual means in sequentially designed experiments with adaptive treatment policies.
method Latent factor model and nearest neighbors method for estimation.
result Asymptotically valid confidence intervals for counterfactual means established.

Paper provides estimates for varifolds with critical mean curvature.

problem Estimating tilt-excess on varifolds with critical mean curvature.
method Generalizing Lipschitz approximation and Sobolev-Poincaré estimates to almost-integral rectifiable varifolds.
result VMO-type estimates for quadratic tilt-excess on varifolds with critical mean curvature.

A new MFG framework for evolving clusters from Gaussian mixtures.

problem Evolutionary clustering of time-dependent Gaussian mixtures.
method Control-theoretic framework based on Mean Field Games (MFG) with coupled HJB and Fokker-Planck systems.
result MFG dynamics recover classical EM algorithm trajectories with mass conservation.

Consider a multi-variate time series (Xt)t=0T(X_t)_{t=0}^{T} where XtRdX_t \in \mathbb{R}^d which may represent spike train responses for multiple neurons in a brain, crime event data across multiple regions, and many others. An important challenge associated with these time series models is to estimate an influence network be…

2018-01-23abs ↗pdf ↗

Faster convergence of kernel mean embeddings using variance information.

problem Speeding up the convergence rate of kernel mean embeddings.
method Leveraging variance information in reproducing kernel Hilbert space and estimating variance from data.
result Efficiently estimate variance information from data to achieve distribution-agnostic convergence bounds.

We present a new implementation of anisotropic mean curvature flow for contour recognition. Our procedure couples the mean curvature flow of planar closed smooth curves, with an external field from a potential of point-wise charges. This coupling constrains the motion when the curve matches a picture placed as backgrou…

2018-03-10abs ↗pdf ↗

This work develops a non-parametric test for relational independence in non-i.i.d. data.

problem Testing independence in relational systems where data samples are not i.i.d.
method Kernel mean embedding for relational variables, consistent non-parametric scalable kernel test.
result Empirically validated effectiveness compared to state-of-the-art tests.

We study the estimation of the parametric components of single and multiple index volatility models. Using the first- and second-order Stein's identities, we develop methods that are applicable for the estimation of the variance index in the high-dimensional setting requiring finite moment condition, which allows for h…

2018-11-27abs ↗pdf ↗

Parametric insurance offers better risk-sharing in high-risk settings than traditional indemnity insurance.

problem High-risk environments where traditional indemnity insurance is unaffordable or ineffective.
method Comparison of excess-of-loss indemnity insurance and parametric insurance within a mean-variance framework, considering fixed costs and binding budget constraints.
result Parametric insurance yields higher welfare for risk-averse individuals, especially when indemnity insurance is impractical.

Enhances generative models stability and accuracy with BNPL, WMMD, and triple model.

problem Overfitting in GANs and noisy samples in VAEs.
method Bayesian non-parametric learning framework, integrating Wasserstein distance and maximum mean discrepancy.
result Superior performance across various generative tasks.

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.

Study proves existence and nonexistence for annular surfaces with specific curvature and boundary.

problem Existence and nonexistence of annular surfaces with prescribed mean curvature.
method Proves existence and nonexistence results for normal graphs of unduloids or nodoids.
result Existence and nonexistence results for annular type surfaces with prescribed mean curvature.

Bayesian model captures mean and variance of response variables.

problem Complex, predictor-dependent relationships and heteroscedastic patterns in data.
method Sum-of-tessellations for mean, product-of-tessellations for variance.
result Model captures nuanced variance structures and provides reliable predictive uncertainty.

We propose to use nonparametric Bernstein copulas as bivariate pair-copulas in high-dimensional vine models. The resulting smooth and nonparametric vine copulas completely obviate the error-prone need for choosing the pair-copulas from parametric copula families. By means of a simulation study and an empirical analysis…

2012-10-07abs ↗pdf ↗

Study of singularities in mean curvature flow with focus on S3imesR\mathbb{S}^3 imes\mathbb{R}.

problem Understanding singularities in mean curvature flow.
method Detailed analysis of singularities modeled on S3imesR\mathbb{S}^3 imes\mathbb{R}, using normal form transformations and rescaled MCF.
result Proves mean convexity and singularity isolation in a small neighborhood, conjectures singularity formation in entire neighborhood.

Learning algorithms for implicit generative models can optimize a variety of criteria that measure how the data distribution differs from the implicit model distribution, including the Wasserstein distance, the Energy distance, and the Maximum Mean Discrepancy criterion. A careful look at the geometries induced by thes…

2017-12-21abs ↗pdf ↗

Our aim is to study invariant hypersurfaces immersed in the Euclidean space Rn+1\mathbb{R}^{n+1}, whose mean curvature is given as a linear function in the unit sphere Sn\mathbb{S}^n depending on its Gauss map. These hypersurfaces are closely related with the theory of manifolds with density, since their weighted mean cu…

2019-08-20abs ↗pdf ↗

Develops flexible non-parametric ACFs using B-spline kernels.

problem Flexible modelling of the autocovariance function (ACF) in time-series, spatial, and spatio-temporal analysis.
method Derives the inverse Fourier transform of B-spline spectral bases to create a general class of non-parametric ACFs.
result Provides a provably dense, flexible, and general class of non-parametric ACFs for various types of processes.

Estimates risk in finance using Wasserstein distance and parametric models.

problem Assessing risk in financial models with model uncertainty.
method Parametric approach based on Wasserstein distance for convex risk functionals.
result Developed a numerical method using neural networks to estimate risk and optimal perturbations.

A parametric manifold can be viewed as the manifold of orbits of a (regular) foliation of a manifold by means of a family of curves. If the foliation is hypersurface orthogonal, the parametric manifold is equivalent to the 1-parameter family of hypersurfaces orthogonal to the curves, each of which inherits a metric and…

1994-07-12abs ↗pdf ↗

We consider a relaxed notion of energy of non-parametric codimension one surfaces that takes account of area, mean curvature, and Gauss curvature. It is given by the best value obtained by approximation with inscribed polyhedral surfaces. The BV and measure properties of functions with finite relaxed energy are studied…

2018-07-25abs ↗pdf ↗

A new particle algorithm improves mean-field variational inference.

problem Efficiently approximating nonparametric posterior distributions in machine learning.
method Introduces PArticle VI (PAVI), a novel particle-based algorithm for nonparametric mean-field approximation.
result Obtains non-asymptotic error bounds for PArticle VI, providing the first end-to-end guarantee for particle-based MFVI.

The goal of this paper is to classify parametrically parabolic submanifolds in any codimension. First, we describe the ones that are ruled and show that they are the only parabolic submanifolds that admit an isometric immersion as a hypersurface. Then, we classify the nonruled ones by two different means. In fact, we p…

2009-04-01abs ↗pdf ↗