DOCSLIB.ORG

A Relaxed Ranking-Based Factor Model for Recommender System

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Relaxed Ranking-Based Factor Model for Recommender System Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) A Relaxed Ranking-Based Factor Model for Recommender System from Implicit Feedback + + Huayu Li , Richang Hong⇤, Defu Lian−, Zhiang Wu⇥, Meng Wang⇤ and Yong Ge + UNC Charlotte, hli38, yong.ge @uncc.edu { } ⇤ Hefei University of Technology, hongrc, wangmeng @hfut.edu.cn { } − University of Electronic Science and Technology of China, [email protected] ⇥ Nanjing University of Finance and Economics, [email protected] Abstract about which items users dislike. This has been a thorny issue for learning task. Implicit feedback based recommendation has re- cently been an important task with the accumulated In the literature, some related work has been proposed to user-item interaction data. However, it is very chal- take advantage of implicit feedback for item recommenda- lenging to produce recommendations from implicit tions. For example, [Hu et al., 2008] regards user’s prefer- feedback due to the sparseness of data and the lack ence for an item as a binary value, where a user’s preference of negative feedback/rating. Although various fac- for observed item and unobserved one are viewed as one and tor models have been proposed to tackle this prob- zero, respectively. Then it fits these predefined ratings with lem, they either focus on rating prediction that may vastly varying confidential levels based on matrix factoriza- lead to inaccurate top-k recommendations or are tion framework. Although it assumes that a user prefers the dependent on the sampling of negative feedback observed items to unobserved ones, the quadratic in the for- that often results in bias. To this end, we propose mulation weakens their instinct ranking order. There is no a Relaxed Ranking-based Factor Model, RRFM, to guarantee that the higher accuracy in rating prediction will re- relax pairwise ranking into a SVM-like task, where sult in the better ranking effectiveness [N. and Qiang, 2008]. positive and negative feedbacks are separated by For instance, the true ratings for two items are 1, 0.5 . The predicted ratings 0.4, 0.6 and 1.6, 0.6 have{ the same} pre- the soft boundaries, and their non-separate property { } { } is employed to capture the characteristic of unob- diction accuracy. But in fact, they lead to totally different served data. A smooth and scalable algorithm is ranking orders of items. To this end, Rendle formulates user’s developed to solve group- and instance- level’s op- consuming behavior into the pairwise ranking problem, i.e., timization and parameter estimation. Extensive ex- users are much more interested in their consumed items than periments based on real-world datasets demonstrate unconsumed ones [Rendle et al., 2009]. Due to a large num- the effectiveness and advantage of our approach. ber of such pairs, it only samples some negative items for the learning procedure. However, there are two limitations. First, the pairwise ranking increases the number of compar- 1 Introduction isons. Second, although Rendle [Rendle and Freudenthaler, Recommender systems have been an important feature to 2014] improves the sampling skill by oversampling the top recommend relevant items to relevant users in many on- ranked items, sampling technique itself easily leads to bias. line communities, e.g. Amazon, Netflix, and Foursquare. It is likely that the sampled negative item is already ranked Some online systems allow users to provide an explicit rat- below the positive one, which as a result has no contribution ing for an item to express how much they like it. A higher to the optimization. (or lower) rating indicates that the user likes (or dislikes) To address these issues, we propose to relax the rank- the item more. Nevertheless, many recommender systems ing model in [Rendle et al., 2009] to eliminate the pair- only have user’s implicit feedback, such as browsing activ- wise ranking. Specifically, the positive and negative feed- ity, purchasing history, watching history, click behavior and backs are separated by the positive and negative boundaries. check-in information. As implicit feedback becomes more In fact, the unobserved implicit feedback is often a mix- and more prevalent, this type of recommender system has at- ture of negative and missed positive data, so a slack vari- tracted many researchers’ attention [Joachims et al., 2005; able is introduced to capture such characteristic, which al- Lim et al., 2015]. However, implicit feedback based recom- lows some negative feedbacks and positive feedbacks to be mender systems suffer from many challenges. For example, non-separate. Furthermore, instead of sampling, a smooth the sparseness of observed data (i.e., only a small percentage and scalable algorithm is designed to learn model’s param- of user-item pairs have implicit feedback) increases the diffi- eters based on group and instance level’s optimization. The culty to learn user’s exact taste on items. Also, different from proposed algorithm allows to take all the unobserved items explicit feedback, only positive preference is observed in im- into account for optimization, and as a result addresses the plicit feedback. In other words, we have no prior knowledge bias caused by the sampling technique in [Rendle et al., 2009; 1683 Rendle and Freudenthaler, 2014]. Finally, the proposed is no negative rating. Most research work argues that one model is evaluated with many state-of-the-art baseline mod- user’s preference for the observed item is supposed to be els and different validation metrics on three real-world data larger than that for any unobserved one [Rendle et al., 2009; sets. The experimental results demonstrate the superiority of Hu et al., 2008], which indicates the presence of ranking be- our model for tackling implicit feedback based recommenda- tween positive and negative ratings. However, the pairwise tions. ranking of a user’s preference for the observed items over the unobserved ones is quite inefficient, especially when the 2 Preliminaries user’s historical data increases. To address this issue, we pro- The recommendation task addressed in this paper is defined pose to relax the pairwise ranking. We treat one user’s pref- as: given the consumption behaviors of N users over M erence for an item as an point, where his positive (or nega- items, we aim at recommending each user with top-K new tive) rating is viewed as the positive (or negative) point. Our items that he might be interested in but has never consumed goal is to make all positive points reside above all negative before. Matrix factorization based models assume that U points. Inspired by the soft margin idea of SVM, we sepa- K N K M 2 rate these two types of points by two different boundaries. In R ⇥ and V R ⇥ are the user and item latent feature 2 other words, user’s preference for the observed items and un- matrices, with column vectors Ui and Vj representing the K- dimension user-specific and item-specific feature vectors of observed ones are separated by the boundaries. Specifically, user i and item j, respectively. The predicted preference (rat- user’s positive rating is located on or above a boundary rep- ˆ resented as a numeric value r+. On the other hand, his nega- ing) of user i for item j, denoted as Rij, is approximated by: tive rating resides on or below another boundary. It not only ˆ T improves the efficiency of comparisons, but also preserves Rij = Ui Vj. (1) the ranking information. Along this line, we relax Eq.(2) for In implicit feedback datasets, only positive feedback is ob- o u j i k i in the following: served. As we lack substantial evidence on which items users 8 2M ^8 2M T dislike, their preference for an unobserved item is regarded Ui Vj r+, T ≥ (3) as a mixture of negative and missing values. Along this line, Ui Vk r + ⇠ik, ⇢ − [Rendle et al., 2009] assumes that each user prefers the ob- where ⇠ik is the slack variable for user i on the unobserved o served items over unobserved ones. Let us denote i as a set item k. Similar to [Hu et al., 2008], r+ and r are set as u M − of items that user i has consumed and as the remaining one and zero, respectively. Even though there may be many Mi items that he never consumed. Then for user i, the ranking unobserved items for a user, it does not necessarily indicate based on user’s preference for an observed item j over an un- that he dislikes them. Probably he may be just unaware of observed item k is given by: them. In other words, some of the unobserved items might be T T o u those users are interested in, while others are actually those U V >U V , j k (2) i j i k 8 2Mi ^8 2Mi they dislike. To capture this characteristic, the slack variable For convenience we will henceforth refer to i as user, j as ⇠ik in Eq.(3) is introduced to allow the mixture of negative observed item, and k as unobserved item unless stated other- feedback and positive feedback in unobserved data. Hence, wise. Eq.(2) models the correlation of user’s preference for we apply the following constraint for ⇠ik as: each pair of observed item and unobserved one. It is actu- r + ⇠ik r+ ⇠ik r+ r . (4) − ≥ ) ≥ − − ally maximizing the Area Under the ROC Curve (AUC) for It is worth to note that for each user i, pairwise ranking in matrix factorization. The optimization problem for pairwise Eq.(2) needs o u comparisons; but our relaxed ranking ranking is formulated as follows: |Mi ||Mi | in Eq.(3) only requires M= o + u comparisons.
Load more

