SAFE automates feature engineering for industrial tasks efficiently and scalably.
problem Efficiency and scalability of automatic feature engineering methods for industrial tasks.
method SAFE (Scalable Automatic Feature Engineering) method, which provides excellent efficiency and scalability.
result SAFE method provides prominent efficiency and competitive effectiveness in industrial tasks.
A scalable parallel BO method for asynchronous settings.
problem Expensive-to-evaluate problems in machine learning.
method Simple and scalable Bayesian optimization method for asynchronous parallel settings.
result Demonstrated promising performance on benchmark functions and hyperparameter optimization.
SIGL learns scalable graphons from graphs.
problem Estimating graphons from graphs of varying sizes.
method Combines INRs and GNNs for scalable graphon estimation.
result SIGL learns consistent graphons at arbitrary resolutions.
Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
Scalable method learns context-specific models for hundreds of variables.
problem Learning context-specific models for large numbers of variables.
method Order-based Markov chain Monte-Carlo search with context-specific sparsity assumption.
result Method scales to hundreds of variables and learns accurate models.
This paper surveys scalable automated alignment methods for LLMs.
problem Scalability issues in traditional human-annotated alignment methods for LLMs.
method Categorizes and discusses various automated alignment methods.
result Emerging automated alignment methods are effective and scalable.
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.
S3VDC improves DC methods for scalability, stability, and simplicity.
problem Poor scalability, instability, and lack of simplicity in DC methods.
method Four algorithmic improvements: initial γ-training, periodic β-annealing, mini-batch GMM initialization, and inverse min-max transform. S3VDC incorporates all improvements. result S3VDC outperforms state-of-the-art methods on benchmark and industrial datasets.
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…
Improved GP models for fast training and good performance.
problem Training scalable Gaussian process models efficiently.
method Cross-validation and nearest neighbor truncation for scalable GP training.
result Our method offers fast training and excellent predictive performance.
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.
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.
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.
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.
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.
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
Two new scalable K-means initialization methods proposed for large-scale clustering.
problem Efficient initialization for large-scale clustering problems.
method Divide-and-conquer approach and random projection method for multiple lower-dimensional subspaces.
result The proposed methods outperform state-of-the-art in large-scale clustering tasks.
Explosive growth in data and availability of cheap computing resources have sparked increasing interest in Big learning, an emerging subfield that studies scalable machine learning algorithms, systems, and applications with Big Data. Bayesian methods represent one important class of statistic methods for machine learni…
The paper analyzes and mitigates biases in scalable Gaussian Process methods.
problem Modeling biases in scalable Gaussian Process methods.
method Randomized truncation estimators to eliminate bias in exchange for increased variance.
result Randomized truncation estimators meaningfully outperform biased counterparts with minimal additional computation.
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…
A new method for fast, non-iterative graphical model estimation.
problem Scalability issues in iterative proportional fitting for high-dimensional data.
method Non-iterative approach for positive definite graphical model estimation.
result The proposed method outperforms state-of-the-art methods in high-dimensional settings.
A scalable method for training prediction models in predict-then-optimize
problem Training prediction models in the predict-then-optimize paradigm
method Decision-focused learning pipeline
result Decision quality competitive with state-of-the-art methods while reducing training time
The book covers scalable MCMC methods for Bayesian learning.
problem Scalability issues in Bayesian learning with large datasets.
method Advanced MCMC algorithms, including stochastic gradient, non-reversible, and continuous time methods.
result Substantial advances in practical and theoretical Bayesian computation.
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.
This dissertation advances scalable Gaussian processes using iterative methods and pathwise conditioning.
problem The classical Gaussian process formulation is not scalable for large datasets and modern hardware.
method Combining iterative methods and pathwise conditioning to improve scalability.
result Significantly reduced memory requirements and facilitated application to larger datasets.
This paper introduces a neural sampler for scalable sampling from complex distributions.
problem Efficiently sampling from high-dimensional un-normalized distributions.
method Neural implicit sampler trained with KL and Fisher divergence methods.
result The neural sampler generates large batches of samples with low computational costs.
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.
A new method combines Laplace and Variational Bayes for scalable inference.
problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.
New methods for scalable causal discovery from complex data.
problem Learning causal structures from nonlinear, continuous or mixed data.
method BF-BIC score and BF-LRT test for scalable causal discovery.
result BF-BIC score and BF-LRT test enable scalable causal discovery with competitive accuracy and runtime.
Kernel methods on discrete domains have shown great promise for many challenging data types, for instance, biological sequence data and molecular structure data. Scalable kernel methods like Support Vector Machines may offer good predictive performances but do not intrinsically provide uncertainty estimates. In contras…
Scalable3-BO tackles scalability issues in Bayesian optimization for big data and high dimensions.
problem Bayesian optimization scalability issues in big data and high dimensions.
method Sparse Gaussian process, random embedding, asynchronous parallelization.
result Scalable3-BO framework optimizes high-dimensional problems with 1 million data points and 10,000 dimensions.
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.
ESAC combines genetic methods with RL to improve scalability and efficiency.
problem Combining genetic scalability with RL's data efficiency and optimal control.
method Combines Evolution Strategies (ES) with Soft Actor-Critic (SAC) to enable skill transfer and reduce hyperparameter sensitivity.
result Demonstrates improved performance and sample efficiency in challenging tasks.
Sep-SpectralNet improves SE for broader applicability and scalability.
problem Three main drawbacks of current SE implementations: generalizability, scalability, and eigenvectors separation.
method Sep-SpectralNet extends SpectralNet with an eigenvector separation post-processing step.
result Sep-SpectralNet achieves consistent SE approximation and generalization, enhancing scalability and applicability.
Scalable TS using sparse GPs improves efficiency without sacrificing performance.
problem Efficiently applying TS to complex, multi-modal problems.
method Sparse Gaussian Process models for scalable TS.
result Theoretical and empirical validation of scalable TS's effectiveness.
SDCOR clusters massive datasets efficiently, detecting outliers with low memory usage.
problem Local outlier detection in large-scale datasets.
method Chunk-based density clustering with incremental updates.
result SDCOR achieves lower linear time complexity and better efficiency than traditional methods.
URSABench benchmarks Bayesian methods for deep learning models.
problem Scalability issues in Bayesian inference for deep learning.
method Open-source benchmark suite for assessing approximate Bayesian inference methods.
result Initial results show promise for addressing uncertainty and robustness in deep learning.
Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing
problem Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing
method Reformulating Stein discrepancy construction as an explicit SNR^2 maximisation problem
result Avoiding exponential SNR^2 collapse and achieving stable SNR^2
DKL-KAN combines deep learning and kernel methods for scalable, expressive models.
problem Combining deep learning's depth with kernel methods' flexibility for scalable models.
method DKL-KAN uses Kolmogorov-Arnold Networks (KAN) to optimize kernel attributes within a Gaussian process framework.
result DKL-KAN outperforms DKL-MLP on datasets with a low number of observations and DKL-MLP on large datasets.
Nyström approximation for scalable operator learning
problem Scalability of operator learning for large datasets
method Nyström subsampling with operator learning
result Minimax-optimal convergence rates for functional outputs
New rule-based method for classification with scalability, interpretability, and fairness.
problem Developing a scalable and fair classification method.
method Column generation for linear programming, decision tree-based heuristic, and rule-based optimization.
result The method returns interpretable rules with optimal weights and addresses fairness constraints.
Robust principal component analysis (RPCA) has drawn significant attentions due to its powerful capability in recovering low-rank matrices as well as successful appplications in various real world problems. The current state-of-the-art algorithms usually need to solve singular value decomposition of large matrices, whi…
ScaML-GP efficiently learns from few meta-tasks using Gaussian processes.
problem Exploiting historical data for quick task solving in low-data regimes.
method Modular Gaussian process model with a carefully designed multi-task kernel.
result ScaML-GP learns efficiently with few and many meta-tasks.
SVB method provides scalable Bayesian proportional hazards model for high-dimensional gene expression data.
problem Bayesian methods for high-dimensional sparse survival data often sacrifice uncertainty quantification or computational scalability.
method Mean-field variational approximation for scalable Bayesian proportional hazards model.
result SVB method offers posterior distribution for parameters and variable selection via posterior inclusion probabilities.
Bayesian optimization method tackles combinatorial spaces, scalable for large data.
problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.
Bayesian Hierarchical Invariant Prediction refines ICP for better scalability and prior integration.
problem Improving computational scalability and invariance testing for causal inference.
method Bayesian Hierarchical structure to test invariance under heterogeneous data.
result Demonstrated improved scalability and potential as an alternative to ICP.
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.
Graphs are ubiquitous real-world data structures, and generative models that approximate distributions over graphs and derive new samples from them have significant importance. Among the known challenges in graph generation tasks, scalability handling of large graphs and datasets is one of the most important for practi…