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

Trend · papers per month

4081121161 · Jun 202019922001200920172026
48 results for activity gating

The paper analyzes the role of ReLU gates in deep learning networks.

problem Understanding the role of gates in deep learning networks.
method Developed neural path features (NPF) and neural path values (NPV) to characterize the active sub-networks during training.
result The neural path kernel associated with NPFs is a fundamental quantity that characterizes the information stored in the gates of a DNN.

Paper connects MoE and self-attention, proposing active-attention.

problem Improving efficiency and performance of self-attention mechanisms.
method Established connection between MoE and self-attention, analyzed quadratic gating functions, proposed active-attention mechanism.
result Active-attention outperforms standard self-attention in various tasks.

Temporal Functional Circuits explain KAN forecasts with interpretable edge functions.

problem Lack of mechanistic explanations in KAN forecasting.
method Transform KAN edge functions into faithful, temporally grounded explanations using a gated residual KAN.
result Gated KAN achieves lower MSE than linear-only models on regime-switching signals.

This work interprets GELU and related activations via a first-order loss function.

problem Understanding and optimizing activation functions in neural networks.
method Complementary interpretation using the Gaussian first-order loss function.
result Calibrated or learned uniform-threshold gates are competitive and often outperform GELU, ReLU, and SiLU/Swish.

Sigmoid gating is more sample efficient than softmax in mixture of experts.

problem Softmax gating leads to unnecessary competition among experts, causing representation collapse.
method Theoretical analysis of a regression framework with mixture of experts, identifying identifiability conditions and convergence rates.
result Sigmoid gating requires fewer samples to achieve the same expert estimation error as softmax gating.

This paper presents a novel model for multimodal learning based on gated neural networks. The Gated Multimodal Unit (GMU) model is intended to be used as an internal unit in a neural network architecture whose purpose is to find an intermediate representation based on a combination of data from different modalities. Th…

2017-02-07abs ↗pdf ↗

Sensor fusion is a key technology that integrates various sensory inputs to allow for robust decision making in many applications such as autonomous driving and robot control. Deep neural networks have been adopted for sensor fusion in a body of recent studies. Among these, the so-called netgated architecture was propo…

2018-10-08abs ↗pdf ↗

Gating is a key technique used for integrating information from multiple sources by long short-term memory (LSTM) models and has recently also been applied to other models such as the highway network. Although gating is powerful, it is rather expensive in terms of both computation and storage as each gating unit uses a…

2018-06-18abs ↗pdf ↗

Methods from convex optimization are widely used as building blocks for deep learning algorithms. However, the reasons for their empirical success are unclear, since modern convolutional networks (convnets), incorporating rectifier units and max-pooling, are neither smooth nor convex. Standard guarantees therefore do n…

2016-04-07abs ↗pdf ↗

We propose a simple extension to the ReLU-family of activation functions that allows them to shift the mean activation across a layer towards zero. Combined with proper weight initialization, this alleviates the need for normalization layers. We explore the training of deep vanilla recurrent neural networks (RNNs) with…

2017-09-12abs ↗pdf ↗

Unified model explains volatility memory in stocks and forex.

problem Understanding the components of volatility memory in financial markets.
method Developed a three-dimensional decomposition of volatility memory into level, shape, and tempo.
result Unified model shows that volatility memory is state-dependent, with different gates prevailing in equities and forex.

Value Iteration Networks (VINs) are effective differentiable path planning modules that can be used by agents to perform navigation while still maintaining end-to-end differentiability of the entire architecture. Despite their effectiveness, they suffer from several disadvantages including training instability, random …

2018-06-17abs ↗pdf ↗

ReLU neural-networks have been in the focus of many recent theoretical works, trying to explain their empirical success. Nonetheless, there is still a gap between current theoretical results and empirical observations, even in the case of shallow (one hidden-layer) networks. For example, in the task of memorizing a ran…

2019-06-12abs ↗pdf ↗

