summaryrefslogtreecommitdiff
path: root/slides.tex
blob: c908b5006b6f24a8e628ef6400bf7398ff238117 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
\documentclass[aspectratio=169,UKenglish]{beamer}

\usetheme{metropolis}
\usepackage[sfdefault]{FiraSans}
\usefonttheme{professionalfonts}
\setbeamerfont{footnote}{size=
  \tiny}
\usepackage{unicode-math}

\usepackage{microtype}

\usepackage{tikz}
\usepackage{pgfplots}
\usepgfplotslibrary{ternary}
\usepackage{stmaryrd}

\newcommand{\R}{\mathbb{R}}
\newcommand{\bx}{\mathbf{x}}
\newcommand{\by}{\mathbf{y}}
\newcommand{\bu}{\mathbf{u}}
\newcommand{\bv}{\mathbf{v}}
\newcommand{\X}{\mathbf{X}}
\newcommand{\V}{\mathbf{V}}
\newcommand{\A}{\mathbf{A}}
\newcommand{\I}{\mathbf{I}}
\newcommand{\U}{\mathbf{u}}
\newcommand{\Q}{\mathbf{q}}
\newcommand{\PP}{\mathbf{P}}
\DeclareMathOperator{\alr}{alr}
\DeclareMathOperator{\clr}{clr}

\usepackage[natbib=true,url=false,style=verbose-ibid]{biblatex}
\addbibresource{slides.bib}
\AtBeginBibliography{\small}

