paper-with-me

Papers

Characteristic Kernels on Groups and Semigroups

2008-12-01 · NeurIPS 2008 12 · Kenji Fukumizu, Arthur Gretton, Bernhard Schölkopf, Bharath K. Sriperumbudur

Embeddings of random variables in reproducing kernel Hilbert spaces (RKHSs) may be used to conduct statistical inference based on higher order moments. For sufficiently rich (characteristic) RKHSs, each probability distribution has a unique embedding, allowing all statistical properties of the distribution to be taken into consideration. Necessary and sufficient conditions for an RKHS to be characteristic exist for $\R^n$. In the present work, conditions are established for an RKHS to be characteristic on groups and semigroups. Illustrative examples are provided, including characteristic kernels on periodic domains, rotation matrices, and $\R^n_+$.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learning proofs for the classification of nilpotent semigroups

2021-06-06 · Carlos Simpson

Machine learning is applied to find proofs, with smaller or smallest numbers of nodes, for the classification of 4-nilpotent semigroups.

BIG-bench Machine LearningClassification

A Hybrid Framework for Healing Semigroups with Machine Learning

2025-09-01 · Sarayu Sirikonda, Jasper van de Kreeke arxiv

In this paper, we propose a hybrid framework that heals corrupted finite semigroups, combining deterministic repair strategies with Machine Learning using a Random Forest Classifier. Corruption in these tables breaks ass…

Soft Neutrosophic Algebraic Structures and Their Generalization

2014-08-23 · Florentin Smarandache, Mumtaz Ali, Muhammad Shabir

Study of soft sets was first proposed by Molodtsov in 1999 to deal with uncertainty in a non-parametric manner. The researchers did not pay attention to soft set theory at that time but now the soft set theory has been d…

A Neural Network for Semigroups

2021-03-12 · Edouard Balzin, Boris Shminke

Tasks like image reconstruction in computer vision, matrix completion in recommender systems and link prediction in graph theory, are well studied in machine learning literature. In this work, we apply a denoising autoen…

DenoisingImage ReconstructionLink PredictionMatrix Completion+1

Revisiting Algebra and Complexity of Inference in Graphical Models

2014-09-25 · Siamak Ravanbakhsh, Russell Greiner

This paper studies the form and complexity of inference in graphical models using the abstraction offered by algebraic structures. In particular, we broadly formalize inference problems in graphical models by viewing the…

Survey