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

88176264352 · Jun 202019922001200920172026
48 results for mean embeddings

This note optimizes distributions using kernel mean embeddings with a new parameterization.

problem Optimizing distributions using kernel mean embeddings is challenging due to the difficulty of characterizing probability distribution vectors.
method Proposes a new parameterization of positive functions using kernel sums-of-squares to fit distributions in the MMD geometry.
result Distributions with kernel sum-of-squares densities are dense in the MMD geometry, allowing optimization in the finite-sample setting.

We provide a theoretical foundation for non-parametric estimation of functions of random variables using kernel mean embeddings. We show that for any continuous function ff, consistent estimators of the mean embedding of a random variable XX lead to consistent estimators of the mean embedding of f(X)f(X). For Matérn ke…

2016-10-19abs ↗pdf ↗

Authors construct hypertori with constant negative mean curvature in a sphere.

problem Constructing constant mean curvature hypertori in a sphere.
method Constructing two different constant mean curvature (2n1)(2n-1)-dimensional hypertori in a 2n2n-dimensional sphere.
result Two different constant mean curvature (2n1)(2n-1)-dimensional hypertori with negative mean curvature in a 2n2n-dimensional sphere.

Conditional kernel mean embeddings form an attractive nonparametric framework for representing conditional means of functions, describing the observation processes for many complex models. However, the recovery of the original underlying function of interest whose conditional mean was observed is a challenging inferenc…

2019-06-01abs ↗pdf ↗

Kernel methods are one of the mainstays of machine learning, but the problem of kernel learning remains challenging, with only a few heuristics and very little theory. This is of particular importance in methods based on estimation of kernel mean embeddings of probability measures. For characteristic kernels, which inc…

2016-03-07abs ↗pdf ↗

New learning rates for embeddings in RKHSs, even when the target is not Hilbert-Schmidt.

problem Applying conditional mean embeddings to complex ML/RL settings with infinite-dimensional RKHSs.
method Developed novel learning rates using interpolation theory for RKHSs, derived explicit adaptive rates for sample estimator.
result Achieved uniform convergence rates in the output RKHS for certain parameter regimes.

Diffusion means converge to extrinsic means for long times on spheres.

problem Understanding the long-time behavior of diffusion means on manifolds.
method Introduced diffusion means as a parameterized family of location statistics on manifolds, and analyzed their convergence to extrinsic means for long times.
result For real projective spaces and connected compact symmetric spaces, the long-time limit of diffusion means is conjectured to be the extrinsic mean in the isometric embedding.

We prove a chord arc bound for disks embedded in R3\mathbb{R}^3 with constant mean curvature. This bound does not depend on the value of the mean curvature. It is inspired by and generalizes the work of Colding and Minicozzi in [2] for embedded minimal disks. Like in the minimal case, this chord arc bound is a fundamen…

2014-08-24abs ↗pdf ↗

Paper improves MMD estimation for analytical mean embeddings.

problem Improving MMD estimation for distributions with analytical mean embeddings.
method Proposes a tighter concentration result for MMD estimation under semi-explicit settings and extends to unbounded kernels.
result Demonstrates efficiency in real-world applications like index replication and calibration.

A new method estimates multi-dimensional value distributions using Hilbert space embeddings.

problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.

Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…

2016-11-29abs ↗pdf ↗

The paper shows translating solitons in R4\mathbb{R}^4 have SO(2)SO(2) symmetry.

problem Understanding the symmetry of translating solitons in R4\mathbb{R}^4.
method Analyzing the blow-up limits of embedded, mean convex mean curvature flow.
result Translating solitons in R4\mathbb{R}^4 have SO(2)SO(2) symmetry.

J. Nash proved that the geometry of any Riemannian manifold M imposes no restrictions to be embedded isometrically into a (fixed) ball B_{\mathbb{R}^{N}}(1) of the Euclidean space R^N. However, the geometry of M appears, to some extent, imposing restrictions on the mean curvature vector of the embedding.

2008-09-15abs ↗pdf ↗

New algorithm tackles multi-agent reinforcement learning issues.

problem Multi-agent reinforcement learning suffers from the curse of many agents.
method Proposes MF-FQI algorithm based on mean embeddings of distributions.
result Establishes a non-asymptotic analysis for MF-FQI algorithm.

The paper studies how surfaces move by mean curvature flow and what happens at singular points.

problem Understanding the behavior of surfaces moving by mean curvature flow at singular points.
method Proves that tangent flows at singular times are smooth shrinkers, with a new local Gauss-Bonnet formula.
result Smooth shrinkers without branch points if the initial surface is embedded in 3-manifold.

Mean embeddings provide an extremely flexible and powerful tool in machine learning and statistics to represent probability distributions and define a semi-metric (MMD, maximum mean discrepancy; also called N-distance or energy distance), with numerous successful applications. The representation is constructed as the e…

2018-02-13abs ↗pdf ↗

In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are that for a random linear embedding of KnK_n in a cube, the mean sum of squared linking numbers and the mean sum of square…

2015-08-05abs ↗pdf ↗

Paper develops a unified framework for measuring differences between conditional distributions.

problem Comparing conditional distributions in a unified and theoretically sound manner.
method Kernel embeddings and conditional maximum mean discrepancy (CMMD) framework.
result Established a coherent framework for measuring divergence between conditional distributions.

We present an operator-free, measure-theoretic approach to the conditional mean embedding (CME) as a random variable taking values in a reproducing kernel Hilbert space. While the kernel mean embedding of unconditional distributions has been defined rigorously, the existing operator-based approach of the conditional ve…

2020-02-10abs ↗pdf ↗

In this paper, we study nn-dimensional hypersurfaces with constant mthm^{\text{th}} mean curvature in a unit sphere Sn+1(1)S^{n+1}(1) and construct many compact nontrivial embedded hypersurfaces with constant mthm^{\text{th}} mean curvature Hm>0H_m>0 in Sn+1(1)S^{n+1}(1), for 1mn11\leq m\leq n-1. In particular, if the 4th4^{\text{th}}

2009-04-02abs ↗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.

Hermite polynomials improve private data generation by reducing feature count.

problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.

Study on linking numbers in random book embeddings of complete graphs.

problem Distribution and mean of linking numbers in random book embeddings of complete graphs.
method Analyzes a family of two-component links arising from random embeddings of complete graphs, using Eulerian numbers and linear growth in mean linking number.
result Mean of squared linking number over all random embeddings is $ rac{i}{6}$, where ii is the number of interior edges.

The study finds new constant mean curvature surfaces in curved spaces.

problem Finding surfaces with constant mean curvature in curved spaces.
method Analyzing families of surfaces in S2imesRS^2 imes \mathbb{R} and H2imesRH^2 imes \mathbb{R}.
result New families of surfaces with constant mean curvature, including non-equivariant examples.

Improved multi-task averaging reduces mean squared error in high-dimensional data.

problem Joint estimation of multiple distributions using independent data sets.
method Exploits similarities between tasks by shrinking naive estimators towards local averages.
result The method provides a significant reduction in mean squared error, especially in high-dimensional spaces.