Adds layers to NNs to protect them from reverse engineering.
problem Extracting the underlying model of a Neural Network.
method Introducing parasitic layers that approximate a noisy identity mapping with a Convolutional NN.
result The protected NN's predictions remain mostly unchanged while making reverse-engineering more complex.
NNs can learn efficient algorithms for certain problems.
problem Learning efficient algorithms for specific problems.
method Recurrent Convolutional Neural Networks (RCNNs) that learn efficiently.
result RCNNs can learn as well as efficient algorithms described by a constant-sized program.
This paper removes the finite variance assumption for deep convolutional neural networks.
problem Removing the finite variance assumption for deep convolutional neural networks.
method Assuming iid parameters distributed according to a stable distribution, the paper shows that the infinite-channel limit of a deep feed-forward convolutional neural network is a multivariate stable stochastic process.
result The infinite-channel limit of a deep feed-forward convolutional neural network, under suitable scaling, is a multivariate stable stochastic process.
Exact bounds derived for neural network outputs with noisy inputs.
problem Bounding the output distribution of neural networks with random inputs.
method Applying ReLU NNs to derive bounds for general NNs, then using these to find exact error guarantees.
result Exact upper and lower bounds for the output distribution of neural networks with random inputs.
Paper studies the expressivity of Convolutional Neural Networks (CNNs).
problem Understanding the expressivity of CNNs and their superiority in deep learning.
method Mathematical analysis of linear regions in one-layer and multi-layer ReLU CNNs.
result Deeper CNNs and CNNs have more expressivity per parameter than fully-connected NNs.
Graph neural networks can be adapted to new graphs with a limit object called graphon NNs.
problem Transferability of graph neural networks across different graphs.
method Introduced graphon NNs as limit objects of GNNs and proved a bound on the difference between GNN and graphon-NN outputs.
result The bound on the difference between GNN and graphon-NN outputs vanishes with growing number of nodes if the graph convolutional filters are bandlimited.
Gatherings of thousands to millions of people frequently occur for an enormous variety of events, and automated counting of these high-density crowds is useful for safety, management, and measuring significance of an event. In this work, we show that the regularly accepted labeling scheme of crowd density maps for trai…
We describe tests validating progress made toward acceleration and automation of hydrodynamic codes in the regime of developed turbulence by three Deep Learning (DL) Neural Network (NN) schemes trained on Direct Numerical Simulations of turbulence. Even the bare DL solutions, which do not take into account any physics …
Paper proposes neural network for efficient MIMO channel estimation and pilot reduction.
problem High overhead from pilot transmission in wideband MIMO systems.
method Neural network architecture for frequency-aware pilot design and channel estimation, with pruning technique.
result Neural network outperforms linear minimum mean square error (LMMSE) estimation.
Different neural network (NN) architectures have different advantages. Convolutional neural networks (CNNs) achieved enormous success in computer vision, while recurrent neural networks (RNNs) gained popularity in speech recognition. It is not known which type of NN architecture is the best fit for classification of co…
Vector-valued neural learning has emerged as a promising direction in deep learning recently. Traditionally, training data for neural networks (NNs) are formulated as a vector of scalars; however, its performance may not be optimal since associations among adjacent scalars are not modeled. In this paper, we propose a n…
Paper models entropy-based impact of soft errors on neural network inference.
problem Estimating impact of radiation-induced faults on neural network inference.
method Entropy-based statistical models for SEU and MBU across layers.
result Accurate models to evaluate error-resiliency of neural network topologies.
Graph convolutional deep kernel machine learns representations for graph tasks.
problem Limited representation learning in infinite-width neural networks.
method Developed a graph convolutional deep kernel machine as an infinite-width limit.
result Representation learning improves performance for heterophilous node classification tasks.
A fast method for neural networks that provides uncertainty measures.
problem Inability of neural networks to provide reliable uncertainty measures for new situations.
method Moment propagation (MP) for analytically approximating MC dropout.
result Single-shot MC dropout approximation as fast as NNs with similar uncertainty measures.
We propose a tensor neural network (t-NN) framework that offers an exciting new paradigm for designing neural networks with multidimensional (tensor) data. Our network architecture is based on the t-product (Kilmer and Martin, 2011), an algebraic formulation to multiply tensors via circulant convolution. In this $t…
Study designs neural networks for fault localization, state estimation, and optimal PMU placement in power systems.
problem Fault localization, state estimation, and optimal PMU placement in power systems.
method Designs and compares various neural networks for fault localization, builds machine learning schemes for state estimation and parameter estimation, and designs an algorithm for optimal PMU placement.
result Comprehensive comparison of neural networks for fault localization shows that Graphical Convolutional NN and Neural Graph-based ODE perform best.
New framework uses symmetry-based matrices for efficient, flexible NNs.
problem Designing neural networks with relaxed equivariance.
method Symmetry-based structured matrices, Group Matrices (GMs).
result GMs enable competitive performance with fewer parameters.
Paper proposes FTT-NAS to create fault-tolerant CNNs for edge devices.
problem Faults in edge devices affect deep learning applications.
method Formalized fault models, implemented FTT-NAS, incorporated FTT.
result Discovered CNNs outperform baseline architectures with fault tolerance.
NN-Turb generates turbulent velocity statistics using neural networks.
problem Creating a 1D field with turbulent velocity statistics.
method Fully-convolutional neural network (NN-Turb) to generate the field.
result NN-Turb generates a 1D field that satisfies Kolmogorov's 2/3 and 4/5 laws, exhibiting intermittency.
Proposes a new CG interpretation of neural networks for better theoretical analysis.
problem Lack of theoretical analysis in neural networks interpretation.
method Interprets neural networks as chain graphs and feed-forward as approximate inference.
result Provides novel theoretical support and insights for various neural network techniques.
Meta-ticket finds optimal sparse subnetworks for few-shot learning in randomly initialized neural networks.
problem Avoiding overfitting in few-shot learning for over-parameterized neural networks.
method Meta-learning approach to find optimal sparse subnetworks.
result Meta-ticket discovers sparse subnetworks that adapt to each task, achieving superior meta-generalization.
Convex neural networks enforce convex constraints on weights and activations, improving generalization.
problem Improving generalization and reducing overfitting in neural networks.
method Enforce convex constraints on weights and activations, using non-negative weights and non-decreasing convex activation functions.
result Convex neural networks self-regularize, outperforming base architectures and achieving similar performance to convolutional architectures.
Probabilistic graphical models are traditionally known for their successes in generative modeling. In this work, we advocate layered graphical models (LGMs) for probabilistic discriminative learning. To this end, we design LGMs in close analogy to neural networks (NNs), that is, they have deep hierarchical structures a…
The paper analyzes deep ReLU CNNs' approximation properties in 2D space.
problem Establishing L2 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.
Federated LIDAR aided beam selection reduces mmWave beam search overhead.
problem Efficient link configuration in mmWave communication systems with reduced beam search overhead.
method Federated learning of LIDAR data to train a shared neural network for beam selection.
result Proposed method significantly outperforms previous works in performance and complexity.
Deep learning using multi-layer neural networks (NNs) architecture manifests superb power in modern machine learning systems. The trained Deep Neural Networks (DNNs) are typically large. The question we would like to address is whether it is possible to simplify the NN during training process to achieve a reasonable pe…
Graph Neural Networks (graph NNs) are a promising deep learning approach for analyzing graph-structured data. However, it is known that they do not improve (or sometimes worsen) their predictive performance as we pile up many layers and add non-lineality. To tackle this problem, we investigate the expressive power of g…
This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.
problem Training infinitely deep ResNets with i.i.d. initializations leads to undesirable properties.
method Introduced doubly infinite ResNets with i.i.d. initializations, linking to diffusion processes.
result The dynamics of quantities of interest converge to deterministic limits in the limit of infinite depth.
In probabilistic classification, a discriminative model based on the softmax function has a potential limitation in that it assumes unimodality for each class in the feature space. The mixture model can address this issue, although it leads to an increase in the number of parameters. We propose a sparse classifier base…
A decoder helps interpret neural network layers.
problem Understanding the output of neural network layers.
method Developed a Classifier-Decoder (ClaDec) architecture.
result Reconstructed images from ClaDec are more relevant for classification.
Obtaining accurate and reliable images from low-dose computed tomography (CT) is challenging. Regression convolutional neural network (CNN) models that are learned from training data are increasingly gaining attention in low-dose CT reconstruction. This paper modifies the architecture of an iterative regression CNN, BC…
We propose a simple approach which, given distributed computing resources, can nearly achieve the accuracy of k-NN prediction, while matching (or improving) the faster prediction time of 1-NN. The approach consists of aggregating denoised 1-NN predictors over a small number of distributed subsamples. We show, bot…
Paper proposes transforming ATN to attack multivariate time series models.
problem Generating adversarial samples for multivariate time series classification models.
method Proposes using a distilled model as a surrogate to mimic attacked models and applies 1-NN DTW and FCN attacks.
result Both models were susceptible to attacks on all 18 datasets.
Trans-dimensional random field language models (TRF LMs) have recently been introduced, where sentences are modeled as a collection of random fields. The TRF approach has been shown to have the advantages of being computationally more efficient in inference than LSTM LMs with close performance and being able to flexibl…
PBN combines generative and discriminative capabilities in a neural network.
problem Combining generative and discriminative capabilities in neural networks.
method Convolutional PBN, sharing FF-NN embodiment, combining generative and discriminative qualities.
result PBN shows excellent qualities from either generative or discriminative viewpoint.
Randomly trained neural networks can generalize well if there's a simpler underlying teacher model.
problem Why randomly trained neural networks generalize well despite interpolating training data.
method Examined a random neural network that interpolates training data and showed it generalizes well if there's a simpler underlying teacher model.
result Randomly trained neural networks can generalize well if there's a simpler underlying teacher model.
Study bridges GARCH and NN models for volatility forecasting.
problem Lack of interaction between GARCH and NN approaches for volatility forecasting.
method Established equivalence between GARCH and NN models, introduced GARCH-NN approach.
result GARCH-NN approach enhances volatility forecasting compared to standalone models.
This paper analyzes deep Stable neural networks, showing convergence rates under different growth settings.
problem Analyzing the behavior of deep Stable neural networks as width increases.
method Large-width asymptotic analysis and convergence rates for fully connected feed-forward deep Stable NNs.
result The rescaled deep Stable NN converges weakly to a Stable SP under joint growth, with sup-norm convergence rates established.
Paper proposes MS-k-NN for improved convergence rate in k-NN classification.
problem Improving convergence rate of k-NN classification methods.
method Proposes MS-k-NN that extrapolates unweighted k-NN estimators to k=0.
result MS-k-NN achieves improved convergence rate under certain conditions.
A fast method for LOOCV in k-NN regression reduces computation time.
problem Efficient computation of LOOCV for k-NN regression.
method Identical LOOCV estimate to (k+1)-NN MSE on training data.
result LOOCV computation can be done with (k+1)-NN regression once.
Artificial neural networks (NN) are instrumental in realizing highly-automated driving functionality. An overarching challenge is to identify best safety engineering practices for NN and other learning-enabled components. In particular, there is an urgent need for an adequate set of metrics for measuring all-important …
Prototype rules simplify multiclass classification in metric spaces, achieving consistency and reduced complexity.
problem Multiclass classification in metric spaces, focusing on universal consistency and convergence rates.
method Novel Proto-NN and hybrid rules for multiclass classification in metric spaces, analyzing convergence rates.
result Proto-NN is universally consistent and simpler to implement, with similar computational advantages.
Neural Networks (NN) have recently emerged as backbone of several sensitive applications like automobile, medical image, security, etc. NNs inherently offer Partial Fault Tolerance (PFT) in their architecture; however, the biased PFT of NNs can lead to severe consequences in applications like cryptography and security …
New method initializes MLPs for tabular data with tree-based feature interactions.
problem No dedicated neural network architecture for tabular data.
method Sparse tree-based initialization for MLPs.
result New method outperforms default MLP initialization and gradient boosting.
Although deep neural networks (NNs) have achievedstate-of-the-art accuracy in many visual recognition tasks,the growing computational complexity and energy con-sumption of networks remains an issue, especially for ap-plications on platforms with limited resources and requir-ing real-time processing. Filter pruning tech…
This work establishes the equivalence between neural networks and support vector machines.
problem Establishing the equivalence between neural networks and support vector machines.
method Proposed a method to establish the equivalence between infinitely wide neural networks trained by soft margin loss and standard soft margin SVMs with NTK trained by subgradient descent.
result The equivalence between NN and SVM is established, enabling practical applications such as non-vacuous generalization bounds and robustness certificates.
In the k-nearest neighborhood model (k-NN), we are given a set of points P, and we shall answer queries q by returning the k nearest neighbors of q in P according to some metric. This concept is crucial in many areas of data analysis and data processing, e.g., computer vision, document retrieval and machi…
The success of Deep Learning and its potential use in many safety-critical applications has motivated research on formal verification of Neural Network (NN) models. In this context, verification involves proving or disproving that an NN model satisfies certain input-output properties. Despite the reputation of learned …