This paper introduces channel gating, a dynamic, fine-grained, and hardware-efficient pruning scheme to reduce the computation cost for convolutional neural networks (CNNs). Channel gating identifies regions in the features that contribute less to the classification result, and skips the computation on a subset of the …
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,932 papers · 148 categories
Trend · papers per month
48 results for “channel gating”
Improved neural networks with conditional gating and reduced computational cost.
problem Training large capacity neural networks with high accuracy and low computational cost.
method Fine-grained channel gating using batch-shaping and residual blocks.
result Conditional gating improves network accuracy and computational efficiency.
Study online learning of quantum processes, showing feasibility for certain types.
problem Learning quantum processes adaptively, especially for bounded gate complexity and Pauli channels.
method Online learning, mistake-bounded model, multiplicative weights update algorithm, Bell sampling.
result Online learning feasible for quantum channels of bounded gate complexity and Pauli channels.
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.
This paper prunes deep neural networks by grouping channels and using a bounded L1-L0 norm.
problem Improving network efficiency by reducing the number of parameters in deep neural networks.
method Group-wise pruning with a bounded L1-L0 norm regularizer.
result Significant reduction in model size with minimal loss in accuracy.
This letter tackles channel assignment in uplink wireless communication systems.
problem Maximizing the sum rate of all users in uplink wireless communication systems with integer channel assignment constraints.
method A convex optimization based algorithm is used to find the optimal channel assignment. Machine learning approaches, including CNNs, FNNs, random forest, and GRUs, are employed to reduce computation time.
result Machine learning methods largely reduce computation time with slightly compromised prediction accuracy.
Architecture optimization, which is a technique for finding an efficient neural network that meets certain requirements, generally reduces to a set of multiple-choice selection problems among alternative sub-structures or parameters. The discrete nature of the selection problem, however, makes this optimization difficu…
Study reduces complexity and uncertainty in human atrial cell models.
problem Uncertainty in parameter estimates from gating kinetics models.
method Approximate Bayesian computation to re-calibrate models, investigate two approaches: more complete datasets and less complex formulations.
result Less complex model with fewer parameters gives better fit and lower uncertainty.
Deep learning model classifies concurrent human interactions from WiFi data with high accuracy.
problem Classifying concurrent human interactions from WiFi data with high accuracy.
method Attention-BiGRU deep learning model using Multiple Input Multiple Output radio link.
result Maximum benchmark accuracy of 94% for a single subject-pair, 88% for ten subject pairs.
IETNet identifies important channels for MVTS classification.
problem Multivariate time series classification with blackbox deep networks.
method End-to-end network combining temporal feature extraction, variable selection, and interaction.
result IETNet improves model accuracy and reduces overfitting by identifying and removing non-predictive variables.
New method separates multiple voices in mixed audio.
problem Separating multiple simultaneous speakers in audio.
method Gated neural networks trained at multiple steps, selecting actual number of speakers.
result Outperforms current state of the art for more than two speakers.
The study examines how quantum resources enhance the complexity of quantum circuits.
problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.
Free Energy Mixercs.CL
FEM improves attention mechanisms by applying value-driven log-linear tilts.
problem Standard attention mechanisms read via convex average, limiting channel-wise selection.
method Free Energy Mixer (FEM) applies a value-driven, per-channel log-linear tilt to a fast prior over indices.
result FEM outperforms strong baselines on NLP, vision, and time-series tasks.
New method uses single quantum state for machine learning tasks, improving accuracy.
problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.
Hybrid deep learning model predicts urban floods with high accuracy.
problem Urban flood prediction and situation awareness using channel network sensors data.
method FastGRNN-FCN hybrid deep learning model trained on Harris County, Texas flood data.
result Test accuracy and F-measure reach 97.8% and 0.792, respectively.
New framework prevents forgetting in sequential learning tasks.
problem Catastrophic forgetting in Convolutional Neural Networks.
method Conditional channel gating modules and task classifier.
result Consistent improvement over existing methods in continual learning.
DeepCausalMMM: A Deep Learning Framework for Marketing Mix Modeling with Causal Structure Learningcs.LG
DeepCausalMMM models marketing impacts using deep learning and causal inference.
problem Traditional MMM approaches struggle with non-linear dynamics and temporal patterns.
method Combines deep learning, causal inference, and marketing science. Uses GRUs for temporal patterns and DAG structure for channel dependencies.
result Captures non-linear dynamics and temporal patterns in marketing impacts.
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.
Preparation of 3-qubit statesquant-ph
New method prepares 3-qubit states using local gates and controlled-Z gates.
problem Preparation of 3-qubit states using quantum gates.
method Uses gates and controlled- gates, with an optimal number of controlled- gates.
result Optimal number of controlled- gates for preparing 3-qubit states is four.
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.
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…
Bivariate Beta-LSTMcs.LG
Proposes a new LSTM gate structure using bivariate Beta distribution.
problem Inflexibility of sigmoid gates in modeling multi-modality and skewness, and lack of modeling correlation between gates.
method Introduces a bivariate Beta distribution gate structure within LSTM cells.
result Empirically shows higher gradient values and improved model performance.
UniPhyNet improves cognitive load classification accuracy using EEG, ECG, and EDA signals.
problem Classifying cognitive load using multimodal physiological data.
method Unified network architecture integrating multiscale parallel convolutional blocks, ResNet-type blocks, and channel block attention module. Uses bidirectional gated recurrent unit for temporal dependencies.
result Improves raw signal classification accuracy from 70% to 80% (binary) and 62% to 74% (ternary) on CL-Drive dataset.
We sparsify gated RNNs by simplifying their structure.
problem Improving efficiency of RNNs by reducing their complexity.
method Adjust existing sparsification techniques to gated RNNs, sparsifying preactivations of gates.
result Simplified LSTM structure improves model performance and efficiency.
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…
Gating units in GRUs and LSTMs create slow modes and control phase-space complexity.
problem Training challenges in RNNs due to exploding or vanishing gradients.
method Random matrix theory and mean-field theory applied to GRUs and LSTMs.
result Gates in GRUs and LSTMs lead to accumulation of slow modes and control phase-space complexity.
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…
Bayesian methods have been successfully applied to sparsify weights of neural networks and to remove structure units from the networks, e. g. neurons. We apply and further develop this approach for gated recurrent architectures. Specifically, in addition to sparsification of individual weights and neurons, we propose t…
This paper analyzes how gradient descent can learn parameters in mixture-of-experts models with gating.
problem Understanding parameter recovery in mixture-of-experts models with gating.
method Careful analysis of the optimization landscape and design of two distinct loss functions.
result Gradient descent can accurately learn parameters in mixture-of-experts models with gating.
Transformers without skip connections collapse token representations to a single direction.
problem Rapid convergence of token representations to a single direction in self-attention-only Transformers.
method Analysis of layer normalization, residual connections, and multi-head attention mechanisms.
result Residual connections prevent rank collapse in real Transformers, while MLPs generate new feature directions.
Study finds no significant short-term impact on liquidity supply after protocol fees were reduced.
problem Liquidity provider welfare is affected by protocol fees, but the impact on liquidity supply is unclear.
method Used a matched-overlap event-study difference-in-differences design to estimate the liquidity-supply response to take-rate cuts.
result No significant short-term impact on active liquidity or local depth; no change in LP participation or composition.
GLCB uses Gated Linear Networks for online contextual bandits.
problem Online learning in contextual bandits with uncertainty estimation.
method Gated Linear Networks (GLNs) for prediction and uncertainty estimation.
result GLCB outperforms state-of-the-art methods in online contextual bandits.
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.
Gated recurrent neural networks have achieved remarkable results in the analysis of sequential data. Inside these networks, gates are used to control the flow of information, allowing to model even very long-term dependencies in the data. In this paper, we investigate whether the original gate equation (a linear projec…
Solves challenges in estimating parameters of softmax gating Gaussian mixture models.
problem Identifiability issues and complex interactions in Gaussian mixture of experts.
method Proposes novel Voronoi loss functions and establishes convergence rates of MLE.
result Connects convergence rate of MLE to a solvability problem of polynomial equations.
A major contributing factor to the recent advances in deep neural networks is structural units that let sensory information and gradients to propagate easily. Gating is one such structure that acts as a flow control. Gates are employed in many recent state-of-the-art recurrent models such as LSTM and GRU, and feedforwa…
A new method quantizes LSTM gate parameters without performance loss.
problem Quantization loss in LSTM gate parameters without performance degradation.
method Lossy quantization of gate parameters during training, weight parameters adjust to offset quantization loss.
result F1 score decreased by only 0.7% on Named Entity Recognition dataset.
Deep gated networks help understand training and generalization in deep learning.
problem Understanding the role of SGD in training and generalization of deep neural networks with ReLU activation.
method Developed deep gated networks (DGNs) as a framework to analyze training and generalization in DNNs with ReLU activation.
result Gate adaptation is key for generalization in deep neural networks.
Gradient Gating improves deep GNNs by modulating message passing updates.
problem Oversmoothing and performance degradation in deep GNNs.
method Gradient gating mechanism for multi-rate message passing.
result G framework alleviates oversmoothing and achieves state-of-the-art performance.
LSTMs were introduced to combat vanishing gradients in simple RNNs by augmenting them with gated additive recurrent connections. We present an alternative view to explain the success of LSTMs: the gates themselves are versatile recurrent models that provide more representational power than previously appreciated. We do…
The paper establishes convergence rates for MoE models in classification problems.
problem Understanding the behavior of MoE models in classification settings.
method Established convergence rates for density and parameter estimation in softmax gating multinomial logistic MoE models.
result Parameter estimation rates are significantly improved with a novel modified softmax gating function.
Spatiotemporal sequence prediction is an important problem in deep learning. We study next-frame(s) video prediction using a deep-learning-based predictive coding framework that uses convolutional, long short-term memory (convLSTM) modules. We introduce a novel reduced-gate convolutional LSTM(rgcLSTM) architecture that…
New insights into the top-K sparse softmax gating function for deep learning.
problem Understanding the theoretical effects of the top-K sparse softmax gating function on density and parameter estimations.
method Using a Gaussian mixture of experts, novel loss functions, and theoretical analysis.
result The convergence rates of density and parameter estimations are parametric under certain conditions, but slow under over-specified models.
Model accurately gates ocean microbes from high-frequency flow cytometry data.
problem Gating of high-frequency flow cytometry data for ocean microbes is challenging.
method Trend filtered mixture of experts with smooth parameter variation.
result Model accurately matches human-annotated gating and corrects errors.