paper-with-me

Papers

Repeatable Random Permutation Set

2022-11-03 · Wenran Yang, Yong Deng

Random permutation set (RPS), as a recently proposed theory, enables powerful information representation by traversing all possible permutations. However, the repetition of items is not allowed in RPS while it is quite common in real life. To address this issue, we propose repeatable random permutation set ($\rm R^2PS$) which takes the repetition of items into consideration. The right and left junctional sum combination rules are proposed and their properties including consistency, pseudo-Matthew effect and associativity are researched. Based on these properties, a decision support system application is simulated to show the effectiveness of $\rm R^2PS$.

📄 PDF Abstract BibTeX arXiv:2211.01676

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Permutation-Based SGD: Is Random Optimal?

2021-02-19 · ICLR 2022 4 · Shashank Rajput, Kangwook Lee, Dimitris Papailiopoulos

A recent line of ground-breaking results for permutation-based SGD has corroborated a widely observed phenomenon: random permutations offer faster convergence than with-replacement sampling. However, is random optimal? W…

Symphony Generation with Permutation Invariant Language Model

2022-05-10 · Jiafeng Liu, Yuanliang Dong, Zehua Cheng, Xinran Zhang 외

In this work, we propose a permutation invariant language model, SymphonyNet, as a solution for symbolic symphony music generation. We propose a novel Multi-track Multi-instrument Repeatable (MMR) representation for symp…

Audio GenerationDecoderLanguage ModelingLanguage Modelling+3

Constant Factor Approximation for Balanced Cut in the PIE model

2014-06-22 · Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan

We propose and study a new semi-random semi-adversarial model for Balanced Cut, a planted model with permutation-invariant random edges (PIE). Our model is much more general than planted models considered previously. Con…

C-MinHash: Improving Minwise Hashing with Circulant Permutation

2021-09-29 · Xiaoyun Li, Ping Li

Minwise hashing (MinHash) is an important and practical algorithm for generating random hashes to approximate the Jaccard (resemblance) similarity in massive binary (0/1) data. The basic theory of MinHash requires applyi…

Bringing Order to Neural Word Embeddings with Embeddings Augmented by Random Permutations (EARP)

2018-10-01 · CONLL 2018 10 · Trevor Cohen, Dominic Widdows

Word order is clearly a vital part of human language, but it has been used comparatively lightly in distributional vector models. This paper presents a new method for incorporating word order information into word vector…

RetrievalWord Embeddings