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,742 papers · 148 categories

Trend · papers per month

4418831,3241,765 · Jun 202019922001200920172026
48 results for neural network models

Probabilistic deep learning uses neural networks and models to handle uncertainty.

problem Handling uncertainty in deep learning models.
method Two approaches: probabilistic neural networks and deep probabilistic models.
result TensorFlow Probability library supports both approaches.

Quantum neural network and tensor network models outperform classical models in Japanese stock market predictions.

problem Improving stock return predictions using quantum and quantum-inspired machine learning.
method Evaluation of quantum neural network and tensor network models against classical models like linear and neural networks.
result Tensor network model outperforms classical models in Japanese stock market, including linear and neural network models.

Paper introduces new neural network models and theories.

problem Understanding neural networks beyond over-parameterized regime.
method Develops two exact models and a novel representor theory.
result Provides insights into neural network training and kernel evolution.

Analyzes neural networks using linear models to understand their behavior.

problem Understanding multi-layer neural networks through linear models.
method Recalls and reviews four models: linear regression with concentrated features, kernel ridge regression, random feature model, and neural tangent model.
result Highlights limitations of linear theory and discusses approaches to overcome them.

Neural networks can model chaos efficiently by becoming geometrically chaotic.

problem Lack of theoretical understanding of how neural networks learn chaos.
method Employed a geometric perspective to show neural networks can model chaotic dynamics.
result Neural networks can reconstruct strange attractors and accurately predict local divergence rates.

Research on neural networks has gained significant momentum over the past few years. Because training is a resource-intensive process and training data cannot always be made available to everyone, there has been a trend to reuse pre-trained neural networks. As such, neural networks themselves have become research data.…

2019-07-26abs ↗pdf ↗

Stochastic neural networks with infinite width become deterministic, reducing training variance.

problem Understanding how stochasticity in neural networks affects learning and regularization.
method Theoretical analysis of stochastic neural networks with infinite width.
result As the width of an optimized stochastic neural network increases, its predictive variance on the training set decreases to zero.

Proposes a neural network for contextual regression.

problem Improving model efficiency and interpretability in regression with contextual features.
method Simple contextual neural network (SCtxtNN) that separates context identification from context-specific regression.
result SCtxtNN achieves lower excess mean squared error and more stable performance than feed-forward neural networks.

Neural networks can learn relationships that traditional models cannot.

problem Identifying factors that differentiate neural networks from traditional models.
method Proving non-identifiability of neural networks compared to smooth parametric models.
result Neural networks can learn nontrivial relationships that traditional models cannot.

Neural networks improve nonparametric regression with measurement errors.

problem Nonparametric regression with measurement errors.
method Proposes a neural network design using FNN, normalizing flow, and inference network.
result Neural network approach is more flexible and superior or comparable to classical methods.

Paper benchmarks quantum neural networks against classical ones for binary classification tasks.

problem Comparing quantum neural networks with classical ones for binary classification.
method Evaluated with two toy examples, focusing on model complexity and training data size.
result EQNN and QNN outperform ENN and DNN for smaller parameter sets and training data samples.

This work proves composite neural networks outperform their components under certain conditions.

problem Understanding the performance of composite neural networks.
method Theoretical investigation of a composite neural network combining pre-trained models.
result A composite neural network, with high probability, performs better than any of its pre-trained components.

Smartfluidnet accelerates Eulerian fluid simulation with neural networks.

problem Current neural network methods for Eulerian fluid simulation lack flexibility and generalization.
method Smartfluidnet automates model generation and dynamic switching to meet user requirements.
result Smartfluidnet achieves 1.46x and 590x speedup compared to state-of-the-art models, with better simulation quality.

Model-based neural networks generalize better than ReLU networks for sparse recovery.

problem Understanding and quantifying the superior generalization of model-based neural networks.
method Using complexity measures like global and local Rademacher complexities, the paper provides theoretical bounds on generalization and estimation errors.
result Model-based neural networks exhibit higher generalization capabilities for sparse recovery problems compared to ReLU networks.

A neural network learns to improve verification of neural networks.

problem Efficient verification of neural networks for safety-critical applications.
method A graph neural network (GNN) learns to imitate strong branching heuristics for effective branching in the Branch and Bound (BaB) formulation.
result Reduces the number of branches and verification time by roughly 50% compared to hand-designed strategies.

Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…

