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

117233350466 · May 202619922001200920172026
48 results for embedding conditions

given two minimal surfaces embedded in §3\S3 of genus gg we prove the existence of a sequence of non-congruent compact minimal surfaces embedded in §3\S3 of genus gg that converges in C2,αC^{2,α} to a compact embedded minimal surface provided some conditions are satisfied. These conditions also imply that, if any of th…

2009-12-30abs ↗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.

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 demonstrate an equivalence between reproducing kernel Hilbert space (RKHS) embeddings of conditional distributions and vector-valued regressors. This connection introduces a natural regularized loss function which the RKHS embeddings minimise, providing an intuitive understanding of the embeddings and a justificatio…

2012-05-21abs ↗pdf ↗

Conditional mean embeddings (CMEs) have proven themselves to be a powerful tool in many machine learning applications. They allow the efficient conditioning of probability distributions within the corresponding reproducing kernel Hilbert spaces (RKHSs) by providing a linear-algebraic relation for the kernel mean embedd…

2019-12-02abs ↗pdf ↗

Study optimizes learning rates for conditional mean embedding estimates.

problem Consistency of kernel ridge regression for conditional mean embedding.
method Adaptive statistical learning rate derived for misspecified setting.
result Upper bound matches optimal O(logn/n)O(\log n / n) rates without assuming finite dimensionality.

The critical catenoid is uniquely determined by certain symmetries of its boundary.

problem Uniqueness of free boundary minimal annuli in a half-ball.
method Symmetry analysis and boundary conditions.
result An embedded free boundary minimal annulus with specific symmetries is congruent to the critical catenoid.

The use of deep networks to extract embeddings for speaker recognition has proven successfully. However, such embeddings are susceptible to performance degradation due to the mismatches among the training, enrollment, and test conditions. In this work, we propose an adversarial speaker verification (ASV) scheme to lear…

2019-04-29abs ↗pdf ↗

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 ↗

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 ↗

We consider existence and uniqueness of two kinds of coisotropic embeddings and deduce the existence of deformation quantizations of certain Poisson algebras of basic functions. First we show that any submanifold of a Poisson manifold satisfying a certain constant rank condition sits coisotropically inside some larger …

2006-11-15abs ↗pdf ↗

Neumann eigenmaps improve landmark-based diffusion map embeddings.

problem Landmark-based diffusion map embeddings can be computationally inefficient and unstable.
method NeuMaps use a renormalized Neumann Laplacian for eigendecomposition, incorporating landmarks as a subgraph.
result NeuMaps offer a computationally efficient and stable embedding method.

We propose a novel framework for multi-task reinforcement learning (MTRL). Using a variational inference formulation, we learn policies that generalize across both changing dynamics and goals. The resulting policies are parametrized by shared parameters that allow for transfer between different dynamics and goal condit…

2019-06-21abs ↗pdf ↗

We introduce (k,l)(k,l)-regular maps, which generalize two previously studied classes of maps: affinely kk-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean space into which a manifold can be embedded by a (k,l)(k,l)-regular map. The problem c…

2005-06-09abs ↗pdf ↗

We show that the left-monotone martingale coupling is optimal for any given performance function satisfying the martingale version of the Spence-Mirrlees condition, without assuming additional structural conditions on the marginals. We also give a new interpretation of the left monotone coupling in terms of Skorokhod e…

2017-01-24abs ↗pdf ↗

Given a finite or infinite planar graph all of whose faces have degree 4, we study embeddings in the plane in which all edges have length 1, that is, in which every face is a rhombus. We give a necessary and sufficient condition for the existence of such an embedding, as well as a description of the set of all such emb…

2003-05-27abs ↗pdf ↗

The paper explores how semantic independence can be captured in text embeddings using partial orthogonality.

problem Capturing semantic independence in text embeddings.
method Developed a theory and methods based on partial orthogonality to demonstrate semantic independence.
result Partial orthogonality captures semantic independence in text embeddings.

Neural-Kernel CME tackles scalability and expressiveness challenges in conditional distribution representation.

problem Scalability and expressiveness challenges in kernel conditional mean embeddings.
method Combines deep learning with CMEs using a neural network optimization framework.
result Achieves competitive and often superior performance in conditional density estimation and RL.

Proposes CCME framework for estimating heterogeneous treatment effects.

problem Estimating heterogeneous treatment effects in complex distributions.
method Embeds conditional distributions into RKHS, develops meta-estimators for CCME.
result Establishes finite-sample convergence rates and double robustness for CCME estimators.

We study some graphs associated to a surface, called k-multicurve graphs, which interpolate between the curve complex and the pants graph. Our main result is that, under certain conditions, simplicial embeddings between multicurve graphs are induced by π1π_1-injective embeddings of the corresponding surfaces. We also p…

2015-10-26abs ↗pdf ↗

We describe sufficient conditions which guarantee that a finite set of mapping classes generate a right-angled Artin group quasi-isometrically embedded in the mapping class group. Moreover, under these conditions, the orbit map to Teichmuller space is a quasi-isometric embedding for both of the standard metrics. As a …

2010-07-07abs ↗pdf ↗

A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing, and independence testing. This embedding represents any probability measure as a mean element in a reproducing kernel Hilbert space (RKHS). A pseudometric on the spac…

2009-07-30abs ↗pdf ↗

The paper explores linearly free graphs and their embeddings into 3D space.

problem Understanding the conditions under which a graph's embedding into 3D space is free.
method Developed a sufficient condition for a linear embedding to be free and applied it to specific graph cases.
result Established sufficient conditions for a graph to be linearly free and provided examples and counterexamples.

Word embeddings are a powerful approach for capturing semantic similarity among terms in a vocabulary. In this paper, we develop exponential family embeddings, a class of methods that extends the idea of word embeddings to other types of high-dimensional data. As examples, we studied neural data with real-valued observ…

2016-08-02abs ↗pdf ↗

Given a properly embedded graph Gamma in a ball B and a punctured sphere Sigma properly embedded in B - Gamma, we examine the conditions on Gamma that are necessary to assure that Sigma is boundary parallel.

2000-05-19abs ↗pdf ↗

The paper shows how coarse embeddings affect homological Dehn functions.

problem Characterizing groups with coarse embeddings into hyperbolic groups.
method Demonstrates a coarse embedding theorem for homological filling functions.
result Characterizes groups with coarse embeddings into hyperbolic groups of geometric dimension 2.

We show that any metric on S2S^2 with Gauss curvature KκK \geq -κ admits a C1,1C^{1,1}-isometric embedding into the hyperbolic space with sectional curvature κ. We also give a sufficient condition for a metric on S2S^2 to be isometrically embedded into anti-de Sitter spacetime with the prescribed cosmological time fun…

2014-01-23abs ↗pdf ↗

SA-REMBO adapts to nonstationary high-dimensional optimization.

problem Bayesian Optimization in high-dimensional spaces is limited by the curse of dimensionality and rigidity of global assumptions.
method SA-REMBO uses multiple random Gaussian embeddings and an index variable to adaptively select the best embedding for the optimization problem.
result SA-REMBO outperforms traditional REMBO and other low-rank BO methods across synthetic and real-world benchmarks.