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

Trend · papers per month

4579131,3701,826 · Jun 202019922001200920172026
48 results for Deep Learning Networks

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.

With the growth of deep learning, how to describe deep neural networks unifiedly is becoming an important issue. We first formalize neural networks mathematically with their directed graph representations, and prove a generation theorem about the induced networks of connected directed acyclic graphs. Then, we set up a …

2018-05-09abs ↗pdf ↗

Lectures on deep learning properties in infinite and large-width networks.

problem Understanding deep neural networks in extreme width conditions.
method Analysis of random deep neural networks, connections to linear models, kernels, and Gaussian processes, perturbative and non-perturbative treatments.
result Properties and behaviors of deep neural networks in the infinite-width limit and large-width regime.

Many theories of deep learning have shown that a deep network can require dramatically fewer resources to represent a given function compared to a shallow network. But a question remains: can these efficient representations be learned using current deep learning techniques? In this work, we test whether standard deep l…

2018-07-17abs ↗pdf ↗

We introduce a novel Deep Reinforcement Learning (DRL) algorithm called Deep Quality-Value (DQV) Learning. DQV uses temporal-difference learning to train a Value neural network and uses this network for training a second Quality-value network that learns to estimate state-action values. We first test DQV's update rules…

2018-09-30abs ↗pdf ↗

Proves deep networks can learn hierarchical structures efficiently.

problem Understanding how deep networks learn hierarchical structures in data.
method Random Hierarchy Models, gradient-based methods, layerwise training.
result Proves deep networks can efficiently learn hierarchical structures.

Why and how that deep learning works well on different tasks remains a mystery from a theoretical perspective. In this paper we draw a geometric picture of the deep learning system by finding its analogies with two existing geometric structures, the geometry of quantum computations and the geometry of the diffeomorphic…

2017-10-30abs ↗pdf ↗

In recent years, deep learning methods applying unsupervised learning to train deep layers of neural networks have achieved remarkable results in numerous fields. In the past, many genetic algorithms based methods have been successfully applied to training neural networks. In this paper, we extend previous work and pro…

2017-11-21abs ↗pdf ↗

Hybrid tensor networks improve machine learning by combining quantum and classical methods.

problem Limitations of regular tensor networks in machine learning.
method Quantum-classical hybrid tensor networks (HTN) combining tensor networks and classical neural networks.
result HTN overcomes limitations of regular tensor networks and enables deep learning training.

Gradient amplification boosts deep learning model performance without increasing training time.

problem Vanishing gradients in deep neural networks.
method Gradient amplification approach to prevent vanishing gradients and training strategy to enable/disable across epochs.
result Improves performance of deep learning models with reduced training time.

Deep actor-critic learning optimizes power control in mobile networks.

problem Optimizing power control in large-scale wireless mobile networks.
method Multi-agent deep reinforcement learning with deep deterministic policy gradient.
result The algorithm maximizes a global utility function in a distributed manner.

Two new criteria help understand the advantage of deep neural networks.

problem Understanding the advantage of deepening neural networks.
method Proposed two new criteria to evaluate the expressivity of functions computable by deep neural networks.
result Increasing layers is more effective than increasing units in improving the expressivity of deep neural networks.

Deep learning has been widely applied and brought breakthroughs in speech recognition, computer vision, and many other domains. The involved deep neural network architectures and computational issues have been well studied in machine learning. But there lacks a theoretical foundation for understanding the approximation…

2018-05-28abs ↗pdf ↗

Bayesian methods enhance deep learning models by improving reliability and uncertainty.

problem Improving reliability and uncertainty awareness in deep learning models.
method Approximate Bayesian inference techniques, including SG-MCMC and VI, applied to deep learning models.
result Enhanced posterior inference for deep learning models, particularly in neural networks and generative models.

The study examines deep convolutional neural networks and their learning ability.

problem Understanding the learning ability of deep convolutional neural networks (DCNNs).
method Examines DCNNs under both underparameterized and overparameterized settings, using a novel network deepening scheme.
result Establishes the first learning rates of underparameterized DCNNs and shows how adding layers can create interpolating DCNNs with good learning rates.

