<!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>Joint Message Passing and Auto-Encoder for Deep Learning</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yiqun Ge</string-name>
          <email>yiqun.ge@huawei.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wuxian Shi</string-name>
          <email>wuxian.shi@huawei.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jian Wang</string-name>
          <email>wangjian23@huawei.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Rong Li</string-name>
          <email>lirongone.li@huawei.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wen Tong</string-name>
          <email>tongwen@huawei.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Wireless Technology Laboratory, Huawei Technologies Co., Ltd.</institution>
          ,
          <addr-line>Hangzhou 310051</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Wireless Technology Laboratory, Huawei Technologies Co., Ltd.</institution>
          ,
          <addr-line>Ottawa K0A3M0</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Autoencoders (AE) are emerging artificial neural networks that learn efficient embedding of unlabeled data and have been considered in the design of end-to-end transceivers. However, AE-based end-to-end transceivers face with a major challenge of poor generalization ability due to the communication channel dynamics. In this paper, a message-passing algorithm (MPA) layer is incorporated into an AE to simultaneously enable coarse learning in training phase and adaptive reasoning in inference phase. Theoretical analysis is also conducted to demonstrate the effectiveness of the MPA layer, recommending that the proposed model is applicable in more general systems.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Autoencoder</kwd>
        <kwd>end-to-end communication</kwd>
        <kwd>transceiver</kwd>
        <kwd>MPA</kwd>
        <kwd>back-propagation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Furthermore, the channel variation will penetrate forward to the entire receiver neural
network part. In case of a fast varying channel, a well-trained receiver might as well become
obsolete quickly and receiving performance degrades soon.
● Loss of Important Connectivity: According to [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], some outputs of a DNN-based classifier
relies on some shortcuts (localities) inside the entire deep neural network. Some parts of the
neural network is more important than others. “Shortcuts” are designated to the important
part. If these shortcuts were perturbed, the classification performance would degrade
significantly. However, the path loss and thermal random noise in communication channels
may affect the critical shortcuts in some probability, largely undermining the AE-based E2E
transceiver’s performance.
      </p>
      <p>
        These three issues result in the poor generalization ability of the AE-based transceiver over the
dynamic and time varying wireless environment. Some prior works have developed some solutions. In
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], a two-phase training strategy is proposed, where the AE-based transceiver is first trained through a
stochastic channel model offline, and fine-tuned when it is used in the real channel. To obtain a
differentiable channel, [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ] proposed to approximate the unknown real channel through generative
adversarial networks (GANs). With a trained GAN model connecting the encoder and decoder, both
forward inference and backward propagation can be conducted. Since the obstacle caused by the
unknown channel is that the back-propagated gradients are not easy to get at the encoder side, methods
for gradient estimation are introduced in [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ].
      </p>
      <p>Although the aforementioned works can overcome the three issues to some extent, all of them
demand high energy consumption, large controlling overhead, and none of them can meet the real-time
latency requirement in future wireless communications. These issues motivated us to incorporate a
MPA layer into an AE. Its existence can simultaneously solve the out-of-distribution (OOD) and outlier
problems usually in the inference stage and reduce the communication and computation costs.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Autoencoder-based Transceiver Design with MPA</title>
      <p>In this section, we first propose a new AE-based transceiver by inserting an MPA layer with the
transmitter, i.e., MPA-AE. Then, we introduce the detailed training process, including the forward
subiteration and backward sub-iteration.</p>
      <p>2.1.</p>
    </sec>
    <sec id="sec-3">
      <title>Autoencoder-based transceiver with MPA</title>
      <p>As illustrated in Fig. 1, we consider an AE-based transceiver that consists of a DNN-based
transmitter and a DNN-based receiver. The transmitter and the receiver are connected by wireless
channels. To adapt to the dynamic channel conditions, we insert an MPA layer between the transmitter
and the communication channel. Without loss of generality, we assume that the channel state
information is available at the transmitter, which can be realized by concurrent channel feedback or
uplink/downlink channel reciprocity.</p>
      <p>The MPA layer is responsible for conducting a linear dimension reduction transformation, whose
coefficients are fine-tuned using an iterative algorithm with two sub-iterations. The first one is the
forward sub-iteration that passes messages from the DNN transmitter to the DNN receiver through the
channel. The other is the backward sub-iteration that passes message from channel layer to the output
layer of the DNN transmitter. To better describe the working mechanism of the introduced transceiver,
we first provide the key parameters throughout the paper, as summarized in Table I.
 
 
 


