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

Trend · papers per month

79158237316 · Jun 202019922001200920172026
48 results for DNN architecture

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 investigates how network width and depth affect adversarially robust DNNs.

problem Understanding architectural configurations for adversarially robust DNNs.
method Comprehensive investigation on the impact of network width and depth on adversarial robustness.
result Optimal architectural configuration for adversarial robustness exists and can improve robustness.

This work analyzes how deep neural networks' expressiveness increases with depth and width.

problem Understanding the expressiveness of deep neural networks (DNNs) based on their Lipschitz constants.
method Leveraging random matrix theory, the study characterizes the expressiveness of DNNs by their Lipschitz constant, showing exponential and polynomial increases with depth and width, respectively.
result The expressiveness of DNNs increases exponentially with depth and polynomially with width, consistent with function approximation benefits.

Paper proposes a new sparse Bayesian neural network for simpler, more efficient DNNs.

problem Complex and large DNN architectures require simplification for better performance and efficiency.
method Masked Bayesian Neural Networks (BNN) with nodewise sparsity and optimal posterior distributions.
result The proposed BNN yields well-condensed DNN architectures with similar accuracy and uncertainty quantification to large DNNs.

The lack of mathematical tractability of Deep Neural Networks (DNNs) has hindered progress towards having a unified convergence analysis of training algorithms, in the general setting. We propose a unified optimization framework for training different types of DNNs, and establish its convergence for arbitrary loss, act…

2018-05-23abs ↗pdf ↗

DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.

problem Challenges in optimizing neural network and accelerator design for efficient DNN execution.
method Differentiable approach to co-exploration of accelerator and network architecture design.
result Significantly shorter time to achieve superior accuracy and hardware cost metrics.

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 ↗

NASCaps automates CapsNet design for better accuracy and hardware efficiency.

problem Designing Capsule Networks is laborious and inefficient.
method Automated Neural Architecture Search (NAS) with Genetic Algorithm optimization.
result Jointly optimizes network accuracy and hardware efficiency.

Paper analyzes deep neural networks with dependent data, establishing convergence rates and error bounds.

problem Statistical analysis of deep neural networks under dependent data.
method Establishes rates of convergence and L2\mathcal{L}^{2}-error bounds for nonparametric sieve estimators of DNNs.
result Non-asymptotic probability bounds on L2\mathcal{L}^{2}-errors for DNN estimators under stationary β\beta-mixing data.

Improved DNN calibration without sacrificing accuracy.

problem Poor calibration of over-parametrized DNNs in safety-critical applications.
method Decoupling feature extraction and classification layers, and applying Gaussian priors.
result Significant improvement in model calibration with minimal training cost.

Bayesian convolutional deep sets improve ambiguity in stationary process modeling.

problem Ambiguity in translation equivariant functional representations due to insufficient data points.
method Introduce Bayesian convolutional deep sets with task-dependent stationary prior.
result Improves representation quality compared to kernel smoother and non-parametric models.

Depth is a key component of Deep Neural Networks (DNNs), however, designing depth is heuristic and requires many human efforts. We propose AutoGrow to automate depth discovery in DNNs: starting from a shallow seed architecture, AutoGrow grows new layers if the growth improves the accuracy; otherwise, stops growing and …

2019-06-07abs ↗pdf ↗

Paper proposes NASAIC framework for co-designing neural architectures and heterogeneous ASICs.

problem Designing efficient neural architectures and ASICs for multiple tasks.
method Build ASIC templates and propose NASAIC framework for simultaneous design of architectures and ASICs.
result NASAIC ensures design specifications and maximizes accuracy with minimal performance loss.

Can we use deep learning to predict when deep learning works? Our results suggest the affirmative. We created a dataset by training 13,500 neural networks with different architectures, on different variations of spiral datasets, and using different optimization parameters. We used this dataset to train task-independent…

2019-06-04abs ↗pdf ↗

Heart disease is the leading cause of death, and experts estimate that approximately half of all heart attacks and strokes occur in people who have not been flagged as "at risk." Thus, there is an urgent need to improve the accuracy of heart disease diagnosis. To this end, we investigate the potential of using data ana…

