Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

8.7%17.3%26.0%34.7% · Jun 202019922001200920172026
48 results for Bayesian neural nets

Bayesian method improves neural net convergence for character recognition.

problem Improving convergence rate of neural network training algorithms.
method Customization of Kalman filter into Bayesian statistics for initialization of weights.
result Improved convergence rate for backpropagation training algorithm.

SDE-Net quantifies uncertainty in deep nets using stochastic dynamics.

problem Uncertainty quantification in deep neural networks.
method Viewing DNN transformations as state evolution of a stochastic dynamical system, introducing a Brownian motion term for epistemic uncertainty.
result SDE-Net outperforms existing methods in uncertainty estimation across various tasks.

Neural Ordinary Differential Equations (N-ODEs) are a powerful building block for learning systems, which extend residual networks to a continuous-time dynamical system. We propose a Bayesian version of N-ODEs that enables well-calibrated quantification of prediction uncertainty, while maintaining the expressive power …

2019-12-02abs ↗pdf ↗

Neural surrogate predicts SPN rates from token trajectories.

problem Challenging parameter estimation in SPNs with covariates.
method 1D Convolutional Residual Network trained on Gillespie-simulated SPN realizations.
result Surrogate predicts rate-function coefficients with RMSE = 0.043.

Deep Bayesian neural nets can use simpler weight approximations without sacrificing performance.

problem The need for complex weight posterior approximations in deep Bayesian neural networks.
method Theoretical and empirical analysis of mean-field variational inference in deep networks.
result Mean-field variational weight posteriors in deep networks can induce similar function-space distributions as complex approximations in shallower networks.

Bayesian ReLU nets fix asymptotic overconfidence with infinite features.

problem Bayesian ReLU nets can be asymptotically overconfident far from training data.
method Extend finite ReLU BNNs with infinite ReLU features via a Gaussian process.
result The resulting model is asymptotically maximally uncertain far from the data.

Deterministic neural nets have been shown to learn effective predictors on a wide range of machine learning problems. However, as the standard approach is to train the network to minimize a prediction loss, the resultant model remains ignorant to its prediction confidence. Orthogonally to Bayesian neural nets that indi…

2018-06-05abs ↗pdf ↗

R2D2-Net improves Bayesian neural networks by preventing over-shrinkage of important weights.

problem Bayesian neural networks struggle with choosing appropriate priors, leading to over-shrinkage or poor predictive performance.
method Proposes R2D2-Net with an R^2-induced Dirichlet Decomposition prior and variational Gibbs inference algorithm.
result R2D2-Net effectively shrinks irrelevant coefficients while preventing key features from over-shrinkage.

This paper improves Bayesian neural nets by using local linearization.

problem Underfitting in Bayesian neural networks.
method Local linearization of Bayesian neural networks to create a generalized linear model (GLM) for predictions.
result The GLM predictive resolves common underfitting problems of the Laplace approximation.

MPHD transfers knowledge across different domains for Bayesian optimization.

problem Optimizing functions with unknown or diverse domains.
method MPHD uses neural nets to map domain-specific contexts to GP specifications, enabling transfer learning across heterogeneous search spaces.
result MPHD improves black-box function optimization performance on diverse domains.

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.

Improves model accuracy for neural nets in stochastic dynamics with partial prior knowledge.

problem Stability and accuracy in neural nets modeling stochastic dynamics with many parameters.
method Three steps: probabilistic weights, partial knowledge incorporation, and PAC-Bayesian training.
result Improved model fit with partial and noisy prior knowledge.

We describe Bayesian Layers, a module designed for fast experimentation with neural network uncertainty. It extends neural network libraries with drop-in replacements for common layers. This enables composition via a unified abstraction over deterministic and stochastic functions and allows for scalability via the unde…

2018-12-10abs ↗pdf ↗

Proposes a new generalization bound for Bayesian deep nets without strict assumptions.

problem Lack of generalization bounds for Bayesian deep nets without strict assumptions.
method Exploits contractivity of Log-Sobolev inequalities to add a loss-gradient norm term to the generalization bound.
result Introduces a new generalization bound for Bayesian deep nets that avoids strict assumptions.

Rank-1 BNNs improve efficiency and scalability of Bayesian neural nets.

problem Underfitting and lack of scalability in Bayesian neural networks.
method Propose a rank-1 parameterization of BNNs and use mixture approximate posteriors.
result Rank-1 BNNs achieve state-of-the-art performance across various datasets.

