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

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for deep features

Researchers quantify the relationship between feature depth and performance in deep neural networks.

problem Understanding how depth affects feature extraction and generalization in deep neural networks.
method Adaptive analysis of feature-depth trade-offs in deep nets, proving optimal generalization performance.
result Optimal generalization performance achieved through empirical risk minimization on deep nets.

Deep-gKnock uses DNNs to select groups of features with improved interpretability.

problem Feature selection in high-dimensional data with grouping structure.
method Combines deep neural networks with Knockoffs technique for group-feature selection.
result Improves interpretability and accurate gFDR control compared to state-of-the-art methods.

This paper considers the power of deep neural networks (deep nets for short) in realizing data features. Based on refined covering number estimates, we find that, to realize some complex data features, deep nets can improve the performances of shallow neural networks (shallow nets for short) without requiring additiona…

2019-01-01abs ↗pdf ↗

Deep neural networks are a powerful tool for feature learning and extraction given their ability to model high-level abstractions in highly complex data. One area worth exploring in feature learning and extraction using deep neural networks is efficient neural connectivity formation for faster feature learning and extr…

2015-12-11abs ↗pdf ↗

We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…

2017-08-01abs ↗pdf ↗

Study compares random and learned features in deep Bayesian linear models.

problem Understanding how feature learning affects generalization in deep learning.
method Comparing deep random feature models to deep networks with trained layers.
result Random feature models can display double-descent behavior, while deep networks do not.

Paper uses RL and DCAE to classify large unstructured data with fewer features.

problem Classifying large unstructured data with high precision using fewer features.
method Deep Convolutional Autoencoder (DCAE) for feature learning and Double DQN/Retrace RL algorithms for policy optimization.
result The approach achieves high classification precision with fewer features than traditional methods.

Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformations are effective and interpretable, while generalization requires more…

2016-06-24abs ↗pdf ↗

Deep learning is popular as an end-to-end framework extracting the prominent features and performing the classification also. In this paper, we extensively investigate deep networks as an alternate to feature encoding technique of low level descriptors for emotion recognition on the benchmark EmoDB dataset. Fusion perf…

2018-10-30abs ↗pdf ↗

DeepFS uses deep neural networks to select significant features in ultra high-dimensional data.

problem Challenges in traditional feature selection methods for high-dimensional, low-sample-size data.
method Two-step nonparametric approach combining deep neural networks and feature screening.
result DeepFS effectively identifies significant features with high precision for ultra high-dimensional data.

forgeNet uses a tree-based ensemble to learn feature graphs for deep learning in omics data.

problem Small sample size vs. large feature space in omics data.
method forgeNet integrates a forest feature graph extractor with a GEDFN architecture.
result ForgeNet achieves high classification accuracy on synthetic and real datasets.

FiBiNET combines feature importance and bilinear interactions for CTR prediction.

problem Improving click-through rate prediction in advertising and feed ranking systems.
method FiBiNET dynamically learns feature importance via SENET and bilinear feature interactions.
result FiBiNET outperforms shallow and deep models on real-world datasets.

GRIP2 improves deep learning feature selection robustness in correlated and noisy data.

problem Identifying predictive features in correlated and noisy data.
method Integrates first-layer feature activity over a two-dimensional regularization surface to control sparsity and geometry, using efficient block-stochastic sampling.
result Demonstrates improved robustness and power in high correlation and low signal-to-noise ratio regimes.

Proposes a feature leveling method to improve interpretability of deep neural networks.

problem Deep neural networks are hard to interpret due to mixed feature levels.
method Introduces a feature leveling architecture to isolate low and high level features.
result Modified models achieve competitive results and improved interpretability.

Deep learning explained through spectral filtering of hierarchical features.

problem Understanding how deep neural networks learn useful representations from data.
method Neural Low-Degree Filtering (Neural LoFi) as a stylized limit of gradient-based training.
result Predicts how representations are selected layer by layer and explains emergence of concepts.

