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

Trend · papers per month

25497498 · Jun 202019922001200920182026
48 results for hierarchical segmentation

Paper tackles brain tumor segmentation using weak labels and hierarchical training.

problem High manual labeling effort for fully supervised brain tumor segmentation.
method Uses scribbles and global labels for weak supervision, trains two networks in phases.
result Achieves competitive results on brain tumor segmentation and substructure segmentation.

We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conv…

2016-02-20abs ↗pdf ↗

CompILE learns reusable segments from demonstrations for hierarchical task execution.

problem Learning reusable, variable-length segments of hierarchical behavior from demonstrations.
method Unsupervised, fully-differentiable sequence segmentation module for latent encoding and re-composition.
result Model generalizes to longer sequences and unseen environments, learns task boundaries and event encodings.

Bayesian layer improves image segmentation and out-of-distribution detection.

problem Outlier detection in image segmentation.
method Parameter-efficient hierarchical convolutional Gaussian Processes in Wasserstein-2 space.
result Uncertainty estimates improve out-of-distribution detection.

A novel time series clustering method that considers segment typologies.

problem Lack of consideration for the similarity of different subsequences in time series clustering.
method Two-stage clustering: polynomial segmentation followed by hierarchical clustering of segments, then final clustering of time series.
result The method outperforms state-of-the-art techniques on UCR Time Series Classification Archive datasets.

Robots learn movement libraries by segmenting complex trajectories.

problem Segmenting complex robot movement demonstrations for library building.
method Model trajectories as Switching Linear Dynamical Systems and infer segmentation using a nonparametric Bayesian approach.
result Robots can learn movement libraries more effectively by segmenting demonstrations.

Improved space management in iterative clustering reduces subset growth without sacrificing performance.

problem Iterative re-clustering of speech segments can lead to unchecked subset growth, compromising performance.
method Integration of a space management strategy into the iterative process of hierarchical clustering.
result No loss in performance in terms of F-measure while guaranteeing space complexity.

INVERT connects neural representations to human-understandable concepts.

problem Lack of understanding and statistical significance in existing explainability methods.
method Inverse Recognition (INVERT) approach that connects learned representations to human-understandable concepts.
result INVERT provides interpretable metrics and statistical significance for representation alignment.

Two methods improve 10-K item segmentation using large language models.

problem Challenges in extracting specific items from 10-K reports due to variations in document formats and item presentation.
method Two advanced item segmentation methods: GPT4ItemSeg and BERT4ItemSeg.
result BERT4ItemSeg achieves a macro-F1 of 0.9825, surpassing other methods.

Proposes MorphMine for unsupervised morpheme segmentation to improve word embeddings.

problem Lack of semantic information in word-level analysis for infrequent and out-of-vocabulary words.
method MorphMine applies a parsimony criterion to hierarchically segment words into the fewest number of morphemes.
result MorphMine segments words into human-verified morphemes and improves word embedding quality.

PFE embeds images into sparse regions for better segmentation.

problem Image segmentation challenges with slowly varying signals and sparse region boundaries.
method Piecewise Flat Embedding (PFE) using sparse signal recovery theory, L1,p regularization, and Bregman iterations.
result PFE enhances image segmentation performance on multiple datasets.

Algorithm segments glandular structures in colon histology images for cancer grading.

problem Manual gland segmentation is time-consuming and risky for patients.
method Local intensity and texture features, Random Forest classifier, multilevel approach.
result Fast, accurate automatic gland segmentation for clinical use.

A novel approach predicts long-term stock price trends using 2D-convolutional encoders and semantic segmentation.

problem Predicting long-term daily stock price changes with deep learning models.
method Proposes a hierarchical CNN structure with Atrous Spatial Pyramid Pooling blocks to capture both long and short-term temporal relationships.
result Achieved overall accuracy and AUC of 78.18% and 0.88 for predicting trends over the next 20 days.

Paper presents a novel online HAR method using Hierarchical Hidden Markov Models.

problem Challenges in robust online activity recognition in smart environments.
method Two-phase approach: 1) Segmentation and activity reporting using Hierarchical Hidden Markov Models, 2) Correction of labels based on statistical features.
result Proposes a method that can detect and correct interrupted activities, outperforming state-of-the-art methods.

Bayesian Gaussian Processes layer detects out-of-distribution data in medical imaging.

