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

3875113150 · Jun 202019922001200920172026
48 results for Mish activation

We propose Mish\textit{Mish}, a novel self-regularized non-monotonic activation function which can be mathematically defined as: f(x)=xtanh(softplus(x))f(x)=x\tanh(softplus(x)). As activation functions play a crucial role in the performance and training dynamics in neural networks, we validated experimentally on several well-known benchmarks…

2019-08-23abs ↗pdf ↗

Deep networks can approximate various activation functions with modest adjustments.

problem Expressive power of deep neural networks with diverse activation functions.
method Approximation of any activation function in set A by ReLU networks with specific scaling factors.
result Approximation of any activation function in a specific subset of A by ReLU networks with (1,1) scaling factors.

A new Universal Activation Function improves performance across various machine learning tasks.

problem Achieving near optimal performance in different machine learning tasks.
method Optimization algorithms evolve the UAF's parameters to match the optimal activation function for each task.
result The UAF converges to near optimal performance in classification, quantification, and reinforcement learning tasks.

Quantized neural networks can represent all fixed-point functions under certain conditions.

problem Expressive power of quantized neural networks under fixed-point arithmetic.
method Analyzing necessary and sufficient conditions for quantized networks to represent all fixed-point functions.
result Various popular activation functions satisfy the sufficient condition for representing all fixed-point functions.

LSQ+ improves quantization of neural nets with Swish activations, achieving state-of-the-art results.

problem Quantization of neural nets with Swish activations, especially negative activations, leads to significant performance loss.
method Introduces learnable scale and offset parameters for asymmetric quantization, and uses MSE-based initialization for quantization parameters.
result Significantly outperforms LSQ for low-bit quantization of neural nets with Swish activations, achieving up to 5.6% gain with W2A2 quantization of EfficientNet-B0.

Many activation functions have been proposed in the past, but selecting an adequate one requires trial and error. We propose a new methodology of designing activation functions within a neural network at each layer. We call this technique an "activation ensemble" because it allows the use of multiple activation functio…

2017-02-24abs ↗pdf ↗

This paper studies activation sparsity in large language models, finding key trends and implications.

problem Activation sparsity in large language models (LLMs) can be improved for efficiency and interpretability.
method Proposes PPL-p%p\% sparsity, analyzes trends with training data, width-depth ratio, and parameter scale.
result ReLU is more efficient for sparsity than SiLU, and deeper architectures can improve sparsity.

Many neural network architectures rely on the choice of the activation function for each hidden layer. Given the activation function, the neural network is trained over the bias and the weight parameters. The bias catches the center of the activation, and the weights capture the scale. Here we propose to train the netw…

2019-01-28abs ↗pdf ↗

BinaryDuo improves BNNs by coupling binary activations, outperforming state-of-the-art models.

problem Gradient mismatch in BNNs due to binarizing activations.
method Using gradient of smoothed loss function to estimate gradient mismatch, proposing BinaryDuo scheme with coupled ternary activations.
result BinaryDuo outperforms state-of-the-art BNNs on various benchmarks.

Evolutionary algorithms improve neural network performance by discovering better activation functions.

problem The choice of activation function affects neural network performance, but ReLU remains dominant.
method Defined a tree-based search space of candidate activation functions and used evolutionary algorithms (mutation, crossover, exhaustive search) to explore and discover better functions.
result Replacing ReLU with evolved activation functions statistically significantly increases network accuracy.

Collaborative filtering is a useful technique for exploiting the preference patterns of a group of users to predict the utility of items for the active user. In general, the performance of collaborative filtering depends on the number of rated examples given by the active user. The more the number of rated examples giv…

2012-07-11abs ↗pdf ↗

Bayesian adaptive designs can be biased by active learning, especially with misspecified models.

problem Active learning bias in Bayesian adaptive experimental designs.
method Analysis of linear and preference learning models, empirical testing.
result Model misspecification and noise influence active learning bias in Bayesian designs.

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

Active testing reduces label costs for efficient model evaluation.

problem Real-world applications require expensive test labels, disconnecting from existing model evaluation methods.
method Derives acquisition strategies to select test points efficiently, addressing label bias and variance.
result Active testing improves model evaluation efficiency without sacrificing accuracy.

Survey of trainable activation functions in neural networks.

