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

Trend · papers per month

1.3%2.6%3.9%5.3% · Feb 199819922001200920172026
48 results for Hierarchical Organization

Researchers organize and analyze a large public safety imagery dataset.

problem Efficiently organizing and analyzing a vast public safety imagery dataset.
method Hierarchical organization approach using Lincoln Laboratory Supercomputing Cluster for compute and storage.
result Successfully organized and evaluated the dataset with large-scale imagery inference across terabytes of data.

We survey agglomerative hierarchical clustering algorithms and discuss efficient implementations that are available in R and other software environments. We look at hierarchical self-organizing maps, and mixture models. We review grid-based clustering, focusing on hierarchical density-based approaches. Finally we descr…

2011-04-30abs ↗pdf ↗

Novel method extracts hierarchical brain connectivity patterns from fMRI.

problem Functional hierarchical organization of the human brain.
method Sparse Connectivity Patterns (SCPs) with hierarchy of sparse overlapping patterns, deep factorization of correlation matrices.
result Reproducible multi-scale hierarchical SCPs more stable than single-scale patterns.

The high-frequency cross-correlation existing between pairs of stocks traded in a financial market are investigated in a set of 100 stocks traded in US equity markets. A hierarchical organization of the investigated stocks is obtained by determining a metric distance between stocks and by investigating the properties o…

2000-09-22abs ↗pdf ↗

New approach for large-scale distributed learning systems that improve generalization performance.

problem Transitioning from centralized to distributed AI systems for complex learning tasks.
method Self-organizing hierarchical structuring mechanism based on agglomerative clustering, hierarchical generalization, and personalized learning.
result Demonstrates better generalization performance compared to conventional federated learning algorithms.

Enhances neural forecasting for hierarchically organized time series data.

problem Probabilistic coherent forecasting of time series data across different levels of aggregation.
method Proposes a coherent multivariate mixture output for neural forecasting architectures, optimizing with a composite likelihood objective.
result 13.2% average accuracy improvements on most datasets compared to state-of-the-art baselines.

Networks have in recent years emerged as an invaluable tool for describing and quantifying complex systems in many branches of science. Recent studies suggest that networks often exhibit hierarchical organization, where vertices divide into groups that further subdivide into groups of groups, and so forth over multiple…

2008-11-04abs ↗pdf ↗

Study on cryptocurrency market correlations at various time scales.

problem Understanding the hierarchical structure of cryptocurrency market dynamics.
method Analysis of MST and TMFG for 25 liquid cryptocurrencies at different time horizons.
result Cryptocurrency market correlations decrease with finer time scales and show a growing hierarchical structure with coarser scales.

Product Kanerva Machines dynamically combine smaller models for better memory organization.

problem Limited organization in the Kanerva Machine.
method Introducing Product Kanerva Machines that dynamically combine multiple smaller Kanerva Machines.
result Product Kanerva Machines can discover spatial tunings that approximately factorize simple images by object.

Paper proposes a new AI design philosophy for distributed learning.

problem Designing AI systems that mimic human cognitive capabilities.
method Democratized learning (Dem-AI) with self-organized hierarchical agents.
result Self-organized learning systems can perform complex tasks more efficiently.

Agent learns diverse hierarchical structures in unknown environments.

problem Autonomous discovery and learning of diverse structures in unknown changing environments.
method Progressive construction of a Hierarchy of Observation Latent Models for Exploration Stratification (HOLMES).
result Agent can learn and reuse representations to progressively explore and discover diverse structures.

Most animals possess the ability to actuate a vast diversity of movements, ostensibly constrained only by morphology and physics. In practice, however, a frequent assumption in behavioral science is that most of an animal's activities can be described in terms of a small set of stereotyped motifs. Here we introduce a m…

2013-10-16abs ↗pdf ↗

Option Encoder compresses reinforcement learning options into a policy basis.

problem Redundant options in reinforcement learning frameworks.
method Auto-encoder framework with constrained weights to discover a policy basis.
result Option Encoder reduces the number of options while maintaining performance.

We introduce the Hierarchically Interacting Particle Neural Network (HIP-NN) to model molecular properties from datasets of quantum calculations. Inspired by a many-body expansion, HIP-NN decomposes properties, such as energy, as a sum over hierarchical terms. These terms are generated from a neural network--a composit…

2017-09-29abs ↗pdf ↗

Probabilistic label trees improve XMLC by organizing labels hierarchically.

problem Efficiently tagging instances with a small subset of relevant labels from a large pool.
method Introduce and analyze probabilistic label trees (PLTs) as a generalization of hierarchical softmax for multi-label problems.
result PLTs are consistent for various performance metrics and can be trained online without prior knowledge.

