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

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for distributed deep learning

Combining Bayesian deep learning and split conformal prediction affects out-of-distribution coverage.

problem Improving out-of-distribution coverage in multiclass image classification.
method Combining Bayesian deep learning with split conformal prediction methods.
result Combining methods can reduce out-of-distribution coverage in some cases.

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.

Deep metric learning employs deep neural networks to embed instances into a metric space such that distances between instances of the same class are small and distances between instances from different classes are large. In most existing deep metric learning techniques, the embedding of an instance is given by a featur…

2019-12-04abs ↗pdf ↗

RelaySum improves decentralized deep learning by uniformly distributing data across workers.

problem Handling data heterogeneity in decentralized deep learning.
method RelaySum uses spanning trees to distribute information exactly uniformly across all workers with finite delays.
result RelaySum is independent of data heterogeneity and scales to many workers, enabling highly accurate decentralized deep learning.

Paper introduces DQPOPE for estimating return distributions in reinforcement learning.

problem Estimating the entire return distribution from off-policy data.
method Deep quantile process regression for distributional off-policy evaluation.
result DQPOPE achieves statistical advantages by estimating full return distribution with same sample size.

Reduces data leakage in distributed deep learning models.

problem Prevents reconstruction of sensitive raw data patterns during client communications.
method Reduces distance correlation between raw data and learned representations.
result Resilient to reconstruction attacks while maintaining model accuracy.

In this work, we introduce a novel probabilistic representation of deep learning, which provides an explicit explanation for the Deep Neural Networks (DNNs) in three aspects: (i) neurons define the energy of a Gibbs distribution; (ii) the hidden layers of DNNs formulate Gibbs distributions; and (iii) the whole architec…

2019-08-26abs ↗pdf ↗

In this paper, we propose a novel method for generating a synthetic dataset obeying Gaussian distribution. Compared to the commonly used benchmark datasets with unknown distribution, the synthetic dataset has an explicit distribution, i.e., Gaussian distribution. Meanwhile, it has the same characteristics as the benchm…

2019-06-01abs ↗pdf ↗

Enhances DIM to match learned representations to a specific distribution.

problem Learning representations conforming to a specific distribution.
method Injecting noise into normalized outputs of the encoder while keeping the InfoMax training objective.
result Learning uniformly and normally distributed representations, as well as representations of other absolutely continuous distributions.

Deep neural networks forecast financial return distributions accurately.

problem Forecasting probability distributions of financial returns.
method Used 1D CNN and LSTM architectures with custom loss functions to optimize distribution parameters.
result LSTM with skewed Student's t distribution outperformed classical models in multiple evaluation metrics.

A new method for learning conditional distributions using ODEs and neural networks.

problem Learning conditional distributions efficiently and accurately.
method Conditional Föllmer Flow, discretized with Euler's method, using nonparametric velocity estimation.
result Effective approximation of target conditional distributions, with convergence results for Wasserstein-2 distance.

Flexible evidential deep learning improves uncertainty quantification in machine learning.

problem Overconfident predictions in machine learning models can lead to serious consequences.
method Proposes flexible evidential deep learning (F-EDL) to model uncertainty over class probabilities using a flexible Dirichlet distribution.
result Empirically demonstrates state-of-the-art uncertainty quantification performance across diverse scenarios.

This paper introduces Probability Engineering to improve deep learning models.

problem Challenges in traditional probabilistic modeling for AI applications.
method Treats learned probability distributions as engineering artifacts and actively modifies them.
result Improves robustness, efficiency, adaptability, and trustworthiness of deep learning models.

Paper proposes a new method for designing materials using deep learning.

problem Designing high-performance material distributions from given distributions.
method Iterative process of selecting, generating, and merging material distributions using a deep generative model.
result The method improves material performance through iterative refinement.

We survey distributed deep learning models for training or inference without accessing raw data from clients. These methods aim to protect confidential patterns in data while still allowing servers to train models. The distributed deep learning methods of federated learning, split learning and large batch stochastic gr…

2018-12-08abs ↗pdf ↗

The recent advances in deep transfer learning reveal that adversarial learning can be embedded into deep networks to learn more transferable features to reduce the distribution discrepancy between two domains. Existing adversarial domain adaptation methods either learn a single domain discriminator to align the global …

2019-09-18abs ↗pdf ↗

Researchers improve deep ensemble forecast aggregation methods.

problem Aggregating forecast distributions from deep ensembles for better predictive performance.
method Comprehensive analysis of twelve benchmark data sets, comparing probability- and quantile-based aggregation methods for three neural network-based approaches.
result A general quantile aggregation framework for deep ensembles improves predictive performance in various settings.

Gradient descent struggles to achieve zero loss in deep learning models due to non-generic data distributions.

problem Achieving zero loss minimizers in deep learning networks.
method Analysis of gradient descent algorithm in deep learning, focusing on underparametrized networks.
result Zero loss minimization cannot be achieved generically in deep learning networks.

A new probabilistic approach improves deep metric learning by considering image uncertainties and class-specific variances.

problem Proxy-based deep metric learning struggles with image uncertainties and class-specific structures.
method Introduces non-isotropic probabilistic proxy-based deep metric learning using directional von Mises-Fisher distributions.
result Improves generalization performance and competitive on standard benchmarks.

The TensorFlow Distributions library implements a vision of probability theory adapted to the modern deep-learning paradigm of end-to-end differentiable computation. Building on two basic abstractions, it offers flexible building blocks for probabilistic computation. Distributions provide fast, numerically stable metho…

2017-11-28abs ↗pdf ↗

An ensemble method enhances cryptocurrency trading strategies using deep reinforcement learning.

problem Improving generalization performance in stochastic cryptocurrency trading environments.
method Model selection and mixture distribution policy to ensemble deep reinforcement learning models.
result Improved out-of-sample performance compared to benchmarks.

This paper improves confidence measurement in deep metric learning models.

problem Measuring confidence in deep metric learning models is challenging.
method Approximates class distributions using Gaussian kernel smoothing and calibrates the confidence metric.
result Improves generalization and robustness of deep metric learning models.

Deep networks adapt to function regularity and data distribution.

problem Understanding deep learning's adaptability to function regularity and data distribution.
method Developed nonparametric approximation and estimation theories for a broad class of functions using deep ReLU networks.
result Deep neural networks are adaptive to different regularity of functions and nonuniform data distributions.

Deep learning models converge to Gaussian dynamics with mixed structured inputs.

problem Understanding neural network dynamics with complex input distributions.
method Extended hidden manifold model to Gaussian mixtures, analyzed via SGD.
result Learning dynamics with mixed inputs converge to Gaussian behavior.

Wide and Deep GNN learns from distributed graphs and retrain online.

problem Decentralized graph support changes over time, causing mismatch between training and testing graphs.
method Wide and Deep GNN architecture with distributed online learning.
result Convergence guarantees for online retraining of the wide part of the GNN.

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.

A new method for deep learning under distribution shift by iteratively refining importance weighting.

problem Handling distribution shift in deep learning models when training and test data distributions differ.
method Dynamic Importance Weighting (dynamic IW) that iterates between weight estimation and weighted classification, using a pre-trained feature extractor and stochastic optimization.
result Dynamic IW outperforms state-of-the-art methods in experiments with various types of distribution shift on multiple datasets.