Bagging and boosting are proved to be the best methods of building multiple classifiers in classification combination problems. In the area of "flat clustering" problems, it is also recognized that multi-clustering methods based on boosting provide clusterings of an improved quality. In this paper, we introduce a novel…
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
48 results for “hierarchical combination”
HNE enhances manifold learning by combining neighbors hierarchically.
problem Data sparsity in manifold learning.
method Hierarchic Neighbors Embedding (HNE) combines neighbors hierarchically to improve local connections.
result HNE performs well on synthetic and real-world data, especially in sparse and weakly connected scenarios.
Curious hierarchical reinforcement learning improves learning performance.
problem Combining hierarchical abstraction and curiosity-driven exploration in reinforcement learning.
method Developed a method that combines hierarchical reinforcement learning with curiosity.
result Curiosity can more than double learning performance and success rates.
Deep learning models based on CNNs are predominantly used in image classification tasks. Such approaches, assuming independence of object categories, normally use a CNN as a feature learner and apply a flat classifier on top of it. Object classes in many settings have hierarchical relations, and classifiers exploiting …
A new hierarchical forecasting method using machine learning improves forecast accuracy.
problem Improving forecast accuracy in hierarchical forecasting systems.
method Non-linear combination of base forecasts, focusing on both accuracy and coherence.
result The proposed method outperforms existing approaches, especially for diverse series.
Combines geometry and topology for analyzing hierarchical datasets.
problem Analyzing complex, hierarchical datasets with irregular structures.
method Combines manifold learning and topological data analysis.
result Superior classification results compared to state-of-the-art methods.
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.
Tree-SNE combines t-SNE and hierarchical clustering for data visualization.
problem Data visualization and clustering in complex datasets.
method Stacked one-dimensional t-SNE embeddings and alpha-clustering.
result Effective hierarchical clustering and visualization of various datasets.
A novel framework combines LLMs and RL for financial portfolio optimization.
problem Optimizing financial portfolios using sentiment analysis and market indicators.
method Hierarchical RL structure with base, meta, and super-agents.
result Achieved a 26% annualized return and Sharpe ratio of 1.2.
Deep neural networks have achieved impressive success in large-scale visual object recognition tasks with a predefined set of classes. However, recognizing objects of novel classes unseen during training still remains challenging. The problem of detecting such novel classes has been addressed in the literature, but mos…
This paper characterizes hierarchical clustering methods that abide by two previously introduced axioms -- thus, denominated admissible methods -- and proposes tractable algorithms for their implementation. We leverage the fact that, for asymmetric networks, every admissible method must be contained between reciprocal …
New Bayesian method for joint sparse parameter inference.
problem Inference of jointly sparse parameter vectors from multiple measurements.
method Hierarchical Bayesian learning with joint sparsity-promoting priors.
result New algorithms consistently outperform existing methods in numerical experiments.
We introduce in this paper a new way of optimizing the natural extension of the quantization error using in k-means clustering to dissimilarity data. The proposed method is based on hierarchical clustering analysis combined with multi-level heuristic refinement. The method is computationally efficient and achieves bett…
New A* algorithm improves hierarchical clustering quality.
problem Improving hierarchical clustering quality in large search spaces.
method Combining A* search with a trellis data structure.
result Achieves higher quality results than baselines in particle physics and other benchmarks.
New image classifier uses hierarchical max-pooling with local pooling.
problem Improving image classification accuracy with variable spatial relationships.
method Introduces a hierarchical max-pooling model with additional local pooling for convolutional neural networks.
result Demonstrates improved performance in estimating image features.
Hierarchical NMF organizes COVID-19 literature into a searchable tree.
problem Organizing and searching for relevant COVID-19 research.
method Hierarchical nonnegative matrix factorization.
result Identified 8 major and 52 subtopics related to COVID-19.
New MIF architecture improves posterior approximations in Bayesian models.
problem Challenges in variational inference for complex hierarchical models.
method Combines VIP and autoregressive flow with prior information and hierarchical ordering.
result Empirically, MIF delivers tighter posterior approximations and state-of-the-art performance.
Bayesian algorithm improves word representations using semantic taxonomy.
problem Improving word representations in semantic taxonomy.
method Bayesian Hierarchical Words Representation (BHWR) learning algorithm combining Variational Bayes and semantic taxonomy modeling.
result BHWR produces better representations for rare words.
New hierarchical VQ-VAE scheme improves image compression quality and features at low bitrates.
problem Low bitrate image compression maintaining quality and features.
method Hierarchical VQ-VAE with stochastic quantization and Markovian latent variables.
result High perceptual quality and semantic features at low bitrates.
Modeling Hierarchical Spaces: A Review and Unified Framework for Surrogate-Based Architecture Designcs.LG
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.
We study how to effectively leverage expert feedback to learn sequential decision-making policies. We focus on problems with sparse rewards and long time horizons, which typically pose significant challenges in reinforcement learning. We propose an algorithmic framework, called hierarchical guidance, that leverages the…
A novel extrapolation method is proposed for longitudinal forecasting. A hierarchical Gaussian process model is used to combine nonlinear population change and individual memory of the past to make prediction. The prediction error is minimized through the hierarchical design. The method is further extended to joint mod…
The study improves prediction regions for hierarchical data using a projection step.
problem Improving prediction regions for hierarchical multivariate data.
method Integrating a projection step in the split conformal prediction (SCP) procedure to reduce prediction regions.
result The resulting prediction regions are globally smaller under both joint and component-wise coverage objectives.
The paper provides conditions for amalgamation of certain subgroups and preserves convexity properties.
problem Conditions for amalgamation of subgroups in hierarchically hyperbolic groups.
method Study of amalgamation conditions and preservation of convexity properties.
result Conditions under which amalgamation preserves hierarchical quasiconvexity and strong quasiconvexity.
Hierarchical models are versatile tools for joint modeling of data sets arising from different, but related, sources. Fully Bayesian inference may, however, become computationally prohibitive if the source-specific data models are complex, or if the number of sources is very large. To facilitate computation, we propose…
Extends MMF to nonsymmetric matrices for hierarchical structure.
problem Capturing hierarchical structure in nonsymmetric matrices.
method Multiresolution Matrix Factorization (MMF) extended to nonsymmetric matrices.
result Effective for matrix compression tasks, outperforming low-rank methods.
A novel framework for adaptive multi-agent communication in reinforcement learning.
problem Manual specification of communication structures in multi-agent reinforcement learning.
method Learning Structured Communication (LSC) framework using hierarchical graph neural networks.
result Adaptive hierarchical formations and efficient message propagation among agents.
Improved outlier detection in hierarchical Gaussian Processes using Wasserstein-2 kernels.
problem Outlier detection limitations in stacked Gaussian Processes.
method Proposed a hybrid kernel combining Euclidean and Wasserstein-2 distances, emphasizing variance in Wasserstein-2 computations.
result Improved performance and enhanced out-of-distribution detection on various datasets.
Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classification and link prediction. However, current GNN methods are inherently flat and do not learn hierarchica…
Method selects valid IVs from a large set using clustering and test of overidentifying restrictions.
problem Selecting valid instrumental variables from a large set of candidates.
method Agglomerative hierarchical clustering combined with a test of overidentifying restrictions.
result Achieves oracle properties when the largest group of IVs is valid.
HCL learns shared and modality-specific latent representations for multimodal data.
problem Binary shared-private decomposition inadequately represents shared information across subsets of modalities.
method Hierarchical Contrastive Learning framework combining latent-variable formulation, structural sparsity, and contrastive objective.
result HCL accurately recovers hierarchical structure and improves predictive performance on multimodal data.
Hierarchically hyperbolic spaces provide a common framework for studying mapping class groups of finite type surfaces, Teichmüller space, right-angled Artin groups, and many other cubical groups. Given such a space , we build a bordificationcompatible with the hierarchically hyperbolic structure. If $\mathc…
HGP-SL pools and learns graph structure for hierarchical representation learning.
problem Graph pooling is overlooked in GNN models, limiting hierarchical representation learning.
method Integrates graph pooling and structure learning into a unified module.
result HGP-SL improves graph classification performance on benchmarks.
FOSC-X: An extended framework for extracting multiple optimal flat clusterings from hierarchical cluster trees
problem Extracting multiple optimal flat clusterings from hierarchical cluster trees
method Dynamic programming with lower and upper feasibility bounds
result Guaranteed optimal rankings of top-M solutions with linear-time complexity
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.
T-Stochastic Graphsstat.AP
New model addresses instability in hierarchical clustering of social networks.
problem Instability in existing hierarchical clustering algorithms for social networks.
method Introduce -Stochastic Graphs, a probabilistic model that relaxes ultrametric assumptions.
result Prove spectral approach combining Neighbor-Joining is statistically consistent.
Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.
problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.
This paper presents a way of solving Markov Decision Processes that combines state abstraction and temporal abstraction. Specifically, we combine state aggregation with the options framework and demonstrate that they work well together and indeed it is only after one combines the two that the full benefit of each is re…
Generative model learns hierarchical structure for better sample diversity.
problem Generating high-quality samples from arbitrary distributions.
method Hierarchical mixtures of generators inspired by hierarchical mixture of experts.
result Hierarchical model generates high-quality and diverse samples.
New algorithm trains neural nets on simple skills to learn complex tasks faster.
problem Learning complex tasks through simple imitation.
method Train neural networks on simple, easy-to-learn skills to accelerate learning of complex, hard-to-learn tasks.
result Consistently outperforms state-of-the-art baseline in training speed and performance.
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.
In this work, we provide theoretical guarantees for reward decomposition in deterministic MDPs. Reward decomposition is a special case of Hierarchical Reinforcement Learning, that allows one to learn many policies in parallel and combine them into a composite solution. Our approach builds on mapping this problem into a…
Set-valued prediction in hierarchical classification with constrained representation complexitycs.LG
Paper relaxes set-valued prediction in hierarchical classification by considering representation complexity.
problem Uncertainty in class labels in hierarchical multi-class classification problems.
method Introduces representation complexity for predicted sets, proposes three methods for inference.
result Recursive tree search method is computationally more efficient.
The study of hierarchy in networks of the human brain has been of significant interest among the researchers as numerous studies have pointed out towards a functional hierarchical organization of the human brain. This paper provides a novel method for the extraction of hierarchical connectivity components in the human …
A hierarchical approach improves classification accuracy in large datasets.
problem Improving classification accuracy in large datasets with high dimensionality.
method Hierarchical subspace learning to scale manifold learning methods.
result Average 5% increase in classification accuracy.
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.
This paper focuses on the problem of hierarchical non-overlapping clustering of a dataset. In such a clustering, each data item is associated with exactly one leaf node and each internal node is associated with all the data items stored in the sub-tree beneath it, so that each level of the hierarchy corresponds to a pa…
Method preserves order in hierarchical clustering of ordered data.
problem Order preserving hierarchical clustering of directed acyclic graphs.
method Combination of classical hierarchical clustering and ultrametric fitting.
result Optimal clustering preserves both cluster quality and order.