-
Notifications
You must be signed in to change notification settings - Fork 31
/
stacked.jl
160 lines (139 loc) · 4.94 KB
/
stacked.jl
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
"""
Stacked(bs)
Stacked(bs, ranges)
stack(bs::Bijector{0}...) # where `0` means 0-dim `Bijector`
A `Bijector` which stacks bijectors together which can then be applied to a vector
where `bs[i]::Bijector` is applied to `x[ranges[i]]::UnitRange{Int}`.
# Arguments
- `bs` can be either a `Tuple` or an `AbstractArray` of 0- and/or 1-dimensional bijectors
- If `bs` is a `Tuple`, implementations are type-stable using generated functions
- If `bs` is an `AbstractArray`, implementations are _not_ type-stable and use iterative methods
- `ranges` needs to be an iterable consisting of `UnitRange{Int}`
- `length(bs) == length(ranges)` needs to be true.
# Examples
```
b1 = Logit(0.0, 1.0)
b2 = Identity{0}()
b = stack(b1, b2)
b([0.0, 1.0]) == [b1(0.0), 1.0] # => true
```
"""
struct Stacked{Bs, N} <: Bijector{1}
bs::Bs
ranges::NTuple{N, UnitRange{Int}}
function Stacked(
bs::C,
ranges::NTuple{N, UnitRange{Int}}
) where {N, C<:Tuple{Vararg{<:ZeroOrOneDimBijector, N}}}
return new{C, N}(bs, ranges)
end
function Stacked(
bs::A,
ranges::NTuple{N, UnitRange{Int}}
) where {N, A<:AbstractArray{<:Bijector}}
@assert length(bs) == N "number of bijectors is not same as number of ranges"
@assert all(b -> isa(b, ZeroOrOneDimBijector), bs)
return new{A, N}(bs, ranges)
end
end
@functor Stacked
Stacked(bs, ranges::AbstractArray) = Stacked(bs, tuple(ranges...))
Stacked(bs) = Stacked(bs, tuple([i:i for i = 1:length(bs)]...))
function Base.:(==)(b1::Stacked, b2::Stacked)
bs1, bs2 = b1.bs, b2.bs
if !(bs1 isa Tuple && bs2 isa Tuple || bs1 isa Vector && bs2 isa Vector)
return false
end
return all(bs1 .== bs2) && all(b1.ranges .== b2.ranges)
end
isclosedform(b::Stacked) = all(isclosedform, b.bs)
stack(bs::Bijector{0}...) = Stacked(bs)
# For some reason `inv.(sb.bs)` was unstable... This works though.
inv(sb::Stacked) = Stacked(map(inv, sb.bs), sb.ranges)
# map is not type stable for many stacked bijectors as a large tuple
# hence the generated function
@generated function inv(sb::Stacked{A}) where {A <: Tuple}
exprs = []
for i = 1:length(A.parameters)
push!(exprs, :(inv(sb.bs[$i])))
end
:(Stacked(($(exprs...), ), sb.ranges))
end
@generated function _transform(x, rs::NTuple{N, UnitRange{Int}}, bs::Bijector...) where N
exprs = []
for i = 1:N
push!(exprs, :(bs[$i](x[rs[$i]])))
end
return :(vcat($(exprs...)))
end
function _transform(x, rs::NTuple{1, UnitRange{Int}}, b::Bijector)
@assert rs[1] == 1:length(x)
return b(x)
end
function (sb::Stacked{<:Tuple})(x::AbstractVector{<:Real})
y = _transform(x, sb.ranges, sb.bs...)
@assert size(y) == size(x) "x is size $(size(x)) but y is $(size(y))"
return y
end
# The Stacked{<:AbstractArray} version is not TrackedArray friendly
function (sb::Stacked{<:AbstractArray, N})(x::AbstractVector{<:Real}) where {N}
y = mapvcat(1:N) do i
sb.bs[i](x[sb.ranges[i]])
end
@assert size(y) == size(x) "x is size $(size(x)) but y is $(size(y))"
return y
end
(sb::Stacked)(x::AbstractMatrix{<:Real}) = eachcolmaphcat(sb, x)
function logabsdetjac(
b::Stacked{<:Any, N},
x::AbstractVector{<:Real}
) where {N}
init = sum(logabsdetjac(b.bs[1], x[b.ranges[1]]))
init + sum(2:N) do i
sum(logabsdetjac(b.bs[i], x[b.ranges[i]]))
end
end
function logabsdetjac(b::Stacked{<:Any, 1}, x::AbstractVector{<:Real})
return sum(logabsdetjac(b.bs[1], x[b.ranges[1]]))
end
function logabsdetjac(b::Stacked, x::AbstractMatrix{<:Real})
return map(eachcol(x)) do c
logabsdetjac(b, c)
end
end
# Generates something similar to:
#
# quote
# (y_1, _logjac) = forward(b.bs[1], x[b.ranges[1]])
# logjac = sum(_logjac)
# (y_2, _logjac) = forward(b.bs[2], x[b.ranges[2]])
# logjac += sum(_logjac)
# return (rv = vcat(y_1, y_2), logabsdetjac = logjac)
# end
@generated function forward(b::Stacked{T, N}, x::AbstractVector) where {N, T<:Tuple}
expr = Expr(:block)
y_names = []
push!(expr.args, :((y_1, _logjac) = forward(b.bs[1], x[b.ranges[1]])))
# TODO: drop the `sum` when we have dimensionality
push!(expr.args, :(logjac = sum(_logjac)))
push!(y_names, :y_1)
for i = 2:length(T.parameters)
y_name = Symbol("y_$i")
push!(expr.args, :(($y_name, _logjac) = forward(b.bs[$i], x[b.ranges[$i]])))
# TODO: drop the `sum` when we have dimensionality
push!(expr.args, :(logjac += sum(_logjac)))
push!(y_names, y_name)
end
push!(expr.args, :(return (rv = vcat($(y_names...)), logabsdetjac = logjac)))
return expr
end
function forward(sb::Stacked{<:AbstractArray, N}, x::AbstractVector) where {N}
yinit, linit = forward(sb.bs[1], x[sb.ranges[1]])
logjac = sum(linit)
ys = mapvcat(drop(sb.bs, 1), drop(sb.ranges, 1)) do b, r
y, l = forward(b, x[r])
logjac += sum(l)
y
end
return (rv = vcat(yinit, ys), logabsdetjac = logjac)
end