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

73145218290 · May 202619922001200920172026
48 results for Finite DNNs

Analyzes DNNs trained with noisy gradients, finding FWCs negligible for large n.

problem Analyzing DNNs trained with noisy gradients.
method Introduced analytical framework to analyze non-Gaussian stochastic process.
result FWCs negligible for large n, improving CNN performance.

New neural network architectures use signed permutation representations for finite groups, improving performance.

problem Designing and optimizing neural networks for finite groups with signed permutation representations.
method Introduces GG-invariant deep neural networks with densely connected layers and signed permutation representations.
result Signed permutation representations lead to significantly better performance in classification tasks.

This paper explains robust overfitting in wide DNNs using adversarial training and NTK theory.

problem Robust overfitting in adversarially trained wide DNNs.
method Theoretical analysis using neural tangent kernel (NTK) theory and adversarial training dynamics.
result Adversarial training can lead to robust overfitting in wide DNNs, which can be mitigated by the proposed Adv-NTK method.

The paper examines when NTK theory applies to real finite-width neural networks.

problem Understanding when NTK theory accurately predicts the behavior of finite-width neural networks.
method Empirical study of fully-connected ReLU and sigmoid DNNs with various hyperparameters and depths.
result NTK theory does not always apply to sufficiently deep networks with exploding gradients, and the kernel changes significantly during training.

Proposes a neural network method to combine nonprobability and probability survey samples.

problem Combining nonprobability and probability survey samples for accurate population mean estimation.
method Uses a deep neural network to estimate sampling scores from nonprobability samples and combines them with probability sample information.
result Proposed estimators improve robustness to parametric propensity-score misspecification, especially for nonlinear selection mechanisms.

Deep neural networks learn by averaging fast variables, revealing a Gaussian process.

problem Analyzing the complex behavior of deep neural networks (DNNs) with billions of parameters.
method Identifying slow variables that average the erratic behavior of fast microscopic variables in fully trained DNNs.
result DNN layers couple only through the second moment (kernels) of their activations and pre-activations, which fluctuate in a nearly Gaussian manner.

In recent studies, several asymptotic upper bounds on generalization errors on deep neural networks (DNNs) are theoretically derived. These bounds are functions of several norms of weights of the DNNs, such as the Frobenius and spectral norms, and they are computed for weights grouped according to either input and outp…

2019-05-22abs ↗pdf ↗

The paper defines a hypothesis space for deep learning using DNNs.

problem Developing a mathematical framework for deep learning.
method Introducing a Banach space of functions of input variables based on DNNs, proving it's a RKBS, and establishing representer theorems for learning models.
result Solutions to learning problems can be expressed as finite sums of kernel expansions based on training data.

Study uses deep neural networks for inference in partially linear models with dependent data.

problem Inference in partially linear models with dependent data.
method First stage deep neural network (DNN) estimation followed by n\sqrt{n}-consistent and asymptotically normal estimator.
result The DNN-estimated finite dimensional parameter achieves n\sqrt{n}-consistency and asymptotic normality.

Topology optimization by optimally distributing materials in a given domain requires non-gradient optimizers to solve highly complicated problems. However, with hundreds of design variables or more involved, solving such problems would require millions of Finite Element Method (FEM) calculations whose computational cos…

2020-02-04abs ↗pdf ↗

New framework for DNN training guarantees convergence to global minimum.

problem Training deep neural networks to converge to global minimum.
method Reformulated minimization problem with recursive algorithmic framework, using bounded style assumptions.
result Convergence to an ε-(global) minimum with O(1/ε^3) gradient computations.

Deep neural networks (DNNs) have emerged as key enablers of machine learning. Applying larger DNNs to more diverse applications is an important challenge. The computations performed during DNN training and inference are dominated by operations on the weight matrices describing the DNN. As DNNs incorporate more layers a…

2018-07-06abs ↗pdf ↗

Sparse DNNs face scalability issues; MIT/IEEE/Amazon challenge analyzes best solutions.

problem Scalability issues in Sparse Deep Neural Networks (DNNs).
method Mathematically defined DNN inference computation, community submissions from various fields.
result Sparse DNN execution time, TmDNNT_{ m DNN}, is strongly dependent on the number of operations, NmopN_{ m op}.

End-to-end learning of codes for secure BPSK communication in Gaussian wiretap channel.

problem Secure communication in the presence of an adversary for BPSK modulation.
method Learning finite-length codes using deep neural networks (DNNs) with mutual information estimation.
result Learned codes achieve near-optimal security performance, as demonstrated by numerical results.

Deep Neural Network (DNN) acoustic models have yielded many state-of-the-art results in Automatic Speech Recognition (ASR) tasks. More recently, Recurrent Neural Network (RNN) models have been shown to outperform DNNs counterparts. However, state-of-the-art DNN and RNN models tend to be impractical to deploy on embedde…