F
H
N
R
T</p>
      <sec id="sec-3-1">
        <title>Meaning</title>
        <sec id="sec-3-1-1">
          <title>Dimension of the transmitter’s output</title>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>Dimension of the communication channel measurement</title>
      </sec>
      <sec id="sec-3-3">
        <title>The k-th channel measurement</title>
      </sec>
      <sec id="sec-3-4">
        <title>The n-th additive noise measurement</title>
        <sec id="sec-3-4-1">
          <title>The i-th feature of the transmitter’s output</title>
        </sec>
        <sec id="sec-3-4-2">
          <title>The k-th feature vector of the MPA layer’s output</title>
        </sec>
      </sec>
      <sec id="sec-3-5">
        <title>The k-th received signal</title>
        <p>Input feature matrix [ 1, … ,   ]
Channel vector [ 1, … ,   ]
Noise vector [ 1, … ,   ]
Received signal vector[ 1, … ,   ]</p>
        <p>Output feature matrix [ 1, … ,   ]
Based on the notations, we elaborate the detailed training process in the sequel.
2.2.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Forward Sub-iteration with Support Vector Machine</title>
      <p>Support vector machine (SVM) is a supervised machine learning model used for data classification,
regression, and outlier detection. In general, an SVM model is composed of a non-linear dimension
extension function  (∙), a linear combination function  ( ) =  ∙  ( ) +  , and a binary classification
function sign(∙), where  is the input data,  is the weight coefficient vector and  is the bias vector.
The objective of SVM is to divide the data samples into classes to find a maximum marginal
hyperplane.
shows the detailed forward iteration with SVM. Specifically, the input of the MPA-layer is an
Lvia communication channels, the received signal is given by
dimension. The output of the MPA-layer is an N-dimensional feature matrix 
dimensional feature matrix  = [ 1,  2, … ,   ], where   is the i-th input feature
vector with
K= [  ,   , … ,   ] where
  is the i-th output feature vector with K-dimension. When the output feature vectors are transmitted

 =1
  = ∑   , ∙   ∙   +   ,  = 1, … ,  ,
where   , is the coefficient of the connection between neuron l and neuron i.</p>
      <p>Based on the above description, we can conclude that the forward sub-iteration is to keep fine-tuning
the hyper-plane of the SVM model in both training and inference phases for given transmitter’s feature
matrix  , channel state information  , noise vector  , and received signal  .</p>
      <p>Note that the MPA layer is mathematically differentiable. Once the coefficients   , are fixed, it can
pass the BP gradients from the receiver side to the transmitter side during the training stage.
2.3.</p>
    </sec>
    <sec id="sec-5">
      <title>Backward Sub-iteration with Attention-DNN</title>
      <p>As we discussed earlier, the MPA layer needs to be trained by a standalone mode rather than a
connection mode with back-propagation from the receiver. In this regards, we consider to use an
attention-DNN in the backward sub-iteration.
dimensions. Fig. 3 depicts the structure of the attention-DNN. The input is the received signal  . The
attention operation is conducted by computing the inner product of each   with an attention coefficient
  , i.e., ⟨  ,   ⟩. This inner product implies the similarity of the signal   and the attention coefficient
  , which is normalized by a softmax layer as
We shall note that the number of attentions are less than the number of received signals, i.e.,  &lt;  .</p>
      <p>Attention-DNN can be employed in the MPA layer for back-propagation. Specifically, each
extracted feature vector   can be used as an attention coefficient. Then, in the backward sub-iteration,
the coefficient   , can be given by</p>
    </sec>
    <sec id="sec-6">
      <title>3. Global Tandem Learning</title>
      <p>the inference phase.
3.1.</p>
    </sec>
    <sec id="sec-7">
      <title>Coarse Learning</title>
      <p>In this section, we propose two algorithms for the AE-based transceiver in the training phase and
The training of the AE-based transceiver includes two parts. One is for the MPA layer in a standalone
mode and the other is for the DNNs in the transmitters and receivers by BP. The detailed procedure is
summarized in Algorithm 1.
2. Initialize the batchsize  .
3. For step from 1: T do</p>
      <p>In tandem stage 1
Algorithm 1. The training algorithm
1. Initialize the coefficients of the MPA layer   , = .</p>
      <p>1
Compute
Sample a batch of training messages  = [ 1, … ,   ].</p>
      <p>DNN-based transmitter computes  = [ 1, … ,   ] based on the training messages  .

 =1
  = ∑   , ∙   ,  = 1, …  ,
