Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1206.6145

Two-way Networks: when Adaptation is Useless

Zhiyu Cheng·Natasha Devroye
View original source ↗Read source document ↗Export metadata ↓

Abstract

In two-way networks, nodes act as both sources and destinations of messages. This allows for "adaptation" at or "interaction" between the nodes - a node's channel inputs may be functions of its message(s) and previously received signals. How to best adapt is key to two-way communication, rendering it challenging. However, examples exist of point-to-point channels where adaptation is not beneficial from a capacity perspective. We ask whether analogous examples exist for multi-user two-way networks. We first consider deterministic two-way channel models: the binary modulo-2 addition channel and a generalization thereof, and the linear deterministic channel. For these deterministic models we obtain the capacity region for the two-way multiple access/broadcast channel, the two-way Z channel and the two-way interference channel (IC). In all cases we permit all nodes to adapt channel inputs to past outputs (except for portions of the linear deterministic two-way IC where we only permit 2 of the 4 nodes to fully adapt). However, we show that this adaptation is useless from a capacity region perspective and capacity is achieved by strategies where the channel inputs at each use do not adapt to previous inputs. Finally, we consider the Gaussian two-way IC, and show that partial adaptation is useless when the interference is very strong. In the strong and weak interference regimes, we show that the non-adaptive Han and Kobayashi scheme utilized in parallel in both directions achieves to within a constant gap for the symmetric rate of the fully (some regimes) or partially (remaining regimes) adaptive models. The central technical contribution is the derivation of new, computable outer bounds which allow for adaptation. Inner bounds follow from non-adaptive achievability schemes of the corresponding one-way channel models.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiyu Cheng, Natasha Devroye. 2013-08-06. Two-way Networks: when Adaptation is Useless. https://doi.org/10.1109/tit.2013.2295596

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Radiance-Field Guided Pretraining: Scaling Localization Models with Unlabeled Wireless Signals

Radio frequency (RF)-based indoor localization offers significant promise for applications such as indoor navigation, augmented reality, and pervasive computing. While deep learning has greatly enhanced localization accuracy and robustness, existing localization models still face major challenges in cross-scene generalization due to their reliance on scene-specific labeled data. To address this, we introduce Radiance-Field Reinforced Pretraining (RFRP). This novel self-supervised pretraining framework couples a large localization model (LM) with a neural radio-frequency radiance field (RF-NeRF) in an asymmetrical autoencoder architecture. In this design, the LM encodes received RF spectra into latent, position-relevant representations, while the RF-NeRF decodes them to reconstruct the original spectra. This alignment between input and output enables effective representation learning using large-scale, unlabeled RF data, which can be collected continuously with minimal effort. To this end, we collected RF samples at 7,327,321 positions across 100 diverse scenes using four common wireless technologies--RFID, BLE, WiFi, and IIoT. Data from 75 scenes were used for training, and the remaining 25 for evaluation. Experimental results show that the RFRP-pretrained LM reduces localization error by over 40% compared to non-pretrained models and by 21% compared to those pretrained using supervised learning.

cs.IT↗
arXiv2026

Uniform Recovery of Structured Signals from Nonlinear Observations: Improved Error Rates

Consider the recovery of structured signals from nonlinear observations. Under Gaussian matrix and a large class of unknown nonlinear link functions, Plan and Vershynin (2016) showed that generalized Lasso achieves accurate nonuniform recovery of a fixed signal. More recently, Genzel and Stollenwerk (2023) showed that generalized Lasso is indeed capable of accurately recovering all structured signals. However, in some canonical settings with discontinuous link functions, their uniform recovery error rate is essentially slower than the nonuniform one. Specifically, in the recovery of $n$-dimensional $k$-sparse vectors from $m$ measurements, generalized Lasso with a perfectly tuned $\ell_1$ constraint achieves nonuniform error rate $ O(\sqrt{k\log(en/k)/m})$, while the uniform error rate of Genzel and Stollenwerk is no faster than $O((k\log(en/k)/m)^{1/4})$. In this paper, we narrow this gap by establishing improved uniform recovery guarantees under piecewise Lipschitz link functions with well-separated jump discontinuities. We analyze a projected gradient descent (PGD) algorithm whose projection can be onto a convex set or a cone, and our results for the PGD with a convex set are also valid for the generalized Lasso. In sparse recovery, the improved uniform error rates match the nonuniform rate $O(\sqrt{k\log(en/k)/m})$ up to logarithmic factors. Under the sign link function, we further show that iterative hard thresholding (a specific instance of the PGD) achieves uniform recovery error rate $O(\sqrt{k\log(en/k)/m})$, matching the nonuniform rate up to a universal constant. Technically, the uniform guarantees for the PGD are obtained by showing that the gradient maps satisfy the restricted approximate invertibility condition uniformly over all signals. We demonstrate that this is a general approach to uniform recovery under nonlinear observations.

cs.IT↗
arXiv2026

Recursive overlap Bernoulli distributions and an entropy concavity conjecture

We introduce a family of recursively generated finite probability distributions obtained from left and right embeddings with overlaps. The construction interpolates between the classical binomial distribution and the non-overlapping Bernoulli product distribution. We derive explicit formulas for the expectation, variance, and the generating function of higher moments, and formulate a conjecture asserting that the Shannon entropy is concave. The conjecture is proved in the two extremal cases and supported by symbolic computations for numerous overlap sequences.

cs.IT↗