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.

169,051 papers · 148 categories

Trend · papers per month

4283125166 · May 202619922001200920182026
48 results for Hierarchical Separation

Posterior regularization enhances Bayesian hierarchical mixture clustering by improving node separation.

problem High nodal variance in BHMC trees, leading to weak separation between nodes at higher levels.
method Employing Posterior Regularization to impose max-margin constraints on nodes at every level.
result Improves cluster separation in BHMC models, enhancing overall model performance.

A new method for blind source separation using hierarchical structure and KL divergence.

problem Blind source separation of complex interacting signals.
method Hierarchical log-linear model with KL divergence minimization.
result Superior performance compared to existing techniques on images and time series data.

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

New algorithm proves deep networks can learn better than shallow ones.

problem Understanding the power difference between shallow and deep neural networks.
method Identifying a class of Boolean functions and proving that logarithmic-depth networks can learn them efficiently using hierarchical reconstruction.
result First algorithmic separation between constant-depth and logarithmic-depth neural networks.

Paper tackles online hierarchical clustering, offering efficient algorithms with good quality clusters.

problem Offline hierarchical clustering algorithms require full dataset, limiting their use on large datasets.
method Proposes two online algorithms (OTD and OHAC) to optimize Moseley and Wang revenue function.
result OTD achieves 1/3-approximation to MW revenue under data separation assumption.

ANTs integrate neural networks and decision trees for better performance.

problem Combining neural networks and decision trees for improved performance.
method Adaptive Neural Trees (ANTs) integrate representation learning into decision tree structures, using backpropagation for adaptive growth.
result ANTs achieve competitive performance on classification and regression datasets, with benefits in lightweight inference, feature separation, and adaptable architecture.

New criteria for relative hyperbolicity in hierarchically hyperbolic spaces.

problem Characterizing relative hyperbolicity in hierarchically hyperbolic spaces.
method New formulation of relative hyperbolicity in terms of hierarchy structures, applied to graphs associated to surfaces.
result The separating curve graph of a surface is relatively hyperbolic when the surface has zero or two punctures.

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.

MSOL learns hierarchical policies for multitask tasks with soft options.

problem Training hierarchical policies for multiple tasks with stability and flexibility.
method MSOL uses separate variational posteriors for each task, regularized by a shared prior, to avoid instabilities and fine-tune options for new tasks.
result MSOL significantly outperforms hierarchical and flat transfer-learning baselines.

HiDe learns hierarchical control for complex tasks by separating planning and control.

problem Solving long horizon control tasks with generalization to unseen scenarios.
method Functional decomposition of state-action spaces, RL-based planner, modular transfer of policy layers.
result Generalizes across unseen test environments and scales to longer horizons.

The study shows that certain curve graphs are hierarchically hyperbolic but not Gromov hyperbolic.

problem Characterizing the hyperbolicity of curve graphs and their boundaries.
method Using hierarchical hyperbolicity and framed curves, the study examines the properties of curve graphs and their boundaries.
result The curve graphs and their boundaries are hierarchically hyperbolic but not Gromov hyperbolic.

Hyperbolic space outperforms Euclidean in learning hierarchical data.

problem Learning hierarchical data in Euclidean space requires exponentially many samples.
method Established geometric obstruction in Euclidean space and showed hyperbolic space's advantage.
result Hyperbolic space enables learning with O(mRlogm)O(mR \log m) samples, matching information-theoretic optimum.

The paper explores clustering methods using Bregman divergences.

problem Developing efficient clustering algorithms for complex data.
method Investigates fixed rate quantization and Voronoi diagrams in Riemannian metric spaces induced by separable Bregman divergences.
result Experimental results show improved performance of clustering algorithms using these metrics.

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.

This paper tackles multilingual speech processing by optimizing conflicting objectives hierarchically.

problem Training models for multilingual, multi-task speech processing is hampered by conflicting objectives.
method Investigates three multi-objective MSP formulations and introduces a lightweight layer-selection mechanism.
result A bi-level recipe outperforms standard flat optimization in state-of-the-art MSP models.

