New GP-VAE model improves scalability and performance.
problem Inability of conventional VAEs to model correlations between data points.
method Principled sparse inference approaches to improve scalability of GP-VAEs.
result New model outperforms existing approaches in runtime and memory usage.
New scalable GP approximation using Fourier series decomposition.
problem Scalability and accuracy in Gaussian process approximations.
method Harmonic kernel decomposition (HKD) to decompose kernels orthogonally.
result Significantly outperforms standard variational methods in scalability and accuracy.
New method for scalable barycenter computation using Wasserstein gradient flows.
problem Scalability and integration of label information in barycenter computation.
method Gradient flows in Wasserstein space, time discretization, mini-batch optimal transport, modular regularization, task-aware functions, supervised information integration.
result Empirically validated new state-of-the-art barycenter solver with labeled barycenters outperforming unlabeled ones.
BNAS improves neural architecture search with a scalable, fast, and efficient approach.
problem Efficiently searching for optimal neural architectures with high performance and low training time.
method Designing a broad scalable architecture (BCNN) with reinforcement learning and parameter sharing, and developing two variants.
result Significantly reduces training time and achieves state-of-the-art performance on CIFAR-10 and ImageNet.
dAUTOMAP scales AUTOMAP by decomposing domain transformation.
problem Inadequate scalability limits AUTOMAP's practicality.
method Decomposes AUTOMAP's domain transformation for linear scalability.
result dAUTOMAP outperforms AUTOMAP with fewer parameters.
Efficiently computes tree-Wasserstein barycenter for large-scale multilevel clustering and scalable Bayes.
problem Large-scale multilevel clustering and scalable Bayes problems.
method Proposes an efficient algorithm for tree-Wasserstein barycenter and variants.
result Significantly improves efficiency in computation and memory usage for large-scale applications.
New scalable MCMC sampling for nonsymmetric DPPs speeds up computations.
problem Efficient sampling for nonsymmetric DPPs with low-rank kernels.
method Enhanced rejection sampling with efficient proposal distribution construction.
result Sublinear runtime for scalable MCMC sampling of k-NDPPs. Paper introduces a fast, robust, scalable method for detecting changes in data streams.
problem Detecting changes in data streams efficiently and reliably.
method Bayesian online changepoint detection with provable robustness and scalability.
result The proposed method is more than 10 times faster than previous approaches and provides provable robustness.
Paper presents a new method to learn unnormalized models efficiently.
problem Scalability issues in score matching for flexible unnormalized models.
method Connects learning objectives to Wasserstein gradient flows for scalability.
result Demonstrates improved learning of unnormalized models on manifolds.
A scalable factorized Gaussian process VAE for faster inference.
problem Inference bottlenecks in Gaussian process VAEs.
method Factorizes latent kernel across auxiliary features, leveraging independence.
result Significant speed-up in inference time (in theory and practice).
Develops scalable differentiable physics for complex object interactions.
problem Limited scalability of existing differentiable physics solvers.
method Adopting meshes for arbitrary geometry, localized collision handling, and accelerated implicit differentiation.
result Significantly reduces memory and computation requirements compared to particle-based methods.
We develop a scalable method for Bayesian neural networks with stochastic differential equations.
problem Uncertainty quantification in deep neural networks.
method Gradient-based stochastic variational inference in continuous-depth Bayesian neural networks.
result Gradient estimator with zero variance as the approximation improves.
New scalable Lipschitz bounds improve neural network robustness analysis.
problem Computing tight Lipschitz bounds for deep neural networks is challenging and computationally expensive.
method Derived new closed-form Lipschitz bounds using more general feasible points of LipSDP, avoiding SDP solvers.
result Improved scalability and precision of Lipschitz estimation for large neural networks.
Scalable method completes ill-conditioned matrices from few samples.
problem Matrix completion from few samples for ill-conditioned matrices.
method Iterative algorithm combining IRLS, smoothing Newton, and proximal gradient methods.
result Local quadratic convergence rate and well-conditioned linear systems.
Paper proposes scalable algorithm to estimate intervention targets in linear models.
problem Estimating intervention targets in linear models from observational and interventional data.
method The paper proposes a scalable algorithm that estimates intervention sites from the difference between precision matrices of observational and interventional datasets.
result The algorithm consistently identifies all intervention targets and updates observational Markov equivalence classes to interventional ones.
Scalable algorithm for computing Wasserstein-2 barycenters without bias.
problem Computing Wasserstein-2 barycenters efficiently and accurately.
method Input convex neural networks and cycle-consistency regularization.
result Our approach avoids introducing bias and does not require minimax optimization.
The paper develops scalable variational inference for Bayesian neural networks under model and parameter uncertainty.
problem Combining structural and parameter uncertainties in scalable Bayesian neural networks.
method Adapted variational inference with reparametrization for model space constraints.
result Comparable accuracy with sparse inference compared to ordinary BNNs.
A scalable topic model for large document collections using MapReduce.
problem Scalability issues in topic modeling for large document collections.
method Correlated Topic Model with variational Expectation-Maximization in MapReduce framework.
result Comparable topic coherences with LDA in MapReduce framework.
Bayesian approach improves performance in Gaussian process models.
problem Scalable posterior estimation in Gaussian process models.
method Revisiting variational inference techniques with Bayesian treatment of inducing variables and hyper-parameters.
result State-of-the-art performance demonstrated across various regression and classification problems.
Quantum machine learning: Adiabatic quantum SVM outperforms classical methods.
problem Training support vector machines efficiently on large datasets.
method Adiabatic quantum computing for SVM training.
result Quantum approach outperforms classical methods in accuracy and scalability.
New algorithm discovers causal graphs efficiently from observational data.
problem Discovering causal graphs from observational data efficiently.
method Approximating the score function using machine learning and applying scalable techniques.
result DAS algorithm reduces complexity and achieves competitive accuracy.
L2G2G improves graph autoencoder accuracy without sacrificing scalability.
problem Scalability issues in graph autoencoders for large networks.
method Dynamic synchronization of latent node representations in each epoch.
result L2G2G achieves higher accuracy than standard Local2Global approach on large and dense networks.
We present a scalable approach to performing approximate fully Bayesian inference in generic state space models. The proposed method is an alternative to particle MCMC that provides fully Bayesian inference of both the dynamic latent states and the static parameters of the model. We build up on recent advances in compu…
Bayesian non-linear matrix completion tackles large, sparse data.
problem Predict missing elements in large, sparsely observed matrices.
method Bayesian Gaussian process latent variable models with data-parallel distributed computation.
result Scalable Bayesian non-linear matrix completion outperforms linear methods.
Bayesian method predicts individual and crowd preferences from small data.
problem Difficult to predict preferences from limited personal data and noisy labels.
method Combines matrix factorization with Gaussian processes for scalable inference.
result Method predicts preferences for new users and items not in training set.
A new Gaussian process framework uses neural feature maps for scalable, accurate inference.
problem Efficient and accurate Gaussian process inference for diverse data types.
method Neural feature maps to construct expressive kernels, with theoretical guarantees and practical scalability.
result The approach outperforms existing methods in accuracy and efficiency across various data modalities.
Novel method for scalable neural network-based blackbox optimization.
problem Scalability challenges in high-dimensional Bayesian Optimization.
method SNBO: Adds new samples using separate criteria for exploration and exploitation, adaptively controlling the sampling region.
result SNBO achieves better function values with 40-60% fewer function evaluations and reduced runtime.
Tensor networks help learn complex physical laws from data.
problem Identifying non-linear dynamical laws from complex physical systems.
method Tensor network parameterizations and rank-adaptive optimization.
result Optimal tensor network models can be learned from data.
Scalable model for slate recommendation learns reward probabilities.
problem Scalable personalized slate recommendation in large action spaces.
method Probabilistic Rank and Reward (PRR) model combining reward, interaction, and rank.
result PRR outperforms existing methods and is scalable to large action spaces.
A scalable method for BED with implicit models using approximate gradients.
problem Efficiently estimating posterior distribution and maximizing MI for implicit models.
method Stochastic approximate gradient ascent with smoothed variational MI estimator.
result Significantly improves scalability of BED in high-dimensional problems.
We present a novel, scalable and Bayesian approach to modelling the occurrence of pairs of symbols (i,j) drawn from a large vocabulary. Observed pairs are assumed to be generated by a simple popularity based selection process followed by censoring using a preference function. By basing inference on the well-founded pri…
A scalable GPVAE method using local adjacencies to approximate GP inference.
problem Scalability issues in exact GP inference for large-scale GPVAEs.
method Neighbour-driven approximation strategy that confines computations to nearest neighbours.
result Outperforms other GPVAE variants in predictive performance and computational efficiency.
A scalable algorithm for sampling and fine-tuning models using Tilt Matching.
problem Efficient sampling and fine-tuning of generative models.
method Tilt Matching, arising from a dynamical equation, minimizes variance and inherits regularity from stochastic interpolants.
result Empirically verified to be efficient and highly scalable, providing state-of-the-art results.
In this paper, we present a general framework to scale graph autoencoders (AE) and graph variational autoencoders (VAE). This framework leverages graph degeneracy concepts to train models only from a dense subset of nodes instead of using the entire graph. Together with a simple yet effective propagation mechanism, our…
FISHDBC clusters arbitrary data with flexible, scalable, and hierarchical features.
problem Clustering arbitrary data with arbitrary distance functions efficiently.
method Flexible, incremental, scalable, hierarchical density-based clustering algorithm.
result Flexible clustering of arbitrary data without feature extraction.
Scalable approach for high-dimensional dynamical systems with noise filtering and parameter estimation.
problem Noise filtering and parameter estimation for high-dimensional dynamical systems.
method Flexible latent factor model with orthogonal factor loading matrix and closed-form parameter estimation.
result Substantial acceleration and higher accuracy compared to alternatives.
A scalable algorithm for GP regression selects relevant covariates efficiently.
problem Scalable variable selection in large GP regression models.
method VGPR algorithm using Vecchia approximation for sparse precision matrix, mini-batch subsampling.
result Improved scalability and accuracy in selecting relevant covariates.
We introduce a new structured kernel interpolation (SKI) framework, which generalises and unifies inducing point methods for scalable Gaussian processes (GPs). SKI methods produce kernel approximations for fast computations through kernel interpolation. The SKI framework clarifies how the quality of an inducing point a…
Developing stable and scalable probabilistic ODE solvers for stiff and high-dimensional problems.
problem Stiff and high-dimensional ODEs
method Matrix-free update step and iterative re-linearization
result Improved stability and scalability
This work uses a scalable approach to identify partially observed nonlinear systems.
problem Offline identification of partially observed nonlinear systems.
method Certainty-equivalent expectation-maximization (CEEM) as block coordinate-ascent.
result The CEEM approach can identify high-dimensional systems reliably and efficiently.
Framework generates precise synthetic populations for scalable modeling.
problem Generating accurate synthetic populations without personal data.
method Constraint-programming framework encoding aggregated statistics and structural relations.
result Exact control of demographic profiles without requiring microdata.
Meta-learning interpretable decision trees with synthetic data.
problem Lack of efficient, scalable methods for generating synthetic data for decision tree meta-learning.
method Synthetic generation of near-optimal decision trees using the MetaTree transformer architecture.
result Meta-learning of decision trees achieves performance comparable to real-world data or optimal decision trees, with significant computational cost reduction.
Two approximate lifted variational methods for hybrid domains improve inference scalability and accuracy.
problem Efficient inference in hybrid probabilistic relational models with multi-modality and continuous evidence.
method Two approximate lifted variational approaches applicable to hybrid domains, exploiting model symmetries.
result The proposed variational methods are scalable and can leverage approximate model symmetries, outperforming existing message-passing approaches.
A scalable MARL algorithm using local rewards for cooperative multi-agent learning.
problem Scalability issues in cooperative multi-agent reinforcement learning due to large state and action spaces.
method LOMAQ algorithm incorporating local rewards in centralized training and decentralized execution.
result LOMAQ scales well compared to other methods, improving performance and convergence speed.
Paper combines scalable BMF algorithms for web-scale datasets.
problem High computational cost of Bayesian Matrix Factorization.
method Combines Posterior Propagation and asynchronous distributed implementation.
result Substantial improvements in scalability on web-scale datasets.
New method uses deep neural networks to interpolate spatiotemporal data.
problem Scalable interpolation of spatiotemporal data from growing earth observation systems.
method Bayesian deep learning with random feature expansions.
result Competitive or superior results compared to existing methods.
A scalable Bayesian linear regression framework for spatial data.
problem Scalable methodologies for analyzing large spatial datasets.
method Conjugate Bayesian linear regression framework.
result Exact sampling from joint posterior distribution without iterative algorithms.
This paper improves parallel belief propagation for scalable machine learning.
problem Efficient parallelization of belief propagation for large-scale machine learning tasks.
method Use of scalable relaxed schedulers to parallelize belief propagation.
result Our approach outperforms previous methods in scalability and convergence time.