flowMC 0.3.2__tar.gz → 0.3.3__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {flowmc-0.3.2/src/flowMC.egg-info → flowmc-0.3.3}/PKG-INFO +1 -1
- {flowmc-0.3.2 → flowmc-0.3.3}/setup.cfg +1 -1
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/strategy/optimization.py +82 -5
- {flowmc-0.3.2 → flowmc-0.3.3/src/flowMC.egg-info}/PKG-INFO +1 -1
- {flowmc-0.3.2 → flowmc-0.3.3}/LICENSE +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/README.md +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/pyproject.toml +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/Sampler.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/__init__.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/nfmodel/__init__.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/nfmodel/base.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/nfmodel/common.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/nfmodel/realNVP.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/nfmodel/rqSpline.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/Gaussian_random_walk.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/HMC.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/MALA.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/NF_proposal.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/__init__.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/base.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/proposal/flowHMC.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/strategy/__init__.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/strategy/base.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/strategy/global_tuning.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/strategy/importance_sampling.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/utils/EvolutionaryOptimizer.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/utils/PythonFunctionWrap.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/utils/__init__.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC/utils/postprocessing.py +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC.egg-info/SOURCES.txt +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC.egg-info/dependency_links.txt +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC.egg-info/requires.txt +0 -0
- {flowmc-0.3.2 → flowmc-0.3.3}/src/flowMC.egg-info/top_level.txt +0 -0
|
@@ -10,23 +10,31 @@ from flowMC.strategy.base import Strategy
|
|
|
10
10
|
|
|
11
11
|
|
|
12
12
|
class optimization_Adam(Strategy):
|
|
13
|
-
|
|
14
13
|
"""
|
|
15
14
|
Optimize a set of chains using Adam optimization.
|
|
16
15
|
Note that if the posterior can go to infinity, this optimization scheme is likely to return NaNs.
|
|
17
|
-
|
|
16
|
+
|
|
17
|
+
Args:
|
|
18
|
+
n_steps: int = 100
|
|
19
|
+
Number of optimization steps.
|
|
20
|
+
learning_rate: float = 1e-2
|
|
21
|
+
Learning rate for the optimization.
|
|
22
|
+
noise_level: float = 10
|
|
23
|
+
Variance of the noise added to the gradients.
|
|
18
24
|
"""
|
|
19
25
|
|
|
20
26
|
n_steps: int = 100
|
|
21
27
|
learning_rate: float = 1e-2
|
|
22
28
|
noise_level: float = 10
|
|
29
|
+
bounds: Float[Array, "n_dim 2"] = jnp.array([[-jnp.inf, jnp.inf]])
|
|
23
30
|
|
|
24
31
|
@property
|
|
25
32
|
def __name__(self):
|
|
26
33
|
return "AdamOptimization"
|
|
27
|
-
|
|
34
|
+
|
|
28
35
|
def __init__(
|
|
29
36
|
self,
|
|
37
|
+
bounds: Float[Array, "n_dim 2"] = jnp.array([[-jnp.inf, jnp.inf]]),
|
|
30
38
|
**kwargs,
|
|
31
39
|
):
|
|
32
40
|
class_keys = list(self.__class__.__annotations__.keys())
|
|
@@ -39,6 +47,8 @@ class optimization_Adam(Strategy):
|
|
|
39
47
|
optax.adam(learning_rate=self.learning_rate),
|
|
40
48
|
)
|
|
41
49
|
|
|
50
|
+
self.bounds = bounds
|
|
51
|
+
|
|
42
52
|
def __call__(
|
|
43
53
|
self,
|
|
44
54
|
rng_key: PRNGKeyArray,
|
|
@@ -61,6 +71,7 @@ class optimization_Adam(Strategy):
|
|
|
61
71
|
grad = grad_fn(params) * (1 + jax.random.normal(subkey) * self.noise_level)
|
|
62
72
|
updates, opt_state = self.solver.update(grad, opt_state, params)
|
|
63
73
|
params = optax.apply_updates(params, updates)
|
|
74
|
+
params = optax.projections.projection_box(params, self.bounds[:, 0], self.bounds[:, 1])
|
|
64
75
|
return (key, params, opt_state), None
|
|
65
76
|
|
|
66
77
|
def _single_optimize(
|
|
@@ -91,11 +102,77 @@ class optimization_Adam(Strategy):
|
|
|
91
102
|
summary["final_positions"] = optimized_positions
|
|
92
103
|
summary["final_log_prob"] = local_sampler.logpdf_vmap(optimized_positions, data)
|
|
93
104
|
|
|
94
|
-
if
|
|
105
|
+
if (
|
|
106
|
+
jnp.isinf(summary["final_log_prob"]).any()
|
|
107
|
+
or jnp.isnan(summary["final_log_prob"]).any()
|
|
108
|
+
):
|
|
95
109
|
print("Warning: Optimization accessed infinite or NaN log-probabilities.")
|
|
96
|
-
|
|
110
|
+
|
|
97
111
|
return rng_key, optimized_positions, local_sampler, global_sampler, summary
|
|
98
112
|
|
|
113
|
+
def optimize(
|
|
114
|
+
self,
|
|
115
|
+
rng_key: PRNGKeyArray,
|
|
116
|
+
objective: Callable,
|
|
117
|
+
initial_position: Float[Array, " n_chain n_dim"],
|
|
118
|
+
):
|
|
119
|
+
"""
|
|
120
|
+
Standalone optimization function that takes an objective function and returns the optimized positions.
|
|
121
|
+
|
|
122
|
+
Args:
|
|
123
|
+
rng_key: PRNGKeyArray
|
|
124
|
+
Random key for the optimization.
|
|
125
|
+
objective: Callable
|
|
126
|
+
Objective function to optimize.
|
|
127
|
+
initial_position: Float[Array, " n_chain n_dim"]
|
|
128
|
+
Initial positions for the optimization.
|
|
129
|
+
"""
|
|
130
|
+
grad_fn = jax.jit(jax.grad(objective))
|
|
131
|
+
|
|
132
|
+
def _kernel(carry, data):
|
|
133
|
+
key, params, opt_state = carry
|
|
134
|
+
|
|
135
|
+
key, subkey = jax.random.split(key)
|
|
136
|
+
grad = grad_fn(params) * (1 + jax.random.normal(subkey) * self.noise_level)
|
|
137
|
+
updates, opt_state = self.solver.update(grad, opt_state, params)
|
|
138
|
+
params = optax.apply_updates(params, updates)
|
|
139
|
+
return (key, params, opt_state), None
|
|
140
|
+
|
|
141
|
+
def _single_optimize(
|
|
142
|
+
key: PRNGKeyArray,
|
|
143
|
+
initial_position: Float[Array, " n_dim"],
|
|
144
|
+
) -> Float[Array, " n_dim"]:
|
|
145
|
+
|
|
146
|
+
opt_state = self.solver.init(initial_position)
|
|
147
|
+
|
|
148
|
+
(key, params, opt_state), _ = jax.lax.scan(
|
|
149
|
+
_kernel,
|
|
150
|
+
(key, initial_position, opt_state),
|
|
151
|
+
jnp.arange(self.n_steps),
|
|
152
|
+
)
|
|
153
|
+
|
|
154
|
+
return params # type: ignore
|
|
155
|
+
|
|
156
|
+
print("Using Adam optimization")
|
|
157
|
+
rng_key, subkey = jax.random.split(rng_key)
|
|
158
|
+
keys = jax.random.split(subkey, initial_position.shape[0])
|
|
159
|
+
optimized_positions = jax.vmap(_single_optimize, in_axes=(0, 0))(
|
|
160
|
+
keys, initial_position
|
|
161
|
+
)
|
|
162
|
+
|
|
163
|
+
summary = {}
|
|
164
|
+
summary["initial_positions"] = initial_position
|
|
165
|
+
summary["initial_log_prob"] = jax.jit(jax.vmap(objective))(initial_position)
|
|
166
|
+
summary["final_positions"] = optimized_positions
|
|
167
|
+
summary["final_log_prob"] = jax.jit(jax.vmap(objective))(optimized_positions)
|
|
168
|
+
|
|
169
|
+
if (
|
|
170
|
+
jnp.isinf(summary["final_log_prob"]).any()
|
|
171
|
+
or jnp.isnan(summary["final_log_prob"]).any()
|
|
172
|
+
):
|
|
173
|
+
print("Warning: Optimization accessed infinite or NaN log-probabilities.")
|
|
174
|
+
|
|
175
|
+
return rng_key, optimized_positions, summary
|
|
99
176
|
|
|
100
177
|
class Evosax_CMA_ES(Strategy):
|
|
101
178
|
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|