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

Trend · papers per month

3496971,0461,394 · Jun 202019922001200920172026
48 results for efficient deep networks

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 ↗

Deep networks can learn functions approximated by shallow networks, but not all functions.

problem The learnability of functions by deep neural networks and the approximation capacity of simpler classes.
method Study the connection between learnability and approximation capacity of functions by deep neural networks and simpler classes.
result A necessary condition for a function to be learnable by deep neural networks is to be approximable by shallow networks.

Deep networks can approximate score functions in high-dimensional graphical models efficiently.

problem Approximation efficiency of score functions by deep neural networks in high-dimensional graphical models like Markov random fields.
method Variational inference denoising algorithms and efficient neural network representation.
result Efficient sample complexity bound for diffusion-based generative modeling when score functions are learned by deep neural networks.

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.

Increasing input dimensionality improves deep RL performance and sample efficiency.

problem Real-world reinforcement learning applications often lack sufficient training data.
method Proposed an online feature extractor network (OFENet) to improve deep RL performance and sample efficiency.
result RL agents learn more efficiently with high-dimensional input representations than with lower-dimensional state observations.

Deep quantum neural networks applied to finance for efficient risk management.

problem Efficiently solving numerical problems in finance, especially risk management.
method Application of deep quantum neural networks to finance, focusing on implied volatilities, option prices, and Greeks.
result Deep quantum neural networks can compute Greeks analytically and efficiently solve financial numerical problems.

Deep neural networks are a powerful tool for feature learning and extraction given their ability to model high-level abstractions in highly complex data. One area worth exploring in feature learning and extraction using deep neural networks is efficient neural connectivity formation for faster feature learning and extr…

2015-12-11abs ↗pdf ↗

We show that a collection of Gaussian mixture models (GMMs) in RnR^{n} can be optimally classified using O(n)O(n) neurons in a neural network with two hidden layers (deep neural network), whereas in contrast, a neural network with a single hidden layer (shallow neural network) would require at least O(exp(n))O(\exp(n)) neurons …

2019-02-15abs ↗pdf ↗

Examines learning efficiency in neural networks and related models.

problem Analyzing efficiency in deep learning models with singular learning coefficients.
method Examined learning coefficients in neural networks and three-layer neural networks with ReLU units.
result Extended results to include Softmax function, providing a broader understanding of learning efficiency.

Learning portable neural networks is very essential for computer vision for the purpose that pre-trained heavy deep models can be well applied on edge devices such as mobile phones and micro sensors. Most existing deep neural network compression and speed-up methods are very effective for training compact deep models, …

2019-04-02abs ↗pdf ↗

Efficiently maximizes AUC with deep nets, reducing communication rounds.

problem Maximizing AUC with deep neural networks in a distributed setting.
method Communication-efficient distributed optimization algorithm for non-convex concave AUC maximization.
result Achieves linear speedup with significantly fewer communication rounds.

Rational neural networks approximate functions more efficiently with less depth.

problem Choosing optimal nonlinear activation functions in neural networks.
method Rational activation functions with optimal bounds and efficiency proofs.
result Rational neural networks approximate smooth functions more efficiently than ReLU networks with exponentially smaller depth.

New method grows deep networks efficiently by dynamically pruning and growing layers.

problem Training deep networks is computationally expensive and inefficient.
method Structured continuous sparsification starting from a small seed architecture.
result 49.7% inference FLOPs and 47.4% training FLOPs savings with 75.2% top-1 accuracy.

Paper develops efficient variational inference for sparse deep learning with theoretical guarantees.

problem Sparse deep learning's challenge of huge storage consumption and sparse structure recovery.
method Bayesian treatment with spike-and-slab priors and continuous relaxation of Bernoulli distribution for computationally efficient variational inferences.
result Provides variational posterior contraction rate, justifying consistency of the proposed method.

Develops a deep non-stationary kernel for non-stationary spatio-temporal point processes.

