Estimates neural network errors for classification problems.
problem Binary and multi-class classification problems.
method Rademacher complexity estimates and direct approximation theorems.
result A priori error estimates for regularized loss functionals.
Adversarial Reprogramming has demonstrated success in utilizing pre-trained neural network classifiers for alternative classification tasks without modification to the original network. An adversary in such an attack scenario trains an additive contribution to the inputs to repurpose the neural network for the new clas…
BraidNet uses braid theory to optimize neural networks for image classification.
problem Image classification problems
method Procedural optimization of neural networks combining information theory and braid theory
result BraidNet outperforms other networks in learning speed and accuracy
Paper benchmarks quantum neural networks against classical ones for binary classification tasks.
problem Comparing quantum neural networks with classical ones for binary classification.
method Evaluated with two toy examples, focusing on model complexity and training data size.
result EQNN and QNN outperform ENN and DNN for smaller parameter sets and training data samples.
Develops neural network for directed hypergraphs for node classification.
problem Irregular data structure, particularly directed graphs.
method Directed hypergraph neural network and semi-supervised learning method.
result Novel directed hypergraph neural network achieves highest accuracies on node classification tasks.
New neural network improves audio classification accuracy.
problem Challenging audio classification problem in pattern recognition.
method Introduces a Classifier-Attention-Based Convolutional Neural Network (CAB-CNN) with an attention mechanism to reduce classifier complexity.
result Significantly improves audio classification performance, achieving more than 10% improvements.
Proposes Siegel neural networks for improved classification tasks.
problem Classification on Siegel spaces is underexplored.
method Uses quotient structure and vector-valued distance notation.
result Demonstrates state-of-the-art performance in radar and node classification.
Langevin algorithms improve training of very deep neural networks, especially for image classification.
problem Training very deep neural networks is challenging due to increased non-linearity and the risk of getting stuck in local minima.
method Comparison of Langevin and non-Langevin algorithms for training deep neural networks, introduction of Layer Langevin algorithm.
result Langevin algorithms, especially Layer Langevin, lead to significant improvements in training deep neural networks, particularly for image classification tasks.
Paper reduces neural network complexity for image classification.
problem High computational complexity in deep neural networks.
method Proposes a two-step classification process: coarse-grain and fine-grain.
result Achieves similar accuracy with less computational complexity.
This paper studies semi-supervised object classification in relational data, which is a fundamental problem in relational data modeling. The problem has been extensively studied in the literature of both statistical relational learning (e.g. relational Markov networks) and graph neural networks (e.g. graph convolutiona…
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.
Study shows how to approximate and estimate high-dimensional classification functions without the curse of dimensionality.
problem Approximating and estimating classification functions in high-dimensional spaces.
method Modified existing results to show that RBV2 functions can be approximated by neural networks with bounded weights. Proved the existence of a neural network with bounded weights approximating a classification function. Leveraged these bounds to quantify estimation rates. result Neural networks can approximate RBV2 functions without the curse of dimensionality, leading to efficient estimation rates. Customized-GNN generates model-specific for each graph.
problem Graphs in the same dataset have distinct structures.
method Proposes Customized-GNN framework to generate model-specific for each graph.
result Demonstrates effectiveness on various graph classification benchmarks.
Recently the deep learning techniques have achieved success in multi-label classification due to its automatic representation learning ability and the end-to-end learning framework. Existing deep neural networks in multi-label classification can be divided into two kinds: binary relevance neural network (BRNN) and thre…
Survey of data augmentation techniques for time series classification with neural networks.
problem Small datasets in time series recognition.
method Four families of data augmentation: transformation-based, pattern mixing, generative models, and decomposition methods.
result Empirical evaluation of 12 data augmentation methods on 128 datasets.
New method finds sparse networks without labels, improving performance.
problem Sparse connectivity in neural networks to reduce memory and energy demands.
method Neural Tangent Transfer method to find sparse networks without labels.
result Sparse networks achieve higher classification performance and faster convergence.
Novel neural network approximates exact distance for robust classification.
problem Adversarial attacks on neural networks in safety-critical systems.
method Signed Distance Classifiers (SDCs) and Unitary-Gradient Neural Network.
result Approximates exact distance from classification boundary for certifiable predictions.
Deep neural network improves hand gesture classification from wearable IMUs.
problem Classifying hand gestures from wearable IMUs using conventional methods.
method Deep Neural Network (DNN) with optimization objective for signal fitting.
result 3-5% improvement in classification accuracy compared to SVM and kNN.
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
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.
Braid theory optimizes neural network structures.
problem Optimizing the architecture of neural networks.
method Using braid theory to describe and construct neural network structures.
result Braid-based networks outperform other architectures in classification tasks.
Introduces topological deep learning for neural network classification problems.
problem Classifying neural networks using minimal topological structures.
method Formalizes classification problems in a topological setting.
result Demonstrates conditions for the feasibility of classification problems in neural networks.
A new neural network layer integrates graph learning into classification tasks.
problem Lack of relational information in standard deep learning architectures for label predictions.
method Derives backpropagation equations for a differentiable graph learning layer.
result Smooth label transitions, improved generalization, and robustness to adversarial attacks.
Neural network outperforms traditional methods in chaotic dynamics classification.
problem Classifying chaotic and regular dynamics of the Chirikov standard map.
method Trained a convolutional neural network on finite-length trajectories compared to traditional Lyapunov exponent computation.
result Neural network outperforms traditional methods for short periods, converging faster and more robustly.
Combines neural networks and STL for multi-class time-series classification.
problem Lack of interpretability in neural networks for time-series data.
method Proposes a method that uses neural networks to classify time-series data using STL specifications, introducing margin for multi-class classification and STL-based attributes for interpretability.
result Evaluations show improved interpretability and performance compared to state-of-the-art baselines.
LC-GNN improves GNNs for node classification by incorporating label consistency.
problem Limited performance of GNNs due to label consistency assumption not always holding.
method LC-GNN uses node pairs with the same label but unconnected to expand GNN's receptive field.
result LC-GNN outperforms traditional GNNs in semi-supervised node classification.
Topology aids in solving machine learning classification problems.
problem Machine learning classification problems.
method Classical topology applied to neural networks.
result Topology guides neural network architecture and training.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Neural networks perform differently when regression is treated as classification.
problem Understanding why neural networks perform better when regression is treated as classification.
method Analyzing two-layer ReLU networks and their feature spaces, focusing on the cross entropy loss vs. square loss.
result The support of the measure induced by the square loss differs from that of the cross entropy loss, indicating optimization difficulties.
Revises GNN neighborhood aggregation for more accurate node classification.
problem Flaws in benchmark GNN models for node classification.
method Statistical signal processing approach to neighborhood aggregation.
result Novel insights for designing more efficient GNN models.
Spektral simplifies graph neural networks with TensorFlow and Keras.
problem Building graph neural networks efficiently.
method Open-source library implementing various graph neural network methods.
result Performance of implemented methods in node, graph, and graph regression tasks.
Deep neural networks achieve optimal learning rates for high-dimensional classification.
problem Learning classification functions from noisy data with smooth boundaries.
method Empirical risk minimization over deep neural networks for locally Barron-regular decision boundaries.
result Optimal estimation rates are independent of dimension and can be achieved by deep neural networks.
Stochastic RNNs classify biological neural network paths with robust error bounds.
problem Classifying biological neural network paths.
method Modelled as a continuous-time stochastic recurrent neural network (RNN) with identity activation function, analysed in the robust regime.
result Generalisation error bound holds with high probability, showing the empirical risk minimiser is the best-in-class hypothesis.
Neural networks improve functional data classification.
problem Lack of effective classification methods for functional data.
method Extended deep learning methodologies to functional data for classification.
result Demonstrated superior performance in spectrographic data classification.
Complex-valued neural networks are not a new concept, however, the use of real-valued models has often been favoured over complex-valued models due to difficulties in training and performance. When comparing real-valued versus complex-valued neural networks, existing literature often ignores the number of parameters, r…
Optimized neural networks for Edge TPU achieve high accuracy in real-time image classification.
problem Designing neural networks for hardware accelerators to achieve optimal performance.
method Hardware-aware neural architecture search and model customization for Edge TPU.
result Improved accuracy-latency tradeoff on Pixel 4's Edge TPU compared to existing models.
Study shows MSE with sigmoid can match SCE in classification tasks, especially with noisy data.
problem Inconsistent errors in neural network classification tasks.
method Introduced Output Reset algorithm to use MSE with sigmoid activation.
result MSE with sigmoid activation achieves comparable accuracy and convergence rates to Softmax Cross-Entropy, especially in noisy data scenarios.
Improved anomaly detection in time series data using kervolutional neural networks.
problem Anomaly detection in time series data.
method Mixed kervolutional and convolutional layers in a temporal auto-encoder.
result The mixed model detects anomalies more sensitively in time series data.
Training-free GNNs use labels as features to improve node classification.
problem Improving graph neural networks for transductive node classification.
method Advocates labels as features, designs training-free GNNs based on this.
result Training-free GNNs outperform traditional GNNs in node classification.
We consider the problem of selective prediction (also known as reject option) in deep neural networks, and introduce SelectiveNet, a deep neural architecture with an integrated reject option. Existing rejection mechanisms are based mostly on a threshold over the prediction confidence of a pre-trained network. In contra…
The empirical NTK diverges from the NTK in classification problems during overtraining.
problem The divergence of empirical NTK from NTK in classification problems during overtraining.
method Demonstrated strictly positive definiteness of NTKs for FCNs and ResNets. Proved divergence of neural network parameters during training with cross-entropy loss.
result The empirical NTK does not uniformly converge to the NTK across all times on the training samples as the network width increases.
Humans are able to explain their reasoning. On the contrary, deep neural networks are not. This paper attempts to bridge this gap by introducing a new way to design interpretable neural networks for classification, inspired by physiological evidence of the human visual system's inner-workings. This paper proposes a neu…
Integrates outlier detection into neural networks for improved performance.
problem Lack of competency awareness in machine learning systems, especially in detecting outliers.
method Null Space Analysis (NuSA) of neural networks, computing and controlling null space projection.
result NuSA-trained networks maintain classification performance and detect outliers effectively.
This paper analyzes neural network classifiers' performance in binary classification.
problem Performance of neural network classifiers in binary classification problems.
method Plug-in classifiers based on neural networks, considering a more general function class and surrogate loss.
result Dimension-free, uniform rate of convergence for the excess risk of neural networks, showing minimax optimality.
Sparse-penalized deep neural networks improve performance in weakly dependent processes.
problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.
Tensor neural network improves human pose classification from 3D skeleton data.
problem Efficiently processing spatiotemporal data for human pose classification.
method Proposes a tensor-based neural network with three components: spatiotemporal feature construction, tensor fusion, and tensor-based neural network processing.
result Achieves state-of-the-art performance in human pose classification.
The paper provides theoretical guarantees for neural network-based anomaly detection.
problem Theoretical guarantees for unsupervised neural network-based anomaly detection.
method Casting anomaly detection as a binary classification problem, establishing non-asymptotic upper bounds and convergence rates.
result The convergence rate on the excess risk matches the minimax optimal rate.
Machine learning techniques have become increasingly popular in the field of resting state fMRI (functional magnetic resonance imaging) network based classification. However, the application of convolutional networks has been proposed only very recently and has remained largely unexplored. In this paper we describe a c…