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.

169,051 papers · 148 categories

Trend · papers per month

9.4%18.9%28.3%37.8% · May 201919922001200920172026
48 results for CNN networks

Paper learns an explainer to interpret CNN features without annotations.

problem Interpreting complex features in CNNs without labeled data.
method Unsupervised learning of an explainer to decompose and reconstruct feature maps.
result Explainer learns to reconstruct CNN features without losing information.

In recent years, deep learning poses a deep technical revolution in almost every field and attracts great attentions from industry and academia. Especially, the convolutional neural network (CNN), one representative model of deep learning, achieves great successes in computer vision and natural language processing. How…

2018-06-12abs ↗pdf ↗

Large receptive field CNNs improve distant speech recognition.

problem Degrading performance of ASR systems in noisy environments.
method Investigated large receptive field CNN variants including recursive, dilated, and hourglass networks.
result Stacked hourglass networks show significant improvements in distant speech recognition.

L-CNNs preserve gauge symmetry in neural networks.

problem Applying machine learning to lattice gauge theory while preserving gauge symmetry.
method L-CNNs use gauge equivariance to construct a gauge equivariant convolutional layer and bilinear layer.
result L-CNNs achieve higher accuracy in non-linear regression tasks compared to non-equivariant CNNs.

CNN-F uses generative feedback to improve neural networks' robustness to perturbations.

problem Neural networks' vulnerability to input perturbations like noise and attacks.
method Enforces self-consistency in neural networks by incorporating generative recurrent feedback.
result CNN-F shows significantly improved adversarial robustness compared to conventional CNNs.

L-CNNs maintain gauge symmetry on non-Abelian lattice theories.

problem Applying convolutional neural networks to non-Abelian lattice gauge theories while preserving gauge symmetry.
method Developed a geometric formulation of L-CNNs that are equivariant under global symmetries and gauge transformations.
result Convolutional operations in L-CNNs are a specific case of gauge-equivariant neural networks on SU(NN) principal bundles.

Paper analyzes the free energy of CNNs with skip connections in Bayesian learning.

problem Dependency of CNNs with skip connections on the number of parameters.
method Examines the Bayesian free energy of CNNs with and without skip connections.
result The upper bound of free energy of Bayesian CNN with skip connections does not depend on overparametrization.

Theoretical analysis of CNNs' inductive biases and their efficiency in approximating functions.

problem Understanding and optimizing the inductive biases in deep CNNs.
method Theoretical analysis combining multichanneling, downsampling, weight sharing, and locality.
result Deep CNNs with O(logd)\mathcal{O}(\log d) depth can approximate any continuous function, and require O~(log2d)\widetilde{\mathcal{O}}(\log^2d) samples for sparse functions.

The paper analyzes deep ReLU CNNs' approximation properties in 2D space.

problem Establishing L2L^2 approximation properties for deep ReLU CNNs.
method Analysis based on decomposition theorem for convolutional kernels, properties of ReLU activation, and connections with one-hidden-layer ReLU NNs.
result Universal approximation theorem for deep ReLU CNNs with classic structure.

New bounds for CNNs show better generalization than previous models.

problem Improving understanding of CNNs' generalization ability.
method Proposed tighter generalization bounds for CNNs by exploiting the sparse and permutation structure of weight matrices and spectral norms of convolution operations.
result Theoretical and experimental results show tighter bounds for CNNs than existing bounds.

New multigrid approach reduces CNN parameters by focusing on structured convolutions.

problem Redundancy in standard CNNs leads to high parameter count.
method Replace standard convolutions with structured multilevel convolutions.
result Linearly proportional number of parameters to network width, no loss in accuracy.

This paper introduces a way to learn cross-modal convolutional neural network (X-CNN) architectures from a base convolutional network (CNN) and the training data to reduce the design cost and enable applying cross-modal networks in sparse data environments. Two approaches for building X-CNNs are presented. The base app…

2018-05-02abs ↗pdf ↗

Deep CNN classifies EEG-based brain connectivity in schizophrenia.

problem Classifying neuropsychiatric disorders using EEG connectivity.
method Multi-domain connectome CNN framework integrating time and frequency-domain metrics.
result MDC-CNN achieves 93.06%93.06\% accuracy in schizophrenia classification.

This paper proposes a principled information theoretic analysis of classification for deep neural network structures, e.g. convolutional neural networks (CNN). The output of convolutional filters is modeled as a random variable Y conditioned on the object class C and network filter bank F. The conditional entropy (CENT…

2017-11-29abs ↗pdf ↗

The paper improves DFA for CNN and RNN training to match BP accuracy.

problem Low accuracy in CNN and RNN training using DFA.
method Divide network into modules, apply DFA within, use sparse backward weight, and incorporate dilated convolution and sparse matrix multiplication.
result Achieves BP-level accuracy in CNN and RNN training.

Improved robustness of 1D CNNs for heart arrhythmia classification.

problem Improving the robustness of 1D CNNs for classification tasks.
method Parameterization using Cayley transform and controllability Gramian for Lipschitz-bounded CNNs.
result Improved robustness of trained Lipschitz-bounded 1D CNNs for heart arrhythmia classification.

HOTCAKE compresses CNNs by decomposing kernels into smaller parts.

problem Compressing deep CNNs without significant accuracy loss.
method Input channel decomposition, guided Tucker rank selection, higher order Tucker decomposition, fine-tuning.
result HOTCAKE produces highly compressed CNN models with good accuracy.

Bayesian regularizations are explicitly implemented in CNNs, improving deep learning generalization.

problem Improving generalization in deep learning models.
method Introduced a novel probabilistic representation for CNN hidden layers and demonstrated their Bayesian nature.
result CNNs have explicitly Bayesian regularizations based on Bayesian regularization theory.

In this paper we propose cross-modal convolutional neural networks (X-CNNs), a novel biologically inspired type of CNN architectures, treating gradient descent-specialised CNNs as individual units of processing in a larger-scale network topology, while allowing for unconstrained information flow and/or weight sharing b…

2016-10-01abs ↗pdf ↗

New tensor network decompositions improve CNN performance.

problem Limited exploration of tensor network decompositions for CNNs.
method Characterized a new class of CNN modules and experimentally compared various decompositions.
result Some nonlinear decompositions outperform existing ones in terms of accuracy and efficiency.

The paper introduces a method to explain redundancy in deep CNNs using unit impulse response.

problem Redundancy in deep CNNs leads to unnecessary computations and increased cost.
method Empirical demonstration and unit impulse response analysis to identify and quantify redundancy across layers and depth.
result Identifies and quantifies redundancy in deep CNNs, providing better insights into their internal dynamics.

ResNet-type CNNs achieve optimal error rates in function classes with block-sparse structures.

problem Optimal approximation and estimation in function classes with sparse constraints.
method Developed ResNet-type CNNs that can approximate and estimate functions with block-sparse structures.
result ResNet-type CNNs attain minimax optimal error rates in Hölder and Barron classes.