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

122243365486 · Jun 202019922001200920172026
48 results for class activation

Framework tackles class imbalance and noisy labels in active learning.

problem Class imbalance and noisy labels in real-world datasets.
method Uses foundation model priors to select informative samples for active learning.
result Substantial annotation savings (over 50%) with preserved performance and robustness.

CBDA improves active learning for semantic segmentation, especially with imbalanced classes.

problem Class imbalance degrades performance in domain adaptive active learning.
method Class Balanced Dynamic Acquisition (CBDA) selects more balanced labels for active learning.
result CBDA increases minority class performance and outperforms baselines by 0.6-2.4 mIoU.

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 ↗

New active learning framework for multiclass classification beyond realizability assumption.

problem Active learning in non-realizable settings with convex model classes.
method Surrogate risk minimization, epoch-based fitting, aggregation of models.
result Achieves label and sample complexity comparable to prior work in non-realizable settings.

Improves Active Learning by considering class imbalance and difficulty.

problem Active Learning's focus on individual samples ignores class distribution and difficulty.
method Proposes a method based on Bayes' rule to incorporate class imbalance, using a Variational Auto Encoder (VAE).
result Significantly outperforms state-of-the-art methods on datasets with heavy data imbalance.

A new PLL method uses class activation values to improve robustness.

problem Weakly supervised learning with noisy data and adversarial perturbations.
method Subjective logic with class activation values for uncertainty representation and label weight re-distribution.
result More robust predictions under high noise levels, out-of-distribution examples, and adversarial perturbations.

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.

The paper proves deep neural networks with analytic activation can approximate any function.

problem Approximating functions with neural networks using analytic activation functions.
method Elementary proofs for real and complex networks, Stone-Weierstrass theorem, Mergelyan's theorem.
result Closure of neural network classes equals space of polynomials for analytic activation.

We consider two active binary-classification problems with atypical objectives. In the first, active search, our goal is to actively uncover as many members of a given class as possible. In the second, active surveying, our goal is to actively query points to ultimately predict the proportion of a given class. Numerous…

2012-06-27abs ↗pdf ↗

The representations learned by deep neural networks are difficult to interpret in part due to their large parameter space and the complexities introduced by their multi-layer structure. We introduce a method for computing persistent homology over the graphical activation structure of neural networks, which provides acc…

2019-01-28abs ↗pdf ↗

An active learner is given a class of models, a large set of unlabeled examples, and the ability to interactively query labels of a subset of these examples; the goal of the learner is to learn a model in the class that fits the data well. Previous theoretical work has rigorously characterized label complexity of activ…

2015-06-08abs ↗pdf ↗

This work establishes distribution-free upper and lower bounds on the minimax label complexity of active learning with general hypothesis classes, under various noise models. The results reveal a number of surprising facts. In particular, under the noise model of Tsybakov (2004), the minimax label complexity of active …

2014-10-03abs ↗pdf ↗

Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.

problem Understanding and optimizing deep learning training phases.
method Direct measurements on three deepnet architectures across seven datasets.
result Deep nets exhibit 'Neural Collapse' during training's final phase, simplifying decision-making.

New approach improves human activity recognition with wearables.

problem Improving human activity recognition with wearables.
method Exploiting latent relationships between multi-channel sensor modalities, data-agnostic augmentation, and a classification loss criterion.
result Achieves new state-of-the-art performance on four diverse activity recognition benchmarks.

Active Learning methods create an optimized labeled training set from unlabeled data. We introduce a novel Online Active Deep Learning method for Medical Image Analysis. We extend our MedAL active learning framework to present new results in this paper. Our novel sampling method queries the unlabeled examples that maxi…

2019-08-28abs ↗pdf ↗

Study shows insurance industry in North Macedonia declined 10% due to COVID-19.

problem Impact of COVID-19 on insurance industry activity.
method Seasonal autoregressive models and data analysis for 11 insurance classes.
result Insurance activity in North Macedonia decreased by more than 10% during the pandemic.

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.

