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% · Dec 199219922001200920172026
48 results for hierarchical feature space

Two new Hie-TAN and Hie-TAN-Lite algorithms improve TAN for hierarchical feature spaces.

problem Learning dependencies in hierarchical feature spaces.
method Exploits hierarchical parent-child relationships as constraints to learn a dependency tree.
result Hie-TAN-Lite outperforms Hie-TAN and other methods in predictive accuracy.

Unified framework for modeling hierarchical spaces in design problems.

problem Challenges in modeling hierarchical, conditional, heterogeneous, or tree-structured domains.
method Unified framework combining feature modeling and graph theory, introducing meta and partially-decreed variables.
result Demonstrated effectiveness on complex system design problems, including neural networks and green-aircraft.

DHRL learns interpretable features from visual data.

problem Limited use of deep learning in basic research for interpretable features.
method Generative model chaining, ladder network architecture, latent space regularization.
result DHRL generates disentangled hierarchical features from small datasets.

Three-layer networks learn complex hierarchical polynomials of multiple nonlinear features.

problem Understanding how neural networks learn hierarchical features of multiple nonlinear inputs.
method Examine a broad class of functions using three-layer neural networks, showing complete recovery and efficient learning.
result Three-layer neural networks trained via gradient descent can learn hierarchical polynomials of multiple nonlinear features efficiently.

DHGAK aligns substructures for better graph kernel performance.

problem Limited performance of traditional graph kernels due to missing substructure similarities.
method Hierarchically aligns relational substructures in deep embedding space, assigning same feature maps in RKHS.
result DHGAK outperforms state-of-the-art graph kernels on various benchmarks.

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.

There has been a surge in the number of large and flat data sets - data sets containing a large number of features and a relatively small number of observations - due to the growing ability to collect and store information in medical research and other fields. Hierarchical clustering is a widely used clustering tool. I…

2014-09-02abs ↗pdf ↗

Deep neural networks have been shown to be very successful at learning feature hierarchies in supervised learning tasks. Generative models, on the other hand, have benefited less from hierarchical models with multiple layers of latent variables. In this paper, we prove that hierarchical latent variable models do not ta…

2017-02-27abs ↗pdf ↗

The joint optimization of representation learning and clustering in the embedding space has experienced a breakthrough in recent years. In spite of the advance, clustering with representation learning has been limited to flat-level categories, which often involves cohesive clustering with a focus on instance relations.…

2019-01-28abs ↗pdf ↗

FISHDBC clusters arbitrary data with flexible, scalable, and hierarchical features.

problem Clustering arbitrary data with arbitrary distance functions efficiently.
method Flexible, incremental, scalable, hierarchical density-based clustering algorithm.
result Flexible clustering of arbitrary data without feature extraction.

New algorithm reduces online regression error in RKHS.

problem Online regression with time-varying functions in RKHS.
method Hierarchical Vovk-Azoury-Warmuth with discounting.
result Achieves optimal dynamic regret with O(T2/3PT1/3+TlnT)O(T^{2/3}P_T^{1/3} + \sqrt{T}\ln T) regret bound.

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.

Paper proposes a new metric learning method for better class separability.

problem Class separability in metric spaces for improved classification.
method CLAS(M)K-ML, learning best kernel function for high class separability.
result Better flexibility and lower computational complexity achieved.

Contextual bandit learning is an increasingly popular approach to optimizing recommender systems via user feedback, but can be slow to converge in practice due to the need for exploring a large feature space. In this paper, we propose a coarse-to-fine hierarchical approach for encoding prior knowledge that drastically …

2012-06-27abs ↗pdf ↗

Method learns hierarchical representations of samples and features simultaneously.

problem Hierarchical structures in samples and features not considered by existing methods.
method Jointly learns hierarchical representations via Tree-Wasserstein Distance alternating between samples and features.
result Method improves performance in link prediction and node classification tasks.

Extends linear representation hypothesis to categorical and hierarchical concepts in LLMs.

problem Representing concepts without natural contrasts in large language models.
method Formalizes linear representation hypothesis for categorical and hierarchical concepts, proving relationships between concept hierarchy and representation geometry.
result Validated theoretical results on large language models, estimating representations for 900+ concepts.

A new method for linear regression using feature graphs and hierarchical shrinkage.

problem Estimating robust parameters for linear regression models.
method Hierarchical Feature Regression (HFR) estimator that constructs a supervised feature graph to shrink parameters towards group targets.
result Demonstrates good predictive accuracy and versatility compared to other regularization techniques.

Paper proposes a method to generate synthetic anomalies for robust anomaly detection.

