<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>RecFormer: personalized temporal-aware transformer for fair music recom mendation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Wei-Yao Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wei-Wei Du</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wen-Chih Peng</string-name>
          <email>wcpeng@cs.nycu.edu.tw</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="editor">
          <string-name>Recommendation System, User Fairness, Transformer, Temporal-Aware</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, National Yang Ming Chiao Tung University</institution>
          ,
          <addr-line>Hsinchu</addr-line>
          ,
          <country country="TW">Taiwan</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>systems hosted by EvalRS @ CIKM 2022 is introduced</institution>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Recommendation systems have improved the characterization of user preferences by modeling their digital footprints and item content. However, another facet, model behavior, has attracted a great deal of attention in both academic and industry ifelds in recent years due to the increasing awareness of fairness. The shared task, a Rounded Evaluation of Recommender Systems (EvalRS @ CIKM 2022), is introduced to broadly measure multifaceted model predictions for music recommendation. To tackle the problem, we propose the RecFormer architecture with a personalized temporal-aware transformer to model the interactions among user history in a single framework. Specifically, RecFormer adopts a masked language modeling task as the training objective, which enables the model to capture fine-grained track embeddings by reconstructing tracks. Meanwhile, it also integrates a temporal-aware self-attention mechanism into the Transformer architecture so that the model is able to consider time-variant information among diferent users. Moreover, we introduce linearized attention to reduce quadratic computation and memory cost since the limited time is one of the challenges in this task. Extensive experiments and analysis are conducted to demonstrate the efectiveness of our RecFormer compared with the oficial baseline, and we examine the model contribution from the ablation study. Our team, yao0510, won the seventh prize with a total score of 0.1964 in the EvalRS challenge, which illustrates that our model achieved competitive performance. The source code will be publicly available at https://github.com/wywyWang/RecFormer.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In recent years, characterizing users with accurate
interests has evolved due to the use of advanced
recommendation systems (RSs). These RSs have been used to
develop several real-world applications in industry, for
example, Amazon ROSE [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. While there has been
significant progress in predicting accurate items for users
of RSs, the awareness of model behavior has attracted a
great deal of attention from both academic and industry
researchers. As recommendation systems are built on
top of users, data, and models, it is likely that the system
will make unfair suggestions due to the biases of these
candidates [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], which illustrates the increasing need to
investigate model behavior.
      </p>
      <sec id="sec-1-1">
        <title>To that end, a rounded evaluation of recommender</title>
        <p>to tackle both standard evaluation metrics and model
trates an example of a music recommendation system.</p>
      </sec>
      <sec id="sec-1-2">
        <title>Given multiple past tracks from a set of target users, our</title>
        <p>LGOBE
Information and Knowledge Management</p>
        <p>
          ages/loop.jpg
22.5 minutes per fold, which is challenging when adopt- in RecFormer.
ing deep learning techniques to have a fine-grained track
representation if the space and computation complexity
is high. 3) Time-variant event. The target users have 2. Related Work
their corresponding habits of listening music songs
during the day; for example, students are likely to listen to Recommendation System. The recent progress of
recmusic after school, while ofice workers are likely to lis- ommendation systems (RSs) has brought great incomes
ten during working hours. For example, Koren [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] is the for industry since the preferred items of the target
auifrst approach that verifies the efectiveness of modeling dience can be marked precisely based on collecting and
temporal efect in the Netflix competition. Therefore, con- analyzing their corresponding digital footprints. Early
verting user history into a sequence for recurrent-based work on RSs typically employed collaborative filtering
approaches directly ignores the time-variant influence of (CF) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] and matrix factorization (MF) [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Recently, there
listening to music tracks. Moreover, there is no existing have been several sequential-based recommendation
sysevaluation metric that is able to measure the model be- tems to model user behaviors in the temporal aspect,
havior in terms of the time domain. It is essential to take which was ignored in the early RSs. For instance, Hidasi
temporal information into account and design a proper et al. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] introduced GRU4Rec with sequential models
metric for the corresponding evaluation. and ranking loss, which used the idea of taking previous
        </p>
        <p>
          To address the aforementioned challenges, we propose users’ records into account to predict future preferences.
