Uniform Manifold Sampling (UMS): Sampling the Maximum Entropy PDF

被引:14
|
作者
Baggenstoss, Paul M. [1 ]
机构
[1] Fraunhofer FKIE, D-53343 Wachtberg, Germany
关键词
ALGORITHM;
D O I
10.1109/TSP.2017.2659645
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Maximum entropy PDF projection (MEPP) is a way to construct generative models from feature transformations. Corresponding to each dimension-reducing feature mapping, such as a feed-forward neural network or an algorithm to calculate linear-prediction coefficients from time series, and given a prior distribution for the features, there exists a unique generative model for the input data, which subject to mild requirements, is maximum entropy (MaxEnt) among all probability density functions (PDFs) that are consistent with the given feature prior. In this paper, we consider the problem of sampling from these MaxEnt projected PDFs. The sampling process consists of drawing a sample from the given feature prior distribution, then drawing samples uniformly distributed on the inversion set (set of input samples consistent with the drawn feature value, usually a manifold). The process is called uniform manifold sampling (UMS). We describe UMS for simple nonlinear and iterative feature transformations, then focus on linear transformations with input data constraints (x(i) > 0 or 0 <= x(i) <= 1), which require MCMC-based sampling. We discover that the manifold centroid (sample mean for a fixed feature value) is useful as a deterministic MaxEnt feature inversion solution. We show how to predict the centroid efficiently without sampling and demonstrate its usefulness in speeding up MCMC by an order of magnitude, and in spectral estimation and image reconstruction. Finally, we provide an example of UMS in a classification experiment in which we use Monte Carlo integration to create true generative models from arbitrary classifiers.
引用
收藏
页码:2455 / 2470
页数:16
相关论文
共 50 条
  • [31] Maximum Entropy PDF Projection: A Review
    Baggenstoss, Paul M.
    BAYESIAN INFERENCE AND MAXIMUM ENTROPY METHODS IN SCIENCE AND ENGINEERING (MAXENT 2016), 2017, 1853
  • [32] Real-time Acquisition of Three Dimensional NMR Spectra by Non-uniform Sampling and Maximum Entropy Processing
    Jee, Jun-Goo
    BULLETIN OF THE KOREAN CHEMICAL SOCIETY, 2008, 29 (10) : 2017 - 2022
  • [33] On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem
    Chen, Zhongzhu
    Fampa, Marcia
    Lee, Jon
    INFORMS JOURNAL ON COMPUTING, 2023, 35 (02) : 368 - +
  • [34] Solving maximum-entropy sampling problems using factored masks
    Burer, Samuel
    Lee, Jon
    MATHEMATICAL PROGRAMMING, 2007, 109 (2-3) : 263 - 281
  • [35] Solving maximum-entropy sampling problems using factored masks
    Samuel Burer
    Jon Lee
    Mathematical Programming, 2007, 109 : 263 - 281
  • [36] Mixing convex-optimization bounds for maximum-entropy sampling
    Zhongzhu Chen
    Marcia Fampa
    Amélie Lambert
    Jon Lee
    Mathematical Programming, 2021, 188 : 539 - 568
  • [37] Cumulative Tsallis entropy for maximum ranked set sampling with unequal samples
    Tahmasebi, S.
    Longobardi, M.
    Kazemi, M. R.
    Alizadeh, M.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 556
  • [38] A new maximum entropy-based importance sampling for reliability analysis
    Dai, Hongzhe
    Zhang, Hao
    Wang, Wei
    STRUCTURAL SAFETY, 2016, 63 : 71 - 80
  • [39] Application of an improved maximum entropy sampling method in hull form optimization
    Ouyang, Xuyu
    Chang, Haichao
    Feng, Baiwei
    Liu, Zuyuan
    Zhan, Chengsheng
    Cheng, Xide
    OCEAN ENGINEERING, 2023, 270
  • [40] The impact of sampling method on maximum entropy species distribution modeling for bats
    Barnhart, Paul R.
    Gillam, Erin H.
    ACTA CHIROPTEROLOGICA, 2014, 16 (01) : 241 - 248