File size: 14,249 Bytes
7873319 | 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 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 | # JSON Configuration Documentation
This document lists the JSON parameters of all components of __tiny-cuda-nn__.
For each component, we provide a sample configuration that lists each parameter's default value.
## Networks
### Activation Functions
Activation functions are specified by string, e.g. as follows:
```json5
{
"activation": "ReLU",
}
```
The following activation functions are supported:
- `"None"` (identity)
- `"ReLU"`
- `"Exponential"`
- `"Sine"`
- `"Sigmoid"` (the logistic function)
- `"Squareplus"` (defined as `0.5 * (x + sqrt(x*x + 4))`)
- `"Softplus"` (defined as `log(exp(x) + 1)`)
- `"Tanh"` (defined as `(exp(x) - exp(-x)) / (exp(x) + exp(-x))`)
### Fully Fused MLP
Lightning fast implementation of small multi-layer perceptrons (MLPs). Restricted to hidden layers of size 16, 32, 64, or 128.
```json5
{
"otype": "FullyFusedMLP", // Component type.
"activation": "ReLU", // Activation of hidden layers.
"output_activation": "None", // Activation of the output layer.
"n_neurons": 128, // Neurons in each hidden layer.
// May only be 16, 32, 64, or 128.
"n_hidden_layers": 5, // Number of hidden layers.
}
```
### CUTLASS MLP
Multi-layer perceptron (MLP) based on [CUTLASS](https://github.com/NVIDIA/cutlass)' GEMM routines. Slower than the fully fused MLP, but allows for arbitrary numbers of hidden and output neurons. Like the fully fused MLP, it outperforms TensorFlow for small networks.
```json5
{
"otype": "CutlassMLP", // Component type.
"activation": "ReLU", // Activation of hidden layers.
"output_activation": "None", // Activation of the output layer.
"n_neurons": 128, // Neurons in each hidden layer.
"n_hidden_layers": 5 // Number of hidden layers.
}
```
## Encodings
### Composite
Allows composing multiple encodings. The following example replicates the Neural Radiance Caching [[Müller et al. 2021]](https://tom94.net/data/publications/mueller21realtime/mueller21realtime.pdf) encoding by composing the `TriangleWave` encoding for the first 3 (spatial) dimensions, the `OneBlob` encoding for the following 5 non-linear appearance dimensions, and the `Identity` for all remaining dimensions.
```json5
{
"otype": "Composite",
"nested": [
{
"n_dims_to_encode": 3, // Spatial dims
"otype": "TriangleWave",
"n_frequencies": 12
},
{
"n_dims_to_encode": 5, // Non-linear appearance dims.
"otype": "OneBlob",
"n_bins": 4
},
{
// Number of remaining linear dims is automatically derived
"otype": "Identity"
}
]
}
```
### Frequency
From NeRF [[Mildenhall et al. 2020]](https://www.matthewtancik.com/nerf). Works better than OneBlob encoding if the dynamic range of the encoded dimension is high. However, suffers from stripe artifacts.
The number of encoded dimensions is twice the specified number of frequencies for each input dimension.
```json5
{
"otype": "Frequency", // Component type.
"n_frequencies": 12 // Number of frequencies (sin & cos)
// per encoded dimension.
}
```
### Grid
Encoding based on trainable multiresolution grids.
Used for [Instant Neural Graphics Primitives [Müller et al. 2022]](https://nvlabs.github.io/instant-ngp/). The grids can be backed by hashtables, dense storage, or tiled storage.
The number of encoded dimensions is `n_levels * n_features_per_level`.
```json5
{
"otype": "Grid", // Component type.
"type": "Hash", // Type of backing storage of the
// grids. Can be "Hash", "Tiled"
// or "Dense".
"n_levels": 16, // Number of levels (resolutions)
"n_features_per_level": 2, // Dimensionality of feature vector
// stored in each level's entries.
"log2_hashmap_size": 19, // If type is "Hash", is the base-2
// logarithm of the number of elements
// in each backing hash table.
"base_resolution": 16, // The resolution of the coarsest le-
// vel is base_resolution^input_dims.
"per_level_scale": 2.0, // The geometric growth factor, i.e.
// the factor by which the resolution
// of each grid is larger (per axis)
// than that of the preceeding level.
"interpolation": "Linear" // How to interpolate nearby grid
// lookups. Can be "Nearest", "Linear",
// or "Smoothstep" (for smooth deri-
// vatives).
}
```
### Identity
Leaves values untouched. Optionally, multiplies each dimension by a scalar and adds an offset.
```json5
{
"otype": "Identity", // Component type.
"scale": 1.0, // Scaling of each encoded dimension.
"offset": 0.0 // Added to each encoded dimension.
}
```
### OneBlob
From Neural Importance Sampling [[Müller et al. 2019]](https://tom94.net/data/publications/mueller18neural/mueller18neural-v4.pdf) and Neural Control Variates [[Müller et al. 2020]](https://tom94.net/data/publications/mueller20neural/mueller20neural.pdf). When the dynamic range of the encoded dimension is limited, it results in a more accurate fit than the identity encoding while not suffering from stripe artifacts like the Frequency encoding.
For performance reasons, the encoding uses a quartic kernel rather than a Gaussian kernel to compute blob integrals. We measured no loss of reconstruction quality.
```json5
{
"otype": "OneBlob", // Component type.
"n_bins": 16 // Number of bins per encoded dimension.
}
```
### Spherical Harmonics
A frequency-space encoding that is more suitable to direction vectors than component-wise `Frequency` or `TriangleWave` encodings.
Expects 3D inputs that represent normalized vectors `v` transformed into the unit cube as `(v+1)/2`.
The number of encoded dimensions is the degree squared.
```json5
{
"otype": "SphericalHarmonics", // Component type.
"degree": 4 // The SH degree up to which
// to evaluate the encoding.
// Produces degree^2 encoded
// dimensions.
}
```
### TriangleWave
Similar to the `Frequency` encoding, but replaces the sine function with a cheaper-to-compute triangle wave. Also omits the cosine function. Proposed in [[Müller et al. 2021]](https://tom94.net/data/publications/mueller21realtime/mueller21realtime.pdf). Works better than OneBlob encoding if the dynamic range of the encoded dimension is high. However, suffers from stripe artifacts.
The number of encoded dimensions is the specified number of frequencies for each input dimension.
```json5
{
"otype": "TriangleWave", // Component type.
"n_frequencies": 12 // Number of frequencies (triwave)
// per encoded dimension.
}
```
## Losses
### L1
Standard L1 loss.
```json5
{
"otype": "L1" // Component type.
}
```
### Relative L1
Relative L1 loss normalized by the network prediction.
```json5
{
"otype": "RelativeL1" // Component type.
}
```
### MAPE
Mean absolute percentage error (MAPE). The same as Relative L1, but normalized by the target.
```json5
{
"otype": "MAPE" // Component type.
}
```
### SMAPE
Symmetric mean absolute percentage error (SMAPE). The same as Relative L1, but normalized by the mean of the prediction and the target.
```json5
{
"otype": "SMAPE" // Component type.
}
```
### L2
Standard L2 loss.
```json5
{
"otype": "L2" // Component type.
}
```
### Relative L2
Relative L2 loss normalized by the network prediction [[Lehtinen et al. 2018]](https://github.com/NVlabs/noise2noise).
```json5
{
"otype": "RelativeL2" // Component type.
}
```
### Relative L2 Luminance
Same as above, but normalized by the luminance of the network prediction. Only applicable when network prediction is RGB. Used in Neural Radiance Caching [[Müller et al. 2021]](https://tom94.net/data/publications/mueller21realtime/mueller21realtime.pdf).
```json5
{
"otype": "RelativeL2Luminance" // Component type.
}
```
### Cross Entropy
Standard cross entropy loss. Only applicable when the network prediction is a probability density function.
```json5
{
"otype": "CrossEntropy" // Component type.
}
```
### Variance
Standard variance loss. Only applicable when the network prediction is a probability density function.
```json5
{
"otype": "Variance" // Component type.
}
```
## Optimizers
### Adam
Implementation of Adam [[Kingma and Ba 2014]](https://arxiv.org/abs/1412.6980), generalized to AdaBound [[Luo et al. 2019]](https://github.com/Luolc/AdaBound).
```json5
{
"otype": "Adam", // Component type.
"learning_rate": 1e-3, // Learning rate.
"beta1": 0.9, // Beta1 parameter of Adam.
"beta2": 0.999, // Beta2 parameter of Adam.
"epsilon": 1e-8, // Epsilon parameter of Adam.
"l2_reg": 1e-8, // Strength of L2 regularization
// applied to the to-be-optimized params.
"relative_decay": 0, // Percentage of weights lost per step.
"absolute_decay": 0, // Amount of weights lost per step.
"adabound": false // Whether to enable AdaBound.
}
```
### Novograd
Implementation of Novograd [[Ginsburg et al. 2019]](https://arxiv.org/abs/1905.11286).
```json5
{
"otype": "Novograd", // Component type.
"learning_rate": 1e-3, // Learning rate.
"beta1": 0.9, // Beta1 parameter of Novograd.
"beta2": 0.999, // Beta2 parameter of Novograd.
"epsilon": 1e-8, // Epsilon parameter of Novograd.
"relative_decay": 0, // Percentage of weights lost per step.
"absolute_decay": 0 // Amount of weights lost per step.
}
```
### Stochastic Gradient Descent (SGD)
Standard stochastic gradient descent (SGD).
```json5
{
"otype": "SGD", // Component type.
"learning_rate": 1e-3, // Learning rate.
"l2_reg": 1e-8 // Strength of L2 regularization.
}
```
### Shampoo
Implementation of the 2nd order Shampoo optimizer [[Gupta et al. 2018]](https://arxiv.org/abs/1802.09568) with home-grown optimizations as well as those by [Anil et al. [2020]](https://arxiv.org/abs/2002.09018).
```json5
{
"otype": "Shampoo", // Component type.
"learning_rate": 1e-3, // Learning rate.
"beta1": 0.9, // Beta1 parameter similar to Adam.
// Used to exponentially average the
// first gradient moment.
"beta2": 0.99, // Beta2 parameter similar to Adam.
// Used to exponentially average the
// second gradient moment.
"beta3": 0.9, // Used to exponentially average L and R.
"beta_shampoo": 0.9, // Used to exponentially average
// Shampoo updates.
"epsilon": 1e-8, // Epsilon parameter similar Adam.
// Used to avoid singularity when computing
// momentum.
"identity": 0.01, // Blends L and R with I*identity for
// numerical stability.
"cg_on_momentum": true, // Whether to estimate L and R from the
// estimated momentum or from the raw
// gradients.
"l2_reg": 1e-5, // Strength of L2 regularization
// applied to the to-be-optimized params.
"relative_decay": 0, // Percentage of weights lost per step.
"absolute_decay": 0, // Amount of weights lost per step.
"frobenius_normalization": true, // Whether to normalize update
// steps by the would-be Adam
// update's Frobenius norm.
}
```
### Average
Wraps another optimizer and computes a linear average of the optimized parameters over the last N training steps. The average is used for inference only (does not feed back into training).
```json5
{
"otype": "Average", // Component type.
"n_samples": 128, // The number of steps to be averaged over.
"nested": { // The nested optimizer.
"otype": "Adam"
}
}
```
### Batched
Wraps another optimizer, invoking the nested optimizer once every N steps on the averaged gradient. Has the same effect as increasing the batch size but requires only a constant amount of memory.
```json5
{
"otype": "Batched", // Component type.
"batch_size_multiplier": 16, // N from the above description
"nested": { // The nested optimizer.
"otype": "Adam"
}
}
```
### Exponential Moving Average (EMA)
Wraps another optimizer and computes an exponential moving average of optimized parameters. The average is used for inference only (does not feed back into training).
```json5
{
"otype": "EMA", // Component type.
"decay": 0.99, // The EMA's decay per step.
"nested": { // The nested optimizer.
"otype": "Adam"
}
}
```
### Exponential Decay
Wraps another optimizer and performs piecewise-constant exponential learning-rate decay.
```json5
{
"otype": "ExponentialDecay", // Component type.
"decay_base": 0.1, // The amount per decay step.
"decay_start": 10000, // The training step at which
// to start the decay.
"decay_end": 10000000, // The training step at which
// to end the decay.
"decay_interval": 10000, // Training steps inbetween decay.
"nested": { // The nested optimizer.
"otype": "Adam"
}
}
```
### Lookahead
Wraps another optimizer, implementing the lookahead algorithm [[Zhang et al. 2019]](https://arxiv.org/abs/1907.08610).
```json5
{
"otype": "Lookahead", // Component type.
"alpha": 0.5, // Fraction of lookahead distance to
// traverse.
"n_steps": 16, // Nested optimizer steps for each
// Lookahead step.
"nested": { // The nested optimizer.
"otype": "Adam"
}
}
```
|