Structured Dimension-Matched Joint Variational Transdimensional Inference
Bayesian model selection couples a discrete model indicator with a model-specific continuous parameter space. We introduce structured dimension-matched variational transdimensional inference (SM-VTI) for finite enumerable model spaces. A rooted construction graph expresses a model as a sequence of local stop/child decisions. Each typed edge compiles a declared scientific parent-child edit into an exact native-coordinate dimension-matching lifting; an edge-conditioned flow then learns the residual continuous transport. The resulting local policy and conditional flow define one direct joint variational distribution, without embedding every model in a saturated maximum-dimensional surrogate. We derive its exact path density and optimize the joint reverse-KL objective. On a controlled 15-model target, SM-VTI-Joint recovers terminal masses, local actions, and nonlinear conditional geometry. On a 128-model misspecified robust variable-selection problem, a 10-data-set nearly parameter-matched affine comparison with AVTI shows stronger early model-mass recovery and competitive final joint accuracy under the same target-evaluation budget.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Amortized variational transdimensional inference
The expressiveness of flow-based models combined with stochastic variational inference (SVI) has, in recent years, expanded the application of optimization-based Bayesian inference to include problems with complex data r…
Bayesian InferenceBayesian OptimizationVariational InferenceStructured Semi-Implicit Variational Inference
In this work we construct flexible joint distributions from low-dimensional conditional semi-implicit distributions. Explicitly defining the structure of the approximation allows to make the variational lower bound tight…
Variational InferenceLearning Correlated Latent Representations with Adaptive Priors
Variational Auto-Encoders (VAEs) have been widely applied for learning compact, low-dimensional latent representations of high-dimensional data. When the correlation structure among data points is available, previous wor…
ClusteringLink PredictionImproved far-field speech recognition using Joint Variational Autoencoder
Automatic Speech Recognition (ASR) systems suffer considerably when source speech is corrupted with noise or room impulse responses (RIR). Typically, speech enhancement is applied in both mismatched and matched scenario …
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)DenoisingSpeech Enhancement+2Tensor Matched Kronecker-Structured Subspace Detection for Missing Information
We consider the problem of detecting whether a tensor signal having many missing entities lies within a given low dimensional Kronecker-Structured (KS) subspace. This is a matched subspace detection problem. Tensor match…