Neural plasticity is an important functionality of human brain, in which number of neurons and synapses can shrink or expand in response to stimuli throughout the span of life. We model this dynamic learning process as an L0L_0-norm regularized binary optimization problem, in which each unit of a neural network (e.g., …

2019-08-13abs ↗pdf ↗

This study improves stock investment strategies using advanced neural networks.

problem Improving stock investment strategies for better performance.
method Used LSTM-GRU neural networks combined with SVM for stock prediction.
result LSTM-GRU outperformed benchmarks in stock predictions.

Common nonlinear activation functions used in neural networks can cause training difficulties due to the saturation behavior of the activation function, which may hide dependencies that are not visible to vanilla-SGD (using first order gradients only). Gating mechanisms that use softly saturating activation functions t…

2016-03-01abs ↗pdf ↗

A new method prunes neural networks efficiently without losing effectiveness.

problem Efficient pruning of neural networks without sacrificing performance.
method Deterministic approximation of binary gates and L0L_0 regularization.
result Pruning neural networks significantly without loss in effectiveness.

Client adaptation improves federated learning performance with non-IID data.

problem Improving model performance in federated learning with non-identically and non-independently distributed data.
method Simulates heterogeneous clients to learn client-specific conditioning using a conditional gated activation unit.
result Client adaptation enhances model performance across balanced and imbalanced data sets from audio and image domains.

The paper studies 4-qubit Clifford states and their properties.

problem Understanding the set and properties of 4-qubit Clifford states.
method Analyzing the 293760 4-qubit Clifford states, splitting them into 18 groups, and studying the action of CNOT gates and local gates.
result There are 293760 4-qubit Clifford states with specific entanglement entropies, and any pair can be connected with local gates and at most 3 CNOT gates.

Improved logistic MoE with sigmoid gate shows better sample efficiency.

problem Improving sample efficiency in logistic MoE models.
method Comprehensive analysis of multinomial logistic MoE with modified sigmoid gate, incorporating temperature parameter and using Euclidean score.
result The sigmoid gate leads to lower sample complexity than softmax gate for both parameter and expert estimation.

We explore the application of end-to-end stateless temporal modeling to small-footprint keyword spotting as opposed to recurrent networks that model long-term temporal dependencies using internal states. We propose a model inspired by the recent success of dilated convolutions in sequence modeling applications, allowin…

2018-11-19abs ↗pdf ↗

S2KAN integrates symbolic primitives into neural network activations for improved interpretability.

problem Training activations in KANs often lack symbolic fidelity, leading to unintelligible models.
method Softly Symbolified Kolmogorov-Arnold Networks (S2KAN) integrates symbolic primitives into training with learnable gates and a Minimum Description Length objective.
result S2KAN discovers interpretable forms when symbolic terms suffice, gracefully degrading to dense splines when necessary.

In quantum computation, series of quantum gates have to be arranged in a predefined sequence that led to a quantum circuit in order to solve a particular problem. What if the sequence of quantum gates is known but both the problem to be solved and the outcome of the so defined quantum circuit remain in the shadow? This…

2015-06-27abs ↗pdf ↗

Dropout helps a stable network learn new tasks without forgetting old ones.

problem Catastrophic forgetting in neural networks when learning multiple tasks.
method Investigate the relationship between dropout and stability in neural networks, showing dropout acts as an implicit gating mechanism.
result Dropout stabilizes a network's learning, allowing it to learn new tasks without forgetting old ones.

Long Short-Term Memory (LSTM) infers the long term dependency through a cell state maintained by the input and the forget gate structures, which models a gate output as a value in [0,1] through a sigmoid function. However, due to the graduality of the sigmoid function, the sigmoid gate is not flexible in representing m…

2019-05-25abs ↗pdf ↗

SGD converges globally to logistic loss minima for two-layer nets.

problem Global convergence of SGD for logistic loss on two-layer neural nets.
method Demonstrates existence of Frobenius norm regularized logistic loss functions as Villani functions, proving convergence and exponential rate.
result SGD converges globally to the global minima of appropriately regularized logistic empirical risk of depth 2 nets.

Gated attention improves model curvature, enhancing performance on nonlinear tasks.

problem Understanding the geometric implications of gating in attention mechanisms.
method Modeling attention outputs as Gaussian distributions and analyzing Fisher--Rao geometry.
result Gated attention enables non-flat geometries, including positively curved manifolds.

Gated attention improves performance by using a hierarchical mixture of experts.

problem Improving performance of self-attention mechanisms in Transformers.
method Rigorously show that gated attention can be modeled as a hierarchical mixture of experts, providing a theoretical justification for its benefits.
result Gated attention is more sample-efficient than multi-head self-attention, requiring fewer data points to achieve the same estimation error.

Given the success of the gated recurrent unit, a natural question is whether all the gates of the long short-term memory (LSTM) network are necessary. Previous research has shown that the forget gate is one of the most important gates in the LSTM. Here we show that a forget-gate-only version of the LSTM with chrono-ini…

2018-04-13abs ↗pdf ↗

Improved HMoE models using Laplace gating function enhance expert specialization and performance.

problem Improving performance of hierarchical mixture of experts models.
method Used Laplace gating function instead of Softmax in hierarchical mixture of experts models.
result Laplace gating function accelerates expert convergence and enhances specialization.

The paper evaluates three variants of the Gated Recurrent Unit (GRU) in recurrent neural networks (RNN) by reducing parameters in the update and reset gates. We evaluate the three variant GRU models on MNIST and IMDB datasets and show that these GRU-RNN variant models perform as well as the original GRU RNN model while…

2017-01-20abs ↗pdf ↗

This study analyzes communication constraints in MoE architectures using information theory.

problem Communication constraints in Mixture-of-Experts (MoE) architectures.
method Developed a rate-distortion characterization of finite-rate gating in MoE architectures using information theory.
result Yielded capacity-aware limits for communication-constrained MoE systems.