Recommended publications
  • Context-Aware Learning to Rank with Self-Attention
    Context-Aware Learning to Rank with Self-Attention Przemysław Pobrotyn Tomasz Bartczak Mikołaj Synowiec ML Research at Allegro.pl ML Research at Allegro.pl ML Research at Allegro.pl [email protected] [email protected] [email protected] Radosław Białobrzeski Jarosław Bojar ML Research at Allegro.pl ML Research at Allegro.pl [email protected] [email protected] ABSTRACT engines, recommender systems, question-answering systems, and Learning to rank is a key component of many e-commerce search others. engines. In learning to rank, one is interested in optimising the A typical machine learning solution to the LTR problem involves global ordering of a list of items according to their utility for users. learning a scoring function, which assigns real-valued scores to Popular approaches learn a scoring function that scores items in- each item of a given list, based on a dataset of item features and dividually (i.e. without the context of other items in the list) by human-curated or implicit (e.g. clickthrough logs) relevance labels. optimising a pointwise, pairwise or listwise loss. The list is then Items are then sorted in the descending order of scores [23]. Perfor- sorted in the descending order of the scores. Possible interactions mance of the trained scoring function is usually evaluated using an between items present in the same list are taken into account in the IR metric like Mean Reciprocal Rank (MRR) [33], Normalised Dis- training phase at the loss level. However, during inference, items counted Cumulative Gain (NDCG) [19] or Mean Average Precision are scored individually, and possible interactions between them are (MAP) [4].
    [Show full text]
  • An Introduction to Neural Information Retrieval
    The version of record is available at: http://dx.doi.org/10.1561/1500000061 An Introduction to Neural Information Retrieval Bhaskar Mitra1 and Nick Craswell2 1Microsoft, University College London; [email protected] 2Microsoft; [email protected] ABSTRACT Neural ranking models for information retrieval (IR) use shallow or deep neural networks to rank search results in response to a query. Tradi- tional learning to rank models employ supervised machine learning (ML) techniques—including neural networks—over hand-crafted IR features. By contrast, more recently proposed neural models learn representations of language from raw text that can bridge the gap between query and docu- ment vocabulary. Unlike classical learning to rank models and non-neural approaches to IR, these new ML techniques are data-hungry, requiring large scale training data before they can be deployed. This tutorial intro- duces basic concepts and intuitions behind neural IR models, and places them in the context of classical non-neural approaches to IR. We begin by introducing fundamental concepts of retrieval and different neural and non-neural approaches to unsupervised learning of vector representations of text. We then review IR methods that employ these pre-trained neural vector representations without learning the IR task end-to-end. We intro- duce the Learning to Rank (LTR) framework next, discussing standard loss functions for ranking. We follow that with an overview of deep neural networks (DNNs), including standard architectures and implementations. Finally, we review supervised neural learning to rank models, including re- cent DNN architectures trained end-to-end for ranking tasks. We conclude with a discussion on potential future directions for neural IR.
    [Show full text]
  • Metric Learning for Session-Based Recommendations - Preprint
    METRIC LEARNING FOR SESSION-BASED RECOMMENDATIONS A PREPRINT Bartłomiej Twardowski1,2 Paweł Zawistowski Szymon Zaborowski 1Computer Vision Center, Warsaw University of Technology, Sales Intelligence Universitat Autónoma de Barcelona Institute of Computer Science 2Warsaw University of Technology, [email protected] Institute of Computer Science [email protected] January 8, 2021 ABSTRACT Session-based recommenders, used for making predictions out of users’ uninterrupted sequences of actions, are attractive for many applications. Here, for this task we propose using metric learning, where a common embedding space for sessions and items is created, and distance measures dissimi- larity between the provided sequence of users’ events and the next action. We discuss and compare metric learning approaches to commonly used learning-to-rank methods, where some synergies ex- ist. We propose a simple architecture for problem analysis and demonstrate that neither extensively big nor deep architectures are necessary in order to outperform existing methods. The experimental results against strong baselines on four datasets are provided with an ablation study. Keywords session-based recommendations · deep metric learning · learning to rank 1 Introduction We consider the session-based recommendation problem, which is set up as follows: a user interacts with a given system (e.g., an e-commerce website) and produces a sequence of events (each described by a set of attributes). Such a continuous sequence is called a session, thus we denote sk = ek,1,ek,2,...,ek,t as the k-th session in our dataset, where ek,j is the j-th event in that session. The events are usually interactions with items (e.g., products) within the system’s domain.
    [Show full text]
  • Learning Embeddings: Efficient Algorithms and Applications
    Learning embeddings: HIÀFLHQWDOJRULWKPVDQGDSSOLFDWLRQV THÈSE NO 8348 (2018) PRÉSENTÉE LE 15 FÉVRIER 2018 À LA FACULTÉ DES SCIENCES ET TECHNIQUES DE L'INGÉNIEUR LABORATOIRE DE L'IDIAP PROGRAMME DOCTORAL EN GÉNIE ÉLECTRIQUE ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR Cijo JOSE acceptée sur proposition du jury: Prof. P. Frossard, président du jury Dr F. Fleuret, directeur de thèse Dr O. Bousquet, rapporteur Dr M. Cisse, rapporteur Dr M. Salzmann, rapporteur Suisse 2018 Abstract Learning to embed data into a space where similar points are together and dissimilar points are far apart is a challenging machine learning problem. In this dissertation we study two learning scenarios that arise in the context of learning embeddings and one scenario in efficiently estimating an empirical expectation. We present novel algorithmic solutions and demonstrate their applications on a wide range of data-sets. The first scenario deals with learning from small data with large number of classes. This setting is common in computer vision problems such as person re-identification and face verification. To address this problem we present a new algorithm called Weighted Approximate Rank Component Analysis (WARCA), which is scalable, robust, non-linear and is independent of the number of classes. We empirically demonstrate the performance of our algorithm on 9 standard person re-identification data-sets where we obtain state of the art performance in terms of accuracy as well as computational speed. The second scenario we consider is learning embeddings from sequences. When it comes to learning from sequences, recurrent neural networks have proved to be an effective algorithm.
    [Show full text]
  • An Empirical Study of Embedding Features in Learning to Rank
    An Empirical Study of Embedding Features in Learning to Rank ABSTRACT use of entities can recognize which part of the query is the most is paper explores the possibility of using neural embedding fea- informative; (2) the second aspect that we consider is the ‘type tures for enhancing the eectiveness of ad hoc document ranking of embeddings’ that can be used. We have included both word based on learning to rank models. We have extensively introduced embedding [8] and document embedding [4] models for building and investigated the eectiveness of features learnt based on word dierent features. and document embeddings to represent both queries and docu- Based on these two cross-cuing aspects, namely type of content ments. We employ several learning to rank methods for document and type of embedding, we have dened ve classes of features as ranking using embedding-based features, keyword-based features shown in Table 1. Briey stated, our features are query-dependent as well as the interpolation of the embedding-based features with features and hence, we employ the embedding models to form vec- keyword-based features. e results show that embedding features tor representations of words, chunks and entities in both documents have a synergistic impact on keyword based features and are able and queries that can then be employed for measuring the distance to provide statistically signicant improvement on harder queries. between queries and documents. It should be noted that we do not use entity embeddings [3] to represent entities, but rather use the ACM Reference format: same word embedding and document embedding models on the .
    [Show full text]
  • Learning to Rank Using Gradient Descent
    Learning to Rank using Gradient Descent Keywords: ranking, gradient descent, neural networks, probabilistic cost functions, internet search Chris Burges [email protected] Tal Shaked∗ [email protected] Erin Renshaw [email protected] Microsoft Research, One Microsoft Way, Redmond, WA 98052-6399 Ari Lazier [email protected] Matt Deeds [email protected] Nicole Hamilton [email protected] Greg Hullender [email protected] Microsoft, One Microsoft Way, Redmond, WA 98052-6399 Abstract that maps to the reals (having the model evaluate on We investigate using gradient descent meth- pairs would be prohibitively slow for many applica- ods for learning ranking functions; we pro- tions). However (Herbrich et al., 2000) cast the rank- pose a simple probabilistic cost function, and ing problem as an ordinal regression problem; rank we introduce RankNet, an implementation of boundaries play a critical role during training, as they these ideas using a neural network to model do for several other algorithms (Crammer & Singer, the underlying ranking function. We present 2002; Harrington, 2003). For our application, given test results on toy data and on data from a that item A appears higher than item B in the out- commercial internet search engine. put list, the user concludes that the system ranks A higher than, or equal to, B; no mapping to particular rank values, and no rank boundaries, are needed; to 1. Introduction cast this as an ordinal regression problem is to solve an unnecessarily hard problem, and our approach avoids Any system that presents results to a user, ordered this extra step. We also propose a natural probabilis- by a utility function that the user cares about, is per- tic cost function on pairs of examples.
    [Show full text]
  • Multi-Agent Reinforced Learning to Rank
    MarlRank: Multi-agent Reinforced Learning to Rank Shihao Zou∗ Zhonghua Li Mohammad Akbari [email protected] [email protected] [email protected] University of Alberta Huawei University College London Jun Wang Peng Zhang [email protected] [email protected] University College London Tianjin University ABSTRACT 1 INTRODUCTION When estimating the relevancy between a query and a document, Learning to rank, which learns a model for ranking documents ranking models largely neglect the mutual information among doc- (items) based on their relevance scores to a given query, is a key uments. A common wisdom is that if two documents are similar task in information retrieval (IR) [18]. Typically, a query-document in terms of the same query, they are more likely to have similar pair is represented as a feature vector and many classical models, in- relevance score. To mitigate this problem, in this paper, we propose cluding SVM [8], AdaBoost [18] and regression tree [2] are applied a multi-agent reinforced ranking model, named MarlRank. In partic- to learn to predict the relevancy. Recently, deep learning models has ular, by considering each document as an agent, we formulate the also been applied in learning to rank task. For example, CDSSM [13], ranking process as a multi-agent Markov Decision Process (MDP), DeepRank [12] and their variants aim at learning better semantic where the mutual interactions among documents are incorporated representation of the query-document pair for more accurate pre- in the ranking process. To compute the ranking list, each docu- diction of the relevancy.
    [Show full text]
  • Yahoo! Learning to Rank Challenge Overview
    JMLR: Workshop and Conference Proceedings 14 (2011) 1–24 Yahoo! Learning to Rank Challenge Yahoo! Learning to Rank Challenge Overview Olivier Chapelle⇤ [email protected] Yi Chang [email protected] Yahoo! Labs Sunnyvale, CA Abstract Learning to rank for information retrieval has gained a lot of interest in the recent years but there is a lack for large real-world datasets to benchmark algorithms. That led us to publicly release two datasets used internally at Yahoo! for learning the web search ranking function. To promote these datasets and foster the development of state-of-the-art learning to rank algorithms, we organized the Yahoo! Learning to Rank Challenge in spring 2010. This paper provides an overview and an analysis of this challenge, along with a detailed description of the released datasets. 1. Introduction Ranking is at the core of information retrieval: given a query, candidates documents have to be ranked according to their relevance to the query. Learning to rank is a relatively new field in which machine learning algorithms are used to learn this ranking function. It is of particular importance for web search engines to accurately tune their ranking functions as it directly a↵ects the search experience of millions of users. A typical setting in learning to rank is that feature vectors describing a query-document pair are constructed and relevance judgments of the documents to the query are available. A ranking function is learned based on this training data, and then applied to the test data. Several benchmark datasets, such as letor, have been released to evaluate the newly proposed learning to rank algorithms.
    [Show full text]
  • Sodeep: a Sorting Deep Net to Learn Ranking Loss Surrogates
    SoDeep: a Sorting Deep net to learn ranking loss surrogates Martin Engilberge1,2, Louis Chevallier2, Patrick Perez´ 3, Matthieu Cord1,3 1Sorbonne Universite,´ Paris, France, 2Technicolor, Cesson Sevign´ e,´ France, 3Valeo.ai, Paris, France {martin.engilberge, matthieu.cord}@lip6.fr [email protected] [email protected] Abstract Several tasks in machine learning are evaluated us- ing non-differentiable metrics such as mean average pre- cision or Spearman correlation. However, their non- differentiability prevents from using them as objective func- tions in a learning framework. Surrogate and relaxation methods exist but tend to be specific to a given metric. In the present work, we introduce a new method to learn approximations of such non-differentiable objective func- tions. Our approach is based on a deep architecture that approximates the sorting of arbitrary sets of scores. It is Figure 1: Overview of SoDeep, the proposed end-to- trained virtually for free using synthetic data. This sorting end trainable deep architecture to approximate non- deep (SoDeep) net can then be combined in a plug-and-play differentiable ranking metrics. A pre-trained differen- manner with existing deep architectures. We demonstrate tiable sorter (deep neural net [DNN] ΘB) is used to con- the interest of our approach in three different tasks that vert into ranks the raw scores given by the model (DNN require ranking: Cross-modal text-image retrieval, multi- ΘA) being trained to a collection of inputs. A loss is then label image classification and visual memorability ranking. applied to the predicted rank and the error can be back- Our approach yields very competitive results on these three propagated through the differentiable sorter and used to up- tasks, which validates the merit and the flexibility of SoDeep date the weights ΘA.
    [Show full text]
  • Spectrum-Enhanced Pairwise Learning to Rank
    Spectrum-enhanced Pairwise Learning to Rank Wenhui Yu Zheng Qin∗ Tsinghua University Tsinghua University Beijing, China Beijing, China [email protected] [email protected] ABSTRACT 1 INTRODUCTION To enhance the performance of the recommender system, side in- Recommender systems have been widely used in online services formation is extensively explored with various features (e.g., visual such as E-commerce and social media sites to predict users’ prefer- features and textual features). However, there are some demerits ence based on their interaction histories. Modern recommender sys- of side information: (1) the extra data is not always available in all tems uncover the underlying latent factors that encode the prefer- recommendation tasks; (2) it is only for items, there is seldom high- ence of users and properties of items. In recent years, to strengthen level feature describing users. To address these gaps, we introduce the presentation ability of the models, various features are incor- the spectral features extracted from two hypergraph structures of porated for additional information, such as visual features from the purchase records. Spectral features describe the similarity of product images [14, 44, 48], textual features from review data [8, 9], users/items in the graph space, which is critical for recommendation. and auditory features from music [5]. However, these features are We leverage spectral features to model the users’ preference and not generally applicable, for example, visual features can only be items’ properties by incorporating them into a Matrix Factorization used in product recommendation, while not in music recommenda- (MF) model. tion. Also, these features are unavailable in some recommendation In addition to modeling, we also use spectral features to optimize.
    [Show full text]
  • Embedding Meta-Textual Information for Improved Learning to Rank
    Embedding Meta-Textual Information for Improved Learning to Rank Toshitaka Kuwa∗, Shigehiko Schamoniy;z, Stefan Riezlery;z yDepartment of Computational Linguistics, Heidelberg, Germany. zInterdisciplinary Center for Scientific Computing (IWR), Heidelberg, Germany fkuwa, schamoni, [email protected] Abstract Neural approaches to learning term embeddings have led to improved computation of similarity and ranking in information retrieval (IR). So far neural representation learning has not been ex- tended to meta-textual information that is readily available for many IR tasks, for example, patent classes in prior-art retrieval, topical information in Wikipedia articles, or product categories in e-commerce data. We present a framework that learns embeddings for meta-textual categories, and optimizes a pairwise ranking objective for improved matching based on combined embed- dings of textual and meta-textual information. We show considerable gains in an experimental evaluation on cross-lingual retrieval in the Wikipedia domain for three language pairs, and in the Patent domain for one language pair. Our results emphasize that the mode of combining different types of information is crucial for model improvement. 1 Introduction The recent success of neural methods in IR rests on bridging the gap between query and document vocabulary by learning term embeddings that allow for improved computation of similarity and ranking (Mitra and Craswell, 2018). So far vector representations in neural IR have been confined to textual information, neglecting information beyond the raw text that is potentially useful for retrieval and is readily available in many data situations. For example, meta-textual information is available in the form of patent classes in prior-art search, topic classes in search over Wikipedia articles, or product classes in retrieval in the e-commerce domain.
    [Show full text]
  • Self-Supervised Learning from Permutations Via Differentiable Ranking
    Under review as a conference paper at ICLR 2021 SHUFFLE TO LEARN:SELF-SUPERVISED LEARNING FROM PERMUTATIONS VIA DIFFERENTIABLE RANKING Anonymous authors Paper under double-blind review ABSTRACT Self-supervised pre-training using so-called “pretext” tasks has recently shown impressive performance across a wide range of tasks. In this work, we advance self-supervised learning from permutations, that consists in shuffling parts of in- put and training a model to reorder them, improving downstream performance in classification. To do so, we overcome the main challenges of integrating permu- tation inversions (a discontinuous operation) into an end-to-end training scheme, heretofore sidestepped by casting the reordering task as classification, fundamen- tally reducing the space of permutations that can be exploited. We make two main contributions. First, we use recent advances in differentiable ranking to integrate the permutation inversion flawlessly into a neural network, enabling us to use the full set of permutations, at no additional computing cost. Our experiments validate that learning from all possible permutations improves the quality of the pre-trained representations over using a limited, fixed set. Second, we successfully demon- strate that inverting permutations is a meaningful pretext task in a diverse range of modalities, beyond images, which does not require modality-specific design. In particular, we improve music understanding by reordering spectrogram patches in the time-frequency space, as well as video classification by reordering frames along the time axis. We furthermore analyze the influence of the patches that we use (vertical, horizontal, 2-dimensional), as well as the benefit of our approach in different data regimes.
    [Show full text]