Consensus dimension reduction via multi-view learning

• URL: http://arxiv.org/abs/2512.15802v1
• Date: Tue, 16 Dec 2025 22:32:58 GMT
• Title: Consensus dimension reduction via multi-view learning
• Abstract summary: We advocate for a consensus approach, which summarizes multiple visualizations into a single consensus dimension reduction visualization.<n>Here, we leverage ideas from multi-view learning in order to identify the patterns that are most stable or shared across the many different dimension reduction visualizations.<n>We demonstrate that this consensus visualization effectively identifies and preserves the shared low-dimensional data structure through both simulated and real-world case studies.
• Score: 0.6015898117103067
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A plethora of dimension reduction methods have been developed to visualize high-dimensional data in low dimensions. However, different dimension reduction methods often output different and possibly conflicting visualizations of the same data. This problem is further exacerbated by the choice of hyperparameters, which may substantially impact the resulting visualization. To obtain a more robust and trustworthy dimension reduction output, we advocate for a consensus approach, which summarizes multiple visualizations into a single consensus dimension reduction visualization. Here, we leverage ideas from multi-view learning in order to identify the patterns that are most stable or shared across the many different dimension reduction visualizations, or views, and subsequently visualize this shared structure in a single low-dimensional plot. We demonstrate that this consensus visualization effectively identifies and preserves the shared low-dimensional data structure through both simulated and real-world case studies. We further highlight our method's robustness to the choice of dimension reduction method and hyperparameters -- a highly-desirable property when working towards trustworthy and reproducible data science.

Related papers

• Diversity-aware View Partitioning for Scalable VGGT [48.654660686945526]
  VGGT achieve strong performance by jointly reasoning over multiple views with global attention.<n>We propose a training-free and plug-and-play inference framework that organizes views into diversity-aware balanced chunks.<n>Our framework also complements existing VGGT variants, enabling scalable multi-view reconstruction without sacrificing geometric fidelity.
  arXiv  Detail & Related papers  (2026-07-02T08:37:56Z)
• AdaMuS: Adaptive Multi-view Sparsity Learning for Dimensionally Unbalanced Data [25.19474314673427]
  In emotion recognition tasks, video frames often reach dimensions of $106$, while physiological signals comprise only $101$ dimensions.<n>Existing methods often bias towards high-dimensional data, overlooking the low-dimensional views.<n>We propose a sparse fusion paradigm that flexibly suppresses redundant dimensions and effectively aligns each view.
  arXiv  Detail & Related papers  (2026-03-18T11:22:47Z)
• VIEW2SPACE: Studying Multi-View Visual Reasoning from Sparse Observations [47.94531550391802]
  Multi-view visual reasoning is essential for intelligent systems that must understand complex environments from sparse and discrete viewpoints.<n>In real-world scenarios, reasoning across views requires integrating partial observations without explicit guidance.<n>We leverage physically grounded simulation to construct diverse, high-fidelity 3D scenes with precise per-view metadata.
  arXiv  Detail & Related papers  (2026-03-17T13:36:30Z)
• Mutual information and task-relevant latent dimensionality [0.0]
  Estimating the dimensionality of the latent representation needed for prediction is a difficult, largely unsolved problem.<n>We show that standard neural estimators with separable/bilinear critics systematically inflate the inferred dimension.<n>We extend the approach to intrinsic dimensionality by constructing paired views of a single dataset.
  arXiv  Detail & Related papers  (2026-02-08T19:58:49Z)
• Interpretable dimension reduction for compositional data [14.60927508571862]
  High-dimensional compositional data pose unique statistical challenges due to the simplex constraint and excess zeros.<n>We introduce a novel framework for interpretable dimension reduction of compositional data that avoids extra transformations and zero imputations.<n>Our approach generalizes the concept of amalgamation by softening its operation, mapping high-dimensional directly to a lower-dimensional simplex, which can be visualized in ternary plots.
  arXiv  Detail & Related papers  (2025-09-06T02:16:21Z)
