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

3196389571,276 · Jun 202019922001200920172026
48 results for Activation Methods

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.

New active learning methods for Gaussian process improve predictive modeling of composite fuselage.

problem Improving predictive modeling of composite fuselage with limited training samples and uncertainties.
method Proposed two new active learning algorithms for Gaussian process considering uncertainties.
result The proposed approach realizes better prediction performance for automatic shape control of composite fuselage.

Learning automatically the best activation function for the task is an active topic in neural network research. At the moment, despite promising results, it is still difficult to determine a method for learning an activation function that is at the same time theoretically simple and easy to implement. Moreover, most of…

2019-02-08abs ↗pdf ↗

New active learning method uses combinatorial coverage to improve data transfer and reduce bias.

problem Inability to transfer sampled data to new models and sampling bias issues.
method Data-centric active learning methods utilizing combinatorial coverage.
result Sampling data with coverage leads to better data transfer and competitive sampling bias.

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 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.

GAPA method provides efficient uncertainty quantification for pretrained networks.

problem Reliable uncertainty estimates for pretrained models are challenging.
method Post-hoc Gaussian Process Activations (GAPA) method that shifts Bayesian modeling from weights to activations.
result GAPA method provides efficient uncertainty quantification without altering the backbone's predictions.

New method uses trainable activations to make BNNs behave like GPs.

problem Making Bayesian Neural Networks (BNNs) behave like Gaussian Processes (GPs).
method Introduced trainable activations and periodic activations to map GP priors to BNNs. Used 2-Wasserstein distance for optimization.
result Method consistently outperforms existing approaches or matches heuristic methods.

A new method for recommending groups and activities based on geo-social data.

problem Recommendation of groups and activities based on geo-social data with social constraints.
method Proposes an attentive geo-social group recommendation method with an attention mechanism and a spatial query algorithm.
result Significantly outperforms baseline methods in real-world datasets.

New method predicts activity coefficients for binary mixtures without using physical descriptors.

problem Predicting activity coefficients for unexplored binary mixtures.
method Probabilistic matrix factorization model.
result Method outperforms state-of-the-art models requiring less training effort.

Efficient active learning method defends against malicious mislabeling and data poisoning attacks.

problem Malicious mislabeling and data poisoning attacks on deep neural networks.
method Adversarial retraining and active learning with random sampling strategy.
result The proposed method achieves 89% accuracy with only one-third of the labeled data, significantly outperforming the baseline method.

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.

Proposes a graph-based method for active learning in regression.

problem Active learning for regression is understudied and faces challenges with noisy labels and parameter uncertainty.
method Formulates active regression as a bipartite graph optimization problem.
result Demonstrates the effectiveness of the proposed graph-based approach on benchmark data sets.

New method improves active statistical inference by reducing noise.

problem Inaccurate uncertainty estimates in active sampling lead to noisy results.
method Robust sampling strategies that interpolate between uniform and active sampling based on uncertainty scores.
result The robust sampling ensures that the estimator is never worse than uniform sampling and usually outperforms active inference.

Proposes a method to improve deep active learning for NER tasks.

problem Weaknesses of existing deep active learning algorithms in practice.
method Estimates error decay curves of feature-defined subsets to improve sampling efficiency and robustness.
result Significantly outperforms diversification-based methods for black-box NER taggers and makes sampling more robust to labeling noise.

This paper proposes an active metric learning method for clustering with pairwise constraints.

problem Clustering with pairwise constraints and improving clustering performance.
method Active metric learning method that queries informative instance pairs and updates the learned metric sequentially.
result The proposed method enhances clustering performance and provides a tighter error bound.

We propose a new optimization method for training feed-forward neural networks. By rewriting the activation function as an equivalent proximal operator, we approximate a feed-forward neural network by adding the proximal operators to the objective function as penalties, hence we call the lifted proximal operator machin…

2018-11-05abs ↗pdf ↗

Study improves peptide design efficiency using active and meta-learning.

problem Designing novel functional peptides is inefficient due to low throughput and lack of data.
method Investigated active learning and meta-learning for optimizing peptide design experiments.
result Meta-learning improved average accuracy, but neither method outperformed random choice.

Two machine learning methods detect insider trading from investor activity data.

problem Detecting insider trading from trading activity data is challenging.
method Two unsupervised machine learning methods: clustering and group identification.
result Identifies potential insider trading rings around price sensitive events.

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.

Even though active learning forms an important pillar of machine learning, deep learning tools are not prevalent within it. Deep learning poses several difficulties when used in an active learning setting. First, active learning (AL) methods generally rely on being able to learn and update models from small amounts of …

2017-03-08abs ↗pdf ↗

Logistic regression is by far the most widely used classifier in real-world applications. In this paper, we benchmark the state-of-the-art active learning methods for logistic regression and discuss and illustrate their underlying characteristics. Experiments are carried out on three synthetic datasets and 44 real-worl…

2016-11-25abs ↗pdf ↗

Supervised machine learning methods usually require a large set of labeled examples for model training. However, in many real applications, there are plentiful unlabeled data but limited labeled data; and the acquisition of labels is costly. Active learning (AL) reduces the labeling cost by iteratively selecting the mo…

2019-01-12abs ↗pdf ↗

New method uses GNNs and node feature propagation for active learning in graph node classification.

problem Lack of labeled data for graph neural networks.
method Node feature propagation followed by K-Medoids clustering for instance selection.
result Proposed method significantly outperforms other methods on benchmark datasets.

Active Kriging Monte Carlo simulation method with conformal certification for failure probability estimation

problem Failure probability estimation in structural reliability analysis
method Active learning framework with conformal prediction
result Improved uncertainty quantification and reliability of failure probability estimates