2019-06-05abs ↗pdf ↗

A neural network model minimizes region-based free energy for faster inference in MRFs.

problem Efficient inference in complex Markov random fields (MRFs).
method Region-based Energy Neural Network (RENN) that directly minimizes region-based free energy.
result RENN outperforms other methods in marginal distribution estimation, partition function estimation, and MRF learning.

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Proposes a simple neural network model similar to gradient boosted decision trees.

problem Building a neural network equivalent to gradient boosted decision trees.
method Converts an ensemble of decision trees to a neural network, relaxes properties, and trains a simple neural network model.
result The proposed Hammock model achieves similar performance to gradient boosted decision trees.

Most of the successful deep neural network architectures are structured, often consisting of elements like convolutional neural networks and gated recurrent neural networks. Recently, graph neural networks have been successfully applied to graph structured data such as point cloud and molecular data. These networks oft…

2019-06-03abs ↗pdf ↗

Deep neural network predicts multiphase flow in heterogeneous domains.

problem Predicting multiphase flow in complex, heterogeneous systems.
method Deep neural network model for handling permeability heterogeneity and learning interplay of forces.
result Highly accurate predictions of CO2 saturation distribution with computational efficiency.

We propose Sparse Neural Network architectures that are based on random or structured bipartite graph topologies. Sparse architectures provide compression of the models learned and speed-ups of computations, they can also surpass their unstructured or fully connected counterparts. As we show, even more compact topologi…

2017-06-18abs ↗pdf ↗

Use simplified layerwise linear models to understand neural dynamics.

problem Complex neural network dynamics are hard to grasp.
method Apply simplified layerwise linear models to explain neural phenomena.
result Simplified models explain neural collapse, emergence, etc.

Paper discovers differential equations from data using neural networks and Bayesian methods.

problem Discovering differential equations from datasets using machine learning.
method Integrates neural network-based surrogates with Sparse Bayesian Learning (SBL).
result Proposes a robust model discovery algorithm and a Physics Informed Normalizing Flow (PINF).

Due to the extremely volatile nature of financial markets, it is commonly accepted that stock price prediction is a task full of challenge. However in order to make profits or understand the essence of equity market, numerous market participants or researchers try to forecast stock price using various statistical, econ…

2018-05-29abs ↗pdf ↗

Neural networks improve cancer risk prediction from family history data.

problem Improving cancer risk prediction from family history data using machine learning.
method Developed and trained neural network models on large pedigrees to predict hereditary cancers.
result Neural networks can achieve nearly optimal prediction performance and outperform traditional models in misreported data.

New neural model processes 2D data with long-range dependencies efficiently.

problem Limited receptive field of convolutions for complex 2D tasks.
method Proposes Matrix Shuffle-Exchange network with O(logn)\mathcal{O}( \log{n}) layers and O(n2logn)\mathcal{O}( n^2 \log{n}) complexity.
result Exceeds convolutional and graph neural network baselines in long-range dependency modeling.

GraphMoE generates random graphs using neural networks and graphlets.

problem Learning generative models for random graphs.
method GraphMoE uses a neural network trained with graphlets and subgraph counts to match the distribution of random graphs.
result GraphMoE can generate graphs that mimic various real-world datasets and fool graph classifiers.

The paper explores grokking in various models, revealing it's not limited to neural networks.

problem Understanding grokking in different models and its mechanism.
method Empirical exploration of grokking in neural networks, Gaussian processes, linear regression, and Bayesian neural networks. Inducing grokking through spurious dimensions.
result Grokking occurs in non-neural architectures, indicating it's not model-specific.

How can we efficiently propagate uncertainty in a latent state representation with recurrent neural networks? This paper introduces stochastic recurrent neural networks which glue a deterministic recurrent neural network and a state space model together to form a stochastic and sequential neural generative model. The c…

2016-05-24abs ↗pdf ↗

Survey on statistical theories of neural networks, focusing on approximation, training dynamics, and generative models.

problem Understanding the statistical properties and training dynamics of neural networks.
method Review of existing literature on neural networks from three perspectives: approximation, training dynamics, and generative models.
result Theoretical insights into neural network training dynamics and generative models.