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

Trend · papers per month

2605207801,040 · Jun 202019922001200920172026
48 results for network components

The paper proposes reusable network components by making them compatible across tasks.

problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.

Proposes a balanced multi-component and multi-layer neural network for efficient function approximation.

problem Accurately and efficiently approximating complex functions with high degrees of freedom and computational cost.
method Inspired by a multi-component approach, MMNN combines single-layer networks with a multi-layer decomposition strategy.
result Significant reduction in training parameters, more efficient training process, and improved accuracy compared to FCNNs or MLPs.

New insights into how encoder-decoder networks generate attention matrices.

problem Understanding how encoder-decoder networks use attention matrices.
method Decomposing hidden states into temporal and input-driven components.
result Attention matrices are formed based on task requirements, not architecture type.

This paper introduces a cross adversarial source separation (CASS) framework via autoencoder, a new model that aims at separating an input signal consisting of a mixture of multiple components into individual components defined via adversarial learning and autoencoder fitting. CASS unifies popular generative networks l…

2019-05-23abs ↗pdf ↗

Being among the easiest ways to find meaningful structure from discrete data, Latent Dirichlet Allocation (LDA) and related component models have been applied widely. They are simple, computationally fast and scalable, interpretable, and admit nonparametric priors. In the currently popular field of network modeling, re…

2008-03-11abs ↗pdf ↗

Spectral denoising recovers meaningful network structure from noisy financial correlations.

problem Noise in empirical correlation matrices from financial returns obscures genuine interactions.
method Spectral decomposition to separate structured and random components.
result Structured networks derived from 10-16 eigenmodes exhibit stronger core-periphery organization and scale-free degree distributions.

We propose a new variational family for Bayesian neural networks. We decompose the variational posterior into two components, where the radial component captures the strength of each neuron in terms of its magnitude; while the directional component captures the statistical dependencies among the weight parameters. The …

2019-02-07abs ↗pdf ↗

Gradient descent with growing learning rate enables learning non-linear features in neural networks.

problem Learning non-linear features in two-layer neural networks.
method Using gradient descent with a learning rate that grows with the sample size.
result Multiple rank-one components emerge, each corresponding to a specific polynomial feature.

APD method decomposes neural network parameters into simple, faithful components.

problem Understanding the internal mechanisms learned by neural networks.
method Attribution-based Parameter Decomposition (APD) method.
result Demonstrated effectiveness in recovering features, separating computations, and identifying representations.

FMMNN combines sine activations with multi-component, multi-layer structure for high-frequency function approximation.

problem Effective representation and learning of high-frequency features in neural networks.
method Introduces FMMNN with sine-type activations and multi-component, multi-layer structure.
result FMMNN achieves strong accuracy and favorable convergence on oscillatory function-approximation benchmarks.

Bayesian-TPNN improves ANOVA-TPNN for detecting higher-order components.

problem Difficulty in incorporating higher-order components in ANOVA-TPNN due to computational and memory constraints.
method Bayesian inference procedure for functional ANOVA model with TPNN basis functions.
result Bayesian-TPNN detects higher-order components with reduced computational cost.

To compare entities of differing types and structural components, the artificial neural network paradigm was used to cross-compare structural components between heterogeneous documents. Trainable weighted structural components were input into machine-learned activation functions of the neurons. The model was used for m…

2018-01-09abs ↗pdf ↗

The ever-increasing demand from mobile Machine Learning (ML) applications calls for evermore powerful on-chip computing resources. Mobile devices are empowered with heterogeneous multi-processor Systems-on-Chips (SoCs) to process ML workloads such as Convolutional Neural Network (CNN) inference. Mobile SoCs house sever…

2019-08-24abs ↗pdf ↗

Study identifies components of unknown interventions in a mixture.

problem Identify components of a mixture of unknown interventions on a causal Bayesian Network.
method Construct example showing components not identifiable. Prove identifiability under mild conditions. Develop efficient algorithm for recovery. Analyze performance in simulation.
result Components of a mixture of unknown interventions can be uniquely identified under certain conditions.

Study reveals hidden null components in overparametrized neural networks.

problem Hidden null components in overparametrized neural networks.
method Structure theorem of null space for neural networks using ridgelet transforms.
result Null components can be uniquely written as linear combinations of ridgelet transforms.

CSD learns a common component for domain generalization, outperforming existing methods.

problem Training models to generalize across unseen domains.
method CSD decomposes the model into a common and specific component, discarding the latter.
result CSD outperforms state-of-the-art domain generalization methods.

Research has shown that widely used deep neural networks are vulnerable to carefully crafted adversarial perturbations. Moreover, these adversarial perturbations often transfer across models. We hypothesize that adversarial weakness is composed of three sources of bias: architecture, dataset, and random initialization.…

2018-12-04abs ↗pdf ↗

GT-PCA improves PCA for image and time series data.

problem Lack of robustness to transformations in PCA.
method GT-PCA is a neural network that estimates components invariant to specific transformations.
result GT-PCA outperforms alternative methods in synthetic and real data experiments.

This work investigates the framework and performance issues of the composite neural network, which is composed of a collection of pre-trained and non-instantiated neural network models connected as a rooted directed acyclic graph for solving complicated applications. A pre-trained neural network model is generally well…

2019-10-22abs ↗pdf ↗

Quaternion self-attention reduces computational cost and improves performance.

