Improved multimodal variational models capture more complex joint distributions.
problem Limited expressiveness of multimodal variational models.
method Used normalizing flows to approximate and transform a simple parametric joint posterior into a more complex one.
result The model improves on state-of-the-art multimodal variational methods on various tasks.
Evidential Softmax preserves multimodality in sparse probability distributions for generative models.
problem Sparse probability distributions in deep generative models make exact marginalization computationally intractable.
method Introduce ev-softmax, a sparse normalization function that preserves multimodality and can be trained with probabilistic loss functions.
result ev-softmax outperforms existing techniques in distributional accuracy and dimensionality reduction.
Hybrid model for multimodal distributions using diffusion and classification.
problem Sampling from multimodal distributions with correct proportions.
method Divide-and-conquer strategy: identify modes, train classifiers, diffusion models, bridge sampling.
result Framework effectively handles multimodal distributions in high dimensions.
New method for risk allocation under multimodality of loss distribution.
problem Risk assessment under multimodal conditional loss distribution.
method Maximum Likelihood Allocation (MLA) and multimodality adjustment.
result Multimodality adjustment improves soundness of risk allocations.
BSVGD improves sampling for multimodal distributions using branching.
problem Sampling from multimodal distributions.
method Random branching in Stein Variational Gradient Descent (SVGD).
result Theoretical convergence guarantee and empirical validation.
Proposes a method to improve SLMC for multimodal distributions.
problem Difficulty of applying SLMC to multimodal distributions.
method Parallel adaptive annealing with VAE-SLMC.
result Can proficiently obtain accurate samples from multimodal distributions.
Generative Stochastic Networks (GSNs) have been recently introduced as an alternative to traditional probabilistic modeling: instead of parametrizing the data distribution directly, one parametrizes a transition operator for a Markov chain whose stationary distribution is an estimator of the data generating distributio…
New bounds for SMC show its advantage over MCMC in multimodal distributions.
problem Estimating expectations under multimodal distributions with slow global mixing.
method Proves finite sample complexities for SMC with local mixing times, addressing bias through sequential resampling.
result SMC provides fully polynomial time approximation for multimodal problems.
New method improves sampling from complex, multi-peaked distributions.
problem Sampling from high-dimensional, multimodal distributions using HMC.
method Combines tempered HMC with automatic tuning strategies.
result Demonstrates more effective scaling with dimension than adaptive methods.
Unified approach for multimodal data prediction using synthetic data generation.
problem Challenges in integrating heterogeneous data types for accurate predictive performance.
method Generative Distribution Prediction (GDP) framework that uses multimodal synthetic data generation.
result Empirical validation across four tasks demonstrates versatility and effectiveness of GDP.
Push-forward models struggle to fit multimodal distributions due to high Lipschitz constants.
problem Expressivity of push-forward generative models in fitting multimodal distributions.
method Analyzing the Lipschitz constant and its relation to the total variation distance and Kullback-Leibler divergence.
result Push-forward models require high Lipschitz constants to approximate multimodal distributions, leading to a trade-off between expressivity and stability.
Gradient-based meta-learners such as MAML are able to learn a meta-prior from similar tasks to adapt to novel tasks from the same distribution with few gradient updates. One important limitation of such frameworks is that they seek a common initialization shared across the entire task distribution, substantially limiti…
Survey of multimodal deep generative models for diverse data types.
problem Inference of shared representations and cross-modal generation from heterogeneous multimodal data.
method Variational autoencoders and other deep generative models.
result A comprehensive survey of multimodal deep generative models.
Proposes a multimodal deep generative model for semi-supervised learning with class imbalance.
problem Class imbalance in semi-supervised learning with partial supervision.
method Separate encoders for each modality, sharing latent variables, and using Student's t-distributions for prior, encoder, and decoder.
result Outperforms baseline methods in generalization and classification performance for partially labeled multimodal data.
A new objective function using Jensen-Shannon divergence improves generative learning from multiple data types.
problem Learning from multiple data types efficiently and accurately.
method Proposes a novel objective function using Jensen-Shannon divergence to approximate multimodal posteriors directly.
result The mmJSD objective optimizes an ELBO and improves generative learning tasks.
Stacking improves inference for multimodal Bayesian posterior distributions.
problem Difficulty of MCMC in moving between modes and underestimation of posterior uncertainty.
method Parallel runs of MCMC, variational, or mode-based inference, combined using Bayesian stacking.
result Stacking efficiently samples from multimodal posterior distributions and represents uncertainty better than variational inference.
A new method called TemperFlow tackles multimodality in sampling from unnormalized distributions.
problem Sampling from unnormalized distributions with isolated modes.
method TemperFlow learns a sequence of tempered distributions to progressively approach the target distribution.
result TemperFlow overcomes the limitations of existing methods and achieves superior performance.
Recent advances in stochastic gradient techniques have made it possible to estimate posterior distributions from large datasets via Markov Chain Monte Carlo (MCMC). However, when the target posterior is multimodal, mixing performance is often poor. This results in inadequate exploration of the posterior distribution. A…
Adaptive sampling for multimodal distributions converges faster than classical methods.
problem Sampling from multimodal distributions efficiently.
method Adaptive linear dynamics with adaptive diffusion coefficients and vector fields, interpreted as weighted Wasserstein gradient flows.
result Derivative-free dynamics can achieve significantly faster convergence for nonconvex potentials.
GGMPs improve non-Gaussian conditional density estimation.
problem Multimodality, heteroscedasticity, and strong non-Gaussianity in conditional density estimation.
method GGMP combines local Gaussian mixture fitting, cross-input component alignment, and per-component heteroscedastic GP training.
result GGMPs improve distributional approximation on synthetic and real-world datasets.
Proposes an automatic cyclical scheduling for gradient-based discrete sampling.
problem Gradient-based sampling in high-dimensional models can get stuck in local modes.
method Cyclical step size and balancing schedules with automatic hyperparameter tuning.
result Proves non-asymptotic convergence and inference guarantees for general discrete distributions.
Enhances gradient-based discrete samplers with parallel tempering for multimodal distributions.
problem Local minima in high-dimensional, multimodal discrete distributions.
method Combines parallel tempering with discrete Langevin proposal, using Metropolis criterion for swaps.
result Significantly faster mixing and better sampling from complex distributions.
Word embeddings provide point representations of words containing useful semantic information. We introduce multimodal word distributions formed from Gaussian mixtures, for multiple word meanings, entailment, and rich uncertainty information. To learn these distributions, we propose an energy-based max-margin objective…
Hybrid method improves sampling from multimodal distributions.
problem Sampling from multimodal posterior distributions efficiently.
method Jump-Diffusion Langevin Dynamics hybrid with Metropolis.
result Calibrated hybrid method outperforms pure methods.
MHVAE learns cross-modality inference inspired by human cognition.
problem Cross-modality inference in multimodal data.
method Hierarchical multimodal generative model with modality-specific and joint-modality distributions.
result MHVAE performs on par with state-of-the-art models on multimodal datasets.
The complex world around us is inherently multimodal and sequential (continuous). Information is scattered across different modalities and requires multiple continuous sensors to be captured. As machine learning leaps towards better generalization to real world, multimodal sequential learning becomes a fundamental rese…
New ELBO formulation improves multimodal learning.
problem Existing ELBO models struggle with multimodal data.
method Proposes a generalized ELBO for multimodal data.
result Demonstrates improved performance over state-of-the-art models.
Proposes a copula-driven framework for multimodal learning.
problem Aligning and fusing representations from multiple modalities with complex interactions.
method Copula model for joint distribution of modalities, Gaussian mixture for marginal distributions.
result Superior performance on public MIMIC datasets.
New model improves multimodal autoencoders by learning joint and conditional distributions.
problem Limitations in recent multimodal autoencoders restrict their quality on complex datasets.
method Proposes a multistage training process with variational inference and Normalizing Flows, leveraging shared modality information.
result Achieves state-of-the-art results on benchmark datasets.
Model-agnostic meta-learners aim to acquire meta-learned parameters from similar tasks to adapt to novel tasks from the same distribution with few gradient updates. With the flexibility in the choice of models, those frameworks demonstrate appealing performance on a variety of domains such as few-shot image classificat…
An infinite parallel tempering bouncy particle sampler improves sampling efficiency for multimodal distributions.
problem Sampling from complex posterior distributions with high accuracy and efficiency.
method Introduced an infinite parallel tempering bouncy particle sampler (BPS-PT) to accelerate convergence.
result Demonstrated improved sampling efficiency for multimodal distributions through numerical simulations.
This paper applies quantum probability theory to model asset returns, avoiding assumptions about quantum effects.
problem Modeling asset returns with classical probability theory.
method Derives a Schrödinger-like trading equation using quantum probability, linking it to traders' decisions and market behaviors.
result Quantum probability can describe multimodal distributions of asset returns without assuming quantum effects.
Estimates interactions between modalities for multimodal data.
problem Accurately quantifying interactions between different data types.
method Developed Lightweight Sample-wise Multimodal Interaction (LSMI) estimator using pointwise information theory.
result LSMI reveals fine-grained dynamics in multimodal data.
In this paper we study how to learn stochastic, multimodal transition dynamics in reinforcement learning (RL) tasks. We focus on evaluating transition function estimation, while we defer planning over this model to future work. Stochasticity is a fundamental property of many task environments. However, discriminative f…
This paper strengthens the computational separation between multimodal and unimodal learning, showing unimodal learning is hard on typical instances.
problem Theoretical justification for empirical success of multimodal machine learning.
method Introduced a stronger average-case computational separation between unimodal and multimodal learning.
result For typical instances, unimodal learning is computationally hard, while multimodal learning is easy.
Efficiently samples multimodal distributions using data-based initialization.
problem Sampling multimodal distributions with limited samples.
method Data-based initialization for Markov chains with spectral gap.
result Efficiently generates samples close to stationary distribution.
RAHMC improves sampling from multimodal distributions using dissipative dynamics.
problem Sampling from multimodal distributions efficiently.
method RAHMC uses mode-repelling and mode-attracting stages with a single tuning parameter.
result RAHMC generates proposals that cross low-probability barriers efficiently.
This study compares two methods for sampling with transport maps, finding flow-based proposals work better for multimodal distributions.
problem Sampling from distributions with complex geometries.
method Compares two approaches: (i) proposal draws from the flow and (ii) reparametrization.
result Flow-based proposals are more effective for multimodal distributions in high dimensions, while reparametrization methods are more robust in other scenarios.
Bayesian VFLMSP improves multimodal survival prediction with privacy.
problem Privacy and reliability in multimodal time-to-event prediction.
method Bayesian Vertical Federated Learning (VFL) with differential privacy.
result Consistent improvements in C-index compared to existing methods.
Graph Mixture Density Networks model multimodal data on graphs.
problem Challenging conditional density estimation problems with structured data.
method Combining mixture models and graph representation learning.
result Significant improvement in likelihood of epidemic outcomes.
Cyclical MCMC tackles high-dimensional multimodal distributions, showing convergence under certain conditions.
problem High-dimensional multimodal posterior distributions in deep learning.
method Cyclical MCMC framework that tracks tempered versions of the target distribution over time.
result Cyclical MCMC converges to the target distribution under fast mixing kernels but fails in slow mixing cases.
CQNPs enhance predictive performance and distribution modeling using quantile regression.
problem Limited predictive likelihood of Gaussian models for complex distributions.
method Introducing Conditional Quantile Neural Processes (CQNPs) that focus on estimating informative quantiles.
result Significant improvements in predictive performance and better modeling of multimodal distributions.
DAM improves cryptocurrency trend forecasting using multimodal data.
problem Simplistic merging of sentiment data in cryptocurrency trend forecasting.
method Dual Attention Mechanism (DAM) integrating financial metrics and sentiment analysis.
result DAM outperforms conventional models by up to 20% in prediction accuracy.
CHMC improves HMC efficiency for multimodal distributions.
problem Slow convergence of HMC in multimodal distributions.
method Integrates a counterdiabatic term to optimize Hamiltonian changes.
result CHMC achieves efficient sampling from challenging distributions.
DDSME outperforms SME in estimating multimodal distributions.
problem Efficiency of score matching in multimodal distributions.
method Diffusion-based denoising score matching (DDSME) compared to vanilla score matching (SME).
result DDSME avoids the error bound deterioration of SME with increasing mode separation.
New method accelerates Parallel Tempering using neural samplers.
problem Challenges in sampling from high-dimensional, multimodal distributions.
method Leverages neural samplers to reduce overlap between distributions.
result Improves sample quality and reduces computational cost.
Proposes hinge-Wasserstein to improve uncertainty estimation in regression tasks.
problem Estimating multimodal aleatoric uncertainty in regression tasks from images.
method Regression-by-classification paradigm with hinge-Wasserstein loss.
result Hinge-Wasserstein loss improves uncertainty estimation on challenging tasks.
BDSG generates samples on distribution boundaries, improving anomaly detection.
problem Difficulty in capturing multimodal supports and approximating distribution tails.
method Invertible Residual Network (IResNet) and Residual Flow (ResFlow) for density estimation; compound loss function for boundary samples.
result Competitive performance on synthetic and multimodal data compared to existing methods.