paper-with-me

Papers

Limit of the Maximum Random Permutation Set Entropy

2024-03-10 · Jiefeng Zhou, Zhen Li, Kang Hao Cheong, Yong Deng

The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been proposed. Exploring the maximum entropy provides a possible way of understanding the physical meaning of RPS. In this paper, a new concept, the envelope of entropy function, is defined. In addition, the limit of the envelope of RPS entropy is derived and proved. Compared with the existing method, the computational complexity of the proposed method to calculate the envelope of RPS entropy decreases greatly. The result shows that when $N \to \infty$, the limit form of the envelope of the entropy of RPS converges to $e \times (N!)^2$, which is highly connected to the constant $e$ and factorial. Finally, numerical examples validate the efficiency and conciseness of the proposed envelope, which provides a new insight into the maximum entropy function.

📄 PDF Abstract BibTeX arXiv:2403.06206

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Maximum Entropy of Random Permutation Set

2021-12-16 · Jixiang Deng, Yong Deng

Recently, a new type of set, named as random permutation set (RPS), is proposed by considering all the permutations of elements in a certain set. For measuring the uncertainty of RPS, the entropy of RPS is presented. How…

Permutation Decision Trees

2023-06-05 · Harikrishnan N B, Arham Jain, Nithin Nagaraj

Decision Tree is a well understood Machine Learning model that is based on minimizing impurities in the internal nodes. The most common impurity measures are Shannon entropy and Gini impurity. These impurity measures are…

feature selection

Linear Regression with an Unknown Permutation: Statistical and Computational Limits

2016-08-09 · Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade

Consider a noisy linear observation model with an unknown permutation, based on observing $y = \Pi^* A x^* + w$, where $x^* \in \mathbb{R}^d$ is an unknown vector, $\Pi^*$ is an unknown $n \times n$ permutation matrix, a…

regression

Efficient high dimensional maximum entropy modeling via symmetric partition functions

2012-12-01 · NeurIPS 2012 12 · Paul Vernaza, Drew Bagnell

The application of the maximum entropy principle to sequence modeling has been popularized by methods such as Conditional Random Fields (CRFs). However, these approaches are generally limited to modeling paths in …

Vocal Bursts Intensity Prediction

Global Permutation Entropy

2025-08-27 · Abhijeet Avhale, Joscha Diehl, Niraj Velankar, Emanuele Verri arxiv

Permutation Entropy, introduced by Bandt and Pompe, is a widely used complexity measure for real-valued time series that is based on the relative order of values within consecutive segments of fixed length. After standar…