paper-with-me

Papers

Consistency Analysis for the Doubly Stochastic Dirichlet Process

2016-05-24 · Xing Sun, Nelson H. C. Yung, Edmund Y. Lam, Hayden K. -H. So

This technical report proves components consistency for the Doubly Stochastic Dirichlet Process with exponential convergence of posterior probability. We also present the fundamental properties for DSDP as well as inference algorithms. Simulation toy experiment and real-world experiment results for single and multi-cluster also support the consistency proof. This report is also a support document for the paper "Computationally Efficient Hyperspectral Data Learning Based on the Doubly Stochastic Dirichlet Process".

📄 PDF Abstract BibTeX arXiv:1605.07358

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Semi-Parametric Inference for Doubly Stochastic Spatial Point Processes: An Approximate Penalized Poisson Likelihood Approach

2023-06-11 · Si Cheng, Jon Wakefield, Ali Shojaie

Doubly-stochastic point processes model the occurrence of events over a spatial domain as an inhomogeneous Poisson process conditioned on the realization of a random intensity function. They are flexible tools for captur…

Point Processesvalid

Sparse Parallel Training of Hierarchical Dirichlet Process Topic Models

2019-06-06 · EMNLP 2020 11 · Alexander Terenin, Måns Magnusson, Leif Jonsson

To scale non-parametric extensions of probabilistic topic models such as Latent Dirichlet allocation to larger data sets, practitioners rely increasingly on parallel and distributed systems. In this work, we study data-p…

Topic Models

Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks

2026-04-16 · Zhaobo Hu, Vincent Gauthier, Mehdi Naima arxiv

Graph Neural Networks (GNNs) conventionally rely on standard Laplacian or adjacency matrices for structural message passing. In this work, we substitute the traditional Laplacian with a Doubly Stochastic graph Matrix (DS…

Doubly-Stochastic Normalization of the Gaussian Kernel is Robust to Heteroskedastic Noise

2020-05-31 · Boris Landa, Ronald R. Coifman, Yuval Kluger

A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean space, a widespread approach is to from …

Zeroth-order Asynchronous Doubly Stochastic Algorithm with Variance Reduction

2016-12-05 · Bin Gu, Zhouyuan Huo, Heng Huang

Zeroth-order (derivative-free) optimization attracts a lot of attention in machine learning, because explicit gradient calculations may be computationally expensive or infeasible. To handle large scale problems both in v…