problem Anomaly detection struggles with unbalanced data and rare anomalies.
method Two-level hierarchical latent space representation for feature distillation and synthesis.
result The method creates robust synthetic anomalies for training robust binary classifiers.

In this paper, we propose a Ward-like hierarchical clustering algorithm including spatial/geographical constraints. Two dissimilarity matrices D0D_0 and D1D_1 are inputted, along with a mixing parameter α[0,1]α\in [0,1]. The dissimilarities can be non-Euclidean and the weights of the observations can be non-uniform. The fi…

2017-07-12abs ↗pdf ↗

A hierarchical model shows how scaling laws emerge from sequential feature recovery.

problem Emergence of scaling laws from feature learning in multi-layer networks.
method Layer-wise spectral algorithm adapted to compositional structure, sequential feature detection.
result Sequential detection of latent features, leading to explicit power-law decay of prediction error.

Improved image reconstruction and anomaly detection using hierarchical VAEs.

problem VAEs struggle with sharp images and high-level features.
method Added a new branch to hierarchical VAEs to separate high-level and low-level features.
result Results in sharper images and better anomaly detection.

A new convolutional spectral kernel network learns hierarchical and local features.

problem Lack of deep learning in non-stationary spectral kernels.
method Introduces convolutional filters and deep architectures into non-stationary spectral kernels, derives generalization error bounds, and introduces regularizers.
result Validated the effectiveness of the convolutional spectral kernel network on real-world datasets.

Hierarchical VAEs detect out-of-distribution data by identifying low-level in-distribution features.

problem Out-of-distribution data often has in-distribution low-level features, leading to misleading likelihood estimates in deep generative models.
method Developed a fast, scalable, unsupervised likelihood-ratio score for out-of-distribution detection based on hierarchical variational autoencoders.
result Achieved state-of-the-art results on out-of-distribution detection across various data and model combinations.

DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.

problem Learning deep hierarchical representations from data.
method Dual-constrained Deep Semi-Supervised Coupled Factorization Network (DS2CF-Net) with enriched prior.
result DS2CF-Net achieves state-of-the-art performance in representation learning and clustering.

Paper develops a dynamic Bayesian approach for active learning that optimizes exploration-exploitation balance.

problem Balancing exploration and exploitation in active learning for unknown functions.
method Develops BHEEM, a Bayesian hierarchical approach with approximate Bayesian computation for sampling trade-off parameters.
result BHEEM achieves at least 21% and 11% improvement over pure exploration and exploitation strategies respectively.

Paper develops a framework for generating coherent image captions using visual features and hierarchical topics.

problem Generating semantically coherent paragraphs to describe image content.
method Plug-and-play hierarchical-topic-guided image paragraph generation framework integrating visual extractor and deep topic model.
result Proposed models can distill interpretable multi-layer semantic topics and generate diverse and coherent captions.

Proves deep networks can learn hierarchical structures efficiently.

problem Understanding how deep networks learn hierarchical structures in data.
method Random Hierarchy Models, gradient-based methods, layerwise training.
result Proves deep networks can efficiently learn hierarchical structures.

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.

Paper proposes a GPU-based system for training massive deep learning models in ads systems.

problem Training massive deep learning models with terabyte-scale parameters in ads systems.
method Hierarchical GPU parameter server with 3-layer storage (GPU High-Bandwidth Memory, CPU main memory, SSD).
result 4-node hierarchical GPU parameter server trains a model 2X faster than a 150-node in-memory system.

We propose Deep Feature Factorization (DFF), a method capable of localizing similar semantic concepts within an image or a set of images. We use DFF to gain insight into a deep convolutional neural network's learned features, where we detect hierarchical cluster structures in feature space. This is visualized as heat m…

2018-06-26abs ↗pdf ↗

We propose a novel hierarchical generative model with a simple Markovian structure and a corresponding inference model. Both the generative and inference model are trained using the adversarial learning paradigm. We demonstrate that the hierarchical structure supports the learning of progressively more abstract represe…

2018-02-04abs ↗pdf ↗

Neural NMF discovers hierarchical topics in multilayer data.

problem Detecting latent hierarchical structure in multilayer data.
method Recursive application of nonnegative matrix factorization (NMF) in layers with backpropagation optimization.
result Neural NMF outperforms other hierarchical NMF methods in synthetic and real-world datasets.

Proposes GPHMEs using Gaussian processes for hierarchical expert models.

problem Hierarchical mixtures of experts with complex gating functions.
method Gaussian process-gated hierarchical mixtures of experts (GPHMEs) with non-linear gating and expert functions.
result Outperforms tree-based HMEs and achieves good performance with reduced complexity.