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 条
  • [11] Maximum entropy sampling and general. Equivalence theory
    Wynn, HP
    MODA 7 - ADVANCES IN MODEL-ORIENTED DESIGN AND ANALYSIS, PROCEEDINGS, 2004, : 211 - 218
  • [12] A masked spectral bound for maximum-entropy sampling
    Anstreicher, KM
    Lee, J
    MODA 7 - ADVANCES IN MODEL-ORIENTED DESIGN AND ANALYSIS, PROCEEDINGS, 2004, : 1 - 12
  • [13] Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks
    Al-Thani, Hessa
    Lee, Jon
    PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, 2021, 195 : 127 - 134
  • [14] New upper bounds for maximum-entropy sampling
    Hoffman, A
    Lee, J
    Williams, J
    MODA6 ADVANCES IN MODEL-ORIENTED DESIGN AND ANALYSIS, 2001, : 143 - 153
  • [15] Tridiagonal maximum-entropy sampling and tridiagonal masks
    Al-Thani, Hessa
    Lee, Jon
    DISCRETE APPLIED MATHEMATICS, 2023, 337 : 120 - 138
  • [16] A MAXIMUM-ENTROPY APPROACH TO SAMPLING FUNCTION DESIGN
    LUTTRELL, SP
    INVERSE PROBLEMS, 1988, 4 (03) : 829 - 841
  • [17] Maximum-entropy sampling and the Boolean quadric polytope
    Kurt M. Anstreicher
    Journal of Global Optimization, 2018, 72 : 603 - 618
  • [18] Nonuniform Sampling and Maximum Entropy Reconstruction in Multidimensional NMR
    Hoch, Jeffrey C.
    Maciejewski, Mark W.
    Mobli, Mehdi
    Schuyler, Adam D.
    Stern, Alan S.
    ACCOUNTS OF CHEMICAL RESEARCH, 2014, 47 (02) : 708 - 717
  • [19] Maximum-entropy sampling and the Boolean quadric polytope
    Anstreicher, Kurt M.
    JOURNAL OF GLOBAL OPTIMIZATION, 2018, 72 (04) : 603 - 618
  • [20] Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem
    Chen, Zhongzhu
    Fampa, Marcia
    Lee, Jon
    SIAM CONFERENCE ON APPLIED AND COMPUTATIONAL DISCRETE ALGORITHMS, ACDA23, 2023, : 110 - 118