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

161321482642 · Jun 202019922001200920172026
48 results for conditional mean embedding

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.

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 ↗

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 ↗

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.

Proposes a new method to analyze the distributional effects of treatments.

problem Analyzing the full distributional impact of treatments beyond just the mean.
method Uses kernel conditional mean embeddings and U-statistic regression to investigate the CoDiTE.
result Demonstrates the effectiveness of the proposed method through experiments.

New tests for binary classification regression functions without distribution assumptions.

problem Testing regression functions in binary classification without distributional assumptions.
method Conditional kernel mean embeddings and resampling-based framework.
result Distribution-free hypothesis tests with exact type I error control.

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.

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.

Manifold embedding algorithms map high-dimensional data down to coordinates in a much lower-dimensional space. One of the aims of dimension reduction is to find intrinsic coordinates that describe the data manifold. The coordinates returned by the embedding algorithm are abstract, and finding their physical or domain-r…

2018-11-29abs ↗pdf ↗

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 ↗

Ancient curve shortening flows have entropy and curvature bounds equivalent.

problem Bounding entropy and total curvature for ancient curve shortening flows.
method Equivalence of entropy and total curvature conditions for ancient curve shortening flows.
result Entropy and total curvature bounds are equivalent for ancient curve shortening flows.

In this paper, we study the global geometry of complete, constant mean curvature hypersurfaces embedded in n-manifolds. More precisely, we give conditions that imply properness of such surfaces and prove the existence of fixed size one-sided regular neighborhoods for certain constant mean curvature hypersurfaces in cer…

2010-02-26abs ↗pdf ↗

A new metric compares true and learned causal graphs considering data and graph structure.

problem Comparing true and learned causal graphs accurately.
method Continuous Structural Intervention Distance (CSID) using conditional mean embeddings and maximum mean discrepancy.
result Validated the CSID with synthetic data, showing its effectiveness in comparing causal graphs.

Paper explores RKHS properties for derivative and integral operators.

problem Establishing sufficient conditions for reproducing property in RKHS.
method Establishing reproducing property for combinations of composition operators.
result Provides framework for regularized learning algorithms involving function values, gradients, or operators.

Let MM be a quasi-Fuchsian three-manifold that contains a closed incompressible surface with principal curvatures within the range of the unit interval, for a prescribed function HH (with mild conditions) on MM, we construct a closed incompressible surface with mean curvature HH . A direct application is the existe…

2010-03-08abs ↗pdf ↗

DTE uses tree leaf means to embed data, balancing accuracy and speed.

problem High variance in decision tree splits and computational inefficiency of ensembles.
method DTE constructs an interpretable feature representation using leaf means of a trained tree.
result DTE strikes a balance between accuracy and computational efficiency, outperforming ensembles.

The objective in statistical Optimal Transport (OT) is to consistently estimate the optimal transport plan/map solely using samples from the given source and target marginal distributions. This work takes the novel approach of posing statistical OT as that of learning the transport plan's kernel mean embedding from sam…

2020-02-08abs ↗pdf ↗

A new method compresses conditional distributions of labelled data.

problem No existing method directly compresses the conditional distribution of labelled data.
method Introduce Average Maximum Conditional Mean Discrepancy (AMCMD), derive a closed form estimator, and extend Kernel Herding (KH) to Average Conditional Kernel Herding (ACKH).
result Directly compressing conditional distributions outperforms joint distribution compression and greedy selection.

This paper establishes geometric obstructions to the existence of complete, properly embedded, mean curvature flow self-translating solitons ΣnRn+1Σ^n\subseteq \mathbb{R}^{n+1}, generalizing previously known non-existence conditions such as cylindrical boundedness.

2014-11-10abs ↗pdf ↗

A Hilbert space embedding of a distribution---in short, a kernel mean embedding---has recently emerged as a powerful tool for machine learning and inference. The basic idea behind this framework is to map distributions into a reproducing kernel Hilbert space (RKHS) in which the whole arsenal of kernel methods can be ex…

2016-05-31abs ↗pdf ↗

New algorithm quantifies uncertainty in regression models for complex data types.

problem Uncertainty quantification in regression models for complex data types.
method Model-free uncertainty quantification algorithm based on conditional depth measures and kernel mean embeddings.
result Provides faster convergence rates and non-asymptotic guarantees for prediction regions.

Proposes CCE to assess point-wise reliability of neural network predictions.

problem Overconfidence and misaligned predictive distributions in neural networks.
method Introduces Conditional Congruence (CCE) metric using conditional kernel mean embeddings.
result CCE exhibits correctness, monotonicity, reliability, and robustness in high-dimensional regression tasks.

New insights into CI tests reveal key factors for practical performance.

problem Understanding and improving CI tests in practical applications.
method Investigation of the Kernel-based Conditional Independence (KCI) test and analysis of its practical behavior.
result Errors in conditional mean embedding estimates and appropriate conditioning kernel selection are crucial for CI tests.

Study on uniqueness of hypersurfaces in hyperbolic space with constant mean curvature.

problem Uniqueness of hypersurfaces with constant higher order mean curvature in hyperbolic space.
method Generalization of Bernstein theorem and proof of Bernstein type results for immersed hypersurfaces.
result Rigidity of horospheres and equidistant spheres in terms of their higher order mean curvatures.