problem Capturing non-stationary dependencies in point process data.
method Approximates the influence kernel with a novel low-rank decomposition and introduces a log-barrier penalty to maintain non-negativity.
result Demonstrates superior performance and computational efficiency compared to state-of-the-art methods.

Proposes DGCN with trajectory sampling for data-efficient policy search in MBRL.

problem Improving data efficiency in model-based reinforcement learning.
method Combines trajectory sampling and DGCN for uncertainty propagation in probabilistic world models.
result Improves sample-efficiency over other uncertainty propagation methods and probabilistic models.

WaveQ uses sinusoidal regularization to optimize deep quantization for neural networks, improving both efficiency and accuracy.

problem Deep quantization reduces bitwidth but can lead to significant accuracy loss due to inter-layer dependencies.
method WaveQ employs sinusoidal regularization to learn multiple quantization parameters during gradient-based training, balancing compute efficiency and accuracy.
result WaveQ achieves accuracy preservation and efficiency gains across various deep networks, outperforming state-of-the-art techniques.

Deep neural networks and the ENO procedure are both efficient frameworks for approximating rough functions. We prove that at any order, the ENO interpolation procedure can be cast as a deep ReLU neural network. This surprising fact enables the transfer of several desirable properties of the ENO procedure to deep neural…

2019-12-13abs ↗pdf ↗

Deep neural networks continue to show improved performance with increasing depth, an encouraging trend that implies an explosion in the possible permutations of network architectures and hyperparameters for which there is little intuitive guidance. To address this increasing complexity, we propose Evolutionary DEep Net…

2017-09-26abs ↗pdf ↗

FBSJNN solves PIDEs and FBSDEJs with deep learning, offering theoretical and numerical efficiency.

problem Solving Partial Integro-Differential Equations and Forward-Backward Stochastic Differential Equations with Jumps.
method FBSJNN framework using a single neural network for both solution approximation and non-local integral.
result FBSJNN achieves numerical solutions with a relative error of 10310^{-3}, demonstrating efficiency.

Proposes a sample-efficient method for uncertainty estimation in deep learning.

problem Inaccurate uncertainty estimation in deep learning models, especially with limited data.
method Probabilistic Neighbourhood Component Analysis (PCA) for sample-efficient uncertainty estimation.
result Demonstrates superior uncertainty quantification compared to state-of-the-art methods.

DQA efficiently quantizes deep neural network activations for resource-constrained devices.

problem Efficiently quantizing deep neural network activations for resource-constrained devices.
method DQA uses simple shifting-based operations and Huffman coding for sub-6-bit quantization.
result DQA achieves significantly better accuracy than direct quantization and state-of-the-art methods.

Deep learning upscales geologic models efficiently.

problem Upscaling large-scale geologic models for efficient simulation.
method Theory-guided convolutional neural network (TgCNN) trained to approximate hydraulic conductivity relationships.
result Deep learning method achieves equivalent upscaling accuracy to numerical methods but with significantly improved efficiency.

Efficient equivariant MobileNetV2 for medical applications on mobile devices.

problem Limited computational resources for deep learning models in medical applications.
method Design and optimize an equivariant version of MobileNetV2 with model quantization.
result Achieved close-to state-of-the-art performance on medical dataset with improved efficiency.

A hybrid neural network optimizes AI deployment on edge and cloud for energy efficiency.

problem Energy and resource constraints in edge devices for deep learning models.
method Conditionally deep hybrid neural network with quantized layers at edge and full-precision layers at cloud.
result Early classification at the edge reduces energy consumption by 5.5x on CIFAR-10 dataset.

To train an inference network jointly with a deep generative topic model, making it both scalable to big corpora and fast in out-of-sample prediction, we develop Weibull hybrid autoencoding inference (WHAI) for deep latent Dirichlet allocation, which infers posterior samples via a hybrid of stochastic-gradient MCMC and…

2018-03-04abs ↗pdf ↗