computes the decoded message.</p>
      <p>Update the transmitter and the receiver by back-propagation.</p>
      <p>=   ∙   +   ,  = 1, … ,  .</p>
      <p>Send  = [ 1,  2, … ,   ]to the DNN-based receiver via communication channels, as
DNN-based receiver inputs the received signals  = [ 1,  2, … ,   ] into the DNN and
|| || = √ 12 +  22 + ⋯ +  2 .</p>
      <p>In tandem stage 2</p>
      <p>For iteration from 1: M do</p>
      <p>Compute   = ∑     , ∙   .</p>
      <p>Compute
Update
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20. Output   , ,  = 1, … ,  ;  = 1, … ,  .</p>
      <p>3.2.</p>
    </sec>
    <sec id="sec-8">
      <title>Inference Cycle Adaptation</title>
      <p>Once the training is finished, the AE-based transceiver is used for inference. In particular, the
MPAlayer can help the transceiver adapt to the channel dynamics: when the neurons on the encoder neural
network and decoder neural network are fixed, the coefficient   , on the MAC layer could continue to
adapt themselves in terms of the current physical channel condition. The detailed procedure is
summarized in Algorithm 2.</p>
      <p>Algorithm 2. The inference algorithm</p>
      <p>Input：New messages  .
DNN-based transmitter computes  = [ 1, … ,   ] based on the new message  .</p>
      <p>=</p>
      <p>∑</p>
      <p>=1     , ∙   , ,  = 1, …  .
  , = softmax(  , ),  = 1, … ,  ,  =
|| || = √ 12 +  22 + ⋯ +  2 .</p>
      <p>=1
  = ∑   , ∙   ,  = 1, …  ,
Compute
Compute</p>
      <p>Update
1, … ,  .</p>
      <p>Endfor
Compute</p>
    </sec>
    <sec id="sec-9">
      <title>4. Simulations</title>
      <p>=   ∙   +   ,  = 1, … ,  .
10. DNN-based receiver inputs the received signals = [ 1, … ,   ] into the DNN and computes the</p>
      <p>We consider the following simulation settings. The transmitter sends a block with 256 bits in each
time slot through 16QAM modulation scheme without channel coding. The channel gain changes every
200 time slots by a random distortion, which follows ℎ +1 = ℎ + ∆ℎ , where the random distortion
follows ∆ℎ ~</p>
      <p>(0, 0.3).</p>
      <p>The proposed MPA-AE is first pre-trained at the channel condition ℎ0 with a fixed SNR 10dB to
learn all the neurons on the encoding and decoding neural network and the coefficients on the MAP
layer. Each time that the channel varies, only the coefficients   , at the MPA layer are fine-tuned, while
the rest neurons are fixed.</p>
      <p>For comparison, we simulate a pre-trained AE without the MPA layer as a baseline, whose neurons
are fixed even when the channel has changed, and a retrained AE without MPA layer as another baseline,
that is completely retrained whenever the channel varies.</p>
      <p>The three frameworks use the same AE structure in which a fully connected neural network with
one hidden layer of 16 neurons is used for both the encoder and the decoder and ReLU is used as the
activated function for the hidden layer and Adam optimizer is used to train the AE. The only difference
of MPA-AE to the rest AE is the inserted MPA layer.</p>
    </sec>
    <sec id="sec-10">
      <title>5. Conclusions and Future Directions</title>
      <p>In this paper, we proposed a MPA-AE structure and its corresponding algorithms to train the
endto-end transceiver in the scenarios with time-varying channels. The MPA layer inserted between the
encoder and decoder of traditional AE can be fine-tuned when the under-going channel changes from
the one the transceiver is trained with. Simulations show the superior performance of the proposed
method.</p>
      <p>The MPA layer could be flexibly incorporated with the AE-based transceiver in many use cases,
including single user scenarios and multiuser scenarios. Specifically, in the single user scenarios, the
MPA layer can be used to design source coding scheme, high-order modulation scheme, massive
MIMO scheme, and pre-distortion scheme, which can well adapt to the time-varying channel
conditions. In principle, the DNN layers and MPA layer of a transmitter is to distort the input
distribution to match the current channel distortion distribution. The non-linear DNN layers provide a
quick and powerful non-linear distortion, while the linear MPA layer provides a quick and adaptive
linear matching.</p>
      <p>Moreover, the MPA layer can also be applied in multiuser scenarios for both uplink and downlink
