Interaction Screening and Pseudolikelihood Approaches for Tensor Learning in Ising Models

• URL: http://arxiv.org/abs/2310.13232v2
• Date: Wed, 31 Jul 2024 07:07:05 GMT
• Title: Interaction Screening and Pseudolikelihood Approaches for Tensor Learning in Ising Models
• Authors: Tianyu Liu, Somabha Mukherjee,
• Abstract summary: We study two well known methods of Ising structure learning, namely the pseudolikelihood approach and the interaction screening approach. We show that both approaches retrieve the underlying hypernetwork structure using a sample size logarithmic in the number of network nodes.
• Score: 7.298865011539767
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In this paper, we study two well known methods of Ising structure learning, namely the pseudolikelihood approach and the interaction screening approach, in the context of tensor recovery in $k$-spin Ising models. We show that both these approaches, with proper regularization, retrieve the underlying hypernetwork structure using a sample size logarithmic in the number of network nodes, and exponential in the maximum interaction strength and maximum node-degree. We also track down the exact dependence of the rate of tensor recovery on the interaction order $k$, that is allowed to grow with the number of samples and nodes, for both the approaches. We then provide a comparative discussion of the performance of the two approaches based on simulation studies, which also demonstrates the exponential dependence of the tensor recovery rate on the maximum coupling strength. Our tensor recovery methods are then applied on gene data taken from the Curated Microarray Database (CuMiDa), where we focus on understanding the important genes related to hepatocellular carcinoma.

Related papers

• Performance Gaps in Multi-view Clustering under the Nested Matrix-Tensor Model [7.4968526280735945]
  We study the estimation of a planted signal hidden in a recently introduced nested matrix-tensor model. We quantify here the performance gap between a tensor-based approach and a tractable alternative approach.
  arXiv  Detail & Related papers  (2024-02-16T13:31:43Z)
• Alteration Detection of Tensor Dependence Structure via Sparsity-Exploited Reranking Algorithm [3.7363073304294336]
  We formulate the problem under the popularly adopted tensor-normal distributions and aim at two-sample correlation/partial correlation comparisons. We propose a novel Sparsity-Exploited Reranking Algorithm (SERA) to further improve the multiple testing efficiency. The properties of the proposed test are derived and the algorithm is shown to control the false discovery at the pre-specified level.
  arXiv  Detail & Related papers  (2023-10-13T01:04:22Z)
• Decorrelating neurons using persistence [29.25969187808722]
  We present two regularisation terms computed from the weights of a minimum spanning tree of a clique. We demonstrate that naive minimisation of all correlations between neurons obtains lower accuracies than our regularisation terms. We include a proof of differentiability of our regularisers, thus developing the first effective topological persistence-based regularisation terms.
  arXiv  Detail & Related papers  (2023-08-09T11:09:14Z)
• Less is More: Mitigate Spurious Correlations for Open-Domain Dialogue Response Generation Models by Causal Discovery [52.95935278819512]
  We conduct the first study on spurious correlations for open-domain response generation models based on a corpus CGDIALOG curated in our work. Inspired by causal discovery algorithms, we propose a novel model-agnostic method for training and inference of response generation model.
  arXiv  Detail & Related papers  (2023-03-02T06:33:48Z)
• Orthogonalization of data via Gromov-Wasserstein type feedback for clustering and visualization [5.44192123671277]
  We propose an adaptive approach for clustering and visualization of data by an orthogonalization process. We prove that the method converges globally to a unique fixpoint for certain parameter values. We confirm that the method produces biologically meaningful clustering results consistent with human expert classification.
  arXiv  Detail & Related papers  (2022-07-25T15:52:11Z)
• Interpolation-based Correlation Reduction Network for Semi-Supervised Graph Learning [49.94816548023729]
  We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN) In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries. By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)
• Data-heterogeneity-aware Mixing for Decentralized Learning [63.83913592085953]
  We characterize the dependence of convergence on the relationship between the mixing weights of the graph and the data heterogeneity across nodes. We propose a metric that quantifies the ability of a graph to mix the current gradients. Motivated by our analysis, we propose an approach that periodically and efficiently optimize the metric.
  arXiv  Detail & Related papers  (2022-04-13T15:54:35Z)
• Riemannian classification of EEG signals with missing values [67.90148548467762]
  This paper proposes two strategies to handle missing data for the classification of electroencephalograms. The first approach estimates the covariance from imputed data with the $k$-nearest neighbors algorithm; the second relies on the observed data by leveraging the observed-data likelihood within an expectation-maximization algorithm. As results show, the proposed strategies perform better than the classification based on observed data and allow to keep a high accuracy even when the missing data ratio increases.
  arXiv  Detail & Related papers  (2021-10-19T14:24:50Z)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)
• Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approach [144.21892195917758]
  We study estimation in a class of generalized Structural equation models (SEMs) We formulate the linear operator equation as a min-max game, where both players are parameterized by neural networks (NNs), and learn the parameters of these neural networks using a gradient descent. For the first time we provide a tractable estimation procedure for SEMs based on NNs with provable convergence and without the need for sample splitting.
  arXiv  Detail & Related papers  (2020-07-02T17:55:47Z)

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.