2015-04-07abs ↗pdf ↗

DNN pruning reduces memory footprint and computational work of DNN-based solutions to improve performance and energy-efficiency. An effective pruning scheme should be able to systematically remove connections and/or neurons that are unnecessary or redundant, reducing the DNN size without any loss in accuracy. In this p…

2019-06-06abs ↗pdf ↗

We present a novel deep Recurrent Neural Network (RNN) model for acoustic modelling in Automatic Speech Recognition (ASR). We term our contribution as a TC-DNN-BLSTM-DNN model, the model combines a Deep Neural Network (DNN) with Time Convolution (TC), followed by a Bidirectional Long Short-Term Memory (BLSTM), and a fi…

2015-04-07abs ↗pdf ↗

Deep neural networks (DNNs) are now a central component of nearly all state-of-the-art speech recognition systems. Building neural network acoustic models requires several design decisions including network architecture, size, and training loss function. This paper offers an empirical investigation on which aspects of …

2014-06-30abs ↗pdf ↗

DNNs improve accuracy by using more evidence from images.

problem Understanding why DNNs generalize well and improving model selection metrics.
method Minimal sufficient views (MSVs) to identify key evidence regions in images.
result DNNs with more evidence regions in images have higher generalization performance.

Embedding principle explains loss landscape of deep neural networks.

problem Understanding the structure of loss landscapes in deep neural networks.
method Proposed an embedding principle that critical points of narrower DNNs can be embedded to critical points of wider DNNs.
result Wide DNNs are often attracted by highly-degenerate critical points embedded from narrower DNNs.

Deep neural networks (DNNs) can easily fit a random labeling of the training data with zero training error. What is the difference between DNNs trained with random labels and the ones trained with true labels? Our paper answers this question with two contributions. First, we study the memorization properties of DNNs. O…

2019-11-21abs ↗pdf ↗

Sparse deep neural networks(DNNs) are efficient in both memory and compute when compared to dense DNNs. But due to irregularity in computation of sparse DNNs, their efficiencies are much lower than that of dense DNNs on regular parallel hardware such as TPU. This inefficiency leads to poor/no performance benefits for s…

2018-08-10abs ↗pdf ↗

slimTrain simplifies DNN training by separating features and adapting hyperparameters.

problem Challenges in training deep neural networks, including non-convexity, non-smoothness, and hyperparameter sensitivity.
method slimTrain exploits separability in DNN architectures to reduce hyperparameter sensitivity and improve convergence.
result slimTrain outperforms existing methods with recommended hyperparameters and reduces sensitivity to remaining hyperparameters.

Deep neural networks (DNNs) may outperform human brains in complex tasks, but the lack of transparency in their decision-making processes makes us question whether we could fully trust DNNs with high stakes problems. As DNNs' operations rely on a massive number of both parallel and sequential linear/nonlinear computati…

2019-09-29abs ↗pdf ↗

The sizes of deep neural networks (DNNs) are rapidly outgrowing the capacity of hardware to store and train them. Research over the past few decades has explored the prospect of sparsifying DNNs before, during, and after training by pruning edges from the underlying topology. The resulting neural network is known as a …

2018-09-14abs ↗pdf ↗

Deep neural networks (DNNs) are known as black-box models. In other words, it is difficult to interpret the internal state of the model. Improving the interpretability of DNNs is one of the hot research topics. However, at present, the definition of interpretability for DNNs is vague, and the question of what is a high…

2019-09-12abs ↗pdf ↗

The paper explains DNNs by quantifying interactions among input variables.

problem Understanding and explaining the complex behavior of deep neural networks.
method The paper defines and quantifies the significance of interactions among multiple input variables using the Shapley value.
result The proposed method effectively explains the behavior of DNNs by assigning attribution values to input variables.

The paper explains knowledge distillation by analyzing visual concepts in DNNs.

problem Understanding how knowledge distillation affects the learning of visual concepts in deep neural networks.
method The paper proposes three hypotheses and designs mathematical metrics to evaluate feature representations of DNNs.
result The hypotheses were verified through experiments on various DNNs.

Deep neural networks (DNNs) are shown to be promising solutions in many challenging artificial intelligence tasks. However, it is very hard to figure out whether the low precision of a DNN model is an inevitable result, or caused by defects. This paper aims at addressing this challenging problem. We find that the inter…

2019-09-05abs ↗pdf ↗

Paper improves DNN accelerator robustness against bit errors with energy savings.

problem Bit errors in quantized DNN weights reduce energy efficiency.
method Combines robust fixed-point quantization, weight clipping, and random bit error training.
result Significantly improves robustness against random bit errors with high energy savings.