We propose a novel method for closed-form predictive distribution modeling with neural nets. In quantifying prediction uncertainty, we build on Evidential Deep Learning, which has been impactful as being both simple to implement and giving closed-form access to predictive uncertainty. We employ it to model aleatoric un…

2019-06-03abs ↗pdf ↗

This paper improves ensemble learning for vision tasks by encouraging diversity in predictions.

problem Generating effective ensembles of neural networks for multi-modal data.
method Explicitly optimize a diversity inducing adversarial loss for learning stochastic latent variables.
result Significant improvements in classification accuracy and out-of-distribution detection compared to baselines.

This thesis builds theoretical foundations for deep learning, proving complexity theorems and training algorithms.

problem Rigorous explanation of deep learning's success and mathematical challenges.
method Developed circuit complexity theorems, classification theorems, and training algorithms for neural nets.
result Established the existence of high-complexity neural functions and provided rigorous proofs for training algorithms.

Bayesian neural networks predict stress fields and uncertainty in materials.

problem Uncertainty in stress field predictions for complex materials.
method Modified Bayesian U-net architecture with three inference algorithms.
result High accuracy predictions and interpretable uncertainty estimates.

An important class of distance metrics proposed for training generative adversarial networks (GANs) is the integral probability metric (IPM), in which the neural net distance captures the practical GAN training via two neural networks. This paper investigates the minimax estimation problem of the neural net distance ba…

2018-11-02abs ↗pdf ↗

New method solves high-dimensional Bayesian inverse problems efficiently.

problem Efficiently solving high-dimensional Bayesian inverse problems with limited data.
method Physics-informed Neural Operators with RealNVP architecture for invertibility and differentiability.
result Accurate approximations of the full posterior without additional forward solves or sampling.

Despite the phenomenal success of deep learning in recent years, there remains a gap in understanding the fundamental mechanics of neural nets. More research is focussed on handcrafting complex and larger networks, and the design decisions are often ad-hoc and based on intuition. Some recent research has aimed to demys…

2019-04-24abs ↗pdf ↗

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

A scalable method for Bayesian inference in large linear models.

problem High computational cost in Bayesian linear models for large networks.
method Sample-based inference and g-prior for hyperparameter selection.
result Linearised neural network inference on large datasets (ResNet-18, ResNet-50, U-Net).

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.

Proposes HDBEN for heteroscedastic regression with improved sparsity and variance modeling.

problem Violation of constant error variance in high-dimensional regression.
method HDBEN framework using hierarchical Bayesian priors with 1\ell_1 and 2\ell_2 penalties.
result Achieves posterior concentration, variable selection consistency, and asymptotic normality.

The vast majority of current machine learning algorithms are designed to predict single responses or a vector of responses, yet many types of response are more naturally organized as matrices or higher-order tensor objects where characteristics are shared across modes. We present a new machine learning algorithm BaTFLE…

2016-12-09abs ↗pdf ↗

Study measures impact of data and neural net similarity on transferability in restaurant sales data.

problem Identify indicators for successful transferability of neural nets across different data sets.
method Empirical study on sales data from six restaurants, calculating indicators based on data and neural net similarities.
result Negative correlations between transferability and indicators, allowing better model performance and fewer transfers.

Learning to Optimize is a recently proposed framework for learning optimization algorithms using reinforcement learning. In this paper, we explore learning an optimization algorithm for training shallow neural nets. Such high-dimensional stochastic optimization problems present interesting challenges for existing reinf…

2017-03-01abs ↗pdf ↗

This paper considers the power of deep neural networks (deep nets for short) in realizing data features. Based on refined covering number estimates, we find that, to realize some complex data features, deep nets can improve the performances of shallow neural networks (shallow nets for short) without requiring additiona…

2019-01-01abs ↗pdf ↗

DNF-Net tackles tabular data challenges with neural architecture.

problem Handling tabular data efficiently using neural networks.
method DNF-Net uses a neural architecture with inductive bias corresponding to logical Boolean formulas in disjunctive normal form over affine soft-threshold decision terms.
result DNF-Net significantly outperforms fully connected networks on tabular data.

fSDE-Net generates time series with long-term memory using neural networks.

problem Generating time series with long-term memory from irregularly sampled data.
method fSDE-Net: neural fractional Stochastic Differential Equation Network using fractional Brownian motion.
result fSDE-Net can replicate distributional properties of real time-series data.

Proposes ΠΠ-Nets, polynomial neural networks, for improved representation power.

problem Improving representation power in deep learning models.
method Introduces ΠΠ-Nets, a new class of deep polynomial neural networks.
result Demonstrates ΠΠ-Nets outperform standard DCNNs and achieve state-of-the-art results.