Unsupervised Submodular Rank Aggregation on Score-based Permutations
Unsupervised rank aggregation on score-based permutations, which is widely used in many applications, has not been deeply explored yet. This work studies the use of submodular optimization for rank aggregation on score-based permutations in an unsupervised way. Specifically, we propose an unsupervised approach based on the Lovasz Bregman divergence for setting up linear structured convex and nested structured concave objective functions. In addition, stochastic optimization methods are applied in the training process and efficient algorithms for inference can be guaranteed. The experimental results from Information Retrieval, Combining Distributed Neural Networks, Influencers in Social Networks, and Distributed Automatic Speech Recognition tasks demonstrate the effectiveness of the proposed methods.
Code (1)
Tasks
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Information RetrievalRetrievalspeech-recognitionSpeech RecognitionStochastic OptimizationSimilar Papers 제목 키워드 기반
Submodular Rank Aggregation on Score-based Permutations for Distributed Automatic Speech Recognition
Distributed automatic speech recognition (ASR) requires to aggregate outputs of distributed deep neural network (DNN)-based models. This work studies the use of submodular functions to design a rank aggregation on score-…
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)speech-recognitionSpeech RecognitionEfficient Rank Aggregation via Lehmer Codes
We propose a novel rank aggregation method based on converting permutations into their corresponding Lehmer codes or other subdiagonal images. Lehmer codes, also known as inversion vectors, are vector representations of …
Thesis: Document Summarization with applications to Keyword extraction and Image Retrieval
Automatic summarization is the process of reducing a text document in order to generate a summary that retains the most important points of the original document. In this work, we study two problems - i) summarizing a te…
ArticlesDocument SummarizationImage RetrievalInformation Retrieval+4Ranking Aggregation with Interactive Feedback for Collaborative Person Re-identification
Person re-identification (re-ID) aims to retrieve the same person from a group of networking cameras. Ranking aggregation (RA), a method to aggregates multiple ranking results, can further improve the retrieval accuracy …
Person Re-IdentificationRe-RankingRetrievalLearning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments
In applications such as rank aggregation, mixture models for permutations are frequently used when the population exhibits heterogeneity. In this work, we study the widely used Mallows mixture model. In the high-dimensio…