Diff of /docs/references.rst [000000] .. [6ff4a8]

Switch to unified view

a b/docs/references.rst
1
References
2
==========
3
4
Bibliography
5
------------
6
.. bibliography::
7
    :cited:
8
9
Glossary
10
--------
11
.. glossary::
12
13
    OT
14
        An `optimal transport <https://en.wikipedia.org/wiki/Transportation_theory_(mathematics)>`_ problem is defined
15
        as a matching task between distributions, e.g. sets of cells.
16
17
    transport matrix
18
        The output of a discrete :term:`OT` problem indicating how much mass from data point :math:`x_i` in row
19
        :math:`i` is transported to data point :math:`y_j` in column :math:`j`.
20
21
    entropic regularization
22
        Entropy regularization of :term:`OT` problems :cite:`cuturi:2013` reduces the time complexity and allows for
23
        more desirable statistical properties. The higher the entropy regularization, the more diffused the OT solution.
24
25
    marginals
26
        An :term:`OT` problem matches distributions, e.g. set of cells. The distribution is defined by the location
27
        of a cell, e.g. in gene expression space, and the weight assigned to one cell.
28
29
30
    balanced OT problem
31
        :term:`OT` problem where the :term:`marginals` are fixed. Each data point (cell) of the source distribution
32
        emits a certain amount of mass given by the source :term:`marginals`, and each data point (cell) of the target
33
        distribution receives a certain amount of mass given by the target :term:`marginals`.
34
35
    unbalanced OT problem
36
        :term:`OT` problem where the :term:`marginals` are not fixed. If beneficial, a data point might emit or
37
        receive more or less mass than prescribed by the :term:`marginals`. The larger the unbalancedness parameters
38
        ``tau_a`` and ``tau_b``, the more the mass emitted, and received, respectively, can deviate from the
39
        :term:`marginals` :cite:`chizat:18`.
40
41
    linear problem
42
        :term:`OT` problem only containing a :term:`linear term` and no :term:`quadratic term`.
43
44
    linear term
45
        Term of the cost function on the shared space, e.g. gene expression space.
46
47
    quadratic problem
48
        :term:`OT` problem containing a :term:`quadratic term` and possibly a :term:`linear term`.
49
50
    quadratic term
51
        Term of the cost function comparing two different spaces.
52
53
    Gromov-Wasserstein
54
        :term:`OT` problem between two distributions where a data point, e.g. a cell. in the source distribution
55
        does not live in the same space as a data point in the target distribution. Such problem is a
56
        :term:`quadratic problem`.
57
58
    fused Gromov-Wasserstein
59
        :term:`OT` problem between two distributions where a data point, e.g. a cell, of the source distribution
60
        has both features in the same space as the target distribution (:term:`linear term`) and features in a
61
        different space than a data point in the target distribution (:term:`quadratic term`). Such problem is a
62
        :term:`quadratic problem`.
63
64
    dual potentials
65
        Potentials obtained by the :term:`Sinkhorn` algorithm which define the solution of a :term:`linear problem`
66
        :cite:`cuturi:2013`. These weights are referred to as `marginals`.
67
68
    Sinkhorn
69
        The Sinkhorn algorithm :cite:`cuturi:2013` is used for solving a :term:`linear problem`, and is also used
70
        in inner iterations for solving a :term:`quadratic problem`.
71
72
    low-rank OT
73
        `low-rank <https://en.wikipedia.org/wiki/Low-rank_approximation>`_ OT approximates full-rank :term:`OT`,
74
        which allows for faster computations and lower memory complexity
75
        :cite:`scetbon:21a,scetbon:21b,scetbon:22b,scetbon:23`. The :term:`transport matrix`
76
        will be :term:`low-rank`.
77
78
    low-rank
79
        If the OT problem is solved with a `low-rank <https://en.wikipedia.org/wiki/Low-rank_approximation>`_ solver,
80
        the :term:`transport matrix` is the product of several low-rank matrices (i.e. lower than the number of data
81
        points in the source distribution and the target distribution).