RecFormer, a novel personalized temporal-aware Trans- However, one of the limitations in this task is the
valiformer for fair music recommendation, which consists of dation strategy, which does not guarantee that the test
personalized user embeddings, a temporal-aware multi- set is from the latest timestamp. This hinders the above
head linearized-attention in a modified Transformer [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ], approaches to tackle this task efectively. Inspired by
and a track classifier to predict the possible tracks. Specif- the robust pretrained tasks of BERT [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], we aim to adopt
ically, the personalized user embeddings take rich user- masked language modeling tasks to randomly mask the
related metadata into account to represent each user. To user sequence and reconstruct them, which is able to
tackle the first challenge, we employ the masked lan- learn a fine-grained track representation as well as the
guage modeling task as our training objective, which robustness of the time-invariant test set. This
motivarandomly masks a proportion of all tracks in the input tion has been used by [9], who proposed BERT4Rec, a
sequence. For the second and third challenges, we in- bidirectional Transformer with masked language
modeltroduced a temporal-aware linearized-attention, incor- ing tasks, and demonstrated the efectiveness in several
porating attention bias with temporal information and sequential recommendation tasks.
replacing standard softmax computation with kernel com- Dataset Introduction. The selected dataset in this task
putation. This not only models time-variant information is LFM-1b [10], which is a dataset focused on music
recinto an attention score but also reduces both the memory ommendation on Last.fm. The dataset is composed of
and computation complexity while preserving competi- 120k users, 63k artists, 1.3M albums, 821k tracks, and
tive performance. In addition, we propose a new metric, 38M listening events, which is filtered with some
preMRED_DOH, to evaluate the diference performance in processing procedure introduced in [11]. Furthermore, it
terms of various listening times in a day, which reflects provides rich song (i.e., artist and album) and user (i.e.,
another critical but unexplored dimension of fairness. country, age, gender, listening preference) metadata for
        </p>
        <p>In summary, our contributions are as follows: 1) We evaluating multi-dimensional behaviors of models. In
propose RecFormer, a novel personalized temporal-aware general, this dataset is able to help researchers achieve
Transformer for fair music recommendation by adopting not only quantitative performance but also non-standard
masked language modeling tasks as training objectives metrics for fairness.
to learn fine-grained track representations. 2) To reduce
the computation complexity and model time-variant in- 3. Methodology
formation, a temporal-aware linearized-attention is
designed by replacing softmax with kernel computation and Figure 2 illustrates an overview of our proposed
Recintegrating temporal embeddings into attention scores. Former, some of which is inspired by the recent research
Furthermore, we propose a new metric (MRED_DOH) on natural language understanding. Given a user
histo reflect the diferent performance of predicting tracks tory (sequence), we first apply random masks to the
in each hour, which is also an essential but challenging sequence, and then personalized user embeddings are
dimension of fairness. 3) Our RecFormer outperforms generated based on the user metadata and
correspondthe oficial baseline at least 116% in terms of the total ing tracks. Afterwards, the RecFormer, which modifies
score. Moreover, extensive experiments were further the self-attention mechanism to the proposed
temporalconducted to examine the contribution of each module aware linearized-attention in each layer, is introduced</p>
        <sec id="sec-1-2-1">
          <title>3.1. Personalized User Embeddings</title>
          <p>
            As each user has multiple tracks they have listened to
and the corresponding user metadata, we incorporate
each type of user metadata with each track to model each
persona, which is inspired by [
            <xref ref-type="bibr" rid="ref14">12</xref>
            ]. Specifically, the input
embedding   , and metadata embeddings (, , 
embedding for the RecFormer at the  -th timestamp is
constructed by adding the track embedding   , positional
), which
are all projected with corresponding embedding layers
to  dimensional vectors:
 = ( 1, ⋯ ,   ) = ( 1 +  1 +  +  + , ⋯ , 
 +   +  +  + ),
where  denotes gender,  denotes country,  denotes
age and  is the max sequence length. The user age is
discretized to 15 bins since it is a continuous variable.
(1)
          </p>
        </sec>
        <sec id="sec-1-2-2">
          <title>3.2. RecFormer</title>
        </sec>
      </sec>
      <sec id="sec-1-3">
        <title>RecFormer aims to capture the temporal order of a user</title>
        <p>history, which is hard to consider with traditional CF and</p>
      </sec>
      <sec id="sec-1-4">
        <title>MF approaches. To that end, we introduce RecFormer</title>
        <p>
          based on the Transformer encoder [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] to not only encode