The rise and fall of artificial neural networks is well documented in the scientific literature of both computer science and computational chemistry. Yet almost two decades later, we are now seeing a resurgence of interest in deep learning, a machine learning algorithm based on multilayer neural networks. Within the la…

2017-01-17abs ↗pdf ↗

The paper bounds the excess risk of deep neural networks for weakly dependent processes.

problem Learning with weakly dependent data using deep neural networks.
method Approximation of smooth functions by deep neural networks and a bound on excess risk.
result The excess risk bound for deep learning under weak dependence is close to O(n1/2)\mathcal{O}(n^{-1/2}) for sufficiently smooth functions.

Sparse Meta Networks adapt deep neural networks incrementally for fast learning.

problem Training deep neural networks is slow and impractical for complex, changing environments.
method Sparse Meta Networks use a memory layer to learn online sequential adaptation, accumulating fast-weights incrementally.
result Sparse Meta Networks achieve strong performance in various sequential adaptation scenarios.

Many studies have been undertaken by using machine learning techniques, including neural networks, to predict stock returns. Recently, a method known as deep learning, which achieves high performance mainly in image recognition and speech recognition, has attracted attention in the machine learning field. This paper im…

2018-01-03abs ↗pdf ↗

In recent years, China, the United States and other countries, Google and other high-tech companies have increased investment in artificial intelligence. Deep learning is one of the current artificial intelligence research's key areas. This paper analyzes and summarizes the latest progress and future research direction…

2018-04-05abs ↗pdf ↗

The paper studies how regularization parameters affect sparsity in deep neural networks.

problem Reducing the complexity of deep neural networks by promoting sparsity.
method Derives 1\ell_1-norm sparsity-promoting models, characterizes sparsity levels, and develops algorithms for selecting optimal regularization parameters.
result Developed algorithms to select regularization parameters for desired sparsity levels in neural networks.

Deep reinforcement learning boosts throughput in RF-powered cognitive radio networks.

problem Maximizing throughput in large-scale, decentralized RF-powered cognitive radio networks.
method Proposes deep reinforcement learning to find optimal policies for network throughput maximization.
result Deep reinforcement learning outperforms existing techniques in large-scale RF-CRN environments.

In this paper we introduce ZhuSuan, a python probabilistic programming library for Bayesian deep learning, which conjoins the complimentary advantages of Bayesian methods and deep learning. ZhuSuan is built upon Tensorflow. Unlike existing deep learning libraries, which are mainly designed for deterministic neural netw…

2017-09-18abs ↗pdf ↗

Study of infinitely deep but narrow neural networks using NTK theory.

problem Analyzing the role of depth in deep learning with overparameterized networks.
method Infinite-depth limit analysis of MLP and CNN using Neural Tangent Kernel (NTK) theory.
result Established trainability guarantee for infinitely deep but narrow neural networks.

A recent line of research on deep learning focuses on the extremely over-parameterized setting, and shows that when the network width is larger than a high degree polynomial of the training sample size nn and the inverse of the target error ε1ε^{-1}, deep neural networks learned by (stochastic) gradient descent enjoy …

2019-11-27abs ↗pdf ↗

An unsupervised deep learning method solves PIDEs for option pricing.

problem Solving partial integro-differential equations for financial option pricing.
method Employing unsupervised deep learning to directly solve PIDEs without requiring labeled data.
result An unsupervised neural network accurately solves PIDEs and calculates derivatives and integrals.

The paper addresses challenges in edge deep learning for IoT, proposing new directions.

problem Challenges in large-scale deep learning adoption for IoT devices.
method Unified view targeting three research directions: federated learning, data-independent deployment, and communication-aware inference.
result A network-centric approach is needed for edge intelligence.

Study of deep neural networks using finite-time Lyapunov exponents.

problem Understanding the geometric structures in input space formed by deep neural networks.
method Analogy with dynamical systems, computing finite-time Lyapunov exponents.
result Ridges of large positive exponents divide input space into regions associated with different classes.