problem Detecting out-of-distribution data in medical imaging tasks.
method Parameter-efficient hierarchical convolutional Gaussian Processes in Wasserstein-2 space.
result Uncertainty estimates enable superior out-of-distribution detection compared to previous methods.

LEAK learns from mistakes to improve point cloud segmentation.

problem Improving point cloud semantic segmentation performance.
method Coarse-to-fine clustering, class-conditional prototypical feature alignment, fairness weighting.
result State-of-the-art performances on different architectures, datasets, and tasks.

The paper explores methods to explain brain tumor segmentation models and extract visualizations.

problem Improving interpretability of deep learning models for brain tumor segmentation.
method Exploring techniques to explain brain tumor segmentation models and extract visualizations.
result Brain tumor segmentation networks learn human-understandable disentangled concepts and use a top-down approach.

Self-supervised learning improves few-shot classification and segmentation on point clouds.

problem Efficiently learn from limited labeled data in point cloud applications.
method Hierarchical cover-tree partitioning for self-supervised pre-training; restricted to support set for few-shot learning.
result Self-supervised learning significantly improves downstream classification and segmentation accuracy.

This paper improves ASR robustness by learning domain invariant features.

problem Robustness issues in ASR due to mismatched training and testing distributions.
method Factorized Hierarchical Variational Autoencoder (FHVAE) for unsupervised learning of domain invariant features.
result 41% and 27% absolute word error rate reductions on mismatched domains.

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.

U-Nets use belief propagation for efficient image denoising and classification.

problem Efficiently denoise and classify images using generative hierarchical models.
method Interpreted U-Nets as implementing belief propagation in tree-structured models.
result U-Nets can efficiently approximate denoising functions with sample complexity bounds.

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.

Framework for ensuring fairness in machine learning models across multiple groups.

problem Ensuring fairness in machine learning models across multiple groups.
method Introduces (s,G,α)(\mathbf{s},\mathcal{G}, α)-GMC for multi-dimensional mappings and constraint sets, proposing algorithms to achieve multicalibration.
result Demonstrates the effectiveness of the framework on various scenarios, including image segmentation, hierarchical classification, and text generation.

Probabilistic embeddings improve speaker diarization accuracy.

problem Improving speaker diarization accuracy using embeddings.
method Extracting x-vectors and precision matrices from speech segments, interfacing with PLDA model, applying agglomerative clustering, joint training of PLDA and extractor.
result Joint training of PLDA and probabilistic x-vector extractor yields accuracy gains.

We consider the problem of speaker diarization, the problem of segmenting an audio recording of a meeting into temporal segments corresponding to individual speakers. The problem is rendered particularly difficult by the fact that we are not allowed to assume knowledge of the number of people participating in the meeti…

2009-05-15abs ↗pdf ↗

A system is presented that segments, clusters and predicts musical audio in an unsupervised manner, adjusting the number of (timbre) clusters instantaneously to the audio input. A sequence learning algorithm adapts its structure to a dynamically changing clustering tree. The flow of the system is as follows: 1) segment…

2015-02-02abs ↗pdf ↗

In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different distances used in the literature to compare trajectories. Then based on the limitation…

2015-08-20abs ↗pdf ↗

HiGraphDTI learns drug and target representations from molecular graphs to predict DTIs.

problem Inaccurate drug-target interaction prediction due to insufficient chemical information extraction.
method Hierarchical graph representation learning to extract chemical information from atoms, motifs, and molecules.
result HiGraphDTI outperforms state-of-the-art methods in DTI prediction and interaction interpretation.

Hierarchical Foresight improves robot vision tasks by planning long-term goals.

problem Compounding uncertainty and scalability issues in long horizon video prediction.
method Subgoal generation and planning using hierarchical visual foresight (HVF).
result Achieves nearly 200% performance improvement in vision-based manipulation tasks.

We propose a Bayesian nonparametric mixture model for prediction- and information extraction tasks with an efficient inference scheme. It models categorical-valued time series that exhibit dynamics from multiple underlying patterns (e.g. user behavior traces). We simplify the idea of capturing these patterns by hierarc…

2017-06-19abs ↗pdf ↗

Hierarchical clustering models capture electricity load patterns from smart meters.

problem Improving efficiency and sustainability of electricity systems.
method Quantile autocovariances and autocorrelations for summarizing time series.
result Clusters identify relevant consumption behaviors and capture geo-demographic segmentation.