Nesting is not Contracting

• URL: http://arxiv.org/abs/2501.17222v1
• Date: Tue, 28 Jan 2025 19:00:00 GMT
• Title: Nesting is not Contracting
• Authors: Bartlomiej Czech, Sirui Shuai,
• Abstract summary: We discuss how proofs by contraction are constrained and informed by entanglement wedge nesting (EWN)<n>EWN is the property that enlarging a boundary region can only enlarge its entanglement wedge.<n>We study the recently discovered infinite families of holographic entropy inequalities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The default way of proving holographic entropy inequalities is the contraction method. It divides Ryu-Takayanagi (RT) surfaces on the `greater than' side of the inequality into segments, then glues the segments into candidate RT surfaces for terms on the `less than' side. Here we discuss how proofs by contraction are constrained and informed by entanglement wedge nesting (EWN) -- the property that enlarging a boundary region can only enlarge its entanglement wedge. We propose that: (i) all proofs by contraction necessarily involve candidate RT surfaces, which violate EWN; (ii) violations of EWN in contraction proofs of maximally tight inequalities occur commonly and -- where this can be quantified -- with maximal density near boundary conditions; (iii) the non-uniqueness of proofs by contraction reflects inequivalent ways of violating EWN. As evidence and illustration, we study the recently discovered infinite families of holographic entropy inequalities, which are associated with tessellations of the torus and the projective plane. We explain the logic, which underlies their proofs by contraction. We find that all salient aspects of the requisite contraction maps are dictated by EWN while all their variable aspects set the scheme for how to violate EWN. We comment on whether the tension between EWN and contraction maps might help in characterizing maximally tight holographic entropy inequalities.

Related papers

• On the completeness of contraction map proof method for holographic entropy inequalities [0.10923877073891444]
  The contraction map proof method is the commonly used method to prove holographic entropy inequalities.<n>In this note, we answer the question in affirmative for all linear holographic entropy inequalities with rational coefficients.<n>We show that, generically, the pre-image of a non-contraction map is not a hypercube, but a proper cubical subgraph.
  arXiv  Detail & Related papers  (2025-06-22T16:21:54Z)
• A Signed Graph Approach to Understanding and Mitigating Oversmoothing in GNNs [54.62268052283014]
  We present a unified theoretical perspective based on the framework of signed graphs.<n>We show that many existing strategies implicitly introduce negative edges that alter message-passing to resist oversmoothing.<n>We propose Structural Balanced Propagation (SBP), a plug-and-play method that assigns signed edges based on either labels or feature similarity.
  arXiv  Detail & Related papers  (2025-02-17T03:25:36Z)
• Disentangled Representation Learning with the Gromov-Monge Gap [65.73194652234848]
  Learning disentangled representations from unlabelled data is a fundamental challenge in machine learning. We introduce a novel approach to disentangled representation learning based on quadratic optimal transport. We demonstrate the effectiveness of our approach for quantifying disentanglement across four standard benchmarks.
  arXiv  Detail & Related papers  (2024-07-10T16:51:32Z)
• Two infinite families of facets of the holographic entropy cone [4.851309113635069]
  We verify that the recently proven infinite families of holographic entropy inequalities are maximally tight, i.e. they are symmetry facets of the holographic entropy cone. On star graphs, both families of inequalities quantify how concentrated / spread information is with respect to a dihedral acting on subsystems. In addition, toric inequalities viewed in the K-basis show an interesting interplay between four-party and six-party perfect tensors.
  arXiv  Detail & Related papers  (2024-01-23T19:00:01Z)
• Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive Learning [69.6810940330906]
  We propose a novel contrastive learning framework to learn high-quality graph embedding. Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information. We show that in the hyperbolic space one has to address the leaf- and height-level uniformity which are related to properties of trees.
  arXiv  Detail & Related papers  (2023-10-27T15:31:42Z)
• Holographic Entropy Inequalities and the Topology of Entanglement Wedge Nesting [0.5852077003870417]
  We prove two new infinite families of holographic entropy inequalities. A key tool is a graphical arrangement of terms of inequalities, which is based on entanglement wedge nesting (EWN)
  arXiv  Detail & Related papers  (2023-09-26T18:00:01Z)
• From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent [50.4531316289086]
  Gradient Descent (SGD) has been the method of choice for learning large-scale non-root models. An overarching paper is providing general conditions SGD converges, assuming that GF on the population loss converges. We provide a unified analysis for GD/SGD not only for classical settings like convex losses, but also for more complex problems including Retrieval Matrix sq-root.
  arXiv  Detail & Related papers  (2022-10-13T03:55:04Z)
• Contrastive Laplacian Eigenmaps [37.5297239772525]
  Graph contrastive learning attracts/disperses node representations for similar/dissimilar node pairs under some notion of similarity. We extend the celebrated Laplacian Eigenmaps with contrastive learning, and call them COntrastive Laplacian EigenmapS (COLES)
  arXiv  Detail & Related papers  (2022-01-14T14:59:05Z)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)
• H\"older Bounds for Sensitivity Analysis in Causal Reasoning [66.00472443147781]
  We derive a set of bounds on the confounding bias |E[Y|T=t]-E[Y|do(T=t)]| based on the degree of unmeasured confounding. These bounds are tight either when U is independent of T or when U is independent of Y given T.
  arXiv  Detail & Related papers  (2021-07-09T20:26:36Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• The holographic map as a conditional expectation [0.0]
  We study the holographic map in AdS/CFT, as modeled by a quantum error correcting code with exact complementary recovery. We show that the map is determined by local conditional expectations acting on the operator algebras of the boundary/physical Hilbert space.
  arXiv  Detail & Related papers  (2020-08-11T16:04:45Z)
• Superbalance of Holographic Entropy Inequalities [0.0]
  We prove that all non-redundant holographic entropy inequalities are superbalanced. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced.
  arXiv  Detail & Related papers  (2020-02-11T17:24:44Z)

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.