Graph Pointer Networks and hierarchical reinforcement learning solve combinatorial optimization problems like TSP.

problem Traveling Salesman Problem (TSP) with constraints.
method Graph Pointer Networks (GPNs) and hierarchical reinforcement learning.
result GPNs and hierarchical RL find optimal solutions for TSP and TSP with time windows.

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.

Due to myriads of classes, designing accurate and efficient classifiers becomes very challenging for multi-class classification. Recent research has shown that class structure learning can greatly facilitate multi-class learning. In this paper, we propose a novel method to learn the class structure for multi-class clas…

2012-02-14abs ↗pdf ↗

New algorithm learns sub-task policies from unsegmented demonstrations.

problem Challenges in learning hierarchical policies from unsegmented demonstrations.
method Generative adversarial imitation learning framework with directed information maximization.
result Automatic learning of sub-task policies from unsegmented demonstrations.

UNTIE learns representations of coupled categorical data.

problem Challenges in learning from unlabeled categorical data with complex couplings.
method UNTIE approach for unsupervised representation learning of heterogeneous couplings.
result UNTIE significantly improves categorical data representations on 25 diverse datasets.

New WildMix dataset and Spectro-Temporal Transformer model for better monoaural audio source separation.

problem Challenging monoaural audio source separation.
method Introducing WildMix dataset and Spectro-Temporal Transformer model (STT) with Spectro-Temporal Encoder (STE).
result STT outperforms previous baselines on the WildMix dataset.

Deep convolutional networks provide state of the art classifications and regressions results over many high-dimensional problems. We review their architecture, which scatters data with a cascade of linear filter weights and non-linearities. A mathematical framework is introduced to analyze their properties. Computation…

2016-01-19abs ↗pdf ↗

A novel hierarchical Bayesian approach to Federated Learning reduces data exposure and improves convergence rates.

problem Data privacy and convergence in Federated Learning.
method Hierarchical Bayesian modeling and block-coordinate descent optimization.
result The proposed algorithm converges to an optimal solution with a rate of O(1/t)O(1/\sqrt{t}) and guarantees vanishing generalization error.

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.

A new model separates persistence and transition priors in HDP-HMM.

problem Limitation of sticky HDP-HMM in expressing different persistence strengths.
method Developed a disentangled sticky HDP-HMM (DS-HDP-HMM) with novel Gibbs sampling algorithms.
result DS-HDP-HMM outperforms sticky HDP-HMM and HDP-HMM on synthetic and real data.

New method improves uncertainty calibration in deep learning.

problem Systematic overconfidence in EDL on out-of-distribution inputs.
method Density-Informed Pseudo-count EDL (DIP-EDL) separates class prediction from uncertainty.
result DIP-EDL achieves asymptotic concentration and enhances robustness and uncertainty calibration.

FL+HC improves federated learning on non-iid data by clustering local updates.

problem FL struggles with non-iid data, leading to suboptimal models.
method Introduce hierarchical clustering to separate and train clusters of clients independently.
result FL+HC converges faster and achieves higher accuracy than standard FL.

RG-Flow combines RG and sparse priors for hierarchical image disentanglement.

problem Disentangling and manipulating image representations at different scales.
method Hierarchical flow model using RG and sparse prior distributions.
result RG-Flow enables semantic manipulation and style mixing at different image scales.

HPPCA improves imputation of longitudinal data with missing values.

problem Handling incomplete, high-dimensional longitudinal data with nested sources of variation and temporal dependency.
method Hierarchical probabilistic principal component analysis (HPPCA) with a two-level latent factor model and Gaussian process.
result HPPCA outperforms standard PPCA and multivariate functional PCA in imputation accuracy, even under heavy missingness and model misspecification.

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.

BiGraphNet generalizes graph neural networks for more efficient operations.

problem Fragmented graph neural network architectures hinder optimization.
method Explicitly separates input and output nodes, enabling new efficient operations.
result BiGraphNet accelerates and scales computations in hierarchical networks.

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 ↗