Maximum Entropy of Random Permutation Set

• URL: http://arxiv.org/abs/2203.11941v1
• Date: Thu, 16 Dec 2021 12:44:21 GMT
• Title: Maximum Entropy of Random Permutation Set
• Authors: Jixiang Deng, Yong Deng
• Abstract summary: 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. The maximum entropy principle of RPS entropy has not been discussed.
• Score: 9.327920030279586
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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. However, the maximum entropy principle of RPS entropy has not been discussed. To address this issue, in this paper, the maximum entropy of RPS is presented. The analytical solution for maximum entropy of RPS and its corresponding PMF condition are respectively proofed and discussed. Numerical examples are used to illustrate the maximum entropy RPS. The results show that the maximum entropy RPS is compatible with the maximum Deng entropy and the maximum Shannon entropy. When the order of the element in the permutation event is ignored, the maximum entropy of RPS will degenerate into the maximum Deng entropy. When each permutation event is limited to containing just one element, the maximum entropy of RPS will degenerate into the maximum Shannon entropy.

Related papers

• On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy [70.10668953625247]
  We show that the minimax regret for the case of no side information can be upper bounded in terms of sequential square-root entropy. For the problem of sequential probability assignment with side information, we develop both upper and lower bounds based on the aforementioned entropy.
  arXiv  Detail & Related papers  (2025-03-22T17:26:34Z)
• Limit of the Maximum Random Permutation Set Entropy [16.83953425640319]
  The entropy of Random Permutation Set (RPS) and its corresponding maximum entropy have been proposed. A new concept, the envelope of entropy function, is defined. numerical examples validate the efficiency and conciseness of the proposed envelope.
  arXiv  Detail & Related papers  (2024-03-10T13:04:09Z)
• Fast Rates for Maximum Entropy Exploration [52.946307632704645]
  We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards. We study the maximum entropy exploration problem two different types. For visitation entropy, we propose a game-theoretic algorithm that has $widetildemathcalO(H3S2A/varepsilon2)$ sample complexity. For the trajectory entropy, we propose a simple algorithm that has a sample of complexity of order $widetildemathcalO(mathrmpoly(S,
  arXiv  Detail & Related papers  (2023-03-14T16:51:14Z)
• Maximum entropy quantum state distributions [58.720142291102135]
  We go beyond traditional thermodynamics and condition on the full distribution of the conserved quantities. The result are quantum state distributions whose deviations from thermal states' get more pronounced in the limit of wide input distributions.
  arXiv  Detail & Related papers  (2022-03-23T17:42:34Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Non-Markovian Stochastic Schr\"odinger Equation: Matrix Product State Approach to the Hierarchy of Pure States [65.25197248984445]
  We derive a hierarchy of matrix product states (HOMPS) for non-Markovian dynamics in open finite temperature. The validity and efficiency of HOMPS is demonstrated for the spin-boson model and long chains where each site is coupled to a structured, strongly non-Markovian environment.
  arXiv  Detail & Related papers  (2021-09-14T01:47:30Z)
• Maximum Entropy Reinforcement Learning with Mixture Policies [54.291331971813364]
  We construct a tractable approximation of the mixture entropy using MaxEnt algorithms. We show that it is closely related to the sum of marginal entropies. We derive an algorithmic variant of Soft Actor-Critic (SAC) to the mixture policy case and evaluate it on a series of continuous control tasks.
  arXiv  Detail & Related papers  (2021-03-18T11:23:39Z)
• Action Redundancy in Reinforcement Learning [54.291331971813364]
  We show that transition entropy can be described by two terms; namely, model-dependent transition entropy and action redundancy. Our results suggest that action redundancy is a fundamental problem in reinforcement learning.
  arXiv  Detail & Related papers  (2021-02-22T19:47:26Z)
• Entanglement Dynamics From Random Product States: Deviation From Maximal Entanglement [2.741266294612776]
  We study the entanglement dynamics of quantum many-body systems. Our results highlight the difference between the entanglement generated by (chaotic) Hamiltonian dynamics and that of random states.
  arXiv  Detail & Related papers  (2021-02-15T14:51:36Z)
• Information bound for entropy production from the detailed fluctuation theorem [0.0]
  We show that entropy produced by heat transfer using a bosonic mode at weak coupling reproduces the maximal distribution in a limiting case. A composition of qubit swap engines satisfies a particular case of the maximal distribution regardless of its size.
  arXiv  Detail & Related papers  (2020-10-09T22:42:35Z)
• Extensive R\'enyi entropies in matrix product states [0.0]
  We prove that all R'enyi entanglement entropies of spin-chains described by generic (gapped) are extensive for disconnected sub-systems. For unital quantum channels this yields a very simple lower bound on the distribution of singular values and the expansion coefficient in terms of the Kraus-rank.
  arXiv  Detail & Related papers  (2020-08-26T18:53:46Z)
• Maximum Geometric Quantum Entropy [0.0]
  We propose the Maximum Geometric Quantum Entropy Principle to exploit the notions of Information Dimension and Quantum Entropy. These allow us to quantify the entropy of fully arbitrary ensembles and select the one that maximizes it.
  arXiv  Detail & Related papers  (2020-08-19T21:43:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.