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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Backbone Feature Extractor

This study addresses an issue of co-adaptation between a feature extractor and a classifier in a neural network. A naive joint optimization of a feature extractor and a classifier often brings situations in which an excessively complex feature distribution adapted to a very specific classifier degrades the test perform…

2019-06-04abs ↗pdf ↗

This paper proposes a method to improve few-shot learning by generating multi-level weight-centric features.

problem Improving few-shot learning performance by leveraging both representation power and weight generation capacity.
method A multi-level weight-centric feature learning approach with a weight-centric training strategy and multi-level feature incorporation.
result Significantly outperforms existing methods in low-shot classification benchmarks.

A new method scales sparse machine learning to ultra-high dimensional problems.

problem Sparse and interpretable machine learning in ultra-high dimensional data.
method Two-phase approach: backbone set determination followed by reduced problem solving.
result The backbone set contains truly relevant features with high probability.

We introduce a method to provide vectorial representations of visual classification tasks which can be used to reason about the nature of those tasks and their relations. Given a dataset with ground-truth labels and a loss function defined over those labels, we process images through a "probe network" and compute an em…

2019-02-10abs ↗pdf ↗

Deep learning is still not a very common tool in speaker verification field. We study deep convolutional neural network performance in the text-prompted speaker verification task. The prompted passphrase is segmented into word states - i.e. digits -to test each digit utterance separately. We train a single high-level f…

2018-03-13abs ↗pdf ↗

Deep Learning Accelerators are prone to faults which manifest in the form of errors in Neural Networks. Fault Tolerance in Neural Networks is crucial in real-time safety critical applications requiring computation for long durations. Neural Networks with high regularisation exhibit superior fault tolerance, however, at…

2019-07-06abs ↗pdf ↗

Deep convolutional neural networks have led to breakthrough results in practical feature extraction applications. The mathematical analysis of these networks was pioneered by Mallat, 2012. Specifically, Mallat considered so-called scattering networks based on identical semi-discrete wavelet frames in each network layer…

2015-04-21abs ↗pdf ↗

RTFE provides adversarial robustness to multiple models.

problem Adversarial examples can transfer to other models, compromising robustness.
method Proposes RTFE, a deep learning-based pre-processing mechanism.
result RTFE provides adversarial robustness to multiple independently trained classifiers.

DLC enhances distillation-based continual learning with lightweight plugins.

problem Stability-plasticity dilemma in distillation-based continual learning.
method DLC deploys lightweight residual plugins into the classifier-proximal layer of a shared feature extractor.
result Significant 8% accuracy gain on large-scale benchmarks with minimal parameter increase.

Meta-learning improves feature extraction for few-shot tasks.

problem Understanding why meta-learning models perform better on few-shot classification.
method Developed hypotheses and a regularizer to improve standard training routines.
result Meta-learned models outperform classical training routines in few-shot classification.

Proposes a framework for extracting consistent physiological features across users.

problem Variability of biosignals across different users and tasks.
method Adversarial feature extractor for disentangled universal representations.
result Up to 8.8% improvement in average accuracy of classification.

Hyperparameter optimization aims to find the optimal hyperparameter configuration of a machine learning model, which provides the best performance on a validation dataset. Manual search usually leads to get stuck in a local hyperparameter configuration, and heavily depends on human intuition and experience. A simple al…

2017-10-17abs ↗pdf ↗

EAGLE-Net enhances foundation models by integrating patch-level features for better tissue understanding.

problem Foundation models lack mechanisms for global tissue structure and local context in computational pathology.
method EAGLE-Net combines multi-scale spatial encoding, attention-guided loss functions, and background suppression to aggregate patch-level features into slide-level predictions.
result EAGLE-Net improves classification accuracy and concordance indices across multiple cancer types, producing biologically coherent attention maps.

An unsupervised learning classification model is described. It achieves classification error probability competitive with that of popular supervised learning classifiers such as SVM or kNN. The model is based on the incremental execution of small step shift and rotation operations upon selected discriminative hyperplan…

2018-06-25abs ↗pdf ↗

MTL-NAS combines NAS with GP-MTL for task-agnostic multi-task learning.

problem Designing architectures for diverse tasks with varying priors.
method Disentangled GP-MTL networks, hierarchical feature sharing, and gradient-based search.
result General-purpose model trained once can adapt to multiple tasks.

