arXiv:2607. 23480v1 Announce Type: new Abstract: Variational autoencoders (VAEs) transform high-dimensional, often noisy data into a compact latent representation, making downstream optimization more tractable.
arXiv:2111. 10722v4 Announce Type: replace-cross Abstract: We propose a novel deterministic sampling method, EVI-MMD, to approximate a target distribution $\rho^*$ by minimizing the kernel discrepancy, also known as the Maximum Mean Discrepancy (MMD).
arXiv:2607. 03809v1 Announce Type: new Abstract: Normalising flows provide a powerful variational family for approximate inference, yet individual architectures often fail to generalise across heterogeneous posterior geometries.
arXiv:2304.06522v3 Announce Type: replace-cross Abstract: Signal extraction is difficult when the number of variables $N$ is much larger than the number of observations $M$. We address this problem u...
arXiv:2608. 25138v1 Announce Type: new Abstract: Stochastic masking, cropping, or modality removal makes deterministic reconstruction an incomplete target: one observation can admit many clean completions.
arXiv:2607. 16811v4 Announce Type: replace Abstract: Drift detectors that work tend not to explain themselves, and drift detectors that explain themselves tend to fail in high dimension.
arXiv:2510. 12744v2 Announce Type: replace-cross Abstract: We develop a unified statistical framework for softmax-gated Gaussian mixture of experts (SGMoE) that addresses three long-standing obstacles in parameter estimation and model selection: (i) non-identifiability of gating parameters up to common translations, (ii) intrinsic gate-expert interactions that induce coupled differential relations in the likelihood, and (iii) the tight numerator-denominator coupling in the softmax-induced conditional density.
GRALIS (Gradient‑Riesz Averaged Locally‑Integrated Shapley) merges coalition‑based and gradient‑based post‑hoc XAI techniques into a single estimator. It provides two certified guarantees: an exact closed‑form completeness deficit and a finite‑sample bound on the self‑normalized ratio. The method is grounded in a representation‑theoretic result that uniquely characterizes additive, linear, continuous attribution functionals, and it is experimentally illustrated on breast histology imaging.
FB‑GDM is a fully‑Bayesian guided diffusion method that eliminates the need for task‑specific hyperparameter tuning in linear inverse problems. It derives a closed‑form conditional score from a Gaussian approximation of ΦGDM, treating two precision parameters as latent variables inferred via variational inference at each reverse step. Experiments on CelebA‑HQ show that FB‑GDM outperforms ΦGDM at its nominal setting, matches a ground‑truth‑calibrated oracle within 0.1 dB, and remains robust to changes in the forward operator, noise level, or image distribution without hallucinations.
arXiv:2507.20459v2 Announce Type: replace-cross Abstract: With direct computation of moments through order $L$ in $d$ dimensions, standard method of moments (MM) incurs $\Omega(d^L)$ computation and...
The paper introduces a highly efficient variational approximation for Gaussian Mixture Models (GMMs) with arbitrary covariances, integrated with mixtures of factor analyzers. This method reduces the per‑iteration runtime from ≠O(NCD^2) to a complexity that scales linearly with dimensionality D and sublinearly with the product NC. Experiments demonstrate sublinear scaling across the entire optimization, order‑of‑magnitude speed‑ups on large benchmarks, training of GMMs with over 10 billion parameters in under nine hours on a single CPU, and competitive zero‑shot image denoising performance.
arXiv:2607.10912v2 Announce Type: replace Abstract: 3D Gaussian Splatting represents scenes as finite mixtures of anisotropic Gaussians whose number of components $K$ is set by heuristic density cont...