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

Trend · papers per month

224449673897 · Jun 202019922001200920172026
48 results for adaptive activation functions

This research improves neural network performance with adaptive activation functions in sparse data settings.

problem Limited data availability in scientific and engineering problems.
method Investigation of two types of adaptive activation functions with individual trainable parameters.
result Adaptive activation functions, especially with individual trainable parameters, enhance prediction accuracy and confidence in sparse data settings.

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 ↗

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.

Improves graph-based active learning for non-Gaussian models.

problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.

Smooth activations enable optimal error rates in neural networks for Sobolev function classes.

problem Achieving optimal approximation and estimation error rates for neural networks in Sobolev function classes.
method Study of neural networks with smooth activations, proving optimal rates via approximation and statistical properties.
result Constant-depth networks with smooth activations achieve optimal rates of approximation and estimation, demonstrating smoothness adaptivity.

Artificial neural networks typically have a fixed, non-linear activation function at each neuron. We have designed a novel form of piecewise linear activation function that is learned independently for each neuron using gradient descent. With this adaptive activation function, we are able to improve upon deep neural ne…

2014-12-21abs ↗pdf ↗

We point out an issue with Theorem 5 appearing in "Group-based active query selection for rapid diagnosis in time-critical situations". Theorem 5 bounds the expected number of queries for a greedy algorithm to identify the class of an item within a constant factor of optimal. The Theorem is based on correctness of a re…

2017-05-10abs ↗pdf ↗

Gaussian Mixture Models (GMM) have found many applications in density estimation and data clustering. However, the model does not adapt well to curved and strongly nonlinear data. Recently there appeared an improvement called AcaGMM (Active curve axis Gaussian Mixture Model), which fits Gaussians along curves using an …

2015-02-06abs ↗pdf ↗

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.

Physics-informed neural network identifies and characterizes surface cracks in metals.

problem Identifying and characterizing surface-breaking cracks in metals using ultrasound.
method Physics-informed neural network (PINN) trained with ultrasonic surface wave data and adaptive activation functions.
result PINN accurately estimates the speed of sound and identifies crack locations in metals.

As one of standard approaches to train deep neural networks, dropout has been applied to regularize large models to avoid overfitting, and the improvement in performance by dropout has been explained as avoiding co-adaptation between nodes. However, when correlations between nodes are compared after training the networ…

2018-06-26abs ↗pdf ↗

Paper presents a robust transfer learning method for active level set estimation.

problem Efficiently identifying regions of a black-box function with limited function evaluations.
method Incorporates prior knowledge from a related function while locally adapting it.
result The method achieves better convergence of level sets compared to standard transfer learning.

New activation function BrownianReLU improves LSTM network performance on financial time series.

problem Gradient instability in noisy financial time series data.
method Introduces BrownianReLU, a stochastic activation function based on Brownian motion.
result Significantly improved predictive accuracy and generalization on financial datasets.

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.

Adaptive quadrature improves Bayesian inference through active learning.

problem Efficiently estimating posterior densities in Bayesian inference.
method Sequential node selection using acquisition functions, combining interpolative surrogate models and quadrature rules.
result Positive estimation of marginal likelihood with improved accuracy.

We extend neural networks with fractional and mixed activation functions for better function approximation.

problem Limitations in approximating higher-order smooth functions in complex spaces.
method Incorporating fractional exponents in activation functions and defining new density functions.
result Improved accuracy and broader applicability of neural network approximation theory.

Unified perspective unites Bayesian optimization and active learning for efficient goal-oriented optimization.

problem Efficiently optimize expensive engineering and scientific problems with limited data.
method Unified framework linking Bayesian infill criteria and active learning criteria.
result Unified approach formalizes Bayesian infill criteria and active learning criteria.

This document investigates the integration of adaptive distinguishing sequences into the process of active automata learning (AAL). A novel AAL algorithm "ADT" (adaptive discrimination tree) is developed and presented. Since the submission of the original thesis, the presented algorithm has been integrated into LearnLi…

2019-02-04abs ↗pdf ↗

Adaptive sequential decision making is one of the central challenges in machine learning and artificial intelligence. In such problems, the goal is to design an interactive policy that plans for an action to take, from a finite set of nn actions, given some partial observations. It has been shown that in many applicat…

2019-11-09abs ↗pdf ↗

We propose to optimize the activation functions of a deep neural network by adding a corresponding functional regularization to the cost function. We justify the use of a second-order total-variation criterion. This allows us to derive a general representer theorem for deep neural networks that makes a direct connectio…

2018-02-26abs ↗pdf ↗

Paper improves PINNs' extrapolation by TL and adaptive AFs.

problem PINNs' poor extrapolation performance and sensitivity to AFs.
method Transfer learning within an extended domain and adaptive activation functions.
result Average 40% reduction in relative L2 error and 50% in mean absolute error in extrapolation domain.

Study proposes a stopping criterion for active learning based on error stability.

problem Improving predictive performance in active learning by adaptively annotating samples.
method Proposes a stopping criterion based on error stability for Bayesian active learning.
result Demonstrates the proposed criterion stops active learning at the appropriate timing for various models and datasets.

We present the first adaptive strategy for active learning in the setting of classification with smooth decision boundary. The problem of adaptivity (to unknown distributional parameters) has remained opened since the seminal work of Castro and Nowak (2007), which first established (active learning) rates for this sett…

2017-11-25abs ↗pdf ↗

We present a new active learning algorithm that adaptively partitions the input space into a finite number of regions, and subsequently seeks a distinct predictor for each region, both phases actively requesting labels. We prove theoretical guarantees for both the generalization error and the label complexity of our al…

2020-02-18abs ↗pdf ↗

A framework is introduced for actively and adaptively solving a sequence of machine learning problems, which are changing in bounded manner from one time step to the next. An algorithm is developed that actively queries the labels of the most informative samples from an unlabeled data pool, and that adapts to the chang…

2018-05-29abs ↗pdf ↗

Discriminative active learning reduces data annotation costs for domain adaptation.

problem Conditional shift problem hinders domain adaptation between related but different domains.
method Three-stage active adversarial training: invariant feature space learning, uncertainty and diversity criteria, re-training with queried labels.
result Empirical comparisons show the proposed approach is more effective than existing methods.

AReLU uses attention-based rectification to improve neural network performance.

problem Improving neural network performance through better activation functions.
method Integrates attention mechanism with rectified linear unit (ReLU) to learn and scale feature maps.
result AReLU significantly boosts performance of most network architectures with minimal changes.