New dataset for UAV gesture recognition in outdoor settings.
problem Lack of public outdoor UAV gesture recognition datasets.
method Recorded 13 gestures in an outdoor setting, created 119 HD video clips, annotated with body joints and gesture classes.
result Baseline gesture recognition performance of 91.9% using P-CNN.
LumièreNet creates lecture videos from audio narration.
problem Creating high-quality lecture videos from audio narration.
method Modular deep-learning architecture that learns from audio to video.
result Synthesizes high-quality lecture videos from any length of audio.
ConvNets can be translated into CKNs that perform similarly.
problem The distinction between ConvNets and kernel-based methods.
method Translation of ConvNets into CKNs using a new gradient algorithm.
result CKNs perform as well as ConvNets, supporting the translation.
VC dimensions of group CNNs are infinite for certain kernels and groups.
problem Estimating the generalization capacity of group convolutional neural networks.
method Identifying precise VC dimension estimates for simple sets of group CNNs.
result Two-parameter families of convolutional neural networks have an infinite VC dimension for infinite groups and certain kernels.
FST.ai 2.0 improves Taekwondo decision-making with AI, reducing review time and increasing trust.
problem Fair, transparent, and explainable decision-making in Taekwondo.
method Pose-based action recognition, epistemic uncertainty modeling, interactive dashboards.
result 85% reduction in decision review time, 93% referee trust in AI-assisted decisions.
Convolutional neural networks converge quickly with gradient descent.
problem Learning efficient image classifiers with over-parameterized networks.
method Gradient descent for training over-parametrized CNNs with global average-pooling.
result Gradient descent quickly reduces the misclassification risk of CNNs.
Proposes a method to constrain singular values of convolutional kernels in neural networks.
problem Avoiding exploding/vanishing gradient problems and improving generalizability in neural networks.
method Introduces a penalty function to constrain singular values of convolutional kernels around 1, and derives an algorithm for optimization.
result Demonstrates the effectiveness of the method through numerical examples.
Convolutional neural networks improve image classification accuracy.
problem Improving accuracy in image classification.
method Analyzing the convergence rate of misclassification risk for image classifiers.
result A rate of convergence independent of image dimension proves the effectiveness of CNNs.
Deep neural network predicts traffic flow on city maps.
problem Short-term traffic flow prediction on high-resolution city maps.
method UNet-based deep convolutional neural network with densely connected layers.
result Best performance on the Traffic4cast challenge 2019.
Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
problem Vulnerability of capsule networks to adversarial attacks.
method Compared capsule networks to convolutional neural networks using various adversarial attacks.
result Capsule networks are vulnerable to adversarial attacks, similar to convolutional neural networks.
This work proposes hyperbolic deep convolutional neural networks for better pattern recognition.
problem The limitations of Euclidean deep convolutional neural networks in capturing intricate patterns.
method Developed Hyperbolic DCNN based on Poincaré Disc, analyzing expansive convolution in non-Euclidean space.
result Hyperbolic convolutional architecture outperforms Euclidean ones in pattern recognition tasks.
Proves DCNNs with expansive convolution are strongly universally consistent.
problem Theoretical consistency of deep convolutional neural networks (DCNNs).
method Empirical risk minimization on DCNNs with expansive convolution (with zero-padding).
result DCNNs with expansive convolution are strongly universally consistent.
This research studies affine invariance in continuous-domain convolutional neural networks.
problem Recognizing patterns and features under affine transformations in continuous domains.
method Introduces a new criterion for assessing affine invariance, embeds images into the affine Lie group, and analyzes convolution over this group.
result Extends the scope of geometrical transformations that deep-learning pipelines can handle.
L-CNNs learn gauge invariant quantities on lattices.
problem Learning gauge invariant quantities on lattices.
method Novel convolutional layer preserving gauge equivariance and forming Wilson loops.
result L-CNNs can approximate any gauge covariant function on the lattice.
Convolutional neural networks can regularize inverse problems without training.
problem Solving inverse problems like image recovery from limited data.
method Fixed or parameterized convolutional networks with few parameters.
result Untrained convolutional networks can recover images from few measurements.
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(N) principal bundles. RecNets use RNNs to process image channels in a compact, recurrent way.
problem Creating efficient neural network architectures for computer vision.
method Introducing RecNets with CRC layers that simulate recurrent processing of image channels.
result RecNets achieve superior size-accuracy trade-off compared to other compact models.
Proposes a new convolutional neural network for non-grid data.
problem Limited applicability of standard CNNs to non-grid structured data.
method Introduces Parametric Continuous Convolution (PCC) with learnable kernel functions.
result Significant improvement in point cloud segmentation and lidar motion estimation.
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.
Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized …
Improved CNN with general image processing kernels reduces training time and achieves high accuracy.
problem Training time and accuracy of CNNs.
method Used 41 general-purpose kernels for the first layer of CNNs.
result GFNN reduces training time by 30% and achieves 99.56% accuracy.
A modified VDCNN model reduces size and latency for mobile platforms.
problem Memory and processing constraints on mobile platforms.
method Temporal Depthwise Separable Convolutions and Global Average Pooling.
result The squeezed model (SVDCNN) is 10x-20x smaller with minimal accuracy loss.
Simplicial neural networks extend graph neural networks to handle higher-order interactions.
problem Handling higher-order interactions in complex data structures.
method Define a convolution operation for simplicial complexes and use it to construct convolutional neural networks.
result SNNs effectively impute missing data in coauthorship complexes.
New neural model processes 2D data with long-range dependencies efficiently.
problem Limited receptive field of convolutions for complex 2D tasks.
method Proposes Matrix Shuffle-Exchange network with O(logn) layers and O(n2logn) complexity. result Exceeds convolutional and graph neural network baselines in long-range dependency modeling.
We introduce Group equivariant Convolutional Neural Networks (G-CNNs), a natural generalization of convolutional neural networks that reduces sample complexity by exploiting symmetries. G-CNNs use G-convolutions, a new type of layer that enjoys a substantially higher degree of weight sharing than regular convolution la…
Paper introduces method to make neural networks symmetrical.
problem Creating symmetrical neural networks for data with inherent symmetries.
method Introduces a method for modifying neural networks to enforce equivariance.
result Group convolutional neural networks are a special case of the introduced framework.
Convolutional networks struggle with repeating patterns in ECGs.
problem Modeling repeating patterns in electrocardiogram signals.
method Demonstrated through ECG examples, highlighting systemic issues in deep learning.
result Counterintuitive effects on generalization in deep networks.
The study examines deep convolutional neural networks and their learning ability.
problem Understanding the learning ability of deep convolutional neural networks (DCNNs).
method Examines DCNNs under both underparameterized and overparameterized settings, using a novel network deepening scheme.
result Establishes the first learning rates of underparameterized DCNNs and shows how adding layers can create interpolating DCNNs with good learning rates.
Channel normalization prevents vanishing gradients in convolutional neural networks.
problem Vanishing gradients in convolutional neural networks during optimization.
method Channel normalization, which centers and normalizes each channel individually.
result Channel normalization avoids vanishing gradients, enabling efficient optimization.
Combines BERT and graph CNN for improved text classification.
problem Text classification problems
method Combining BERT embedding and graph convolutional neural network
result Graph CNN model performs better than classical models combined with BERT
Deep learning has been widely applied and brought breakthroughs in speech recognition, computer vision, and many other domains. The involved deep neural network architectures and computational issues have been well studied in machine learning. But there lacks a theoretical foundation for understanding the approximation…
A new CNN approach for time series forecasting outperforms traditional RNNs.
problem Time series forecasting using conventional RNNs.
method Temporally folded convolutional neural networks (TFC's) for sequence forecasting.
result TFC's outperform conventional RNNs on sequential MNIST and JSB chorals datasets.
Covariance in physics and CNNs share similarities, with simple assumptions uniquely determining convolution forms.
problem Understanding the similarities between physics and CNNs using covariance.
method Examined similarities and differences, and demonstrated that simple assumptions lead to unique convolution forms.
result Simple assumptions of covariance, locality, linearity, and weight sharing uniquely determine convolution forms.
In this paper, some patterns of the Neuron Response of deep Convolutional Neural Networks were observed.
Convolutional neural networks predict the analytic rank of elliptic curves accurately.
problem Predicting the analytic rank of elliptic curves over Q.
method Applied one-dimensional convolutional neural networks to Frobenius traces.
result High accuracy predictions for analytic rank across various conductors.
New method tightens Lipschitz bounds for CNNs efficiently.
problem Lipschitz regularization of Convolutional Neural Networks (CNNs).
method Using Toeplitz matrix theory, introduces a tight and computationally efficient upper bound for convolutional layers.
result Developed an algorithm to train Lipschitz regularized CNNs.
A hybrid method improves Convolutional Neural Networks training.
problem Training Convolutional Neural Networks efficiently and avoiding local minima.
method Combines backpropagation with evolutionary strategies.
result Improves accuracy by 0.61% on CIFAR-10 image classification.
New hypergraph operators improve graph neural networks for higher-order relationships.
problem Learning deep embeddings on high-order graph-structured data.
method Introducing hypergraph convolution and hypergraph attention operators.
result Extensive experimental results show the effectiveness of hypergraph operators.
In this paper we cast the well-known convolutional neural network in a Gaussian process perspective. In this way we hope to gain additional insights into the performance of convolutional networks, in particular understand under what circumstances they tend to perform well and what assumptions are implicitly made in the…
The paper verifies deep neural networks' ability to approximate functions on spheres.
problem Theoretical verification of deep neural networks' performance on spherical functions.
method Spherical analysis using reproducing kernels and convolutional factorizations.
result Rates of uniform approximation for functions in Sobolev spaces and additive ridge forms.
ARMA filters improve graph neural networks' flexibility and robustness.
problem Improving graph neural networks' performance and robustness.
method Proposes an ARMA-based graph convolutional layer for graph neural networks.
result ARMA filters outperform polynomial filters in various graph tasks.
New method solves PDEs on spheres using physics-informed convolutional neural networks.
problem Solving PDEs on surfaces, especially spheres, with high accuracy and efficiency.
method Physics-informed convolutional neural networks (PICNN) with theoretical analysis and approximation results.
result Established fast convergence rates for PICNN solving PDEs on spheres.
New models explain residual and dilated dense neural networks using sparse coding.
problem Lack of theoretical understanding of residual and dilated dense neural networks.
method Proposed Res-CSC and MSD-CSC models, derived mathematical relationships, implemented ISTA.
result Mathematical understanding of residual and dilated dense neural networks.
The fully connected layers of a deep convolutional neural network typically contain over 90% of the network parameters, and consume the majority of the memory required to store the network parameters. Reducing the number of parameters while preserving essentially the same predictive performance is critically important …
Lie groupoid equivariant neural networks are a new type of neural network.
problem Designing neural networks that respect the structure of Lie groupoids.
method Introducing Lie groupoid equivariant convolutions and layers, and showing their equivalence to Lie algebroid-equivariant networks.
result Lie groupoid equivariant neural networks are equivalent to certain Lie algebroid-equivariant networks.
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.
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.
AdaGCN uses AdaBoost to efficiently integrate high-order neighbor knowledge in graph neural networks.
problem Efficiently exploring and exploiting knowledge from different hops of neighbors in graph neural networks.
method Incorporates AdaBoost into graph convolutional networks to integrate knowledge from high-order neighbors.
result AdaGCN achieves state-of-the-art prediction performance across different graphs and label rates.