• Synthesizing Consistent Novel Views via 3D Epipolar Attention without Re-Training [102.82553402539139]
  Large diffusion models demonstrate remarkable zero-shot capabilities in novel view synthesis from a single image.<n>These models often face challenges in maintaining consistency across novel and reference views.<n>We propose to use epipolar geometry to locate and retrieve overlapping information from the input view.<n>This information is then incorporated into the generation of target views, eliminating the need for training or fine-tuning.
  arXiv  Detail & Related papers  (2025-02-25T14:04:22Z)
• Simultaneous Dimensionality Reduction for Extracting Useful Representations of Large Empirical Multimodal Datasets [0.0]
  We focus on the sciences of dimensionality reduction as a means to obtain low-dimensional descriptions from high-dimensional data. We address the challenges posed by real-world data that defy conventional assumptions, such as complex interactions within systems or high-dimensional dynamical systems.
  arXiv  Detail & Related papers  (2024-10-23T21:27:40Z)
• Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein [56.62376364594194]
  Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets.<n>In this work, we revisit these approaches under the lens of optimal transport and exhibit relationships with the Gromov-Wasserstein problem.<n>This unveils a new general framework, called distributional reduction, that recovers DR and clustering as special cases and allows addressing them jointly within a single optimization problem.
  arXiv  Detail & Related papers  (2024-02-03T19:00:19Z)
• 360 Layout Estimation via Orthogonal Planes Disentanglement and Multi-view Geometric Consistency Perception [56.84921040837699]
  Existing panoramic layout estimation solutions tend to recover room boundaries from a vertically compressed sequence, yielding imprecise results. We propose an orthogonal plane disentanglement network (termed DOPNet) to distinguish ambiguous semantics. We also present an unsupervised adaptation technique tailored for horizon-depth and ratio representations. Our solution outperforms other SoTA models on both monocular layout estimation and multi-view layout estimation tasks.
  arXiv  Detail & Related papers  (2023-12-26T12:16:03Z)
• Diffusion-based Visual Counterfactual Explanations -- Towards Systematic Quantitative Evaluation [64.0476282000118]
  Latest methods for visual counterfactual explanations (VCE) harness the power of deep generative models to synthesize new examples of high-dimensional images of impressive quality. It is currently difficult to compare the performance of these VCE methods as the evaluation procedures largely vary and often boil down to visual inspection of individual examples and small scale user studies. We propose a framework for systematic, quantitative evaluation of the VCE methods and a minimal set of metrics to be used.
  arXiv  Detail & Related papers  (2023-08-11T12:22:37Z)
• GM-NeRF: Learning Generalizable Model-based Neural Radiance Fields from Multi-view Images [79.39247661907397]
  We introduce an effective framework Generalizable Model-based Neural Radiance Fields to synthesize free-viewpoint images. Specifically, we propose a geometry-guided attention mechanism to register the appearance code from multi-view 2D images to a geometry proxy.
  arXiv  Detail & Related papers  (2023-03-24T03:32:02Z)
• Subspace-Contrastive Multi-View Clustering [0.0]
  We propose a novel Subspace-Contrastive Multi-View Clustering (SCMC) approach. We employ view-specific auto-encoders to map the original multi-view data into compact features perceiving its nonlinear structures. To demonstrate the effectiveness of the proposed model, we conduct a large number of comparative experiments on eight challenge datasets.
  arXiv  Detail & Related papers  (2022-10-13T07:19:37Z)
• Incorporating Texture Information into Dimensionality Reduction for High-Dimensional Images [65.74185962364211]
  We present a method for incorporating neighborhood information into distance-based dimensionality reduction methods. Based on a classification of different methods for comparing image patches, we explore a number of different approaches.
  arXiv  Detail & Related papers  (2022-02-18T13:17:43Z)
• NCVis: Noise Contrastive Approach for Scalable Visualization [79.44177623781043]
  NCVis is a high-performance dimensionality reduction method built on a sound statistical basis of noise contrastive estimation. We show that NCVis outperforms state-of-the-art techniques in terms of speed while preserving the representation quality of other methods.
  arXiv  Detail & Related papers  (2020-01-30T15:43:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.