problem Existing quaternion self-attention increases computational cost and diverges attention distributions.
method Proposes a shared-score quaternion self-attention mechanism.
result Reduces score-computation multiplications by 75% and softmax operations from four to one.

Deep Neural Networks for image classification have been found to be vulnerable to adversarial samples, which consist of sub-perceptual noise added to a benign image that can easily fool trained neural networks, posing a significant risk to their commercial deployment. In this work, we analyze adversarial samples throug…

2019-12-07abs ↗pdf ↗

Unrolled neural networks emerged recently as an effective model for learning inverse maps appearing in image restoration tasks. However, their generalization risk (i.e., test mean-squared-error) and its link to network design and train sample size remains mysterious. Leveraging the Stein's Unbiased Risk Estimator (SURE…

2019-06-10abs ↗pdf ↗

Eigen component analysis combines quantum mechanics with machine learning for efficient data analysis.

problem Efficiently extracting linearly separable components from complex data.
method Eigen component analysis (ECA) incorporates quantum mechanics principles into linear learning models.
result ECA outperforms classical linear models and can be integrated with deep neural networks.

Learning to solve sequential tasks with recurrent models requires the ability to memorize long sequences and to extract task-relevant features from them. In this paper, we study the memorization subtask from the point of view of the design and training of recurrent neural networks. We propose a new model, the Linear Me…

2020-01-31abs ↗pdf ↗

Verification determines whether two samples belong to the same class or not, and has important applications such as face and fingerprint verification, where thousands or millions of categories are present but each category has scarce labeled examples, presenting two major challenges for existing deep learning models. W…

2017-06-12abs ↗pdf ↗

Despite the promising results of convolutional neural networks (CNNs), their application on devices with limited resources is still a big challenge; this is mainly due to the huge memory and computation requirements of the CNN. To counter the limitation imposed by the network size, we use pruning to reduce the network …

2020-01-22abs ↗pdf ↗

Despite a lack of theoretical understanding, deep neural networks have achieved unparalleled performance in a wide range of applications. On the other hand, shallow representation learning with component analysis is associated with rich intuition and theory, but smaller capacity often limits its usefulness. To bridge t…

2018-03-16abs ↗pdf ↗

Proposes BATer for improved adversarial example detection.

problem Detecting adversarial examples in neural networks.
method Introduces a Bayesian adversarial example detector (BATer) using random components in a Bayesian neural network.
result BATer outperforms state-of-the-art detectors in adversarial example detection.

Conventional principal component analysis (PCA) finds a principal vector that maximizes the sum of second powers of principal components. We consider a generalized PCA that aims at maximizing the sum of an arbitrary convex function of principal components. We present a gradient ascent algorithm to solve the problem. Fo…

2019-10-29abs ↗pdf ↗

Model combines long-term and short-term memory using conceptors.

problem Transfer between long-term and short-term memory.
method Recurrent neural network with gated reservoir for short-term memory and conceptors for long-term memory.
result Standard operations on conceptors allow combining long-term memories and describing their effect on short-term memory.

Deeper neural networks learn lower frequency functions faster, according to a new principle.

problem Understanding why deeper learning is faster.
method Fourier analysis and filtering method to separate and analyze the frequency distribution of neural network outputs.
result Deeper hidden layers in neural networks bias towards lower frequency functions during training.

Paper addresses theoretical risks in neural MCCFR, proposing Robust Deep MCCFR for improved performance.

problem Theoretical risks in neural MCCFR, especially in large games.
method Adaptive framework with selective component deployment, including target networks, exploration, and variance-aware training.
result Robust Deep MCCFR achieves significant exploitability improvements in both Kuhn and Leduc Poker.

GNIs induce a regulariser that penalizes high-frequency components in neural network activations.

problem Understanding the regularizing effect of Gaussian noise injections on neural network activations.
method Deriving the explicit regularizer by marginalizing out injected noise and analyzing its effect in the Fourier domain.
result GNIs induce a regularizer that produces calibrated classifiers with large margins.

FA algorithm provides convergence guarantees for deep linear networks.

problem Training efficiency and convergence of deep neural networks.
method Theoretical analysis of Feedback Alignment (FA) algorithm for deep linear networks.
result Certain initializations lead to implicit anti-regularization, affecting learning effectiveness.

In this paper, we study the adversarial attack and defence problem in deep learning from the perspective of Fourier analysis. We first explicitly compute the Fourier transform of deep ReLU neural networks and show that there exist decaying but non-zero high frequency components in the Fourier spectrum of neural network…

2019-05-30abs ↗pdf ↗

The paper defines and analyzes feature complexity in DNNs, proposing metrics for feature disentanglement and evaluation.

problem Understanding and quantifying the complexity of features learned by deep neural networks.
method Proposes a definition and disentanglement of feature complexity orders, introduces metrics for reliability and over-fitting evaluation.
result Establishes a relationship between feature complexity and DNN performance, and proposes a generic mathematical tool for network compression and knowledge distillation.

A new GNN architecture called coVariance neural network (VNN) improves stability and transferability of covariance matrix analysis.

problem Stability and transferability issues in covariance matrix analysis.
method Developed coVariance neural network (VNN) that operates on sample covariance matrices.
result VNN is more stable and transferable than PCA-based approaches.

New method finds smaller networks with similar performance to large models in fewer epochs.

problem Training large neural networks is computationally expensive and energy-intensive.
method Use PCA to identify a basis of hidden layer activations and reduce network parameters.
result Principal Component Networks (PCNs) can train faster and use less energy than overparameterized models without accuracy loss.