% Tikz relative positioning https://tex.stackexchange.com/questions/89588/positioning-relative-to-page-in-tikz
\makeatletter
\def
\parsecomma#1,#2
\endparsecomma{\def
  \page@x{#1}
  \def
  \page@y{#2}}
\tikzdeclarecoordinatesystem{page}{\parsecomma#1
  \endparsecomma
  \pgfpointanchor{current page}{north east}
  \pgf@xc=
  \pgf@x
  \pgf@yc=
  \pgf@y
  \pgfpointanchor{current page}{south west}
  \pgf@xb=
  \pgf@x
  \pgf@yb=
  \pgf@y
  \pgfmathparse{(\pgf@xc-
    \pgf@xb)/2.*
    \page@x+(
    \pgf@xc+
    \pgf@xb)/2.}
  \expandafter
  \pgf@x
  \expandafter=
  \pgfmathresult pt
  \pgfmathparse{(\pgf@yc-
    \pgf@yb)/2.*
    \page@y+(
    \pgf@yc+
    \pgf@yb)/2.}
  \expandafter
  \pgf@y
  \expandafter=
  \pgfmathresult pt}
\makeatother

\usepackage{acronym}
\usepackage{xspace}
\renewcommand*{\acsfont}[1]{\textsc{#1}}
\newacro{dms}{Deep Mutational Scanning}
\newacro{clr}{Centred Log-Ratio}
\newacro{alr}{Additive Log-Ratio}
\newacro{pca}{Principal Component Analysis}
\newcommand{\dms}{\ac{dms}
  \xspace}

\definecolor{cb1}{HTML}{1b9e77}
\definecolor{cb2}{HTML}{d95f02}
\definecolor{cb3}{HTML}{7570b3}

\author{Justin Bed\H{o}}
\title{Representation learning of compositional counts: an exploration of deep mutational scanning data}
\date{December 13, 2022}

% Abstract:

% Deep mutational scanning data provides important functional information on the % effects of protein variants. Many different aspects of proteins can be assayed, % many different experimental designs are possible, and many different scores are % computed leading to very heterogeneous data that is difficult to integrate.

% In this talk I will explore a representational learning approach on raw count % data. This technique uses recent methods combining compositional data analysis % with a generalised form of principal component analysis to infer protein % representations without specific knowledge of the experimental design or assay % type.

% Bio

% Dr Justin Bedő is the Stafford Fox Centenary Fellow in Bioinformatics and % Computational Biology at the Walter and Eliza Hall Institute. He studied % computer science followed by a PhD in machine learning at the Australian % National University and was awarded his doctorate in 2009. He subsequently % worked as a researcher across both academia and industry at NICTA, IBISC % (Informatique, BioInformatique, Systèmes Complexes) CNRS, and IBM Research on % machine learning methods development and applications to biology before joining % the WEHI in 2016.

\begin{document}

  \maketitle

  \begin{frame}{Variants of Uncertain Significance
      \footfullcite{Liu2020}}
    \begin{center}
      \input{clinvar.tikz}
    \end{center}
  \end{frame}

  \begin{frame}{\dms}
    \begin{quote} Deep mutational scanning is a method for systematically introducing mutations into a gene and then analyzing the resulting protein products to see how the changes affect the protein's function.
    \end{quote}
    \begin{enumerate}
      \item Growing resource of functional data
      \item MaveDB
      \footfullcite{Esposito2019}
      \unskip
      \footnote{\url{https://www.mavedb.org}} catalogs a number of datasets and provides easy access
    \end{enumerate}
  \end{frame}

  \begin{frame}{Deep Mutational Scanning: Overview
      \footfullcite{Fowler2014}}
    \begin{tikzpicture}
      \node at (page cs:0,0.75){\(t_0\)};
      \node at (page cs:0.53,0.75){\(t_1\)};
      \node(a) at (page cs:-0.75,0.5){\includegraphics[width=0.3
          \textwidth]{Protein-BRCA1.png}};
      \node(b) at (page cs:0,0.5){\begin{tikzpicture}
          \node[circle,draw,fill=cb1] at (page cs:-0.06,0){};
          \node[circle,draw,fill=cb1] at (page cs:0,0){};
          \node[circle,draw,fill=cb1] at (page cs:0.06,0){};
          \node[circle,draw,fill=cb2] at (page cs:-0.06,0.1){};
          \node[circle,draw,fill=cb2] at (page cs:0.06,0.1){};
          \node[circle,draw,fill=cb2] at (page cs:0,0.1){};
          \node[circle,draw,fill=cb3] at (page cs:-0.06,-0.1){};
          \node[circle,draw,fill=cb3] at (page cs:0,-0.1){};
          \node[circle,draw,fill=cb3] at (page cs:0.06,-0.1){};
        \end{tikzpicture}};

      \node(c) at (page cs:0.5,0.5){\begin{tikzpicture}
          \node[circle,draw,fill=cb1] at (page cs:0.5,0){};
          \node[circle,draw,fill=cb1] at (page cs:0.56,0){};
          \node[circle,draw,fill=cb1] at (page cs:0.62,0){};
          \node[circle,draw,fill=cb1] at (page cs:0.68,0){};
          \node[circle,draw,fill=cb1] at (page cs:0.74,0){};
          \node[circle,draw,fill=cb2] at (page cs:0.5,0.1){};
          \node[circle,draw,fill=cb3] at (page cs:0.5,-0.1){};
          \node[circle,draw,fill=cb3] at (page cs:0.56,-0.1){};
        \end{tikzpicture}};

      \node(d) at (page cs:0.2,-0.25){\includegraphics[width=0.3
          \textwidth]{nextseq500.jpg}};

      \draw[->] (a) -- (b) node[midway,above]{mutagenesis};
      \draw[->] (b) -- (c) node[midway,above]{selection};
      \draw[->] (b) -- (d);
      \draw[->] (c) -- (d);
    \end{tikzpicture}
  \end{frame}

  \begin{frame}{Deep Mutational Scanning: Integration issues}
    \begin{enumerate}
      \item Assays can measure different properties
      \item Numerous different experimental designs
      \item Scores calculated a variety of ways, e.g., Rubin et al.
      \footfullcite{Rubin2017}:
      \[L_{v,t}=\log\left(\frac{(c_{v,t}+\frac12)(c_{wt,0}+\frac12)}{(c_{v,0}+\frac12)(c_{wt,t}+\frac12)}\right)    \]
    \end{enumerate}
  \end{frame}

  \begin{frame}{Representational learning on
      \ac{dms} data} For a given protein:
    \begin{itemize}
      \item Learn a representation of the available
      \ac{dms} data
      \item unsupervised to deal with varying designs
      \item work on counts not scores
    \end{itemize}
  \end{frame}

  \begin{frame}{Compositional simplex}
    \begin{columns}[T]
      \begin{column}{.63
          \textwidth}
        \begin{definition}[Compositional data] Data \(X \in \R_{\geq 0}^{n \times d}\) is compositional if rows \(\bx_i\) are in the simplex
          \[S^d=\{\,\bx \in \R^d_{\geq 0} : \forall j,x_j > 0 ; \sum_{j=1}^d x_j = \kappa\,\}      \]
          for constant \(\kappa > 0\).
        \end{definition}
      \end{column}
      \hfill
      \begin{column}{.26
          \textwidth}
        \begin{tikzpicture}[scale=0.5]
          \begin{ternaryaxis}
            \addplot3 coordinates{(0.25,0.5,0.25)};
            \path (0.25,0.5,0.25) coordinate (M) (1,0,0) coordinate (C) (0,1,0) coordinate (A) (0,0,1) coordinate (B);
          \end{ternaryaxis}
        \end{tikzpicture}
      \end{column}
    \end{columns}
    \vspace{10pt} \(\Rightarrow\) Information is given only by the ratios of components and any composition can be normalised to the standard simplex where \(\kappa = 1\) (c.f., dividing by library size).
  \end{frame}

  \begin{frame}{Isomorphisms to Euclidean vector spaces} The simplex forms a \(d-1\) dimensional Euclidean vector space
    \footfullcite{Aitchison1982}:
    \begin{definition}[\ac{alr}]
      \[\alr_i(\bx) = \log \frac{x_i}{x_0}      \]
    \end{definition}
    \begin{definition}[\ac{clr}]
      \[\clr_i(\bx) = \log \frac{x_i}{\left(\prod_{j=1}^d x_j\right)^{\frac 1 d}}      \]
    \end{definition}
  \end{frame}

  \begin{frame}{\textsc{Pca} on
      \ac{dms} data}
    \begin{block}{Transformation approach}
      \begin{enumerate}
        \item Map
        \dms data to Euclidean space via
        \ac{alr} /
        \ac{clr}
        \item Apply standard
        \ac{pca}
      \end{enumerate}
    \end{block}
    \pause
    \begin{block}{Problems}
      \begin{itemize}
        \item Zeros:
        \begin{enumerate}
          \item \(\log(0)\) undefined \(\Rightarrow\) can't handle unobserved components
          \item geometric mean is \(0\) \(\Rightarrow\)
          \ac{clr} is undefined
        \end{enumerate}
      \end{itemize}
    \end{block}
  \end{frame}

  \begin{frame}{Traditional
      \ac{pca}} Given \(\X\in \R^{n\times d}\) minimise loss
    \[\ell_{\textsc{pca}} \triangleq {\lVert \X - \V\A \rVert}^2_{\textrm{F}} \]
    s.t.
    \(\V \in \R^{n \times k}\), \(\A \in \R^{k \times d}\), and \(\V^\intercal \V = \I\).

    \pause Has been generalised to exponential families
    \footfullcite{collins2001generalization} via Bregman divergences
    \footfullcite{Amari2016-ua}.
  \end{frame}

  \begin{frame}{Exponential family
      \ac{pca}}
    \begin{definition}[Bregman Divergence] Let \(\varphi \colon \R^d \to \R\) be a differentiable convex function.
      The Bregman divergence \(D_\varphi\) with generator \(\varphi\) is
      \[ D_\varphi\left(\bu\,\Vert\,\bv\right) \triangleq \varphi(\bu)-\varphi(\bv)-\langle \nabla\varphi(\bv),\bu-\bv\rangle.           \]
    \end{definition}
    \pause Denote the convex conjugate of \(\varphi\) as \(\varphi^*(\bu) \triangleq \sup_\bv\left\{\langle \bu,\bv\rangle-\varphi(\bv)\right\}\).
    The exponential family
    \ac{pca} is then given by minimising loss
    \[\ell_{\varphi} \triangleq D_\varphi\left(\X\,\Vert\,\nabla\varphi^*\left(\V\A\right)\right)           \]
    under the same constraints as previously, approximating \(\X \sim \nabla\varphi^*\left(\V\A\right)\).
  \end{frame}

  \begin{frame}{Aitchison's simplex and exponential
      \ac{pca}} Aitchison's log-transformation is a dual affine coordinate space made explicit with
    \[\varphi(z) = z\log(z) - z \Leftrightarrow \varphi^*(z) = e^z, \]
    but what about normalisation?

    \pause Consider
    \ac{alr}:
    \[\alr(\bx) \triangleq x_0 \sum_{i=1}^d\varphi\left(\frac{x_i}{x_0}\right) \Leftrightarrow \alr^*(\bx) = x_0\sum_{i=1}^d e^{\frac{x_i}{x_0}}      \]

  \end{frame}

  \begin{frame}{Scaled Bregman}
    \begin{theorem}[Scaled Bregman
        \footfullcite{nock2016scaled}] Let \(\varphi \colon \mathcal{X} \to \R\) be convex differentiable and \(g \colon \mathcal{X} \to \R\) be differentiable.
      Then
      \[D_{\breve{\varphi}}\left(\bx\,\middle\Vert\,\by\right) = g(\bx)\cdot D_\varphi\left(\frac{\bx}{g(\bx)}\,\middle\Vert\,\frac{\by}{g(\by)}\right) \]
      where
      \[\breve{\varphi} \triangleq g(\bx) \cdot \varphi\left(\frac{x}{g(\bx)}\right) \]
    \end{theorem}

    Avalos et al.
    \footfullcite{avalos2018representation}
    \ considered a relaxed form for
    \ac{clr} recently.
  \end{frame}

  \begin{frame}{\textsc{Clr} undefined if any component is unobserved}
    \begin{itemize}
      \item Zeros still a problem for
      \ac{clr} as geometric mean is \(0\).
      \item[\(\Rightarrow\)] use median as gague function.
    \end{itemize}
  \end{frame}

  \section{Experiments}

  \begin{frame}{Activation-Induced Deaminase
      \footfullcite{Gajula2014}}
    \begin{tikzpicture}[remember picture,overlay]
      \node[scale=0.85] at (page cs:0,0.08){\input{106-samples.tikz}};
    \end{tikzpicture}
  \end{frame}

  \begin{frame}{Activation-Induced Deaminase}
    \begin{tikzpicture}
      \node at (page cs:-0.5,0.08){\input{106-Leu113.tikz}};
      \node at (page cs:0.5,0.5){\includegraphics{gku689fig3-a.pdf}};
      \node at (page cs:0.5,-0.25){\includegraphics{gku689fig3-key.pdf}};
    \end{tikzpicture}
  \end{frame}

  \begin{frame}{Activation-Induced Deaminase}
    \begin{tikzpicture}
      \node at (page cs:-0.5,0.08){\input{106-Phe115.tikz}};
      \node at (page cs:0.5,0.5){\includegraphics{gku689fig3-b.pdf}};
      \node at (page cs:0.5,-0.25){\includegraphics{gku689fig3-key.pdf}};
    \end{tikzpicture}
  \end{frame}

  \begin{frame}{Activation-Induced Deaminase}
    \begin{tikzpicture}
      \node at (page cs:-0.5,0.08){\input{106-Glu117.tikz}};
      \node at (page cs:0.5,0.5){\includegraphics{gku689fig3-c.pdf}};
      \node at (page cs:0.5,-0.25){\includegraphics{gku689fig3-key.pdf}};
    \end{tikzpicture}
  \end{frame