Bayesian active learning reduces data needed for latent variable models.

problem Active learning for latent variable models, especially mixtures of linear regressions and HMMs with GLM observations.
method Maximum-mutual-information input selection for discrete latent variable regression models.
result Active learning can achieve large gains for mixtures of linear-Gaussian models and substantially reduces data needed for GLM-HMM.

New insights on eluder dimension for function approximation in machine learning.

problem Complexity measure for online bandits and reinforcement learning with function approximation.
method Study the relationship between eluder dimension and generalized rank for different activation functions.
result Eluder dimension can be exponentially smaller or larger than generalized rank depending on the activation function.

In this paper, we analyze efficacy of the fast gradient sign method (FGSM) and the Carlini-Wagner's L2 (CW-L2) attack. We prove that, within a certain regime, the untargeted FGSM can fool any convolutional neural nets (CNNs) with ReLU activation; the targeted FGSM can mislead any CNNs with ReLU activation to classify a…

2018-11-15abs ↗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.

Traditional human activity recognition (HAR) based on time series adopts sliding window analysis method. This method faces the multi-class window problem which mistakenly labels different classes of sampling points within a window as a class. In this paper, a HAR algorithm based on U-Net is proposed to perform activity…

2018-09-20abs ↗pdf ↗

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.

We propose Disentanglement based Active Learning (DAL), a new active learning technique based on self-supervision which leverages the concept of disentanglement. Instead of requesting labels from human oracle, our method automatically labels the majority of the datapoints, thus drastically reducing the human labeling b…

2019-12-15abs ↗pdf ↗

Model analyzes Proof-of-Stake network dynamics and speculative capital effects on token prices.

problem Understanding and managing price dynamics in Proof-of-Stake networks.
method Developed an open-economy macroeconomic model to analyze Proof-of-Stake dynamics and speculative capital effects.
result Speculative capital can shift staked-token ownership, potentially improving consensus decentralization.

A new activation function improves credit scoring accuracy for imbalanced datasets.

problem Imbalanced datasets in credit scoring lead to underestimation of misclassification costs.
method Introduces ASIG, an asymmetric adjusted Sigmoid function.
result ASIG-embedded classifier outperforms traditional classifiers across various imbalance ratios.

An active learner is given a hypothesis class, a large set of unlabeled examples and the ability to interactively query labels to an oracle of a subset of these examples; the goal of the learner is to learn a hypothesis in the class that fits the data well by making as few label queries as possible. This work addresses…

2015-10-09abs ↗pdf ↗

Generating labeled training datasets has become a major bottleneck in Machine Learning (ML) pipelines. Active ML aims to address this issue by designing learning algorithms that automatically and adaptively select the most informative examples for labeling so that human time is not wasted labeling irrelevant, redundant…

2019-05-29abs ↗pdf ↗

Deep neural networks (DNN) are able to successfully process and classify speech utterances. However, understanding the reason behind a classification by DNN is difficult. One such debugging method used with image classification DNNs is activation maximization, which generates example-images that are classified as one o…

2019-07-06abs ↗pdf ↗

Sparse activations in neural networks are hard to exploit but lead to advantages in learning.

problem Sparse activations in neural networks are hard to exploit but lead to advantages in learning.
method Formal study of PAC learnability of MLP layers with activation sparsity.
result Classes of functions with activation sparsity lead to provable computational and statistical advantages over their non-sparse counterparts.

To date, the tightest upper and lower-bounds for the active learning of general concept classes have been in terms of a parameter of the learning problem called the splitting index. We provide, for the first time, an efficient algorithm that is able to realize this upper bound, and we empirically demonstrate its good p…

2017-02-27abs ↗pdf ↗

We study agnostic active learning, where the goal is to learn a classifier in a pre-specified hypothesis class interactively with as few label queries as possible, while making no assumptions on the true function generating the labels. The main algorithms for this problem are {\em{disagreement-based active learning}}, …

2014-07-10abs ↗pdf ↗