Generative model learns to autoencode and generate sets of images.
problem Learning to represent and generate sets of images with unknown number of sets.
method Set Distribution Networks (SDNs) learn set encoder, discriminator, generator, and prior.
result SDNs can reconstruct and generate sets of images with preserved attributes.
In open set learning, a model must be able to generalize to novel classes when it encounters a sample that does not belong to any of the classes it has seen before. Open set learning poses a realistic learning scenario that is receiving growing attention. Existing studies on open set learning mainly focused on detectin…
A distributed algorithm for training graph convolutional networks.
problem Training graph convolutional networks with sparse network topology and distributed agents.
method Formulate inference and optimization in a distributed scenario, propose a gradient descent procedure, and design communication topology.
result Convergence to stationary solutions of the GCN training problem under mild conditions.
In this chapter we take a look at the universal approximation question for stochastic feedforward neural networks. In contrast to deterministic networks, which represent mappings from a set of inputs to a set of outputs, stochastic networks represent mappings from a set of inputs to a set of probability distributions o…
Paper introduces a novel framework for set input tasks in meta-learning.
problem Meta-learning problems with set inputs often require efficient summary networks.
method Prototype-oriented optimal transport (POT) framework to improve summary networks.
result Significantly improves summary statistics from sets in meta-learning.
A method uses neural networks to approximate sampling distributions of test statistics.
problem Accurate modeling of p-value functions or cdfs for correct confidence set coverage.
method Uses neural networks to model the cdf of test statistics, approximating sampling distributions.
result Neural network approximations of sampling distributions are effective and simple.
We consider a distributed learning setup where a network of agents sequentially access realizations of a set of random variables with unknown distributions. The network objective is to find a parametrized distribution that best describes their joint observations in the sense of the Kullback-Leibler divergence. Apart fr…
Novel neural network models quantify uncertainty for deep classifiers.
problem Deep networks' overconfidence and ignorance about uncertainty.
method Variational autoencoders and GANs generate out-of-distribution samples.
result Better uncertainty estimates for in- and out-of-distribution samples.
Convolutional Neural Networks are a well-known staple of modern image classification. However, it can be difficult to assess the quality and robustness of such models. Deep models are known to perform well on a given training and estimation set, but can easily be fooled by data that is specifically generated for the pu…
GANs learn distributions well from samples, with rates depending on intrinsic dimension.
problem Learning distributions from samples using GANs.
method Oracle inequality, Hölder functions approximation, neural network approximation, integral probability metrics.
result Convergence rates of GANs depend on intrinsic dimension, not ambient dimension.
Distributed machine learning algorithms enable learning of models from datasets that are distributed over a network without gathering the data at a centralized location. While efficient distributed algorithms have been developed under the assumption of faultless networks, failures that can render these algorithms nonfu…
Bayesian inference for wide neural networks using Edgeworth expansion.
problem Analyzing the non-Gaussian behavior of wide neural networks in Bayesian inference.
method Proposed a non-Gaussian distribution using multivariate Edgeworth expansion for finite-width neural networks.
result Derived non-Gaussian posterior distribution in Bayesian regression tasks.
In this paper, we consider distributed optimization problems over a multi-agent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors. Differently from all existing works on distributed optimization, our focus is given to optimi…
We study the mixtures of factorizing probability distributions represented as visible marginal distributions in stochastic layered networks. We take the perspective of kernel transitions of distributions, which gives a unified picture of distributed representations arising from Deep Belief Networks (DBN) and other netw…
The paper proposes a method for better uncertainty estimation in neural networks.
problem Estimating predictive uncertainty in neural networks is crucial but challenging.
method The paper proposes a function-space variational inference method to infer a posterior distribution over functions.
result The proposed method leads to state-of-the-art uncertainty estimation and predictive performance.
Bayesian neural networks reveal multimodal predictive distributions.
problem Uncertainty quantification and interpretability in neural networks.
method Discretized prior for inner layer weights, Gaussian mixture approximation of posterior predictive distribution.
result Distinct parameter realizations can produce the same training error but different posterior predictive distributions.
New method uses extreme value theory to estimate neural network errors.
problem Quantifying the error of neural networks, especially for large values.
method Applying extreme value theory to approximate the distribution of error.
result Developed a new estimator for the shape parameter of the Pareto distribution.
In this work, we perform an exploratory study on synthesizing deep neural networks using biological synaptic strength distributions, and the potential influence of different distributions on modelling performance particularly for the scenario associated with small data sets. Surprisingly, a CNN with convolutional layer…
This paper explores advancements in neural network communication for distributed settings.
problem Challenges in training and evaluating neural networks in distributed, privacy-constrained environments.
method Development and evaluation of novel training and evaluation schemes for neural networks.
result Advantages of novel approaches over traditional cloud solutions, including privacy-preservation, increased security, and high training speed.
Proposes a new method to estimate Bayesian neural network depth.
problem Estimating the depth of Bayesian neural networks.
method Uses a discrete truncated normal distribution to learn depth mean and variance, inferring posterior distributions by minimizing variational free energy.
result Improves test accuracy and reduces posterior depth variance on the spiral dataset.
We propose a distributed approach to train deep neural networks (DNNs), which has guaranteed convergence theoretically and great scalability empirically: close to 6 times faster on instance of ImageNet data set when run with 6 machines. The proposed scheme is close to optimally scalable in terms of number of machines, …
Modern neural networks are very powerful predictive models, but they are often incapable of recognizing when their predictions may be wrong. Closely related to this is the task of out-of-distribution detection, where a network must determine whether or not an input is outside of the set on which it is expected to safel…
We study online linear regression problems in a distributed setting, where the data is spread over a network. In each round, each network node proposes a linear predictor, with the objective of fitting the \emph{network-wide} data. It then updates its predictor for the next round according to the received local feedbac…
MAGDiff detects data shifts in neural networks without retraining.
problem Neural networks' sensitivity to data distribution shifts.
method Extracts MAGDiff representations from neural networks to detect shifts.
result MAGDiff representations improve data set shift detection.
Forecast stock return distributions using neural networks.
problem Accurately modeling non-Gaussian stock return features.
method Two-stage quantile neural network with spline interpolation.
result Improved mean and variance forecasts compared to standard models.
Estimates conditional distribution function using neural networks for censored and uncensored data.
problem Estimating conditional distribution function for censored and uncensored data.
method Neural network algorithm based on Cox regression with time-dependent covariates, using full likelihood with unconstrained optimization.
result Proposed method yields more accurate estimates than existing methods when model assumptions are violated.
TDistNNs improve prediction intervals for neural networks by using t-distributions.
problem Traditional neural networks provide only point estimates, lacking predictive uncertainty.
method TDistNNs generate t-distributed outputs with adjustable degrees of freedom, enhancing robustness to non-Gaussian data.
result TDistNNs produce narrower prediction intervals with proper coverage compared to Gaussian-based PNNs.
Bayesian Tensor Network combines prior and data likelihood for efficient prediction and parameter estimation.
problem Overfitting and poor performance in Tensor Network models.
method Introduce prior distribution, use Laplace approximation for posterior predictive distribution, and propose stable initialization for parameter estimation.
result Reduces overfitting and improves performance of Tensor Network models.
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.
This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source randomness of the network is a continuous distribution (the "semi-discrete" setting), th…
This work develops secure distributed algorithms for machine learning to protect against data poisoning and network attacks.
problem Vulnerability of distributed machine learning algorithms to cyber threats.
method Game-theoretic framework to capture conflicting goals of a learner and an attacker, iterative distributed algorithm.
result Distributed SVM is prone to fail in different types of attacks, with impact depending on network structure and attack capabilities.
EBPs model exchangeable data with flexible distributions.
problem Current energy-based models restrict set cardinality and limited distribution forms.
method Introduced Energy-Based Processes (EBPs) that extend energy models to exchangeable data with neural network parameterizations.
result EBPs can express more flexible distributions over sets without cardinality restrictions.
Generative models learn complex data from low-dimensional manifolds.
problem Theoretical justification for generative models on manifold structures.
method Prove statistical guarantees of generative networks under Wasserstein-1 loss, considering intrinsic dimensionality.
result Generative networks converge to zero at a fast rate depending on intrinsic dimensionality, not ambient data dimension.
The paper studies conditions for exact posterior modeling in Bayesian networks.
problem Exact modeling of posterior distributions in Bayesian networks.
method Derives conditions for a recognition network to model the true posterior distribution exactly.
result Perfectness of the recognition network is crucial for local conditions to hold.
We devise a distributional variant of gradient temporal-difference (TD) learning. Distributional reinforcement learning has been demonstrated to outperform the regular one in the recent study \citep{bellemare2017distributional}. In the policy evaluation setting, we design two new algorithms called distributional GTD2 a…
We consider the problem of distributed dictionary learning, where a set of nodes is required to collectively learn a common dictionary from noisy measurements. This approach may be useful in several contexts including sensor networks. Diffusion cooperation schemes have been proposed to solve the distributed linear regr…
Bayesian Neural Networks improve OOD detection with limited data.
problem Limited training data hinders reliable OOD detection.
method Bayesian Neural Networks with expected logit vectors.
result Bayesian methods outperform deterministic methods in small data settings.
Deep generative networks can simulate from a complex target distribution, by minimizing a loss with respect to samples from that distribution. However, often we do not have direct access to our target distribution - our data may be subject to sample selection bias, or may be from a different but related distribution. W…
We analyze a new robust method for the reconstruction of probability distributions of observed data in the presence of output outliers. It is based on a so-called gradient conjugate prior (GCP) network which outputs the parameters of a prior. By rigorously studying the dynamics of the GCP learning process, we derive an…
Paper tackles distribution matching by partially matching distributions, achieving robust results.
problem Robustly aligning two probability distributions.
method Developed a partial Wasserstein adversarial network (PWAN) to efficiently approximate the partial Wasserstein-1 (PW) discrepancy.
result The PWAN effectively produces highly robust matching results, outperforming state-of-the-art methods.
New algorithm reduces misclassification costs in neural networks.
problem Reduces costs of misclassified instances in neural networks.
method Adaptive Cost-Sensitive Learning (AdaCSL) adjusts loss function to bridge class distribution mismatches.
result Deep neural networks with AdaCSL outperform other methods on cost-sensitive binary classification tasks.
New causal models for growing networks avoid node deletion constraints.
problem Statistical models based on node exchangeability are not suitable for growing networks.
method Enumerated and partitioned causal directed acyclic graph (DAG) models over pairs of nodes.
result Simple model exhibits flexible power-law degree distributions and emergent phase transitions.
New methods improve anomaly detection in deep networks by leveraging hierarchical likelihoods and multi-scale features.
problem Challenges in detecting anomalies in high-level features due to model bias and domain prior.
method Two methods: 1) Log likelihood ratios between in-distribution and general distribution models, 2) Multi-scale likelihood contribution.
result Strong anomaly detection performance in unsupervised setting, slightly underperforming supervised methods.
Neural networks compress and sample WDN contamination dynamics efficiently.
problem Infrastructure monitoring of complex, networked systems like water distribution networks is expensive and challenging.
method Developed Graph Fourier Transform (GFT) operators and neural networks (NN) for efficient data collection and inference.
result High accuracy reconstruction of contamination dynamics using only 5-10% of the sample set.
Federated learning framework with uncertainty estimation.
problem Uncertainty estimation in federated learning models.
method Infers and distills posterior predictive distributions from clients to server.
result Improved accuracy and reliability in predictions and tasks like OOD detection.
A new algorithm reduces data dimensionality and decorrelation in a distributed setting.
problem Distributed PCA for decorrelated features in big data.
method Feedforward neural network-based one time-scale algorithm for estimating eigenvectors of distributed data covariance matrix.
result DSA converges linearly to the true solution.
Analyzes generalization error in distributed linear regression.
problem Understanding generalization performance in distributed learning.
method Analytical characterization of generalization error in linear regression with distributed learning.
result Generalization error increases dramatically when nodes estimate close to the number of observations.
The paper extends entropy maximization to multiscale settings and applies it to neural networks.
problem Achieving optimal risk bounds in neural networks using multiscale entropy.
method Generalizing maximum entropy to multiscale settings and applying it to neural networks.
result The multiscale Gibbs posterior can achieve a smaller excess risk than the single-scale Gibbs posterior in a teacher-student scenario.