In this paper, we propose a new deep feature selection method based on deep architecture. Our method uses stacked auto-encoders for feature representation in higher-level abstraction. We developed and applied a novel feature learning approach to a specific precision medicine problem, which focuses on assessing and prio…

2017-04-20abs ↗pdf ↗

Detects out-of-distribution and adversarial samples using deep feature distributions.

problem Detecting out-of-distribution and adversarial samples in deep neural networks.
method Modeling deep features with parametric probability distributions and calculating likelihoods at inference.
result Improves detection of out-of-distribution and adversarial samples, up to 12 percentage points in AUPR and AUROC metrics.

Proposes a method to select features for deep learning in noisy, high-dimensional data.

problem Feature selection for deep learning in ultra-high dimensional and highly correlated data.
method Data-adaptive multi-resolutional screening and cleaning with deep learning.
result Achieves high power while keeping false discovery rate low.

Redundancy in deep neural network (DNN) models has always been one of their most intriguing and important properties. DNNs have been shown to overparameterize, or extract a lot of redundant features. In this work, we explore the impact of size (both width and depth), activation function, and weight initialization on th…

2019-01-30abs ↗pdf ↗

We propose semi-random features for nonlinear function approximation. The flexibility of semi-random feature lies between the fully adjustable units in deep learning and the random features used in kernel methods. For one hidden layer models with semi-random features, we prove with no unrealistic assumptions that the m…

2017-02-28abs ↗pdf ↗

DSCF-Net learns deep features for clustering with robustness and locality preservation.

problem Unsupervised deep representation learning for clustering.
method Integrates robust deep concept factorization, deep self-expressive representation, and adaptive locality preserving feature learning.
result Delivers state-of-the-art performance on public databases.

This paper extends neural collapse to regression problems, revealing key features and structures.

problem Understanding the structure learned by deep neural networks in regression tasks.
method Established Neural Regression Collapse (NRC) across different models, analyzing feature and weight alignments.
result Deep neural regression models exhibit a collapsed feature space, aligning with target dimensions and covariances.

Deep random feature models are analyzed for their performance with exact asymptotic expressions.

problem Understanding the performance of deep random feature models.
method Established a novel universality result and used the convex Gaussian Min-Max theorem.
result Exact asymptotic expressions for the performance of deep random feature models are derived.

"Deep Learning" methods attempt to learn generic features in an unsupervised fashion from a large unlabelled data set. These generic features should perform as well as the best hand crafted features for any learning problem that makes use of this data. We provide a definition of generic features, characterize when it i…

2014-02-20abs ↗pdf ↗

This paper investigates the influence of different acoustic features, audio-events based features and automatic speech translation based lexical features in complex emotion recognition such as curiosity. Pretrained networks, namely, AudioSet Net, VoxCeleb Net and Deep Speech Net trained extensively for different speech…

2018-10-31abs ↗pdf ↗

ADEC addresses feature randomness and drift in autoencoder-based clustering.

problem Clustering autoencoders learn unreliable pseudo-labels, distorting latent space and feature randomness.
method Adversarial training to balance reconstruction loss and clustering objective.
result ADEC outperforms state-of-the-art autoencoder-based clustering methods.

Deep neural features identify unique vehicles from dash-cam feeds.

problem Identifying unique vehicles in dash-cam feeds for self-driving cars.
method Used pretrained YOLO network feature maps to create deep integrated feature signatures (DIFS) for 700 images of 35 vehicles and 340 images of 17 vehicles.
result Correctly identified unique vehicles at 96.7% for high resolution data and 86.8% for lower resolution data.

DeepUnHide uses deep learning to reveal hidden demographic features in recommender systems.

problem Extracting hidden demographic features from recommender systems factors.
method Gradient-based localization in deep learning for feature extraction.
result DeepUnHide outperforms state-of-the-art feature selection methods.

Study evaluates consistency of feature attribution in deep learning for multi-omics data.

problem Challenges in interpretability of deep learning models in biological research.
method Investigation of Shapley Additive Explanations (SHAP) on multi-view deep learning models applied to multi-omics data.
result SHAP rankings are sensitive to architecture and random initialization, suggesting caution.