problem Improving neural network performance through trainable activation functions.
method Taxonomy and comparison of recent and past models of trainable activation functions.
result Many trainable activation functions are equivalent to adding neuron layers with fixed activation functions and simple constraints.

This paper analyzes and improves active learning techniques for real-world projects.

problem Reducing labelling effort in machine learning models with real-world constraints.
method Systematic study of active learning issues, proposing techniques to address model convergence, annotation error, and dataset imbalance.
result Presentation of two techniques to speed up active learning: partial uncertainty sampling and larger query size.

Study active nematic forces on curved surfaces, revealing new coupling mechanisms.

problem Understanding active nematic forces on curved surfaces.
method Developed a thermodynamically consistent surface model with nematic activity, analyzed topological defects.
result Active defects contribute both tangential and normal forces on curved surfaces.

Bayesian active learning method improved for censored regression data.

problem Challenges in estimating BALD for censored regression data.
method Derived entropy and mutual information for censored distributions, developed C\mathcal{C}-BALD objective, proposed novel modelling approach.
result Demonstrated C\mathcal{C}-BALD outperforms other methods in censored regression.

Large deviation principle for deep neural networks with ReLU activation.

problem Understanding the behavior of deep neural networks with ReLU activation.
method Proving a large deviation principle for networks with Gaussian weights and ReLU activation functions.
result Simplified expressions and power-series expansions for the ReLU case.

EmbraceNet fusion model for multi-sensor activity recognition.

problem Human activity recognition using multiple sensors is challenging.
method Independent processing of each sensor, feature fusion with EmbraceNet, post-processing, and additional processes.
result Improved performance in SHL recognition challenge.

New proof shows neural networks can memorize training data with high accuracy.

problem Proving neural networks can memorize training data with high accuracy.
method Probabilistic construction exploiting sparsity.
result Proves neural networks with threshold or mixed threshold-ReLU activations can memorize training data.

We consider active learning of deep neural networks. Most active learning works in this context have focused on studying effective querying mechanisms and assumed that an appropriate network architecture is a priori known for the problem at hand. We challenge this assumption and propose a novel active strategy whereby …

2018-11-19abs ↗pdf ↗

Data-aware activation function customization reduces neural network error.

problem Current neural networks lack consideration for specific activation functions.
method Linear algebraic explanation and Diaconis-Shahshahani Approximation Theorem criteria for activation functions.
result Using an even activation function like seagull can reduce neural network error by orders of magnitude.

Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for a…

2019-06-14abs ↗pdf ↗

This paper explores adaptive neural activation in RNNs for better learning.

problem Fixed neural activation functions limit the performance and adaptability of RNNs.
method Developed a novel parametric family of nonlinear activation functions inspired by biological neurons.
result Adaptive neural activation improves learning speed and performance in RNNs.

DAL uses disentanglement for automatic labeling in GAN-based active learning.

problem Reducing human labeling in GAN-based active learning.
method DAL leverages disentanglement in InfoGAN to automatically label datapoints, deciding human labeling based on disagreement with InfoGAN labels and label correction.
result DAL achieves better performance than existing GAN-based active learning approaches on image classification tasks.

Active-memory mechanisms can replace self-attention in Transformers, but optimal results often require both.

problem Replacing self-attention with active-memory mechanisms in Transformers.
method Evaluation of various active-memory mechanisms in a Transformer model.
result Active-memory mechanisms can achieve comparable results to self-attention for language modeling, but optimal results are often achieved by combining both mechanisms.

Unified study of active learning for deep neural networks.

problem Improving performance of deep neural networks through active learning.
method Investigation of incremental and cumulative training modes, model configurations, query strategies, and pseudo-labels.
result Proposed more efficient querying procedures and insights into active learning behavior.

Deep learning models outperform classical methods in forecasting neural activity.

problem Improving forecasting of neural activity using deep learning models.
method Systematic evaluation of eight probabilistic deep learning models against classical statistical models and baseline methods.
result Several deep learning models consistently outperform classical approaches in forecasting neural activity.

FedMAX tackles activation divergence in FL, improving accuracy and efficiency.

problem Activation divergence in Federated Learning due to non-IID data.
method Introduced a prior based on maximum entropy to minimize information about per-device activation vectors and make similar classes more alike.
result Significantly more similar activation vectors across multiple devices, leading to better accuracy and efficiency.