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

Trend · papers per month

2.1%4.2%6.3%8.5% · Jun 202019922001200920172026
48 results for Intermediate Layers

This paper introduces a novel approach to measuring privacy risks in deep computer vision models based on intermediate outputs.

problem The exposure of intermediate results in hidden layers of deep computer vision models poses significant privacy concerns.
method The approach leverages Degrees of Freedom (DoF) to evaluate the amount of information retained in each layer and combines this with the rank of the Jacobian matrix to assess sensitivity to input variations.
result The proposed framework provides deeper insights into privacy risks associated with intermediate representations without requiring adversarial attack simulations.

Self-supervised and supervised methods learn similar intermediate visual representations but diverge in final layers.

problem Comparing self-supervised and supervised methods for visual learning.
method Comparison of contrastive self-supervised and supervised methods on simple image data.
result Contrastive and supervised methods learn similar intermediate representations but diverge in final layers.

Paper analyzes why deeper layers of ViTs perform worse on out-of-distribution tasks.

problem Performance degradation of intermediate layers in ViTs under distribution shift.
method Extensive linear probing experiments across various benchmarks and fine-grained analysis of transformer modules.
result Probing feedforward network activations yields best performance under significant distribution shift.

Improves interpretability of neural network intermediate layers by making concept activations more robust and effective.

problem Challenges in interpreting neural network decisions and learning in intermediate layers due to opacity and shared interactions.
method Proposes A-CAV to increase effectiveness and employs Gram-Schmidt process to improve robustness.
result Significant improvement in recall rate of concept images from 18.35% to 76.83% for VGG16, with reduced variance in recall across different random seeds.

Neural network models have a reputation for being black boxes. We propose to monitor the features at every layer of a model and measure how suitable they are for classification. We use linear classifiers, which we refer to as "probes", trained entirely independently of the model itself. This helps us better understand …

2016-10-05abs ↗pdf ↗

This paper proposes a set of rules to revise various neural networks for 3D point cloud processing to rotation-equivariant quaternion neural networks (REQNNs). We find that when a neural network uses quaternion features under certain conditions, the network feature naturally has the rotation-equivariance property. Rota…

2019-11-20abs ↗pdf ↗

LSTMs and other RNN variants have shown strong performance on character-level language modeling. These models are typically trained using truncated backpropagation through time, and it is common to assume that their success stems from their ability to remember long-term contexts. In this paper, we show that a deep (64-…

2018-08-09abs ↗pdf ↗

To reduce the large computation and storage cost of a deep convolutional neural network, the knowledge distillation based methods have pioneered to transfer the generalization ability of a large (teacher) deep network to a light-weight (student) network. However, these methods mostly focus on transferring the probabili…

2018-10-18abs ↗pdf ↗

Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local…

2018-03-10abs ↗pdf ↗

A new KD layer lets student models learn and apply teacher knowledge explicitly.

problem Implicit action of traditional KD on student's feature transform limits its use in intermediate layers.
method Proposes a learnable KD layer that explicitly embeds teacher's knowledge in feature transform.
result Improves KD with two abilities: leveraging teacher's knowledge and feeding forward knowledge deeper.

Neural networks are vulnerable to adversarial examples, malicious inputs crafted to fool trained models. Adversarial examples often exhibit black-box transfer, meaning that adversarial examples for one model can fool another model. However, adversarial examples may be overfit to exploit the particular architecture and …

2018-11-20abs ↗pdf ↗

DFS dynamically decides bitwidths for layers to balance accuracy and efficiency.

problem Balancing model accuracy and inference speed for deep networks.
method Dynamic Fractional Skipping (DFS) framework that assigns bitwidths to layers for input-adaptive inference.
result DFS achieves superior tradeoff between computational cost and model accuracy.

The study proves Gaussian universality of deep random features learning.

problem Understanding the test error in deep random features learning.
method Proving Gaussian universality of test error in ridge regression and arbitrary convex losses.
result Sharp asymptotic formula for test error in ridge regression setting.

Neural networks benefit from intermediate representations, reducing sample complexity.

problem Understanding how neural networks leverage intermediate representations for hierarchical learning.
method Fixed, randomly initialized neural network as a representation function, compared with raw inputs and other trainable networks.
result Neural representations can achieve improved sample complexities compared to raw inputs, especially for low-rank polynomials.

Researchers analyze the geometric and statistical properties of transformer model representations.

problem Understanding the semantic structure of large transformer models across various data types.
method Characterization of geometric and statistical properties through analysis of intrinsic dimension and neighbor composition.
result The semantic information of the dataset is better expressed at the end of the first peak in transformer models.

A new method aggregates generative classifiers to resist adversarial attacks.

problem Adversarial attacks on deep neural networks.
method Rank-aggregating ensemble of generative classifiers trained on intermediate layer responses.
result The ensemble of generative classifiers shows robustness to adversarial attacks.

Improves adversarial robustness of DEQ models by regulating neural dynamics.

problem Limited adversarial robustness of DEQ models.
method Interprets DEQs as neural dynamics, uses entropy reduction and random intermediate states.
result Significantly increases adversarial robustness of DEQ models.

Deep neural network algorithms are difficult to analyze because they lack structure allowing to understand the properties of underlying transforms and invariants. Multiscale hierarchical convolutional networks are structured deep convolutional networks where layers are indexed by progressively higher dimensional attrib…

2017-03-12abs ↗pdf ↗

Our proposed deeply-supervised nets (DSN) method simultaneously minimizes classification error while making the learning process of hidden layers direct and transparent. We make an attempt to boost the classification performance by studying a new formulation in deep networks. Three aspects in convolutional neural netwo…

2014-09-18abs ↗pdf ↗

Transformers solve parity problems efficiently with step-by-step reasoning.

problem Training transformers to solve complex, recursive problems like parity.
method Training a one-layer transformer to solve kk-parity, incorporating intermediate parities into the loss function, and using teacher forcing or augmented data.
result Transformers can learn parity in one gradient update with intermediate supervision or self-consistency checks.

Deep networks improve by progressively refining approximations at each layer.

problem Standard approximation theory doesn't explain the role of intermediate layers in deep neural networks.
method Developed a mixed-activation architecture with a geometric scale interpretation of depth.
result Each intermediate layer approximates the target function with a geometric rate.

Backpropagation-free RL method trains layers using local signals.

problem Vanishing or exploding gradients in backpropagation-based RL.
method Local pairwise distance matching for layer-wise training without backpropagation.
result Backpropagation-free method achieves competitive performance and stability.

Shallow supervised 1-hidden layer neural networks have a number of favorable properties that make them easier to interpret, analyze, and optimize than their deep counterparts, but lack their representational power. Here we use 1-hidden layer learning problems to sequentially build deep networks layer by layer, which ca…

2018-12-29abs ↗pdf ↗

Proposes PSCs for UQ in deep nets without retraining.

problem Estimating uncertainty in deep nets with a single pass.
method Identifies sensitive, smooth intermediate layer, fits probabilistic model.
result PSCs achieve UQ and OOD detection performance matching existing methods.