A new method for efficient probabilistic meta-learning.
problem High-quality predictions with well-calibrated uncertainty estimates require large amounts of data.
method Amortised Inference in Bayesian Neural Networks (APOVI-BNN)
result The APOVI-BNN produces high-quality predictions with well-calibrated uncertainty estimates using significantly less data.
Meta-learn Bayesian inference for task-specific BNNs using amortised inference.
problem Efficiently learning Bayesian inference for small-scale probabilistic meta-learning.
method Replace global inducing points with actual data to create a set of approximate likelihoods, train a meta-model to learn these parameters across related datasets.
result Meta-learned inference can be applied to task-specific BNNs, improving efficiency and scalability.
New method improves generative model performance by fully conditioning variational posteriors.
problem Inaccurate inference due to partial conditioning of variational posteriors in sequential LVMs.
method Introduces fully-conditioned approximate posteriors to improve generative model performance.
result Improves generative modelling and multi-step prediction performance.
A new method learns latent variable updates directly, not approximating the posterior.
problem Intractable maximum-likelihood learning for complex latent-variable models.
method Amortised learning using wake-sleep Monte-Carlo strategy.
result Demonstrated effectiveness on various complex models.
POLAR learns efficient data acquisition policies using pretrained belief representations.
problem Challenges in learning effective policies for adaptive data acquisition.
method POLAR decouples representation learning from policy learning by leveraging pretrained predictive foundation models as belief-state encoders.
result POLAR outperforms state-of-the-art methods across diverse tasks while requiring fewer training samples.
Novel method uses MCMC to improve approximation networks.
problem Approximating complex, intractable distributions.
method Amortized MCMC with iterative refinement of approximation network.
result Improved quality of deep generative model training.
Paper proposes a new method for sampling from complex distributions.
problem Sampling from unnormalised density functions in complex distributions.
method Combines amortised and particle-based methods with reinforcement learning.
result Improves sampling from complex distributions compared to existing methods.
Efficiently computes empowerment for real-time control in complex systems.
problem Computing empowerment in nonlinear continuous spaces is hard and impractical for real-time control.
method Introduces an efficient, amortised method for learning empowerment-maximising policies.
result Demonstrates reliable handling of continuous dynamical systems using learned system dynamics.
Capsule models enforce object pose relationships for robustness, explored with probabilistic generative and variational methods.
problem Enforcing object pose relationships for robustness to viewpoint changes.
method Probabilistic generative model with variational bound, exploring capsule assumptions and inference mechanisms.
result Unified objective and test time optimisation demonstrated for capsule models.
New methods improve uncertainty explanations for models.
problem Improving interpretation of uncertainty estimates from probabilistic models.
method Developed new methods to generate diverse and global explanations for uncertain model predictions.
result Generated diverse and global explanations for uncertain model predictions, addressing previous limitations.
UM trains a neural network to approximate marginal distributions in probabilistic programs.
problem High computational cost and lack of theoretical guarantees in inference methods for probabilistic programs.
method Combining samples from a probabilistic program prior with an augmentation method to train a neural network for any conditional marginal distribution.
result UM trains a single neural network to approximate any conditional marginal distribution, amortizing inference costs.
The paper reclassifies RL algorithms using inference concepts.
problem To provide a unified perspective on RL algorithms.
method Using the control as inference framework, the paper classifies RL algorithms as amortised and iterative inference.
result A wide range of RL algorithms can be classified in this new manner.
Unified reinforcement learning methods using hybrid inference.
problem Combining model-based and model-free reinforcement learning approaches.
method Control as Hybrid Inference (CHI) framework.
result CHI algorithm balances model-based and model-free learning.
New method for image super-resolution using MAP inference with neural networks.
problem Underdetermined image super-resolution problem with blurry outputs.
method Amortised MAP inference using convolutional neural networks.
result GAN-based approach performs best on real image data.
New method learns priors for Bayesian neural networks from datasets.
problem Lack of prior beliefs in Bayesian deep learning.
method Amortised variational inference to learn priors from datasets.
result Flexible Bayesian neural networks for meta-learning and within-task minibatching.
New method improves robustness and efficiency of inference from complex models.
problem Inability of existing methods to handle outliers in simulator-based models.
method Generalised Bayesian inference with neural approximation of weighted score-matching loss.
result Provable robustness to outliers and computational efficiency.
Flexible Bayesian inference for complex dynamical systems.
problem Bayesian inference for nonlinear, hierarchical dynamical systems.
method Stochastic optimisation of a variational autoencoder for ODE dynamics.
result Efficient scaling to large datasets and interpretability.
Paper introduces RVNP to improve SBI in misspecified models.
problem Misspecification in simulation-based inference leads to unreliable posterior estimation.
method RVNP uses variational inference and error modeling to bridge the simulation-to-reality gap.
result RVNP can recover robust posterior inference without hyperparameters or priors.
UM-IS combines neural networks and importance sampling for efficient probabilistic inference.
problem High computational cost and lack of theoretical guarantees in probabilistic inference.
method Hybrid inference scheme combining neural networks and importance sampling.
result UM-IS outperforms sampling-based methods in efficiency and accuracy.
This work trains GFlowNets using information geometry, improving inference efficiency.
problem Efficient inference over discrete and mixed objects with GFlowNets.
method Formulates forward-policy training through the Fisher-Rao metric of trajectory families.
result Derives exact decomposition of trajectory Fisher and identifies computational regimes.
New method uses path signatures for efficient likelihood estimation in time-series data.
problem Intractable likelihood functions in complex dynamic models.
method Kernel classifier based on path signatures for sequential data.
result Path signatures yield highly performant classifiers, even with low sample numbers.
GENESIS generates and samples 3D scenes by capturing object interactions.
problem Lack of models that explicitly capture object interactions in scene generation.
method Object-centric latent variables, spatial GMM, amortized inference, autoregressive prior.
result First object-centric generative model of 3D visual scenes.
Warm starts improve Gaussian process regression by up to 16x.
problem Optimizing hyperparameters for Gaussian processes.
method Iterative Gaussian processes with warm start optimization.
result Warm starts achieve the same results as conventional methods but significantly speed up computations.
Proposes a method to learn conditional VAEs from datasets with missing covariates.
problem Learning conditional VAEs from datasets with missing covariates.
method Augments conditional VAEs with a prior distribution for missing covariates and estimates their posterior using amortised variational inference.
result The proposed method outperforms previous methods in learning conditional VAEs from non-temporal, temporal, and longitudinal datasets.
New analysis for learning and applying preconditioners in MCMC improves efficiency.
problem Improving efficiency of MCMC algorithms by modifying them with preconditioners.
method Analyzes and compares computational costs of MCMC schemes with and without preconditioners.
result Establishes non-asymptotic guarantees for MCMC algorithms that learn and use preconditioners.
Analyzes learning and applying preconditioners in MCMC for efficiency.
problem Improving efficiency of MCMC algorithms.
method Non-asymptotic analysis of schemes that learn preconditioners.
result Established non-asymptotic guarantees for preconditioned ULA.
New method uses neural networks to infer dark matter subhalo abundance from stellar streams.
problem Constrain warm dark matter mass using stellar streams.
method Amortized Approximate Likelihood Ratios (AALR) for likelihood-free Bayesian inference.
result Demonstrates effectiveness of new method for estimating dark matter subhalo abundance.
A new method for Bayesian inference using diffusion models.
problem Bayesian inference in simulator-based models.
method Score-based diffusion models trained with a sequential training procedure.
result Comparable or superior performance compared to existing methods.
GATSBI uses GANs for SBI, improving posterior estimation in high dimensions.
problem Statistical inference on stochastic models without likelihoods.
method Adversarial approach to variational objective, amortized inference, implicit priors.
result GATSBI returns well-calibrated posterior estimates in high dimensions.
Flexible model tackles high-dimensional, missing data, and stochastic processes.
problem High-dimensional longitudinal data with structured missingness and unknown measurement time points.
method Latent variable model using Gaussian processes and variational autoencoder.
result Competitive performance on simulated and real datasets.
Neural point estimators improve parameter estimation from replicated data.
problem Making inference from replicated data in weakly-identified and highly-parameterised models.
method Permutation-invariant neural networks for likelihood-free parameter estimation.
result Neural point estimators can quickly and optimally estimate parameters.
The paper speeds up hyperparameter optimisation in Gaussian processes.
problem Scaling hyperparameter optimisation to large datasets.
method Improvements to linear system solvers (pathwise gradient, warm starting, early stopping).
result Speed-ups of up to 72x and residual norm decreases of up to 7x.
Develops SGP-VAE for efficient sparse GP inference in multi-dimensional datasets.
problem Sparse GP approximations and missing data in multi-dimensional spatio-temporal datasets.
method Leverages partial inference networks for sparse GP approximations and amortized variational inference.
result Outperforms multi-output GPs and structured VAEs in various experiments.
VMoER improves uncertainty quantification in MoE layers for scalable foundation models.
problem Uncertainty quantification in large-scale models like MoE layers.
method Structured Bayesian approach with amortized variational inference over routing logits and temperature parameter inference.
result Improves routing stability, reduces calibration error, and increases AUROC by 12%.
NPE improves scalability and efficiency for ERGMs.
problem Scalability and efficiency issues in Bayesian ERGM estimation.
method Neural posterior estimation (NPE) for ERGMs using neural network density estimation.
result NPE provides more efficient and scalable inference for ERGMs.
Discrete diffusion samplers improve sampling from unnormalised densities.
problem Sampling from discrete unnormalised densities efficiently.
method Introduce off-policy training techniques and data-to-energy Schrödinger bridge training for discrete diffusion samplers.
result Improved performance on synthetic and new benchmarks.
Italian banks use swaps to hedge against rising interest rates, offsetting losses on debt securities.
problem Interest rate risk on Italian banks' debt securities.
method Analysis of granular regulatory data on euro interest rate swap trades.
result Swaps can offset losses on debt securities, reducing interest rate exposure.
Divide-and-conquer framework speeds up black-box inference for large data.
problem Computational intractability of uncertainty quantification for expensive data simulation.
method Divide data into partitions, train on a subset, bootstrap on partitions, combine results.
result Feasibility of estimating max-stable process parameters with tens of thousands of locations.
Graph neural networks extend neural Bayes estimators to irregular spatial data.
problem Estimating parameters from irregular spatial data with computational efficiency.
method Employing graph neural networks to approximate Bayes estimators for irregular spatial data.
result Extending neural Bayes estimation to irregular spatial data with computational benefits.
In 1979 following a decade of hyperinflation, Iceland introduced Verðtryggð lán, negatively amortised, index-linked loans whose outstanding principal is increased by the rate of the consumer price inflation index(CPI). The loans were part of a general government policy which used indexation to the CPI to address the ec…
Meta-learning adapts models for unseen tasks across AI, robotics, and NLP.
problem Adapting models to unseen tasks efficiently and accurately.
method Black-box, metric-based, layered, and Bayesian approaches.
result Meta-learning enhances model generalization and adaptation to unseen tasks.
Meta-learning improves neural networks by adapting learning algorithms.
problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.
metric-learn simplifies metric learning in Python.
problem Performing distance metric learning efficiently.
method Unified scikit-learn compatible interface for supervised and weakly-supervised metric learning.
result Unified interface for cross-validation and model selection.
Meta-learning speeds up learning new tasks.
problem Designing and improving machine learning pipelines.
method Observing and learning from different machine learning approaches.
result Learning new tasks much faster than traditional methods.
Survey explores how transfer learning improves deep reinforcement learning.
problem Challenges in reinforcement learning efficiency and effectiveness.
method Categorizes and analyzes transfer learning approaches.
result Transfer learning enhances reinforcement learning performance.
Machine learning models adapt to motor learning but face challenges.
problem Adapting machine learning to handle motor variability and differentiate new movements from known ones.
method Parameter adaptation, transfer and meta-learning, reinforcement learning.
result Challenges in applying machine learning models for motor learning support systems.
Dropout learning is analyzed as ensemble learning to prevent overfitting.
problem Overfitting in deep learning models.
method Dropout learning ignores some inputs and hidden units with a probability, p, and combines them with the learned network.
result Combining neglected hidden units with the learned network can be seen as ensemble learning.
Optimal learning paths designed for E-learning systems using reinforcement learning.
problem Designing optimal learning paths for E-learning systems.
method Developed a hierarchical skill model and a proficiency level model, applied reinforcement learning to find the optimal learning strategy.
result Demonstrated the effectiveness of the proposed framework via numerical experiments.