Improves unsupervised domain adaptation by enforcing feature extractor to focus on task-relevant information.

problem Leveraging label information from source domain for accurate target domain models without labels.
method Variational Information Bottleneck (VBDA) method that explicitly enforces feature extractor to ignore irrelevant task factors.
result Significantly outperforms state-of-the-art methods across three domain adaptation benchmark datasets.

Improves speaker verification for variable-duration utterances using a feature pyramid module.

problem Improving robustness for variable-duration utterances in speaker verification.
method Integrates a feature pyramid module into multi-scale aggregation to enhance speaker-discriminative information from multiple layers.
result Improves performance for both short and long utterances compared to state-of-the-art approaches.

Generative model designs highly designable proteins using geometric algebra.

problem Creating proteins with diverse and statistically accurate secondary structures.
method Introduced a geometric algebra flow matching model (FrameFlow) with Clifford Frame Attention (CFA) for protein backbone design.
result Achieved high designability, diversity, and novelty in protein backbone sampling.

A new model improves uncertainty estimation in deep learning.

problem Deep Kernel Learning (DKL) produces unreliable uncertainty estimates.
method Proposed a bi-Lipschitz constraint to preserve distances in feature space.
result DUE model outperforms previous DKL and other methods in uncertainty quality.

LDA improves image classification accuracy with fewer features.

problem Fine-grained image classification with pretrained features.
method Supervised dimensionality reduction with LDA before linear probing.
result LDA improves accuracy over full features in 11 out of 12 configurations.

Enhances ZSL models with biologically inspired feature enhancement.

problem Limited training data leads to poor feature extraction from pre-trained models.
method Dual-channel learning framework using auxiliary data sets.
result Improves ZSL model's generalization ability and achieves state-of-the-art results.

The paper proposes reusable network components by making them compatible across tasks.

problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.

Many recent methods for unsupervised or self-supervised representation learning train feature extractors by maximizing an estimate of the mutual information (MI) between different views of the data. This comes with several immediate problems: For example, MI is notoriously hard to estimate, and using it as an objective…

2019-07-31abs ↗pdf ↗

Proposes PSCs for UQ in deep nets without retraining.

problem Estimating uncertainty in deep nets with a single pass.
method Identifies sensitive, smooth intermediate layer, fits probabilistic model.
result PSCs achieve UQ and OOD detection performance matching existing methods.

Purpose: Lung nodules have very diverse shapes and sizes, which makes classifying them as benign/malignant a challenging problem. In this paper, we propose a novel method to predict the malignancy of nodules that have the capability to analyze the shape and size of a nodule using a global feature extractor, as well as …

2019-04-23abs ↗pdf ↗

We propose a Variational Time Series Feature Extractor (VTSFE), inspired by the VAE-DMP model of Chen et al., to be used for action recognition and prediction. Our method is based on variational autoencoders. It improves VAE-DMP in that it has a better noise inference model, a simpler transition model constraining the …

2018-07-06abs ↗pdf ↗

The paper introduces metrics to objectively evaluate interpretability methods.

problem Lack of objective evaluation metrics for interpretability methods.
method Proposes a set of metrics to evaluate interpretability methods along simplicity and broadness.
result Validated metrics on different benchmark tasks and showed their utility in method selection.

New algorithms minimize regret in multi-task and lifelong linear bandits with shared representation.

problem Minimizing regret in multi-task and lifelong linear bandits with shared representation.
method Novel algorithms using efficient estimator for low-rank linear feature extractor and novel analysis.
result Achieved regret bounds matching minimax lower bound up to logarithmic factors.

Improves few-shot learning for hierarchical data using hyperbolic space.

problem Few-shot class-incremental learning for hierarchical data.
method Contrastive learning in hyperbolic space, Poincaré ball model, hyperbolic contrastive loss, maximum entropy distribution.
result Effective improvement of coarse and fine class accuracies in few-shot conditions.

Many practical machine learning tasks employ very deep convolutional neural networks. Such large depths pose formidable computational challenges in training and operating the network. It is therefore important to understand how fast the energy contained in the propagated signals (a.k.a. feature maps) decays across laye…

2017-04-12abs ↗pdf ↗