MIMO design and Multiple-Access design. More than one MPA-AE could share the same channel.
Then, the MPA layer of each becomes autonomous coding design. These research aspects will be
considered in future.</p>
      <p>Another research direction is to use more complex channel models in the training phase. In
particular, the channel models are generated by a DNN with the input of surrounding topological
information. In this case, the MPA layer is still effective since the inference DNN of the channel is a
non-linear function. However, the DNN-based channel model is often very large. Therefore, how to
reduce the DNN model size is an interesting research topic for future investigation.</p>
    </sec>
    <sec id="sec-11">
      <title>6. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>G. Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Juang</surname>
            ,
            <given-names>B. H. F.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Sivanesan</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          (
          <year>2018</year>
          , December).
          <article-title>Channel agnostic endto-end learning based communication systems with conditional GAN</article-title>
          .
          <article-title>In 2018 IEEE Globecom Workshops (GC Wkshps)</article-title>
          (pp.
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Aoudia</surname>
            ,
            <given-names>F. A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Hoydis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2018</year>
          ,
          <article-title>October)</article-title>
          .
          <article-title>End-to-end learning of communications systems without a channel model</article-title>
          .
          <source>In 2018 52nd Asilomar Conference on Signals, Systems, and Computers</source>
          (pp.
          <fpage>298</fpage>
          -
          <lpage>303</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Goutay</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aoudia</surname>
            ,
            <given-names>F. A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Hoydis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2019</year>
          , June).
          <article-title>Deep reinforcement learning autoencoder with noisy feedback</article-title>
          .
          <source>In 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)</source>
          (pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2021</year>
          ,
          <article-title>September). A Kalman-based Autoencoder Framework for End-to-End Communication Systems</article-title>
          .
          <source>In 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)</source>
          (pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Cammerer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aoudia</surname>
            ,
            <given-names>F. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dörner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stark</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoydis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Ten Brink</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Trainable communication systems: Concepts and prototype</article-title>
          .
          <source>IEEE Transactions on Communications</source>
          ,
          <volume>68</volume>
          (
          <issue>9</issue>
          ),
          <fpage>5489</fpage>
          -
          <lpage>5503</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Goodfellow</surname>
            ,
            <given-names>I. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shlens</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Szegedy</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          (
          <year>2014</year>
          ).
          <article-title>Explaining and harnessing adversarial examples</article-title>
          .
          <source>arXiv preprint arXiv:1412</source>
          .
          <fpage>6572</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Dörner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cammerer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hoydis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Ten Brink</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Deep learning based communication over the air</article-title>
          .
          <source>IEEE Journal of Selected Topics in Signal Processing</source>
          ,
          <volume>12</volume>
          (
          <issue>1</issue>
          ),
          <fpage>132</fpage>
          -
          <lpage>143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>O</given-names>
            <surname>'Shea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. J.</given-names>
            ,
            <surname>Roy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            , &amp;
            <surname>West</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          (
          <year>2019</year>
          ,
          <article-title>February). Approximating the void: Learning stochastic channel models from observation with variational generative adversarial networks</article-title>
          .
          <source>In 2019 International Conference on Computing, Networking and Communications (ICNC)</source>
          (pp.
          <fpage>681</fpage>
          -
          <lpage>686</lpage>
          ). IEEE.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>G. Y.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Juang</surname>
            ,
            <given-names>B. H.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Deep learning-based end-to-end wireless communication systems with conditional GANs as unknown channels</article-title>
          .
          <source>IEEE Transactions on Wireless Communications</source>
          ,
          <volume>19</volume>
          (
          <issue>5</issue>
          ),
          <fpage>3133</fpage>
          -
          <lpage>3143</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Raj</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Kalyani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2018</year>
          ).
          <article-title>Backpropagating through the air: Deep learning at physical layer without channel models</article-title>
          .
          <source>IEEE Communications Letters</source>
          ,
          <volume>22</volume>
          (
          <issue>11</issue>
          ),
          <fpage>2278</fpage>
          -
          <lpage>2281</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Aoudia</surname>
            ,
            <given-names>F. A.</given-names>
          </string-name>
          , &amp;
          <string-name>
            <surname>Hoydis</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Model-free training of end-to-end communication systems</article-title>
          .
          <source>IEEE Journal on Selected Areas in Communications</source>
          ,
          <volume>37</volume>
          (
          <issue>11</issue>
          ),
          <fpage>2503</fpage>
          -
          <lpage>2516</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>