all tracks in a sequence but also to speed up the training
procedure with parallel computation of the attention
mechanism compared with the recurrent-based models.
        </p>
      </sec>
      <sec id="sec-1-5">
        <title>Formally, the personalized user embedding  follows</title>
        <p>the standard Transformer encoding steps to encode the</p>
      </sec>
      <sec id="sec-1-6">
        <title>The output dimension of  is  , and the inner dimension</title>
        <p>of FFN is</p>
        <p>.</p>
        <p>
          Temporal-Aware Linearized-Attention (TALA): To
reduce the quadratic memory and computation
complexity from the conventional self-attention mechanism, we
replace the softmax with the kernel computation, which
only requires linear computation [
          <xref ref-type="bibr" rid="ref15">13</xref>
          ]:
 = 
 ,  = 
 ,  =
        </p>
        <p>
          Since users listen to music tracks following their
personal habits (e.g., at work or on a bus), it is essential to
take time-invariant information into account for
recommending user preferred tracks, e.g., [
          <xref ref-type="bibr" rid="ref16 ref3">14, 3</xref>
          ]. Therefore,
in addition to the linearized-attention, we also
incorporate the listening time of each track as the attention bias,
which is motivated from [
          <xref ref-type="bibr" rid="ref17">15</xref>
          ]. Formally, Equ. 4 is
extended as:
 () = (()( + 
 ) ) ,
where   is the  dimensional hour embedding (from 0
to 23, total 24 categories). It is noted that we empirically
add hour embeddings to key matrices from experiments.
        </p>
        <sec id="sec-1-6-1">
          <title>3.3. Track Classifier</title>
          <p>After  layers of RecFormer to encode multi-hop
information, we get the final output   for all items of the
user sequence. The track classifier is employed to predict
(3)
(4)
(5)
sequence with the proposed temporal-aware linearized- the masked tracks as shown in Figure 2. Specifically, we
attention (TALA), residual connection and layer normal- apply a feed-forward layer to generate the  -th output:
ization (Norm), dropout, and feed forward network (FFN)
  =  (

   );  ̂ =  (
 ),
(6)
as follows:
 =̃   ( +  ()),  =   (
 +̃    (
 ) )̃.</p>
          <p>where   ∈ ℝ× ,  is the total number of tracks, and 
(2) is the activation function.
Training and Testing. As one of the challenges in this
task is the validation strategy, it is expected that the test
set may not be sampled at the latest timestamp. To tackle
this issue, we applied masked language modeling tasks
(MLM) as the training objective to learn a robust track
representation. The goal of MLM is to reconstruct the
masked tracks by giving a user sequence, which enables
the model to learn the relation between tracks.</p>
          <p>Following [9], we use the final output  with the track
classifier to predict the masked tracks, and the loss
function is defined as follows:</p>
          <p>| |
 = − ∑   ( ̂  ),</p>
          <p>=1
where  is the set of user sequences.</p>
          <p>In the inference phase, we empirically set the mask
in the last timestamp of a sequence to predict the most
possible 100 tracks that the user are likely to listen to. In
addition, as we cannot fetch the timestamp in the test
set, we set the predicted hour as the hour that the user
often listens to music tracks to fit into TALA.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>4. Experiments and Analysis</title>
      <sec id="sec-2-1">
        <title>4.1. Experimental Setup</title>
        <p>a per-group or slice basis (gender balance, artist
popularity, user country, song popularity, and user history), and
behavioral tests (be less wrong, and latent diversity) [11].</p>
        <p>The data are pre-processed by filling NaN values of user
gender and country with n and UNKNOWN, respectively.</p>
        <p>
          Proposed MRED_DOH Metric: Since one of the
challenges we aim to address is the time-variant event, we
propose a new metric, MRED_DOH, to evaluate the
difference performance in terms of various listening times
in a day, which reflects another critical but unexplored
dimension of fairness. That is, this MRED_DOH enables
us to investigate if a model bias to predictions that are
(7) from users listening to in specific time slots. In other
words, we operationalize this metric as the smaller the
diference similar to MRED_Gender proposed in Reclist
[
          <xref ref-type="bibr" rid="ref18">16</xref>
          ]: the fairer the model towards potential temporal
