Compact embeddings for invariant functions in metric-measure spaces.
problem Embedding functions with symmetry in metric-measure spaces.
method Analyzing H-invariant functions in compact metric-measure spaces, extending to Riemannian manifolds. result Obtained compact Sobolev embeddings for critical exponents.
Kernel embeddings map measures to functions in RKHS, addressing embedding and metric properties.
problem Characterizing sets of measures that can be embedded and the conditions for embedding to be injective.
method Study of kernel mean embeddings, focusing on universal, characteristic, and strictly positive definite kernels.
result Unified and extended results on embedding and metric properties of measures.
A Hilbert space embedding for probability measures has recently been proposed, wherein any probability measure is represented as a mean element in a reproducing kernel Hilbert space (RKHS). Such an embedding has found applications in homogeneity testing, independence testing, dimensionality reduction, etc., with the re…
Measures time-delay embedding for noisy, sparse data.
problem Applying Takens' embedding theorem to real-world, noisy data.
method Formulated a measure-theoretic generalization of the embedding theorem, using optimal transport.
result Reconstructed full state of dynamical systems from time-lagged partial observations robust to noise and sparsity.
We present the Procrustes measure, a novel measure based on Procrustes rotation that enables quantitative comparison of the output of manifold-based embedding algorithms (such as LLE (Roweis and Saul, 2000) and Isomap (Tenenbaum et al, 2000)). The measure also serves as a natural tool when choosing dimension-reduction …
The paper explores how word embeddings affect the stability of downstream NLP models.
problem Small changes in training data can cause significant changes in model predictions.
method Empirical and theoretical analysis of embedding instability, including the introduction of eigenspace instability measure.
result Increasing embedding memory can reduce the disagreement in predictions by 5% to 37%.
New invariant metrics preserved under deformed Markov embeddings.
problem Preserving invariance in probability measure spaces under deformed embeddings.
method Deforming Markov embeddings while maintaining sufficiency, proving existence and uniqueness of invariant families.
result Existence and uniqueness of invariant families of tensor fields under deformed embeddings.
We offer a new, rigorous approach to conditional mean embeddings without operator constraints.
problem Lack of rigorous, operator-free approach to conditional mean embeddings.
method Measure-theoretic approach to conditional mean embeddings.
result Natural regression interpretation and universal consistency of empirical estimates.
Paper generalizes kernel mean embedding to von Neumann-algebra-valued measures.
problem Analyzing complex multivariate distributions and quantum mechanics.
method Generalizes kernel mean embedding to von Neumann-algebra-valued measures in reproducing kernel Hilbert modules.
result Injectivity and universality of the generalized KME are confirmed.
Kernel embeddings separate distinct probability distributions, simplifying testing.
problem Testing equality of non-atomic probability distributions.
method Kernel covariance embeddings and Gaussian measures in reproducing kernel Hilbert spaces.
result Testing for singularity between Gaussian measures is equivalent to testing for equality of non-atomic probability distributions.
New measure helps identify better word embedding compression methods.
problem Challenges in evaluating compressed word embeddings for downstream tasks.
method Proposed eigenspace overlap score and developed generalization bounds.
result Eigenspace overlap score correlates with better downstream performance.
Paper tackles biases in AI embeddings from wild data.
problem Biases in AI embeddings from uncontrolled data.
method Measures biases using social psychology word lists, observes gender bias in occupations, demonstrates simple projection to reduce bias.
result Simple projection significantly reduces embedding biases.
Study uses trajectory embedding to measure place function similarity at fine spatial granularity.
problem Measuring place function similarity at fine spatial granularity.
method Trajectory embedding to reduce dimensions and measure similarity of place functions.
result Embedding similarity can be a metric proxy for place functions at fine spatial granularity.
Probabilistic McShane's identity measures paths through a point.
problem Understanding the probabilistic nature of McShane's identity.
method Interpreting McShane's identity as a measure on path spaces.
result A probabilistic measure on path spaces.
Study proposes an alternative method to measure societal biases using smoothed co-occurrence relations.
problem Measuring societal biases using word embeddings can introduce irrelevant concepts.
method Proposes an alternative approach using smoothed first-order co-occurrence relations.
result First-order approach shows higher correlations with actual gender bias statistics.
Study evaluates node embedding algorithms using graph centrality measures.
problem Lack of research on node embedding algorithms compared to natural language processing.
method Systematic experiments with four node embedding algorithms, four or five graph centralities, and six datasets.
result Insights into properties of node embedding algorithms.
Curvature measures uniquely determined by invariance under embeddings.
problem Characterizing curvature measures uniquely.
method Applied Weyl principle and Künneth-type formula.
result Curvature measures uniquely characterized by invariance under isometric embeddings.
Nilpotent groups can't be biLipschitz embedded into L1.
problem Proving that simply connected nilpotent Lie groups cannot be biLipschitz embedded into L1. method Using a pull-back distance and cut measures, the authors show that bi-Lipschitz embeddings can't exist in non-abelian settings.
result Every Carnot group that biLipschitz embeds into L1 is abelian. Bayesian model improves kernel learning for probability measures.
problem Challenges in kernel learning, especially for characteristic kernels.
method Bayesian model combining Gaussian process prior and conjugate likelihood.
result Closed form posterior over mean embedding with uncertainty.
This paper tackles deep clustering evaluation challenges in high-dimensional data.
problem Evaluation of deep clustering methods is problematic due to the curse of dimensionality and variations in embedding spaces.
method Develops a theoretical framework to highlight the ineffectiveness of internal validation measures and proposes a systematic approach to applying clustering validity indices in deep learning.
result The proposed framework reduces misguidance from improper use of clustering validity indices in deep learning.
Study various complexity measures of curves on surfaces.
problem Measuring complexity of curves on surfaces.
method Examines minimum intersections, lengths of words, and covering degrees.
result Established relationships between these complexity measures.
Study improves radio show segmentation using audio embeddings.
problem Automated segmentation of radio shows.
method Created audio embeddings from multi-class classification tasks on different datasets, evaluated performance against text-only baseline.
result Audio embeddings from non-speech sound event classification significantly outperformed text-only baseline by 32.3% in F1-measure.
Expected centre of mass for random embeddings is constant.
problem Understanding the expected centre of mass for random embeddings.
method Analyzing the Haar measure and Gaussian unitary ensemble on SL(N, C).
result The expectation of the centre of mass is a constant multiple of the identity matrix.
The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.
problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.
Handlebody groups are rigid under measure equivalence.
problem Proving handlebody groups are rigid under measure equivalence.
method Proving superrigidity for measure equivalence of handlebody groups.
result Every countable group measure equivalent to handlebody groups is virtually isomorphic to them.
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.
Paper introduces a new distance measure for Gaussian Mixture Models.
problem Developing a new distance measure for Gaussian Mixture Models.
method Embedding K-component Gaussian Mixture Models into the manifold of symmetric positive definite matrices and calculating a lower bound for the Fisher-Rao metric.
result Demonstrated effectiveness through experiments on standard datasets.
The study shows that ergodic measures are not generic on non-positively curved manifolds.
problem Determining the genericity of ergodic measures on non-positively curved Riemannian manifolds.
method Investigates the existence of an open isometric embedding of a product manifold with a factor isometric to S1. result The closure of the set of ergodic measures does not encompass all invariant measures, indicating the failure of genericity.
A novel kernel-based test detects equality versus singularity of two probability measures.
problem Detecting equality versus singularity of two probability distributions.
method Combines kernel mean and kernel covariance embeddings to construct a likelihood ratio test statistic.
result The test statistic satisfies a '0/\infty' law, vanishing under the null and diverging under the alternative.
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…
A new method embeds distributions in a common space for optimal transport comparison.
problem Comparing distributions in different metric spaces.
method Sub-embedding robust Wasserstein (SERW) distance.
result SERW mimics GW distance properties and provides a cost relation.
Study linearizes 2-Wasserstein space using optimal transport maps.
problem Stability and linearization of the 2-Wasserstein space.
method Explicit embedding of probability measures into a Hilbert space using optimal transport maps.
result The embedding is (bi-)Hölder continuous, with stability results for optimal transport maps.
New test for conditional independence using kernel embeddings.
problem Testing conditional independence in high-dimensional settings.
method Analytic kernel embeddings, asymptotic distribution.
result New test outperforms existing methods in high-dimensional settings.
Root's barrier is continuous and finite under certain conditions.
problem Continuity of the root barrier function.
method Analyzing Skorokhod embedding problem and properties of target measures.
result The barrier function is continuous and finite under specified conditions.
Proves compactness for lamination spaces in complex manifolds.
problem Compactness of lamination spaces in complex manifolds.
method Introduced a Levy-Prokhorov metric topology on measured Riemann surface laminations and proved compactness using this topology.
result Compactness theorem for embedded measured Riemann surface laminations in almost complex manifolds.
The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classic…
LOCA learns standardized data coordinates from measurements.
problem Learning invariant data coordinates from non-linearly deformed manifolds.
method LOCA, a LOcal Conformal Autoencoder, learns an isometric embedding.
result LOCA preserves geometric information while learning invariant coordinates.
We establish an area-type formula for the intrinsic spherical Hausdorff measure of every regular curve embedded in an arbitrary graded group.
Paper introduces a new method for learning with distributions using dissimilarity measures.
problem Learning with probability distributions using dissimilarity measures.
method Introduces embeddings based on dissimilarity of distributions to templates, extending similarity theory to population distributions.
result Proves that dissimilarity theory holds for empirical distributions and shows better performance of Wasserstein distance embedding.
Kernel embeddings help estimate causal effects from observational data.
problem Estimating causal effects from observational data with confounding variables.
method Kernel embeddings in reproducing kernel Hilbert spaces (RKHS).
result Robust nonparametric framework for causal inference.
Time-delayed embeddings avoid self-intersections for high enough delay.
problem Analyzing self-intersections in time-delayed embeddings.
method Study of time-delayed coordinate maps for diffeomorphisms on compact manifolds.
result For high enough delay, time-delayed embeddings avoid self-intersections almost everywhere.
We study harmonic and totally invariant measures in a foliated compact Riemannian manifold isometrically embedded in an Euclidean space. We introduce geometrical techniques for stochastic calculus in this space. In particular, using these techniques we can construct explicitely an Stratonovich equation for the foliated…
A new stable similarity measure for time series using persistent homology.
problem Constructing a robust measure of time series similarity.
method Persistent homology for stability, bi-conditional periodicity score for similarity.
result Stability of the bi-conditional periodicity score under perturbations and dimension reduction.
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.
Optimizes embedding accuracy for data variance and error.
problem Efficiently embedding data while minimizing distortion.
method Uses Johnson-Lindenstrauss embeddings with orthogonal matrices and singular-value latent variables.
result Achieves best accuracy in variance, mean-squared error, and length distortion.
The paper extends optimal transport for linear separability of sheared distributions in supervised learning.
problem Learning on the space of probability measures using shifts and scalings.
method Embedding probability measures into L2 spaces using optimal transport, then applying regular machine learning techniques. result Sheared distributions can be linearly separated under certain conditions, with bounds on transformations.
This paper improves binary embeddings and quantized compressed sensing methods.
problem Distance-preserving binary embeddings and quantization for compressed sensing.
method Quantization of fast Johnson-Lindenstrauss embeddings and bounded orthonormal systems.
result Quantization methods yield reconstruction errors that decay polynomially and exponentially in the number of measurements.
Efficient method for vertex embedding and community detection.
problem Vertex embedding and community detection.
method Normalized one-hot graph encoder and rank-based cluster size measure.
result Excellent numerical performance of graph encoder ensemble algorithm.