Free Random Projection enhances reinforcement learning by naturally incorporating hierarchical structure.

problem Improving reinforcement learning algorithms for better generalization and adaptability.
method Introduces Free Random Projection, a method that uses free probability theory to create random orthogonal matrices encoding hierarchical structure.
result Empirically shows consistent improvement in generalization over standard methods on multi-environment benchmarks.

BiHRNN predicts inflation by leveraging hierarchical structure and bidirectional RNNs.

problem Accurate inflation forecasting is challenging due to dynamic factors and the layered structure of the Consumer Price Index.
method Bi-directional Hierarchical Recurrent Neural Network (BiHRNN) model that uses bidirectional information flow between levels and informative constraints on RNN parameters.
result BiHRNN significantly outperforms traditional RNN models in forecasting accuracy.

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.

HierarchicalForecast provides a Python framework for coherent hierarchical forecasting.

problem Ensuring forecasts at disaggregate levels add up to aggregate forecasts.
method Preprocessed datasets, evaluation metrics, and statistical baseline models.
result Python-based reference framework for statistical and ML forecasting.

Interactive steering improves hierarchical clustering for diverse user needs.

problem Existing hierarchical clustering methods fail to meet diverse user needs.
method Knowledge-driven and data-driven constraints, interactive steering through a visual interface.
result Facilitates the building of customized clustering trees efficiently and effectively.

Generalizes information theory for hierarchical partitions.

problem Understanding hierarchical decomposition of complex systems.
method Introducing a generalization of information theory for hierarchical partitions, revisiting Hierarchical Mutual Information (HMI), and proving its bounds and transformations.
result Derives hierarchical generalizations of information-theoretic quantities, including a non-metric variation of information.

In order to learn quickly with few samples, meta-learning utilizes prior knowledge learned from previous tasks. However, a critical challenge in meta-learning is task uncertainty and heterogeneity, which can not be handled via globally sharing knowledge among tasks. In this paper, based on gradient-based meta-learning,…

2019-05-13abs ↗pdf ↗

The extension of deep learning towards temporal data processing is gaining an increasing research interest. In this paper we investigate the properties of state dynamics developed in successive levels of deep recurrent neural networks (RNNs) in terms of short-term memory abilities. Our results reveal interesting insigh…

2018-02-02abs ↗pdf ↗

A new model embeds word and label hierarchies in hyperbolic space for HMLC.

problem Learning mappings from word hierarchies to label hierarchies in hierarchical multi-label classification.
method Proposes a Hyperbolic Interaction Model (HyperIM) to learn label-aware document representations in hyperbolic space.
result Demonstrates improved performance for HMLC compared to state-of-the-art methods.

New framework for domain adaptation using hierarchical optimal transport.

problem Improving domain adaptation when source and target data distributions differ.
method Proposes a new theoretical framework and hierarchical Wasserstein distance.
result Provides more explicit generalization bounds and aligns specific structures for successful adaptation.

Paper proposes integrating hierarchical class structure into prototypical network supervision.

problem Improving classification accuracy in tasks with hierarchical class structures.
method Integrates hierarchical class structure (metric) into prototypical network supervision.
result Consistent improvement of error rate weighted by the cost matrix compared to traditional methods.

Memory networks are neural networks with an explicit memory component that can be both read and written to by the network. The memory is often addressed in a soft way using a softmax function, making end-to-end training with backpropagation possible. However, this is not computationally scalable for applications which …

2016-05-24abs ↗pdf ↗

An empirical analysis of interest rates in money and capital markets is performed. We investigate a set of 34 different weekly interest rate time series during a time period of 16 years between 1982 and 1997. Our study is focused on the collective behavior of the stochastic fluctuations of these time-series which is in…

2004-01-23abs ↗pdf ↗

Tree-based variational inference improves PLN model for hierarchical count data.

problem Limited applicability of PLN model in ecosystems due to lack of hierarchical tree structures.
method Introduced PLN-Tree model integrating structured variational inference techniques.
result Enhanced generative improvements and practical interpretability in microbiome modeling.

Proposes a method to improve hierarchical clustering using set-level structural priors.

problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.

Diffusion models generalize better with hierarchical data structure and regularization.

problem Understanding generalization in diffusion models with finite data.
method Analyzing diffusion models through data covariance spectra and developing a theoretical framework based on linear neural networks.
result Generalization in diffusion models improves with hierarchical data structure and regularization.

Diffusion models learn hierarchical composition rules from data.

problem How many samples do generative models need to learn hierarchical composition rules?
method Theoretical and empirical investigation of diffusion models on probabilistic context-free grammars.
result Diffusion models learn hierarchical composition rules with sample complexity scaling polynomially with context size.