biases.
        </p>
        <p>Specifically, we represent the hour when the user most
often listens to select the test set as sub-groups of listeners
(i.e., there are total 24 sub-groups), which is represented
as the user hour. Afterwards, we can evaluate the MRED
score using the existing RecList with the user hour to
measure the model performance at each hour in a day.</p>
        <p>We note that this is a aspect-driven metric, which can be
adjusted by monitoring diferent temporal dimensions
based on user needs. For example, the hour when the user
most often listens can be easily changed to the least active
hours or the average active hours. Moreover, it can also
be employed in the sequential recommendation systems
by changing the user hours to sequential positions.</p>
        <p>The dimension  was set to 64, the inner dimension of
the feed-forward layer was 256, and the number of heads
was set to 1. The dropout rate was 0.0, and the max
sequence length ( ) was 60 due to the time limit, which
kept about 25% tracks on average. The batch size was
100, the learning rate was set to 1e-3, the training epochs 4.2. Overall Performance Comparison
were set to 50, and the seeds were tested from 42 to 52. It
is noted that the number of predicted tracks is based on Ablation Study. To verify the contribution of each
modthe train set. That is, we hypothesize that our RecFormer ule in RecFormer, we conduct ablative experiments by
only recommends tracks that have been listened to before. removing personalized user embeddings, temporal-aware
All the training and evaluation phases were conducted on computation, and both. From Table 1, we can observe
a machine with AMD Ryzen Threadripper 3960X 24-Core that removing any one module in RecFormer results in
Processor, Nvidia GeForce RTX 3090, and 252GB RAM. a performance drop in terms of metrics adopted in this</p>
        <p>The evaluation metrics include diferent perspectives: task, which testifies to the efective design of RecFormer.
standard RSs metrics (HR, and MRR), standard metrics on However, our RecFormer performs the worst in terms
of our proposed MRED_DOH, which indicates that our
method still fails to meet the fairness in the temporal
aspect. In addition, this result also indicates that
considering temporal-awareness is not able to address the
temporal fairness, which will be investigated in our
future research.</p>
        <p>
          We note that several continuous variables (e.g.,
novelty_artist related features) are also included in the
personalized user embeddings with projecting as in [
          <xref ref-type="bibr" rid="ref19">17</xref>
          ], but
the training loss cannot converge.
        </p>
        <p>Oficial Score. Table 2 shows the performance in the
