paper-with-me

홈 › Papers

Robust Low Rank Kernel Embeddings of Multivariate Distributions

2013-12-01 · NeurIPS 2013 12 · Le Song, Bo Dai

Kernel embedding of distributions has led to many recent advances in machine learning. However, latent and low rank structures prevalent in real world distributions have rarely been taken into account in this setting. Furthermore, no prior work in kernel embedding literature has addressed the issue of robust embedding when the latent and low rank information are misspecified. In this paper, we propose a hierarchical low rank decomposition of kernels embeddings which can exploit such low rank structures in data while being robust to model misspecification. We also illustrate with empirical evidence that the estimated low rank embeddings lead to improved performance in density estimation.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningDensity Estimation

Similar Papers 제목 키워드 기반

A Note on Optimizing Distributions using Kernel Mean Embeddings

2021-06-18 · Boris Muzellec, Francis Bach, Alessandro Rudi

Kernel mean embeddings are a popular tool that consists in representing probability measures by their infinite-dimensional mean embeddings in a reproducing kernel Hilbert space. When the kernel is characteristic, mean em…

Low-rank Distributional Matrix Completion

2026-06-02 · Jiayi Wang, Raymond K. W. Wong arxiv

We study a distributional generalization of the matrix completion problem in which each entry of the target matrix is a probability distribution rather than a scalar. In this setting, only a subset of matrix entries is o…

Learning Counterfactual Distributions via Kernel Nearest Neighbors

2024-10-17 · Kyuseong Choi, Jacob Feitelberg, Caleb Chin, Anish Agarwal 외

Consider a setting with multiple units (e.g., individuals, cohorts, geographic locations) and outcomes (e.g., treatments, times, items), where the goal is to learn a multivariate distribution for each unit-outcome entry,…

counterfactualMatrix Completion

Statistical Depth Meets Machine Learning: Kernel Mean Embeddings and Depth in Functional Data Analysis

2021-05-26 · George Wynne, Stanislav Nagy

Statistical depth is the act of gauging how representative a point is compared to a reference probability measure. The depth allows introducing rankings and orderings to data living in multivariate, or function spaces. T…

BIG-bench Machine Learning

A kernel log-rank test of independence for right-censored data

2019-12-08 · Tamara Fernandez, Arthur Gretton, David Rindt, Dino Sejdinovic

We introduce a general non-parametric independence test between right-censored survival times and covariates, which may be multivariate. Our test statistic has a dual interpretation, first in terms of the supremum of a p…

Survival Analysis