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…
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
48 results for “Deep learning efficiency”
Deep learning has enabled major advances in the fields of computer vision, natural language processing, and multimedia among many others. Developing a deep learning system is arduous and complex, as it involves constructing neural network architectures, managing training/trained models, tuning optimization process, pre…
Proposes using gradients as features for efficient deep learning adaptation.
problem Efficient deep representation learning for different tasks.
method Designs a linear model incorporating gradients and activations of a pre-trained network.
result Shows strong results across various tasks and datasets.
The paper identifies overfitting as the main bottleneck in efficient deep reinforcement learning.
problem Improving sample efficiency in deep reinforcement learning.
method Empirical analysis on DMC tasks to identify overfitting as the main issue and developing a hill-climbing method targeting validation TD error.
result Overfitting is the primary bottleneck in sample-efficient deep RL, and regularization techniques can control this.
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 learning improves portfolio optimization efficiency.
problem Efficient frontier calculation in high-dimensional finance problems.
method Deep neural networks for portfolio optimization with added constraints.
result A new projected feedforward network outperforms classical methods.
Improved sample efficiency in reinforcement learning with deep Gaussian processes.
problem Efficiently learn to control actions with limited interaction data.
method Deep Gaussian processes that simulate dynamics with depth and prior knowledge.
result Significantly improved early sample efficiency across various tasks, including half-cheetah control.
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…
New deep learning architecture learns martingales efficiently.
problem Efficiently learning martingales in financial derivatives pricing.
method High-order weak approximation algorithms of Runge-Kutta type.
result Deep neural networks based on this architecture learn martingales effectively.
Study develops efficient nested deep hedging method for derivatives pricing.
problem Hedging derivatives in market frictions using multiple options.
method Nested deep hedging approach with efficient learning techniques.
result Reduces arbitrage opportunities and improves hedging risks.
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.
swTVM: Towards Optimized Tensor Code Generation for Deep Learning on Sunway Many-Core Processorcs.LG
The flourish of deep learning frameworks and hardware platforms has been demanding an efficient compiler that can shield the diversity in both software and hardware in order to provide application portability. Among the existing deep learning compilers, TVM is well known for its efficiency in code generation and optimi…
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.
This paper provides an overview of deep semi-supervised learning methods.
problem Reducing the need for large annotated datasets in deep learning.
method Summarizes dominant semi-supervised approaches in deep learning.
result Provides a comprehensive overview of deep semi-supervised learning.
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.
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.
New method creates coresets for deep neural networks efficiently.
problem Efficiently handling large data streams with limited resources.
method Cardinality-constrained bilevel optimization for deep neural networks.
result Demonstrated efficient generation of coresets for deep neural networks.
Deep neuroevolution, that is evolutionary policy search methods based on deep neural networks, have recently emerged as a competitor to deep reinforcement learning algorithms due to their better parallelization capabilities. However, these methods still suffer from a far worse sample efficiency. In this paper we invest…
Efficiently learns deep factor graphs using Gaussian belief propagation.
problem Learning in deep factor graphs with efficient inference.
method Treats all relevant quantities as random variables, uses belief propagation for inference.
result Efficiently solves training and prediction problems in deep factor graphs with belief propagation.
The paper uses deep learning to efficiently price Bermudan swaptions.
problem Pricing Bermudan swaptions efficiently and accurately.
method Combines differential machine learning, Monte Carlo simulation, and joint learning.
result Improves efficiency and accuracy in pricing Bermudan swaptions.
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.
A new correction term improves sample efficiency in deep reinforcement learning.
problem Momentum accumulation in TD learning leads to doubly stale gradients.
method Proposed a correction term to address the issue of doubly stale gradients.
result Improves sample efficiency in policy evaluation.
A new algorithm improves efficiency in selecting examples for deep learning.
problem Efficiently choosing multiple examples to mark up for deep learning on large datasets.
method Large BatchBALD algorithm, approximating BatchBALD with reduced computational complexity.
result Comparable quality in selection while significantly reducing computation time, especially for large batches.
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.
The study explores how brain development can inspire efficient deep learning models.
problem Efficient and robust optimization procedures for deep learning.
method Inspiration from biological neural development to improve deep learning models.
result Biological neural development can inspire efficient and robust optimization procedures.
Paper proposes a deep RL approach for traffic signal control balancing efficiency and equity.
problem Inefficient and inflexible traffic signal controllers.
method Deep reinforcement learning with a novel reward function combining efficiency and equity.
result The proposed algorithm achieves state-of-the-art performance on various traffic scenarios.
Deep reinforcement learning finds optimal learning policies for adaptive systems.
problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.
Securely trains neural networks remotely with deep learning's flaws.
problem Secure and efficient training of neural networks over unsecured channels.
method Leverages deep learning's weaknesses for secure training.
result Efficient and secure training of neural networks remotely.
Active deep learning classification of hyperspectral images is considered in this paper. Deep learning has achieved success in many applications, but good-quality labeled samples are needed to construct a deep learning network. It is expensive getting good labeled samples in hyperspectral images for remote sensing appl…
We methodologically address the problem of Q-value overestimation in deep reinforcement learning to handle high-dimensional state spaces efficiently. By adapting concepts from information theory, we introduce an intrinsic penalty signal encouraging reduced Q-value estimates. The resultant algorithm encompasses a wide r…
Efficiently regularizes deep learning models using Jacobian nuclear norm.
problem Regularizing deep learning models to prevent overfitting and improve generalization.
method Proposes a denoising-style approximation to penalize the Jacobian nuclear norm without computing the Jacobian matrix.
result Demonstrates that penalizing the average squared Frobenius norm of and is equivalent to penalizing the Jacobian nuclear norm for function compositions.
Deep learning methods improve subsurface flow modeling efficiency.
problem Efficiently modeling subsurface flow with uncertain parameters.
method Two categories of deep-learning based inverse modeling methods: surrogate-based and direct.
result Deep-learning methods significantly accelerate subsurface flow modeling.
Recently deep reinforcement learning (DRL) has achieved outstanding success on solving many difficult and large-scale RL problems. However the high sample cost required for effective learning often makes DRL unaffordable in resource-limited applications. With the aim of improving sample efficiency and learning performa…
New algorithm reduces communication costs in distributed deep learning.
problem High communication costs in distributed deep learning.
method Sparse-SignSGD with Majority Vote (S3GD-MV).
result Significantly reduces communication costs while maintaining accuracy.
A new algorithm solves high-dimensional nonlinear BSDEs efficiently.
problem Solving high-dimensional nonlinear backward stochastic differential equations (BSDEs).
method Transformed BSDE into a differential deep learning problem using Malliavin calculus. Discretized integrals using Euler-Maruyama method. Approximated solution with three deep neural networks. Optimized parameters using a differential learning loss function.
result Our algorithm is more accurate and faster than other methods.
Deep learning's success requires vast computing power, making future progress unsustainable.
problem Deep learning's success is heavily dependent on computing power, making future progress unsustainable.
method Cataloging and extrapolating the dependency on computing power for various deep learning applications.
result Continued progress in deep learning applications will require more computationally-efficient methods.
Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning Dynamicscs.LG
Efficiently compress overparameterized deep models by focusing on low-dimensional learning dynamics.
problem Overparameterized models increase computational and memory costs.
method Study of learning dynamics reveals updates occur within a low-dimensional subspace, leading to a compression algorithm.
result Compressed deep linear networks converge faster and yield smaller recovery errors.
Adaptive multi-domain learning reduces parameter count for efficient deep learning.
problem Different domains have varying complexity, leading to inefficient model training.
method Proposes adaptive parameterization to reduce model complexity without sacrificing performance.
result Efficient multi-domain learning solutions with far fewer parameters.
Research reveals deep networks often learn low-rank structures, leading to more efficient training and fine-tuning.
problem Efficient training and deployment of large-scale deep learning models.
method Complementary theoretical perspectives on low-rank structures during training and convergence, and practical applications of LoRA and masked training.
result Understanding and exploiting low-rank structures can improve efficiency and effectiveness of training and fine-tuning.
Improved computed tomography reconstruction with deep learning and deep image prior.
problem Low data efficiency in computed tomography reconstruction.
method Combining learned primal-dual methods with deep image prior for improved quality and generalization.
result Proposed methods outperform state-of-the-art in low data regime.
BLAST optimizes deep model inference by learning efficient matrix structures.
problem Efficient inference of large-scale deep neural networks.
method Introduces BLAST matrix for adaptive structured weights.
result Significant compression and performance improvements for various model sizes.
In this article we review computational aspects of Deep Learning (DL). Deep learning uses network architectures consisting of hierarchical layers of latent variables to construct predictors for high-dimensional input-output models. Training a deep learning architecture is computationally intensive, and efficient linear…
Proposes efficient data acquisition for personalized treatment effects from observational data.
problem Efficiently acquiring outcomes for personalized treatment effects in observational studies.
method Introduces causal, Bayesian acquisition functions to select points with overlapping support.
result Demonstrates improved sample efficiency and accuracy in learning personalized treatment effects.
Enhances crypto-asset AMM with deep learning for better liquidity and efficiency.
problem Reduced slippage and improved liquidity in decentralized finance.
method Deep reinforcement learning for predicting market equilibrium and optimizing liquidity.
result Improved capital efficiency and reduced slippage for crypto-asset traders.
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.
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.
We study the use of randomized value functions to guide deep exploration in reinforcement learning. This offers an elegant means for synthesizing statistically and computationally efficient exploration with common practical approaches to value function learning. We present several reinforcement learning algorithms that…