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.
Bayesian Tweedie mixed models are improved with adversarial variational inference.
problem Intractable likelihood function and hierarchical structure of mixed effects.
method Adversarial variational inference with reparameterization and flexible hyper prior.
result Proposed method reduces estimation bias and achieves state-of-the-art predictive performance.
High-dimensional feature selection arises in many areas of modern science. For example, in genomic research we want to find the genes that can be used to separate tissues of different classes (e.g. cancer and normal) from tens of thousands of genes that are active (expressed) in certain tissue cells. To this end, we wi…
Novel method for model selection in Bayesian autoencoders.
problem Model selection for Bayesian autoencoders.
method Prior hyper-parameter optimization using distributional sliced-Wasserstein distance.
result State-of-the-art results in small-data regimes.
Unified framework for learning function representations using INRs and Transformers.
problem Scalability and efficiency limitations in existing generative models.
method Integrates INRs and Transformer-based hypernetworks into latent variable models.
result Improved scalability, expressiveness, and generalization over existing models.
Evolutionary Strategies optimize hyper-parameters for off-policy learning.
problem Hyper-parameter sensitivity in off-policy learning.
method Application of Evolutionary Strategies for online hyper-parameter tuning.
result Our method outperforms state-of-the-art baselines.
La-MAML improves fast online continual learning with a look-ahead approach.
problem Fast online continual learning with limited model capacity.
method Optimisation-based meta-learning with look-ahead and episodic memory.
result Superior performance on visual classification benchmarks.
This paper uses SPNs with GPs to efficiently model complex data.
problem Inference cost and memory issues in Gaussian processes.
method Integrating Gaussian processes into sum-product networks.
result The model efficiently learns input-dependent parameters and hyper-parameters.
The quality of an induced model by a learning algorithm is dependent on the quality of the training data and the hyper-parameters supplied to the learning algorithm. Prior work has shown that improving the quality of the training data (i.e., by removing low quality instances) or tuning the learning algorithm hyper-para…
Flexible priors improve deep generative models.
problem Training deep generative models with complex deterministic models.
method Induce flexible code distributions directly from data.
result More powerful generative models, better latent structure modeling, explicit generalization control.
GRAD simplifies making neural networks fair.
problem No methods for making neural networks fair.
method Gradient Reversal Against Discrimination (GRAD)
result Improved individual and group fairness.
Paper tackles hyper-gradient estimation in decentralized FL over time-varying networks.
problem Excessive communication costs and inability to use robust networks.
method Introduces an optimality condition and uses Push-Sum for averaging model parameters and gradients over time-varying directed networks.
result Derives a hyper-gradient estimator that operates over time-varying directed networks and converges to the true hyper-gradient.
Hi-fi priors enhance BNNs by learning flexible activations.
problem Challenging to impose function-space priors on BNNs.
method Optimization techniques to learn flexible activations.
result BNNs with flexible activations can achieve desired priors.
HybridSVD combines user and item info for efficient, flexible recommendations.
problem Lack of effective methods for incorporating both user and item side information in collaborative filtering.
method Hybrid algorithm using PureSVD with generalized singular value decomposition and cold start solution.
result Superior performance compared to similar hybrid models on various datasets.
Flexible priors improve VAE-based CF models for better user preference modeling.
problem Simplistic priors in VAEs limit user preference modeling and deeper representation learning.
method Incorporated flexible priors and gating mechanisms into VAEs for collaborative filtering.
result Flexible priors and gating mechanisms significantly improve recommendation performance.
We propose a novel method for network inference from partially observed edges using a node-specific degree prior. The degree prior is derived from observed edges in the network to be inferred, and its hyper-parameters are determined by cross validation. Then we formulate network inference as a matrix completion problem…
PFNs4BO uses neural processes for flexible Bayesian Optimization.
problem Efficient surrogate modeling for Bayesian Optimization.
method In-context learning of PFNs to approximate posterior predictive distribution.
result PFNs outperform traditional GP, BNN in BO tasks.
Unified framework for multi-objective curriculum learning in robotics.
problem Improving sample efficiency and final performance in robotic policy learning.
method Unified automatic curriculum learning framework with multi-task hyper-net and flexible memory mechanism.
result Superior performance compared to state-of-the-art methods in robotic manipulation tasks.
DEEPLY improves cloud service partitioning across multiple datasets and goals.
problem Finding a generally useful method to partition monolithic enterprise applications into cloud-based microservices.
method DEEPLY extends CO-GCN with a novel loss function and hyper-parameter optimization.
result DEEPLY outperforms prior work across multiple datasets and goals.
Combines kernels to create flexible priors in BNNs for seasonal and trend data.
problem Creating flexible priors in Bayesian neural networks for complex data.
method Derives BNN architectures from kernel combinations and periodic functions.
result BNNs can produce periodic kernels useful for capturing seasonal and trend data.
GOAT improves attention mechanisms by learning better priors.
problem Standard attention mechanisms use a naive uniform prior, limiting flexibility and generalization.
method GOAT introduces a trainable, continuous prior that replaces the uniform assumption, maintaining compatibility with optimized kernels.
result GOAT avoids representational trade-offs and learns an extrapolatable prior that combines positional flexibility with length generalization.
AR-Flow VAE improves blind source separation with flexible autoregressive priors.
problem Unsupervised blind source separation of latent signals from mixtures.
method AR-Flow VAE uses autoregressive flows to model latent sources, enhancing flexibility and capturing complex dependencies.
result AR-Flow VAE effectively separates latent sources, demonstrating improved performance over conventional methods.
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of disadvantages such as the inability to assess model uncertainty and expensive crossvalidatio…
A parametrization of hypergraphs based on the geometry of points in Rd is developed. Informative prior distributions on hypergraphs are induced through this parametrization by priors on point configurations via spatial processes. This prior specification is used to infer conditional independence models or M…
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of disadvantages such as the inability to assess model uncertainty and expensive cross-validati…
Adma proposes a flexible loss function for neural networks.
problem Static loss functions limit neural network performance.
method Introduces a flexible loss function that adapts to ANN complexity and data distribution.
result Flexible loss function achieves state-of-the-art performance.
Nested sampling improved for arbitrary priors.
problem Technical obstacle to using nested sampling with arbitrary priors.
method Parametric bijectors trained on samples from a desired prior density.
result Nested sampling can be used with arbitrary priors.
Hyper-parameters play a major role in the learning and inference process of latent Dirichlet allocation (LDA). In order to begin the LDA latent variables learning process, these hyper-parameters values need to be pre-determined. We propose an extension for LDA that we call 'Latent Dirichlet allocation Gibbs Newton' (LD…
A new framework reduces RL training cost by optimizing hyper-parameters.
problem High sampling cost in RL due to complex hyper-parameter tuning.
method Proposes a 'reinforcement on reinforcement' (RoR) architecture to decompose tasks into two layers of RL.
result The proposed framework achieves up to 56% expected sampling cost saving.
Bayesian model improves classification performance with flexible uncertainty modeling.
problem Improving classification performance with flexible uncertainty modeling.
method Combines Gaussian process and Dirichlet process priors for latent function and link function, respectively.
result Outperforms standard logistic regression on simulated data.
C-VAE improves VAE by resolving prior issues and generating better samples.
problem Low-quality samples from VAE due to prior issues.
method Formulates VAE as OT, allows flexible priors, and uses OT formulations.
result C-VAE generates higher quality samples and latent representations.
Deep Gaussian Processes with polynomial kernels can collapse rapidly without proper hyperparameter tuning.
problem The collapse of Deep Gaussian Processes with polynomial kernels without careful hyperparameter tuning.
method Analysis using the Berry-Esseen Theorem and observation of prior behavior.
result The prior of a Deep Gaussian Process collapses rapidly towards zero or places negligible mass on low norm functions without proper hyperparameter tuning.
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.
Bayesian optimization improved AlphaGo's win-rate from 50% to 66.5%.
problem Hyper-parameter tuning for machine learning models.
method Bayesian optimization for hyper-parameter tuning.
result Bayesian optimization improved AlphaGo's performance in self-play games.
Maximizing mutual information selects simple models from limited data.
problem Selecting simple models from finite and potentially noisy data.
method Prior choice that maximizes mutual information between parameters and predictions.
result The method selects a lower-dimensional effective theory by ignoring poorly constrained parameters.
DeepRV accelerates spatiotemporal inference using neural priors.
problem Intractable scaling of Gaussian Processes for large datasets.
method Neural-network surrogate replacing GP prior sampling with O(N2) complexity. result DeepRV achieves highest fidelity to exact GPs while significantly speeding up inference.
Proposes a new prior for VAEs to improve out-of-distribution detection.
problem Probabilistic generative models struggle with out-of-distribution detection.
method Introduces an exponentially tilted Gaussian prior for VAEs.
result Achieves state-of-the-art results on ROC-AUC metric.
Empirical Gaussian Processes learn flexible priors from data.
problem Limited effectiveness of standard Gaussian process kernels.
method Estimate mean and covariance functions empirically from data.
result Empirical GPs converge to closest GP to real data generating process.
We present a simple explicit construction of hyper-Kaehler and hyper-symplectic (also known as neutral hyper-Kaehler or hyper-parakaehler) metrics in 4D using the Bianchi type groups of class A. The construction underlies a correspondence between hyper-Kaehler and hyper-symplectic structures in dimension four.
New method tunes prior IP to data for flexible predictive distributions.
problem Challenges in approximate inference for large models with high parameter dependencies.
method Inducing-point representation of prior IP to approximate posterior process.
result Scalable method that tunes prior IP to data and provides accurate non-Gaussian predictive distributions.
Labels distilled from images improve model training efficiency and flexibility.
problem Creating synthetic labels for a small set of real images to train models effectively.
method Introduce a more robust and flexible meta-learning algorithm for distillation and an effective first-order strategy based on convex optimization layers.
result Label distillation leads to improved results and greater flexibility in neural architectures.
Meta-learning priors improves safe Bayesian optimization.
problem Optimizing robot controllers under safety constraints.
method Meta-learning priors from offline data using F-PACOH.
result Meta-learned priors accelerate safe BO convergence.
Paper proposes using logic networks to inject prior knowledge for better reinforcement learning.
problem Improving reinforcement learning agents with prior knowledge of object and event semantics.
method Integrates first-order logic grounded in deep neural networks as prior knowledge into reinforcement learning algorithms.
result Demonstrates that combining symbolic and image layers in a single decision module improves learning efficiency.
We propose a novel approach for nonlinear regression using a two-layer neural network (NN) model structure with sparsity-favoring hierarchical priors on the network weights. We present an expectation propagation (EP) approach for approximate integration over the posterior distribution of the weights, the hierarchical s…
A new method for deep Wishart processes improves kernel-based models.
problem Inference in deep Wishart processes is challenging due to the need for flexible distributions over positive semi-definite matrices.
method Developed a novel approach to flexible distributions over positive semi-definite matrices using the Bartlett decomposition of the Wishart probability density. Used this to create an approximate posterior for the DWP.
result Improved performance of inference in the DWP compared to DGP with equivalent prior.
Introduces PELP for graph-enhanced word embeddings.
problem Combining graph side-information into static word embeddings.
method Probabilistic embeddings using Laplacian priors.
result Unified and flexible approach to various embedding methods.
BI-EqNO improves Bayesian inference with flexible neural operators.
problem Inaccurate estimation of marginal likelihoods in approximate Bayesian methods.
method Equivariant neural operator framework for generalized approximate Bayesian inference.
result BI-EqNO enhances both deterministic and stochastic approaches to Bayesian inference.
Flexible Bayesian approach for generalized linear models, especially for sparse logistic regression.
problem Sparse logistic regression challenges in machine learning.
method Empirical Bayes approach with mean-field variational inference, tuning-free and scalable.
result Superior predictive performance in sparse logistic regression compared to existing methods.