formal phase. We also implemented BERT4Rec to
compare the performance, which can be viewed as one of our
variants. It can be observed that the MRED_DOH
performance of BERT4Rec is the best, but the performance
of standard RSs metrics fails to meet the requirement
(hit-rate &gt; 0.015). One of the reasons is that BERT4Rec
is not converged using the same hyper-parameters due
to the computational complexity, which is attributed by
linear attention in our RecFormer. Therefore, these
fairness results cannot be directly compared with the
oficial baseline and our RecFormer since BERT4Rec cannot
recommend possible tracks. Our framework achieved
0.1964 of the total score, which outperformed the oficial
baseline by 116%, while it still has some gaps compared
to the first prize. Despite the result, our approach still
demonstrates that using MLM as the training objective
can achieve competitive performance.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lakshman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Shrivastava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Cao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Nag</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Goutam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Yin,</surname>
          </string-name>
          <article-title>ROSE: robust caches for amazon product search, in: WWW (Companion Volume)</article-title>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>93</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mehta</surname>
          </string-name>
          ,
          <article-title>Why is the fairness in recommender systems required</article-title>
          ?,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Koren</surname>
          </string-name>
          ,
          <article-title>Collaborative filtering with temporal dynamics</article-title>
          ,
          <source>in: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>447</fpage>
          -
          <lpage>456</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Shazeer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Parmar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jones</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. N.</given-names>
            <surname>Gomez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kaiser</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Polosukhin</surname>
          </string-name>
          ,
          <article-title>Attention is all you need</article-title>
          ,
          <source>in: NIPS</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>5998</fpage>
          -
          <lpage>6008</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>B. M.</given-names>
            <surname>Sarwar</surname>
          </string-name>
          , G. Karypis,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riedl</surname>
          </string-name>
          ,
          <article-title>Item-based collaborative filtering recommendation algorithms</article-title>
          , in: WWW, ACM,
          <year>2001</year>
          , pp.
          <fpage>285</fpage>
          -
          <lpage>295</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <article-title>Fast adaptively weighted matrix factorization for recommendation with implicit feedback</article-title>
          , in: AAAI, AAAI Press,
          <year>2020</year>
          , pp.
          <fpage>3470</fpage>
          -
          <lpage>3477</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Hidasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Karatzoglou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Baltrunas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Tikk</surname>
          </string-name>
          ,
          <article-title>Session-based recommendations with recurrent neural networks</article-title>
          ,
          <source>in: ICLR (Poster)</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          ,
          <article-title>BERT: pre-training of deep bidirectional transformers for 5. Conclusion language understanding, in: NAACL-HLT (1), Association for Computational Linguistics</article-title>
          ,
          <year>2019</year>
          , pp.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          In this paper,
          <source>we propose RecFormer incorporating 4171-4186.</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <article-title>personalized user embeddings and temporal-aware [9</article-title>
          ]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sun</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          , P. Jiang, linearized
          <article-title>-attention to recommend accurate and fair Bert4rec: Sequential recommendation with bidirectracks to users based on their personal listening habits for tional encoder representations from transformer, the EvalRS task. Furthermore, the linearized-attention in: CIKM</article-title>
          , ACM,
          <year>2019</year>
          , pp.
          <fpage>1441</fpage>
          -
          <lpage>1450</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <article-title>reduces both computation and memory complexity by [10] M. Schedl, The lfm-1b dataset for music retrieval making use of kernel computation. The ablation study and recommendation</article-title>
          , in: ICMR, ACM,
          <year>2016</year>
          , pp.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <article-title>with the proposed metric demonstrates the efectiveness 103-110</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <article-title>and fairness of our proposed approach</article-title>
          . From the leader- [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Tagliabue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bianchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Schnabel</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Attanasio, board score, our method illustrates that using MLM for C. Greco</article-title>
          , G. de Souza P. Moreira,
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Chia</surname>
          </string-name>
          ,
          <article-title>Evalrs: a learning track representations can achieve competitive rounded evaluation of recommender systems, CoRR performance</article-title>
          .
          <source>abs/2207</source>
          .05772 (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Zheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Mao</surname>
          </string-name>
          ,
          <article-title>A pretraining based personalized dialogue generation model with persona-sparse data</article-title>
          , in: AAAI, AAAI Press,
          <year>2020</year>
          , pp.
          <fpage>9693</fpage>
          -
          <lpage>9700</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Katharopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vyas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Pappas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Fleuret</surname>
          </string-name>
          ,
          <article-title>Transformers are rnns: Fast autoregressive transformers with linear attention</article-title>
          , in: ICML, volume
          <volume>119</volume>
          <source>of Proceedings of Machine Learning Research, PMLR</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>5156</fpage>
          -
          <lpage>5165</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <surname>Y. Zhang,</surname>
          </string-name>
          <article-title>Time-aware recommender system via continuous-time modeling</article-title>
          ,
          <source>in: CIKM</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>2872</fpage>
          -
          <lpage>2876</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>P.</given-names>
            <surname>Shaw</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Uszkoreit</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vaswani</surname>
          </string-name>
          ,
          <article-title>Self-attention with relative position representations</article-title>
          ,
          <source>in: NAACLHLT (2)</source>
          ,
          <source>Association for Computational Linguistics</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>464</fpage>
          -
          <lpage>468</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P. J.</given-names>
            <surname>Chia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tagliabue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Bianchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ko</surname>
          </string-name>
          ,
          <string-name>
            <surname>Beyond</surname>
            <given-names>NDCG</given-names>
          </string-name>
          :
          <article-title>behavioral testing of recommender systems with reclist, in: WWW (Companion Volume)</article-title>
          , ACM,
          <year>2022</year>
          , pp.
          <fpage>99</fpage>
          -
          <lpage>104</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Shuai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Peng</surname>
          </string-name>
          , Shuttlenet:
          <article-title>Position-aware fusion of rally progress and player styles for stroke forecasting in badminton</article-title>
          , in: AAAI, AAAI Press,
          <year>2022</year>
          , pp.
          <fpage>4219</fpage>
          -
          <lpage>4227</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>