Diagonal Multi-omics Integration of Heterogenous Datasets

• URL: http://arxiv.org/abs/2608.16968v1
• Date: Mon, 17 Aug 2026 08:37:56 GMT
• Title: Diagonal Multi-omics Integration of Heterogenous Datasets
• Abstract summary: We consider methods for the diagonal multi-omics integration of heterogeneous datasets.<n>Specifically, the extremal trace problems for the Laplacian on sets homeomorphic to the Stiefel manifold embedded in the complex Euclidean space are investigated.<n>We introduce a novel characteristic dataset by employing the norm of the difference between the maximum and minimum points.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we consider methods for the diagonal multi-omics integration of heterogeneous datasets. Several approaches to the nature of biological heterogeneity are analyzed and developed to comprehend more clearly the generated differences. Specifically, the extremal trace problems for the coupled Laplacian on sets homeomorphic to the Stiefel manifold embedded in the complex Euclidean space are investigated. The gradient ascent method for the maximization problem is elaborated in the classical terms of functional analysis, which is of significant interest in itself. On this basis, we introduce a novel characteristic of dataset heterogeneity by employing the norm of the difference between the maximum and minimum points.

Related papers

• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• STABLE: Efficient Hybrid Nearest Neighbor Search via Magnitude-Uniformity and Cardinality-Robustness [59.119196450578364]
  Hybrid Approximate Nearest Neighbor Search (Hybrid ANNS) is a foundational search technology for large-scale heterogeneous data.<n>We propose the robuSt heTerogeneity-Aware hyBrid retrievaL framEwork, STABLE, to overcome the Compatibility Barrier for Similarity Magnitude Heterogeneity and the Tolerance Bottleneck to Attribute Cardinality.
  arXiv  Detail & Related papers  (2026-04-02T04:52:35Z)
• Multiscale Grassmann Manifolds for Single-Cell Data Analysis [3.073258665974412]
  We propose a multiscale framework that integrates machine learning with subspace geometry for single-cell data analysis.<n>A power-based scale sampling function is introduced to control the selection of scales and balance in- formation across resolutions.<n>Experiments on nine benchmark single-cell RNA-seq datasets demonstrate that the proposed approach effectively preserves meaningful structures.
  arXiv  Detail & Related papers  (2025-11-12T19:47:10Z)
• GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Experts [13.701637246257707]
  Real-world graphs have inherently complex and diverse topological patterns, known as topological heterogeneity.<n>Most existing works learn graph representation in a single constant curvature space that is insufficient to match the complex geometric shapes, resulting in low-quality embeddings with high distortion.
  arXiv  Detail & Related papers  (2024-12-15T06:52:40Z)
• Approximate Fiber Product: A Preliminary Algebraic-Geometric Perspective on Multimodal Embedding Alignment [1.3824176915623292]
  Multimodal tasks, such as image-text retrieval and generation, require embedding data from diverse modalities into a shared representation space.<n>This paper provides an initial attempt to integrate algebra into multimodal representation learning.
  arXiv  Detail & Related papers  (2024-11-30T06:45:13Z)
• Robust Multi-view Co-expression Network Inference [8.697303234009528]
  Inferring gene co-expression networks from transcriptome data presents many challenges. We introduce a robust method for high-dimensional graph inference from multiple independent studies.
  arXiv  Detail & Related papers  (2024-09-30T06:30:09Z)
• Topological complexity of spiked random polynomials and finite-rank spherical integrals [2.1756081703276]
  In particular, we establish variational formulas for the exponentials of the average number of total critical points and the determinants of local parameters of a finite-rank spiked Gaussian Wigner matrix. The analysis is based on recent advances on finite-rank spherical integrals by [Guionnet, Husson] to study the large deviations of multi-rank spiked Gaussian Wigner matrices. There is an exact threshold for the external parameters such that, once exceeded, the complexity function vanishes into new regions in which the critical points are close to the given vectors.
  arXiv  Detail & Related papers  (2023-12-19T16:52:01Z)
• Measuring dissimilarity with diffeomorphism invariance [94.02751799024684]
  We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces. We prove that DID enjoys properties which make it relevant for theoretical study and practical use.
  arXiv  Detail & Related papers  (2022-02-11T13:51:30Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Jointly Modeling and Clustering Tensors in High Dimensions [6.072664839782975]
  We consider the problem of jointly benchmarking and clustering of tensors. We propose an efficient high-maximization algorithm that converges geometrically to a neighborhood that is within statistical precision.
  arXiv  Detail & Related papers  (2021-04-15T21:06:16Z)
• Asymptotic Analysis of an Ensemble of Randomly Projected Linear Discriminants [94.46276668068327]
  In [1], an ensemble of randomly projected linear discriminants is used to classify datasets. We develop a consistent estimator of the misclassification probability as an alternative to the computationally-costly cross-validation estimator. We also demonstrate the use of our estimator for tuning the projection dimension on both real and synthetic data.
  arXiv  Detail & Related papers  (2020-04-17T12:47:04Z)
• Inverse Learning of Symmetries [71.62109774068064]
  We learn the symmetry transformation with a model consisting of two latent subspaces. Our approach is based on the deep information bottleneck in combination with a continuous mutual information regulariser. Our model outperforms state-of-the-art methods on artificial and molecular datasets.
  arXiv  Detail & Related papers  (2020-02-07T13:48:52Z)

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.