New Bayesian method for joint sparse parameter inference.
problem Inference of jointly sparse parameter vectors from multiple measurements.
method Hierarchical Bayesian learning with joint sparsity-promoting priors.
result New algorithms consistently outperform existing methods in numerical experiments.
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.
The paper bounds and identifies joint probabilities in causal inference with monotonicity assumptions.
problem Bounding and identifying joint probabilities of potential outcomes and observed variables under monotonicity assumptions.
method Proposes new families of monotonicity assumptions, formulates bounding problem as linear programming, introduces new monotonicity assumption for identification.
result Validated methods through numerical experiments and applied to real-world datasets.
Estimates joint causal effects using single-variable interventions on nonlinear models.
problem Estimating joint causal effects from single-variable interventions.
method Identifiability result and practical estimator for decomposing causal effects.
result Joint effects can be inferred without joint interventional data for nonlinear additive models.
Efficiently combines autoregressive and set-based models for joint distributions.
problem Joint distributions over multiple predictions from set-based models.
method Causal autoregressive buffer that caches context and captures dependencies.
result Up to 20x faster joint sampling and density evaluation, up to 7x lower memory usage.
New methods improve Bayesian inference and decision-making in online learning.
problem Current Bayesian deep learning does not fully utilize joint predictives for sequential decision-making.
method Proposes new evaluation settings for active learning and active sampling, focusing on marginal and joint cross-entropies.
result Initial experiments suggest challenges in applying current BDL inference techniques in high-dimensional spaces.
Agents learn and control complex mechanical systems through shared memories.
problem Controlling multi-joint dynamical systems.
method Coupled autoregressive active inference agents using Bayesian filtering and minimizing expected free energy.
result Demonstrated learning and control of a double mass-spring-damper system.
Estimates network topologies from shared graphon models across different networks.
problem Estimating the topology of multiple networks from nodal observations.
method Combining maximum likelihood penalty with graphon estimation schemes.
result Validated performance against competing methods in synthetic and real-world datasets.
This paper presents a Bayesian method for estimating the rank of a low-rank tensor model of joint PMF.
problem Estimating the rank of a low-rank tensor model of joint PMF from observed data.
method Bayesian framework for estimating low-rank components and rank simultaneously, using variational inference.
result Automatic rank detection and improved estimation accuracy compared to cross-validation methods.
New method reduces inference variance for faster optimization.
problem High variance in black-box variational inference.
method Joint control variate addressing both data subsampling and Monte Carlo noise.
result Significantly reduced gradient variance, leading to faster optimization.
We present a non-parametric prognostic framework for individualized event prediction based on joint modeling of both longitudinal and time-to-event data. Our approach exploits a multivariate Gaussian convolution process (MGCP) to model the evolution of longitudinal signals and a Cox model to map time-to-event data with…
VPP learns joint policies for multi-agent RL through interactions.
problem Learning effective joint policies for multi-agent reinforcement learning.
method VPP integrates variational inference into policy layers for efficient sampling and differentiability.
result VPP outperforms previous methods on large-scale multi-agent tasks.
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.
Surveying joint Gaussian graphical models to identify shared structures across domains.
problem Estimating shared structures across different data sources.
method Statistical inference of joint Gaussian graphical models.
result Improved estimation power for high-dimensional data.
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.
New method optimizes sensor placement for stochastic systems efficiently.
problem Optimizing sensor placements for black-box stochastic systems with computational constraints.
method Trains a joint energy-based model on simulation data to learn parameter and solution distributions, allowing efficient sensor placement.
result Demonstrates lower computational cost and more informative sensor locations compared to conventional approaches.
We introduce the adversarially learned inference (ALI) model, which jointly learns a generation network and an inference network using an adversarial process. The generation network maps samples from stochastic latent variables to the data space while the inference network maps training examples in data space to the sp…
Cooperation information sharing is important to theories of human learning and has potential implications for machine learning. Prior work derived conditions for achieving optimal Cooperative Inference given strong, relatively restrictive assumptions. We relax these assumptions by demonstrating convergence for any disc…
New method detects and analyzes correlation in multiple network data.
problem Detecting and analyzing correlation in multiple network data.
method Generalized omnibus embedding methodology.
result Induced correlation can significantly extend the reach of spectral inference procedures.
A new framework for efficient Bayesian network inference.
problem High-dimensional Bayesian networks are hard to infer due to computational scaling.
method Directed convex subgraphs and minimal d-decomposition tree for decomposition, enabling parallel computation.
result The method reduces computational cost and enables parallel computation.
This work optimizes induced correlation in joint graph embeddings.
problem Optimizing correlation across embedded networks in joint graph embeddings.
method Developed corr2Omni algorithm to estimate optimal Omnibus weights.
result corr2Omni algorithm improves inference fidelity compared to classical Omnibus construction.
Causal discovery predicts unobserved joint statistics from observed data.
problem Inferring properties of unobserved joint distributions from observed data.
method Infer causal models from observed data to predict statistical properties of unobserved sets.
result Sparse causal graphs can be more useful than dense ones in predicting unobserved joint distributions.
Study improves probabilistic circuits using transformations for better predictions.
problem Predictive limitations of probabilistic circuits in robotic scenarios.
method Integrates transformations into joint probability trees, extending their capabilities.
result Achieves higher likelihoods with fewer parameters on various data sets.
New method uses joint stochastic approximation to improve learning of discrete latent models.
problem Challenges in learning discrete latent variable models, especially with inference model gradients and log-likelihood optimization.
method Proposes a new method based on stochastic approximation theory that directly maximizes the target log-likelihood and minimizes the posterior-inference model divergence.
result Consistently outperforms recent competitive algorithms in generative modeling and structured prediction tasks.
We formalize the problem of learning interdomain correspondences in the absence of paired data as Bayesian inference in a latent variable model (LVM), where one seeks the underlying hidden representations of entities from one domain as entities from the other domain. First, we introduce implicit latent variable models,…
We tackle the problem of inferring node labels in a partially labeled graph where each node in the graph has multiple label types and each label type has a large number of possible labels. Our primary example, and the focus of this paper, is the joint inference of label types such as hometown, current city, and employe…
Graphical models help infer domain adaptation across unknown distributions.
problem Unknown changes in joint distribution across domains.
method Use graphical models to encode and infer changes in data distribution.
result Automated domain adaptation framework improves posterior inference of target variable.
Simulators often provide the best description of real-world phenomena. However, they also lead to challenging inverse problems because the density they implicitly define is often intractable. We present a new suite of simulation-based inference techniques that go beyond the traditional Approximate Bayesian Computation …
This paper offers a simple method for Bayesian regression with unknown transformations.
problem Joint inference of unknown transformations and model parameters in Bayesian regression is computationally inefficient and cumbersome.
method The paper introduces a Bayesian nonparametric model via the Bayesian bootstrap to directly target the posterior distribution of the transformation.
result The approach delivers joint posterior consistency and efficient Monte Carlo inference for the transformation and all parameters.
DiBS learns Bayesian network structure and parameters efficiently.
problem Bayesian structure learning with uncertainty reasoning.
method Differentiable framework for continuous latent graph representation, agnostic to local conditional distributions.
result Significantly outperforms related approaches in posterior inference.
This paper proposes the divergence triangle as a framework for joint training of generator model, energy-based model and inference model. The divergence triangle is a compact and symmetric (anti-symmetric) objective function that seamlessly integrates variational learning, adversarial learning, wake-sleep algorithm, an…
A new framework models multi-state events and biomarkers.
problem Limited representation of complex multi-state trajectories.
method General multi-state joint modeling framework.
result Accurate parameter recovery and personalized predictions.
We consider Bayesian inference problems with computationally intensive likelihood functions. We propose a Gaussian process (GP) based method to approximate the joint distribution of the unknown parameters and the data. In particular, we write the joint density approximately as a product of an approximate posterior dens…
Framework synthesizes programs for simulating complex models and estimating parameters.
problem Parameter estimation for complex models requires manual encoding of fixed model structures.
method Combines LLMs for program synthesis with neural simulation-based inference.
result Identifies plausible model families from open-ended prompts with high accuracy.
We extend recent work (Brehmer, et. al., 2018) that use neural networks as surrogate models for likelihood-free inference. As in the previous work, we exploit the fact that the joint likelihood ratio and joint score, conditioned on both observed and latent variables, can often be extracted from an implicit generative m…
Variational dropout (VD) is a generalization of Gaussian dropout, which aims at inferring the posterior of network weights based on a log-uniform prior on them to learn these weights as well as dropout rate simultaneously. The log-uniform prior not only interprets the regularization capacity of Gaussian dropout in netw…
A new method infers graph structure and parameters using a single generative flow network.
problem Bayesian Network structure and parameter inference from data.
method Single GFlowNet with two-phase sampling: DAG generation followed by parameter assignment.
result Accurate approximation of joint posterior distribution over graph structure and parameters.
Existing model-based reinforcement learning methods often study perception modeling and decision making separately. We introduce joint Perception and Control as Inference (PCI), a general framework to combine perception and control for partially observable environments through Bayesian inference. Based on the fact that…
Diffusion models enhance SBI with flexible parameter and observation learning.
problem Efficient and accurate estimation of latent parameters from simulations and real data.
method Score-based diffusion models, guidance, score composition, flow matching, consistency models, joint modeling.
result Flexibility and versatility in modeling various problems.
Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.
problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.
In this paper, we introduce a new form of amortized variational inference by using the forward KL divergence in a joint-contrastive variational loss. The resulting forward amortized variational inference is a likelihood-free method as its gradient can be sampled without bias and without requiring any evaluation of eith…
Bayesian models that mix multiple Dirichlet prior parameters, called Multi-Dirichlet priors (MD) in this paper, are gaining popularity. Inferring mixing weights and parameters of mixed prior distributions seems tricky, as sums over Dirichlet parameters complicate the joint distribution of model parameters. This paper s…
I consider two problems in machine learning and statistics: the problem of estimating the joint probability density of a collection of random variables, known as density estimation, and the problem of inferring model parameters when their likelihood is intractable, known as likelihood-free inference. The contribution o…
Estimates multiple networks using graphons for non-aligned graphs.
problem Estimating topology of multiple networks from nodal observations.
method Combining maximum likelihood penalty with graphon estimation schemes.
result Validated performance against competing methods in synthetic and real-world datasets.
APQ jointly optimizes neural architecture, pruning, and quantization for efficient inference.
problem Efficient deep learning inference on resource-constrained hardware.
method Joint optimization of neural architecture, pruning, and quantization policy using a quantization-aware accuracy predictor.
result Joint optimization leads to 2.3% higher ImageNet accuracy with reduced latency and energy consumption.
The paper proposes a method to estimate joint probability from unpaired data using entropic transport kernels.
problem Estimating joint probability from unpaired data with unknown internal ordering.
method Maximum-likelihood inference, entropic optimal transport kernels, EMML algorithm.
result The method can recover true density from empirical approximations as the number of blocks increases.
We present a novel approximate graph matching algorithm that incorporates seeded data into the graph matching paradigm. Our Joint Optimization of Fidelity and Commensurability (JOFC) algorithm embeds two graphs into a common Euclidean space where the matching inference task can be performed. Through real and simulated …
Bayesian method infers contextual bandit policies robustly.
problem Inference of contextual bandit policies in small sample sizes.
method Empirical likelihood for Bayesian inference.
result Accurate uncertainty measurements and policy comparison.