2018-08-22abs ↗pdf ↗

The pioneer deep neural networks (DNNs) have emerged to be deeper or wider for improving their accuracy in various applications of artificial intelligence. However, DNNs are often too heavy to deploy in practice, and it is often required to control their architectures dynamically given computing resource budget, i.e., …

2018-07-07abs ↗pdf ↗

Paper introduces non-linearity signature to measure deep neural network performance.

problem Difficulty in explaining performance differences among similar DNN architectures.
method Affine Optimal Transport mappings to measure non-linearity.
result Signature provides better understanding of DNN inner workings.

To better understand and improve the behavior of neural networks, a recent line of works bridged the connection between ordinary differential equations (ODEs) and deep neural networks (DNNs). The connections are made in two folds: (1) View DNN as ODE discretization; (2) View the training of DNN as solving an optimal co…

2019-11-01abs ↗pdf ↗

The paper explores how ReLU DNNs can represent MPC policies and vice versa.

problem Representing MPC policies as ReLU DNNs and vice versa.
method Developed an approximate method for identifying input-space in ReLU nets resulting in PWA functions over polyhedral regions. Studied inverse multiparametric linear or quadratic programs for reconstruction of constraints and cost functions given a PWA function.
result Identification and representation of MPC policies as ReLU DNNs and vice versa.

Paper develops deep neural networks for wireless tasks with reduced complexity.

problem Reducing training complexity for deep neural networks in wireless systems.
method Develops permutation invariant DNNs (PINNs) leveraging wireless task properties.
result Demonstrates dramatic reduction in training complexity for PINNs.

We derive the fast convergence rates of a deep neural network (DNN) classifier with the rectified linear unit (ReLU) activation function learned using the hinge loss. We consider three cases for a true model: (1) a smooth decision boundary, (2) smooth conditional class probability, and (3) the margin condition (i.e., t…

2018-12-10abs ↗pdf ↗

Study examines noise sensitivity of DNNs for binary classification.

problem Understanding non-robustness of DNN classifiers under noise.
method Defined and extended noise sensitivity and stability concepts for Boolean functions, applied to DNN models.
result Sorted out the relation between definitions and properties of DNN architectures under noise.

Reduced numerical precision is a common technique to reduce computational cost in many Deep Neural Networks (DNNs). While it has been observed that DNNs are resilient to small errors and noise, no general result exists that is capable of predicting a given DNN system architecture's sensitivity to reduced precision. In …

2018-05-03abs ↗pdf ↗

Deep neural networks perform well due to a balance of architecture, training, and structured data.

problem Understanding why overparameterized DNNs perform well.
method Bayesian approach to analyze the interplay between network architecture, training algorithms, and data structure.
result Structured data and an inductive bias towards simple functions explain DNN success.

Time Series Classification (TSC) is an important and challenging problem in data mining. With the increase of time series data availability, hundreds of TSC algorithms have been proposed. Among these methods, only a few have considered Deep Neural Networks (DNNs) to perform this task. This is surprising as deep learnin…

2018-09-12abs ↗pdf ↗

Deep neural networks perform poorly on smooth functions despite strong approximation theory.

problem The gap between deep learning theory and practical performance on smooth functions.
method Computational framework to study DNN performance, comparing against best-in-class methods.
result There is a crucial gap between DNN approximation theory and practical performance, but it can be closed.

Paper proposes a new confidence dimension to measure DNN generalization.

problem Measuring the generalization ability of deep neural networks is challenging.
method Introduces confidence dimension (CD) based on Hoeffding's inequality and VC-dimension.
result CD provides a feasible framework to calculate the upper bound of generalization.

Paper improves robustness and sparsity in adversarially trained DNNs.

problem Developing efficient compression algorithms for robustly trained DNNs.
method Pruning weights using relaxed augmented Lagrangian algorithms for both structured and unstructured levels, leveraging Feynman-Kac formalism.
result At least doubles channel sparsity of adversarially trained ResNet20 for CIFAR10 classification.