You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
All three follow JAX conventions—pure functions, explicit state, composable transformations. **Read the "Getting Started" tutorials for each.** Learning new tools from documentation is a core professional skill.
109
+
All three follow JAX conventions: pure functions, explicit state, composable transformations. **Read the "Getting Started" tutorials for each.** Learning new tools from documentation is a core professional skill.
102
110
103
111
---
104
112
@@ -112,10 +120,11 @@ Train a neural network to predict **summary statistics** of N-body simulations a
| Timestep | Constant $\Delta t$ | Required for symplectic structure (see below) |
155
164
| Softening | $\epsilon \sim 0.1 \times a / N^{1/3}$ |~10% of mean interparticle spacing |
156
165
@@ -168,9 +177,10 @@ where $R$ is a characteristic radius (use your Plummer scale radius $a$) and $\s
168
177
169
178
$$t_{\rm cross} \sim \sqrt{\frac{a^3}{GM}}$$
170
179
171
-
This is essentially the dynamical time—the timescale over which gravitational dynamics operate. The scaling $t_{\rm cross} \propto a^{3/2} M^{-1/2}$ is what matters; compute it from your initial conditions.
180
+
This is essentially the dynamical time: the timescale over which gravitational dynamics operate. The scaling $t_{\rm cross} \propto a^{3/2} M^{-1/2}$ is what matters; compute it from your initial conditions.
172
181
173
182
After $\sim 10 \, t_{\rm cross}$:
183
+
174
184
- Subvirial systems ($Q < 1$) have collapsed and re-virialized
175
185
- Systems near equilibrium ($Q \approx 1$) remain bound with modest evolution
176
186
- Supervirial systems ($Q > 1$) have expanded, with unbound stars escaping
@@ -205,7 +215,7 @@ If you see secular drift or much larger oscillations, reduce $\Delta t$ by a fac
205
215
206
216
When training an emulator, the design of your training set matters. You need samples that **cover the parameter space efficiently**—not clustered in one region, not leaving gaps where the emulator must extrapolate blindly.
207
217
208
-
**Why not uniform random sampling?**
218
+
**Why not uniform random sampling?**
209
219
210
220
Random samples from a uniform distribution tend to clump and leave holes, especially in higher dimensions. With only 100 samples in 2D, random sampling might accidentally cluster points in one corner, leaving another corner with no training data. Your emulator would perform poorly there.
211
221
@@ -218,6 +228,7 @@ Random samples from a uniform distribution tend to clump and leave holes, especi
218
228
The result: every "row" and "column" of parameter space contains exactly one sample. No clumping, no gaps, guaranteed coverage.
219
229
220
230
For 2D with $N = 100$ samples:
231
+
221
232
- Divide $Q_0 \in [0.5, 1.5]$ into 100 bins of width 0.01
222
233
- Divide $a \in [50, 200]$ into 100 bins of width 1.5 AU
223
234
- Each bin in $Q_0$ gets exactly one sample; same for $a$
@@ -228,8 +239,9 @@ LHS is standard practice for computer experiments and surrogate modeling. It pro
Note: First compute $\mathbf{v}_{\rm COM}$ for the bound population, then compute $\sigma_v$ using velocities relative to that COM. This removes bulk motion and isolates the internal velocity dispersion.
265
+
*Note:* First compute $\mathbf{v}_{\rm COM}$ for the bound population, then compute $\sigma_v$ using velocities relative to that COM. This removes bulk motion and isolates the internal velocity dispersion.
254
266
255
267
**Half-mass radius**: Sort bound particles by distance from the center of mass. Find the radius $r_h$ enclosing half of the *bound* mass (i.e., the radius within which the cumulative bound mass equals $\frac{1}{2}\sum_{i \in \text{bound}} m_i$).
0 commit comments