Paper · 2023-06-19 · stat.ML, cs.LG
A VAE Approach to Sample Multivariate Extremes
Samples multivariate heavy-tailed extremes with a VAE. A polar split gives a radius VAE with an inverse-gamma latent prior and a conditional angular VAE on the simplex. A standard Gaussian VAE is shown to be light-tailed. Author-reported: radius ELBO cost stays flat from train to test (1.12) where the standard VAE diverges.
Variational autoencoderExtreme value theoryGenerative model evaluationgenerative-modelsheavy-tailsrisk-assessment
arXivPDFCodeMarkdown14 min read
AI-compiled by claude-haiku-5-5 on 2026-11-12, not yet reviewed by a human. Every claim cites its source; check it when a detail matters.
In plain words
Most generative models learn from typical data, so they rarely produce values larger than the biggest ones they were trained on. That is a problem when the goal is to estimate the risk of rare, very large events such as floods or financial crashes, because those events are exactly the ones the training data hardly contains.
The paper splits each sample into two parts: how large it is overall, and how its total is shared among its components. A first generative model produces the overall size, and it is built so that large sizes stay likely, giving a heavy tail. A second model produces the shares, conditioned on the size, and it is built so that very large sizes do not distort how the shares are spread. Putting the two parts together gives new samples with large values, including combinations of large values that never occurred in the training data.
The authors test this on a synthetic data set and on river discharge data, where it beats a standard VAE and a GAN baseline in their own experiments.
TL;DR
- A standard VAE with Gaussian latent, likelihood and posterior produces only light-tailed marginals, so it cannot extrapolate past the training maxima §3.1.
- Generators built from ReLU networks of a heavy-tailed input concentrate their dependence on finitely many directions §3.2.
- The fix is a polar split: a radius VAE with an inverse-gamma latent prior §4.3 and a radius-conditioned VAE for the simplex §4.4.
- Author-reported: the radius ELBO cost stays flat from train to test, the standard VAE diverges, and the Wasserstein distance to test data is 5.37 against 6.80 for ParetoGAN on synthetic data tab. 1 §6.1.
Problem
Risk estimation needs samples beyond the largest observed value. Heavy-tailed data (tail index \alpha, with regular variation of the radius) is the setting §1 §2.2 §2.3.
Two obstacles are stated:
- Standard VAE: with a Gaussian prior, Gaussian likelihood and Gaussian posterior, the output marginals are light-tailed. The result assumes the decoder mean and scale networks are piecewise linear, as ReLU, leaky ReLU, max-pooling, linear and concatenation layers are §3.1 app. G.1.
- Deterministic transforms of heavy-tailed noise (GANs with Pareto latent, normalizing flows with Student-t latent): a ReLU network applied to a heavy-tailed input has an angular measure supported on at most n points, where n is the input dimension §3.2. Such a generator therefore tends to produce extremes along a few directions §6.2.
Method
Polar decomposition and regular variation
For \mathbf{X} in (\mathbb{R}^+)^m, write the radius as the sum of the components, R = X_1 + \cdots + X_m, and the angle as \mathbf{\Theta} = \mathbf{X}/R, which lies on the (m-1)-simplex §2.3. The vector is multivariate regularly varying when R is regularly varying with tail index \alpha, and the conditional law of \mathbf{\Theta} given R > r converges weakly to an angular measure \mathbf{S} as r \to \infty §2.3, Definition of multivariate regular variation eq. 4 eq. 5.
Sampling plan §4.1: draw a heavy-tailed radius r, then draw \mathbf{\Theta} conditionally on r with independence imposed for large r, then output \mathbf{x} = r\,\mathbf{\Theta}. Two VAEs do this: one for the radius, one for the angle given the radius §4.1 fig. 2.
Radius VAE (heavy-tailed prior)
Idea: if R = A\,Z with Z inverse-gamma with shape \alpha and A positive, independent and with E[A^{\alpha+\epsilon}] < \infty, then Breiman's lemma gives tail index \alpha for R §4.2. If A is exponential with scale c, R is a generalized Pareto variable with \xi = 1/\alpha and \sigma = \beta c/\alpha §4.2 app. G.3.
The VAE uses that structure as follows §4.3:
p_\alpha(z_{\mathrm{rad}}) = \mathrm{InvGamma}(z_{\mathrm{rad}};\ \alpha,\ 1) \qquad [\text{eq. 8}]
p_\theta(r \mid z_{\mathrm{rad}}) = \mathrm{Gamma}\!\left(r;\ \alpha_\theta(z_{\mathrm{rad}}),\ \beta_\theta(z_{\mathrm{rad}})\right) \qquad [\text{eq. 9}]
q_\phi(z_{\mathrm{rad}} \mid r) = \mathrm{InvGamma}\!\left(z_{\mathrm{rad}};\ \alpha_\phi(r),\ \beta_\phi(r)\right) \qquad [\text{eq. 10}]
with the decoder shape and rate given by
\alpha_\theta(z) = \frac{|g_\theta(z)|}{z}, \qquad \beta_\theta(z) = \frac{|f_\theta(z)|}{z^2} \qquad [\text{eq. 12}] [\text{eq. 11}]
where f_\theta and g_\theta are ReLU networks §4.3. The scale of the inverse-gamma prior can be fixed to 1 without loss of generality, because rescaling z rescales \beta §4.3.
Heavy-tail result §4.3: if \alpha_\theta has a strictly positive limit at infinity and \beta_\theta(z) is proportional to 1/z both as z \to 0 and as z \to \infty, the sampled radius has tail index \alpha app. G.4. Eqs. 11 and 12 are chosen to meet these conditions.
Closed-form KL term, possible because prior and posterior are both inverse-gamma §4.3:
D_{KL}\big(q_\phi \,\|\, p_\alpha\big) = (\alpha_\phi(r)-\alpha)\,\psi(\alpha_\phi(r)) - \log\frac{\Gamma(\alpha_\phi(r))}{\Gamma(\alpha)} + \alpha\log\beta_\phi(r) + \alpha_\phi(r)\,\frac{1-\beta_\phi(r)}{\beta_\phi(r)} \qquad [\text{eq. 15}]
The digamma argument is \alpha_\phi(r), not \alpha as printed in eq. 15; see Pitfalls. The paper uses the same expression to learn \alpha by gradient descent §4.3 §5.2.
Angular VAE (conditional on the radius)
A conditional VAE §4.4 with:
- prior \mathcal{N}(\mathbf{0}, \mathbf{I}_n) on the angular latent \mathbf{z}_{\mathrm{ang}} §4.4;
- posterior q_\omega(\mathbf{z}_{\mathrm{ang}} \mid \mathbf{\Theta}, r), a diagonal Gaussian whose mean and standard deviation are networks of (\mathbf{\Theta}, r) §4.4;
- likelihood p_\nu(\mathbf{\Theta} \mid \mathbf{z}_{\mathrm{ang}}, r), either a Dirichlet with concentration a_\nu(\mathbf{z}_{\mathrm{ang}}, r) app. C, or a Gaussian \mathcal{N}(\mu_\nu, \operatorname{diag}\sigma_\nu^2) projected onto the simplex by \Pi(\mathbf{s}) = \mathbf{s}/\|\mathbf{s}\|_1 §4.4.
The synthetic experiment uses the Dirichlet likelihood, and the Danube case study uses the projected Gaussian, which the authors report as the better fit on each data set §6.1 §6.2.
Independence of angle and radius for large r is enforced by feeding 1/(1+r) to the networks instead of r §4.4:
\mu_\nu(\mathbf{z}_{\mathrm{ang}}, r) = f_\nu\!\left(\mathbf{z}_{\mathrm{ang}},\ \tfrac{1}{1+r}\right) \qquad [\text{eq. 17}]
\sigma_\nu(\mathbf{z}_{\mathrm{ang}}, r) = g_\nu\!\left(\mathbf{z}_{\mathrm{ang}},\ \tfrac{1}{1+r}\right) \qquad [\text{eq. 18}]
with f_\nu and g_\nu Lipschitz networks §4.4. For the Dirichlet likelihood the same trick applies to a_\nu app. C. The limit r \to \infty is then obtained by feeding 0 §4.4, remark after eq. 18.
Sampling
# Sample one heavy-tailed vector [§4.1]
# Input: radius decoder, angular decoder, tail index alpha
# Output: x with non-negative components, shape (m,)
def sample_extreme(radius_decoder, angle_decoder, alpha):
# Draw the radius latent from its inverse-gamma prior [§4.3] [eq. 8]
z_rad = sample_inverse_gamma(alpha, scale=1.0)
# Draw the radius from Gamma(alpha_theta(z), beta_theta(z)) [§4.3] [eq. 9]
r = sample_gamma(radius_decoder.shape(z_rad), radius_decoder.rate(z_rad))
# Draw the angular latent from the standard normal prior [§4.4]
z_ang = sample_normal(mean=0, cov=identity(n_latent))
# Draw the angle on the simplex given r [§4.4] [eq. 17] [eq. 18]
theta = angle_decoder.sample(z_ang, r)
# Multiply the angle by the radius [§4.1]
x = r * theta # (m,)
return xSampling from the angular measure alone §4.4, remark:
# Sample from the angular measure [§4.4, remark]
# Input: angular decoder
# Output: theta on the simplex
def sample_angular_measure(angle_decoder):
# Draw the angular latent from the standard normal prior [§4.4]
z_ang = sample_normal(mean=0, cov=identity(n_latent))
# Decode with radius input 0, which is the limit r -> infinity [§4.4]
theta = angle_decoder.sample(z_ang, radius_input=0.0)
# Gaussian likelihood: project onto the simplex, Pi(s) = s / ||s||_1 [§4.4]
return thetaTraining
Losses §5.2 eq. 19: the radius loss \mathcal{L}_R and the angular loss \mathcal{L}_{\Theta \mid R} are summed; training runs the radius VAE first and the angular VAE second. The radius loss has the KL term of eq. 15 and a Monte Carlo log-likelihood term; the angular loss has a closed-form Gaussian KL to the standard normal §4.4 and a Monte Carlo log-likelihood term. The sign convention of eq. 19 is discussed under Paper vs code.
# Train the radius VAE [§5.2] [eq. 19]
# Input: radii r_i > 0, tail index alpha (fixed or trainable)
# Output: encoder and decoder parameters
def train_radius_vae(radii, alpha):
for epoch in range(5000): # max epochs [§5.2]
for batch in minibatches(radii, size=32): # batch size [§5.2]
# Encode: posterior InvGamma(alpha_phi(r), beta_phi(r)) [eq. 10]
posterior = encoder(batch)
# Draw the radius latent from the posterior [§5.2]
z_rad = posterior.sample()
# Gamma log-likelihood of the radius under the decoder [eq. 9]
log_lik = gamma_log_pdf(batch, decoder(z_rad))
# Closed-form KL to the prior [eq. 15] [app. G.5]
kl = kl_inv_gamma(posterior, alpha)
# Minimise the negative ELBO [§2.1] [eq. 1]
loss = kl - log_lik.mean()
adam_step(loss, learning_rate=1e-4) # [§5.2]
return encoder, decoder# Train the angular VAE on angles given radii [§5.2] [§4.4]
# Input: angles theta_i on the simplex, radii r_i
# Output: encoder and decoder parameters
def train_angular_vae(thetas, radii):
for epoch in range(5000): # max epochs [§5.2]
for batch in minibatches(thetas, radii, size=32): # [§5.2]
# Encode: Gaussian posterior over z_ang given (theta, r) [§4.4]
posterior = angle_encoder(batch.theta, batch.r)
# Draw the angular latent from the posterior [§5.2]
z_ang = posterior.sample()
# Likelihood of theta under the decoder at this radius [§4.4]
log_lik = angle_decoder.log_prob(batch.theta, z_ang, batch.r)
# Closed-form KL to N(0, I) of the posterior [§4.4]
kl = kl_normal_to_standard(posterior)
# Minimise the negative ELBO [§2.1] [eq. 1]
loss = kl - log_lik.mean()
adam_step(loss, learning_rate=1e-5) # [§5.2]
return encoder, decoderStated training choices §5.2: Adam; batch size 32; at most 5000 epochs; a learning rate of 10^{-4} for the radius VAE and 10^{-5} for the angular VAE. The tail index \alpha is either known (ExtVAE) or optimised by gradient descent (UExtVAE) §5.4.
Hyperparameters
| Name | Value | Where | Notes |
|---|---|---|---|
| Inverse-gamma prior scale \beta | 1 | §4.3 | fixed without loss of generality |
| Tail index \alpha, synthetic | 1.5 (known, ExtVAE) | §6.1 app. A.1 | learned variant starts from values drawn uniformly on 0.5 to 3 fig. 5 |
| Tail index \alpha, Danube | learned: 4.5 | §6.2 | paper's own estimate; see Pitfalls |
| Radius encoder hidden layers | 2 layers, 5 ReLU units each | §5.1 | output: 2 units, ReLU |
| Radius encoder initialisation | weights 0; output biases uniform on 1 to 2 | §5.1 | described as "for convergence purposes" |
| Radius decoder | same architecture as encoder; two outputs f_\theta, g_\theta | §5.1 | output bias of f_\theta uniform on 1 to 2; output kernel of g_\theta uniform on 0.1 to 2 |
| Angular latent dimension n | 4 | §5.1 | |
| Angular encoder hidden layers | 3 ReLU layers with 8, 8, 4 units | §5.1 | output: dense linear layer; default initialisation |
| Angular decoder hidden layers | 3 ReLU layers with 5, 10, 5 units | §5.1 | output: dense layer; final bias uniform on 0.5 to 3 |
| Angular decoder radius input | 1/(1+r) | §4.4 eq. 17 eq. 18 | required for independence in the limit |
| Optimiser | Adam | §5.2 | moment constants not stated |
| Batch size | 32 | §5.2 | |
| Max epochs | 5000 | §5.2 | no early stopping stated |
| Learning rate, radius VAE | 10^{-4} | §5.2 | |
| Learning rate, angular VAE | 10^{-5} | §5.2 | |
| Monte Carlo samples per point, L | not stated | §5.2 | |
| Synthetic dimension | 5 | app. A.1 | |
| Synthetic split (train / val / test) | 250 / 750 / 10 000 | §6.1 | |
| Synthetic Dirichlet concentrations | a_1(r) = 3(2 - \min(1, 1/(2r))), a_2(r) = 3(1 + \min(1, 1/(2r))); components (a_1, a_1, a_2, a_2, a_2) | app. A.1 | |
| Synthetic radius | R_1 = 2U \times \mathrm{InvGamma}(\alpha = 1.5, \beta = 0.6), U \sim \mathrm{Uniform}[0,1] | app. A.1 | |
| Danube stations | 5 of 31 (numbers 23 to 27) | §6.2 fig. 10 | daily flow, 50 years |
| Danube train / test sizes | 730 / 17 486 | §6.2 | training set takes one value every 25 days |
| Extreme-event levels | p = 0.9 and p = 0.99 | §6.2 tab. 2 | |
| Independence p-value threshold | 0.45 | fig. 8 | read from the plot's caption |
| Wasserstein rescaling | divide by u^2 | app. E.2 | u is a radius threshold; the value of u used is not stated |
| Monte Carlo draws in the independence test | not stated | app. E.3 | |
| Distance-covariance subsample size N_k | not stated | app. E.3 |
Results
Author-reported. Setup: synthetic 5-dimensional heavy-tailed data with \alpha = 1.5 §6.1; five Danube stations §6.2; baselines are a standard VAE (StdVAE) and ParetoGAN, a Wasserstein GAN with a Pareto latent §5.4. The number of runs or seeds behind each number is not stated.
Radius ELBO cost on the synthetic data (the paper's term; lower is better) tab. 1:
| Method | Train cost | Validation cost | Test cost |
|---|---|---|---|
| StdVAE | 1.21 | 4.81 | +\infty |
| ExtVAE_r (known \alpha) | 0.88 | 1.10 | 1.12 |
| UExtVAE_r (learned \alpha) | 0.95 | 1.12 | 1.15 |
Other synthetic results §6.1:
- Wasserstein distance between 10 000 generated and 10 000 test samples: 5.37 for ExtVAE, 6.80 for ParetoGAN §6.1.
- Radius threshold above which radius and angle look independent, from the p-value criterion of §5.3: 1.3 for ExtVAE, 1.6 for the true data, 2.7 for ParetoGAN §6.1 fig. 8.
- Learned tail index of UExtVAE_r: mean 1.56, standard deviation 0.2, against the true 1.5 §6.1 fig. 5.
- Log-QQ plots fig. 3 and KL divergence above a quantile fig. 4 show StdVAE departing from the true tail, while the two VAE variants follow it. The paper gives these as plots only, without numbers.
- Angular measure fig. 6: the ExtVAE density agrees with the true distribution but is less sharp; ParetoGAN's mass collapses onto a single mode.
Danube case study: proportion (in %) of samples in the extreme events A_j^{(p)} tab. 2 §6.2. The training set contains no p = 0.99 events.
| Event | Train | Test | UExtVAE | StdVAE | ParetoGAN |
|---|---|---|---|---|---|
| p = 0.9, A_{25} | 5.9 | 6.6 | 5.0 | 3.8 | 5.5 |
| p = 0.9, A_{26} | 4.9 | 6.0 | 4.6 | 3.3 | 5.5 |
| p = 0.9, A_{27} | 3.8 | 5.1 | 4.1 | 2.5 | 4.4 |
| p = 0.99, A_{25} | 0.0 | 0.48 | 0.22 | 0.01 | 0.13 |
| p = 0.99, A_{26} | 0.0 | 0.4 | 0.2 | 0.0 | 0.13 |
| p = 0.99, A_{27} | 0.0 | 0.25 | 0.18 | 0.0 | 0.09 |
Text values §6.2: UExtVAE gives 0.2% and 0.18% for A_{26}^{(0.99)} and A_{27}^{(0.99)}, against 0.4% and 0.25% in the test set; StdVAE gives no sample in A_{26}^{(0.99)} or A_{27}^{(0.99)}. The learned Danube tail index of UExtVAE is 4.5 §6.2, compared with an external estimate of 3.5 \pm 0.5 for summer months §6.2.
Paper vs code
Official code: the footnote in §5.2 links github.com/Nicolasecl16/ExtVAE.
Because the paper itself links it, it is used as the official repository. Commit
8f00a169cad2e7413e011c945b1de587ba45767a. The repository has no LICENSE file,
so no code is quoted here. The repository contains TensorFlow notebooks
(Training.ipynb, Test.ipynb, ParetoGAN.ipynb), a TensorFlow model file
(Prob_models.py), and a PyTorch re-implementation (models_torch.py,
experiment.py). The README gives a different clone URL, a sibling repository
of the same account [README.md#L11]. The data are not in the repository; the
README points to the Bavarian Environmental Agency [README.md#L21-L25].
Discrepancies, paper first, then code:
- Learned tail-index initialisation: paper samples initial \alpha uniformly on 0.5 to 3 fig. 5; PyTorch code uses 3.5 to 5.5 models_torch.py; the TensorFlow model does the same Prob_models.py.
- Radius encoder width: paper has two hidden layers of 5 units §5.1; PyTorch uses 32 and 32 models_torch.py; TensorFlow uses 5 and 5 Prob_models.py.
- Radius encoder initialisation: paper sets weights to 0 and output biases to uniform 1 to 2 §5.1; PyTorch uses weights uniform 0.01 to 0.02 and output bias uniform 3 to 5.5 models_torch.py.
- Radius decoder: PyTorch implements \alpha_\theta = |g|/z and \beta_\theta = |f|/z^2 with latent u = 1/z, which matches eqs. 11 and 12 models_torch.py. The TensorFlow decoder computes the shape as 1/(\text{linear output}), which is a different functional form Prob_models.py.
- Loss sign: eq. 19 adds the KL term and adds the log-likelihood term. The PyTorch code minimises reconstruction negative log-likelihood plus KL, i.e. the negative ELBO models_torch.py. The angular loss in the paper already uses the ELBO sign (negative KL) eq. 19.
- Radius latent: the code parameterises the posterior and prior of u = 1/z as Gamma distributions and computes the KL in that space models_torch.py models_torch.py models_torch.py. Because u \mapsto 1/u is a bijection, the KL equals the inverse-gamma KL, so this is a reparameterisation, not a discrepancy.
- Radius positivity: paper uses ReLU output heads §5.1; PyTorch applies a ReLU and then |\cdot| + 10^{-3} models_torch.py.
- Latent clamp: the decoder uses 1/(u + 10^{-3}), which bounds z at 1000 models_torch.py. Not stated in the paper.
- Angular encoder: paper has hidden layers of 8, 8 and 4 units §5.1; PyTorch has two hidden layers of 8 units, then a Gaussian output of size 2n models_torch.py. The radius input is scaled by 1/10 models_torch.py; not in the paper.
- Angular decoder: paper has hidden layers of 5, 10 and 5 units §5.1; PyTorch has two hidden layers of 5 and 10 units models_torch.py. Dirichlet output bias is uniform 2 to 3 models_torch.py, paper says 0.5 to 3 §5.1. The 1/(1+r) input matches eqs. 17 and 18 models_torch.py.
- Projected Gaussian likelihood: the Gaussian branch of the PyTorch decoder returns a Gaussian with no L1 projection models_torch.py. A post-hoc normalisation appears in the notebook Test.ipynb. The projected-Gaussian variant used for the Danube results is therefore not in the model code.
- Training hyperparameters: the paper gives Adam, batch 32, at most 5000 epochs, learning rates 10^{-4} and 10^{-5} §5.2. The PyTorch
experiment.pyuses batch 256, learning rate 10^{-3}, 1000 epochs for the radius and 100 epochs for the angle experiment.py experiment.py experiment.py experiment.py experiment.py. The TensorFlow notebooks use batch 32 and 5000 epochs Training.ipynb, with learning rates of 10^{-5} Training.ipynb Training.ipynb, 10^{-3} Training.ipynb, and 10^{-4} in an evaluation cell Test.ipynb. Which setting produced the reported results is not stated. - Synthetic split: the paper uses 250 / 750 / 10 000 §6.1;
experiment.pygenerates 10 000 samples and does not split them that way experiment.py. The generator matches the paper's description: R = 2U \cdot \mathrm{InvGamma}(1.5, 0.6) and the Dirichlet concentrations of app. A.1 data_sampler.py. - Dirichlet targets:
experiment.pyclamps the targets at 10^{-6} and renormalises them experiment.py; the models add 10^{-3} to concentrations models_torch.py. Neither is in the paper.
Remaining items: none found beyond the above. The code was read, not run.
Pitfalls
- Eq. 15 has a typo. The digamma term is printed as \psi(\alpha) but the appendix derivation gives \psi(\alpha_1) with \alpha_1 = \alpha_\phi(r) app. G.5. The standard Gamma KL also takes the posterior shape inside \psi. Implement \psi(\alpha_\phi(r)). The PyTorch code avoids the issue by calling a library KL models_torch.py.
- Eq. 19 signs. Implement the negative ELBO, i.e. KL minus log-likelihood, for both VAEs. Printing
+KLin the radius term would minimise the likelihood. - Remark in §2.2 says to sample a GP variable by multiplying an inverse-gamma with rate \sigma and shape 1/\xi by a unit exponential. The proof in app. G.3 gives \sigma = \beta c/\alpha for scale c. With a unit exponential, the inverse-gamma rate must be \alpha \sigma, not \sigma. Use the proof.
- Positivity of inverse-gamma parameters. The KL in eq. 15 needs \alpha_\phi, \beta_\phi > 0. A ReLU output can be exactly zero, so use |\cdot| + \varepsilon or softplus, as the code does models_torch.py.
- Heavy-tail guarantee depends on both limits of \beta_\theta being proportional to 1/z §4.3. A decoder that satisfies only one end does not carry the guarantee. The |f|/z^2 form does satisfy both.
- Tail-index learning is sensitive to initialisation. The paper's own figure starts from 0.5 to 3 fig. 5, but the code starts from 3.5 to 5.5. Appendix D reports a maximum-likelihood estimate of 1.28 at the 0.8 quantile and 1.67 at the 0.9 quantile on the same training radii app. D, and a Hill plot without a plateau app. D.
- The Danube learned index is 4.5 §6.2. The paper calls this "slightly higher" than 3.5 with a spread of 0.5, which puts 4.5 outside that range. Treat the Danube tail index as uncertain.
- Asymptotic independence is only approximate. Feeding 1/(1+r) makes the angle law constant in the limit, but at finite r the paper selects a threshold with a p-value test §5.3 app. E.3, and reads 0.45 from the plot fig. 8. The paper notes that the threshold for the true data (1.6) and for ExtVAE (1.3) differ §6.1.
- The Dirichlet likelihood needs strictly positive angle components. Zero components give infinite log-density, so clamp or mix with a small uniform, as the code does experiment.py.
- Light-tail proof scope: the marginal result §3.1 assumes piecewise-linear decoder networks, and the proof relies on Lipschitz bounds app. G.1. Smooth activations are not covered. The paper does not state a result for them.
- Wasserstein comparisons use a threshold u and divide by u^2 app. E.2; the value of u used for each figure is not stated.
- Count check for Danube: 730 training and 17 486 test measurements sum to 18 216 days. The paper does not say how missing days were handled §6.2.
- Cross-reference slip: the text points to "Section 4.1" for the ideal multiplicative framework, which is in the intuition subsection of Section 4 (§4.2) §4.3.
- Run-to-run variation is not reported except for the learned \alpha across initial values §6.1. The text says the ParetoGAN experiment was repeated, without a count §6.2.
- This card follows arXiv v2 (updated 2026-01-30), matching the TeX source used for compilation.
Lineage
- Builds on: the VAE [kingma2013auto] (arXiv:1312.6114), the conditional VAE for the angular part [zhao2017learning] (arXiv:1703.10960), and implicit reparameterisation for the inverse-gamma latent [figurnov2018implicit] (Appendix F). Breiman's lemma gives the heavy-tail mechanism §4.2.
- Compared against: the standard Gaussian VAE (StdVAE, §2.1 Example 1) and ParetoGAN [huster2021pareto] (a Wasserstein GAN with a Pareto latent; no card yet).
- Related: a heavy-tailed-latent GAN approach [feder2020nonlinear] and normalizing flows with Student-t latent [jaini2020tails], both named in §3.2; no cards yet.
- Superseded by: not known from wikillm content.
Source and license
Adapted from “A VAE Approach to Sample Multivariate Extremes” by Nicolas Lafon, Philippe Naveau, Ronan Fablet (arXiv:2306.10987), used under CC BY 4.0. Changes: condensed and restructured for implementation, with tables, equations and algorithms taken from the paper and its code, each cited to its source. Not affiliated with or endorsed by the authors. Code citations refer to https://github.com/Nicolasecl16/ExtVAE at commit 8f00a169cad2 (not stated (no LICENSE file in the repository)). Any quoted code is shown under that license.