NRWS improves training of SBNs and HMs using natural gradient.
problem Training Sigmoid Belief Networks and Helmholtz Machines efficiently.
method Exploits block-diagonal structure of Fisher Information Matrices to use natural gradient.
result NRWS and NBiHM achieve better log-likelihood and faster convergence.
RWS outperforms current methods in learning SCFMs.
problem Learning models with stochastic control flow is challenging.
method Revisited reweighted wake-sleep algorithm for SCFMs.
result RWS learns better models and inference networks with more particles.
A new method for training generative models with sparse supervision.
problem Training deep generative models with sparse and varying supervision.
method Caffeinated Wake-Sleep (CWS) method, combining reweighted wake-sleep and teacher-forcing.
result The CWS method is robust to variable length supervision and performs well on various datasets.
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.
VIPs use IPs for efficient inference in flexible models.
problem Efficient inference in flexible models like Bayesian neural networks and Gaussian processes.
method Variational Implicit Processes (VIPs) using generalised wake-sleep updates.
result VIPs provide better uncertainty estimates and lower errors compared to existing methods.
New method learns flexible posterior distributions in generative models.
problem Learning accurate posterior distributions in hierarchical latent-variable models.
method Distributed distributional code Helmholtz machine with an extended wake-sleep algorithm.
result Outperforms state-of-the-art methods on various datasets.
DDVI uses diffusion models for variational inference, improving latent variable model performance.
problem Improving variational inference in latent variable models.
method Introduces diffusion-based variational posteriors trained with a regularized ELBO.
result Outperforms alternative variational posteriors on various benchmarks and a biology task.
This paper unifies GANs and VAEs through a new formulation.
problem The distinction between GANs and VAEs in generative model learning.
method Interpreting GANs as posterior inference and showing KL divergence minimization similarities.
result Unified view of GANs and VAEs provides a powerful tool for analysis and technique transfer.
A new approach to learning in brain-like networks using adversarial algorithms.
problem Complex inter-dependencies in brain-like networks not compatible with conditional independence assumptions.
method Adversarial algorithm for learning models of perceptual processing.
result The approach can mimic known neural phenomena and yields testable hypotheses.
TVO tightens variational inference bounds for deep models.
problem Improving variational inference bounds for deep models.
method Introduces thermodynamic variational objective (TVO) connecting variational inference and thermodynamic integration.
result TVO provides tighter lower bound to log marginal likelihood than ELBO.
Framework for lifelong learning using eigentasks to avoid forgetting and transfer knowledge.
problem Avoiding forgetting and transferring knowledge in lifelong learning.
method Eigentask framework: skills paired with generative models, wake-sleep cycle for learning and consolidation.
result Improved performance in supervised continual learning, evidence of forward knowledge transfer.
NAS-X improves inference and model learning for SLVMs.
problem Challenges in analytic inference and model learning for flexible SLVMs.
method NAS-X combines reweighted wake-sleep and smoothing sequential Monte Carlo.
result NAS-X provides low-bias and low-variance gradient estimates.
Massively parallel RWS improves inference in complex models.
problem Exponential sample requirement for effective importance weighting.
method Draws K samples of all n latent variables and individually reasons through all combinations. result Significant improvements over standard RWS.
New method improves variational inference for better posterior approximation.
problem Challenges in minimizing inclusive KL divergence for amortized variational inference.
method Likelihood-tempered sequential Monte Carlo samplers to estimate inclusive KL gradient.
result SMC-Wake method fits variational distributions more accurately than existing methods.
QEM uses parallel importance weighting for fast approximate Bayesian inference.
problem Bayesian inference challenges in large models with many observations and latent variables.
method Expectation Maximization (EM) with massively parallel importance weighting.
result QEM is faster and more scalable than RWS and VI.
CNN classifies sleep-wake states from heart rate variability.
problem Classifying sleep-wake states from heart rate data.
method Convolutional Neural Network (CNN) trained on ECG data.
result CNN achieves high accuracy in classifying wake/sleep stages.
Highly expressive directed latent variable models, such as sigmoid belief networks, are difficult to train on large datasets because exact inference in them is intractable and none of the approximate inference methods that have been applied to them scale well. We propose a fast non-iterative approximate inference metho…
Unified framework for training generator, energy model, and inference model.
problem Training of generator, energy model, and inference model in a unified probabilistic formulation.
method Divergence Triangle framework integrating variational learning, adversarial learning, wake-sleep algorithm, and contrastive divergence.
result Unified training of generator, energy model, and inference model without costly Markov chain Monte Carlo methods.
New algorithm minimizes inclusive KL for VI, improving accuracy.
problem Improving variational inference accuracy with KL(p||q).
method Markovian score climbing (MSC) using stochastic gradients.
result MSC converges to local optimum of inclusive KL without bias.
InfoGAN learns disentangled representations without supervision.
problem Learning interpretable representations without labeled data.
method Generative adversarial network with mutual information maximization.
result InfoGAN successfully disentangles various latent variables from observations.
Model learns association between text and speech without paired data.
problem Learning association between text and speech with limited paired data.
method Noisy channel generative model with variational inference and KL encoder loss.
result Tiny paired data (5 minutes) sufficient to learn association.
AISLE framework improves on IWAE by directly optimising proposal distribution.
problem IWAE's multi-sample objective leads to inference-network gradients that break down with increasing samples.
method Introduces AISLE framework, which optimises proposal distribution directly.
result AISLE admits IWAE-STL and IWAE-DREG as special cases, avoiding breakdown.
Paper improves variance control in importance weighted variational bounds.
problem Improving the variance of gradient estimators for IWAE.
method Develops a novel control variate that grows SNR as √K for large K.
result Empirically, the method yields superior variance reduction for generative models.
Improved gradient estimator boosts performance in latent variable models.
problem Poor gradient estimation in multi-sample variational bounds.
method Doubly reparameterized gradient (DReG) estimator.
result DReG estimator reduces variance and improves model performance.
Deep learning detects microsleep episodes in EEG data.
problem Automatic detection of microsleep episodes (MSEs) in EEG data.
method Convolutional neural networks (CNNs) and LSTM networks were implemented to analyze MWT data.
result Deep learning algorithms showed good performance close to human experts in detecting MSEs.
Develops a new method for efficient probabilistic inference.
problem Efficient inference for models with dynamic computation graphs.
method Introduces combinator library for Probabilistic Torch framework.
result Models can be trained using stochastic methods that optimize variational or wake-sleep objectives.
This paper shows hedging algorithms improve performance in repeated matrix games.
problem Improving multi-agent learning algorithms in repeated matrix games.
method Develops and experiments with hedging algorithms combining a top-level and a set of basic algorithms.
result Well-selected hedging algorithms outperform previous MAL algorithms on repeated matrix games.
Examines algorithmic modeling across three cultures.
problem Tackles algorithmic modeling in different cultural contexts.
method Uses parametric regressions, interpretable algorithms, and complex algorithms.
result Extension of Leo Breiman's thesis to include cultural differences.
Meta-algorithm selection aims to choose the best algorithm selector for a given problem instance.
problem Selecting the best algorithm selector for a specific problem instance.
method Apply algorithm selection to the selection of other algorithms (meta-algorithm selection).
result Meta-algorithm selection can be beneficial in some cases but faces challenges in solving the meta-level problem.
Proposes CLRS benchmark to evaluate algorithmic reasoning.
problem Difficulty in transferring results across publications due to targeted algorithmic data.
method Develops a comprehensive benchmark covering various algorithmic tasks.
result Demonstrates performance of algorithmic reasoning baselines on the CLRS benchmark.
Combines multiple bandit algorithms to create a nearly optimal single algorithm.
problem Designing a single bandit algorithm that performs nearly as well as the best individual algorithm in a stochastic environment.
method Develops two general corralling algorithms that achieve favorable regret guarantees.
result The regret of the corralling algorithms is no worse than the best individual algorithm's performance.
New algorithms improve stochastic optimization and online learning efficiency.
problem Efficient optimization and online learning algorithms for stochastic problems.
method Accelerated randomized coordinate descent algorithms.
result Significantly less per-iteration complexity and better regret performance.
Automates algorithm design using reinforcement learning.
problem Manual algorithm design is time-consuming and error-prone.
method Guided policy search for optimizing policies representing algorithms.
result Learned algorithm outperforms existing hand-engineered algorithms.
The exchange algorithm is studied for its convergence and asymptotic variance.
problem Theoretical limitations of the exchange algorithm in sampling from doubly-intractable distributions.
method Theoretical analysis of the exchange algorithm's convergence speed and asymptotic variance.
result The exchange algorithm converges at a geometric rate and satisfies a Central Limit Theorem.
New algorithms optimize algorithm parameters in online settings with reduced computational costs.
problem Optimizing algorithm parameters in online settings with volatile and discontinuous losses.
method Developed semi-bandit optimization algorithms that leverage extra information to reduce computational costs.
result Achieved regret bounds as good as full-information feedback with significantly less computational effort.
Bayesian networks (BN) are used in a big range of applications but they have one issue concerning parameter learning. In real application, training data are always incomplete or some nodes are hidden. To deal with this problem many learning parameter algorithms are suggested foreground EM, Gibbs sampling and RBE algori…
Parallel algorithm finds sparse solutions for nonconvex problems.
problem Nonconvex sparsity-regularized rank minimization.
method Parallel best-response algorithm with exact line search.
result Guaranteed convergence to a stationary point.
No algorithm outperforms uniform sampling in A/B testing.
problem Identifying the best arm in A/B testing with fixed budget.
method Introducing consistent and stable algorithms, deriving lower bounds, and proving optimality of uniform sampling.
result No algorithm performs better than uniform sampling in A/B testing.
Improves algorithm selection for thousands of candidates using dyadic features.
problem Selecting the best algorithm from a large set of candidates for specific problems.
method Proposes extreme algorithm selection (XAS) with dyadic feature representation.
result Improves significantly over current state of the art in various metrics.
AIDE measures the accuracy of probabilistic inference algorithms.
problem Measuring the accuracy of approximate inference algorithms on specific data sets.
method AIDE is an algorithm based on viewing inference algorithms as probabilistic models and auxiliary variables.
result AIDE captures the qualitative behavior of inference algorithms and detects failure modes.
New algorithm improves worst Value-at-Risk computation for risky portfolios.
problem Computing worst Value-at-Risk in heterogeneous portfolios is numerically challenging.
method Introduced an Adaptive Rearrangement Algorithm to improve the Rearrangement Algorithm.
result The Adaptive Rearrangement Algorithm provides more accurate approximations of worst Value-at-Risk.
New algorithms decode Markov chains with near-optimal performance, even with small latency.
problem Online decoding of nth order ergodic Markov chains with latency constraints. method Deterministic and randomized algorithms using dynamic programs, with lower bounds established.
result Near-optimal performance of algorithms with minimal latency, outperforming existing methods.
Combines online learning algorithms to achieve better performance.
problem Improving online learning algorithms with varying guarantees.
method Adding iterates of two parameter-free algorithms to create a new algorithm with improved regret.
result Generates efficient algorithms that adapt to multiple norms and maintain dimension-free guarantees.
New ELM algorithms reduce computation time and complexity.
problem Efficient computation of extreme learning machine (ELM) algorithms.
method Developed inverse-free ELM algorithms using recursive matrix inverse and inverse LDL' factorization.
result Proposed algorithms significantly reduce computational complexity.
This review article surveys data augmentation MCMC algorithms.
problem Sampling from intractable probability distributions.
method Comprehensive study of DA MCMC algorithms, their convergence properties, and acceleration strategies.
result Synthesizes recent developments and provides insights for researchers.
Bayesian learning rule unifies and generalizes various machine learning algorithms.
problem Machine learning algorithms are diverse and not always understood.
method Bayesian principles and natural gradients are used to derive algorithms.
result Derives a wide range of algorithms including classical and modern ones.
This review summarizes five Lasso optimization algorithms.
problem Optimizing the Lasso objective function.
method Five representative algorithms: ISTA, FISTA, CGDA, SLA, PFA.
result Comparison of convergence rates and strengths/weaknesses.
Neural networks mimic algorithms to solve complex problems.
problem Current machine learning methods struggle with generalisation and efficiency.
method Representing algorithms in a continuous space and adapting them to real-world problems.
result Neural networks can execute classical algorithms more efficiently.