PDE-Based Bounds on Optimal Exponents in Active Simple Hypothesis Testing

Sushant Vijayan; Himadri Mandal

Home/Archive/arXiv

arXiv · 2610.36657

PDE-Based Bounds on Optimal Exponents in Active Simple Hypothesis Testing

Sushant Vijayan·Himadri Mandal

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present general upper and lower bounds on the optimal error exponent for the Active Simple Hypothesis Testing (ASHT) problem. ASHT has been extensively studied across diverse fields including Information Theory, Bandits, and Operations Research, a precise characterization of this optimal exponent has remained elusive. This work combines a recent Partial Differential Equation (PDE) characterization of the optimal exponent by Vijayan (2025) with the comparison principle of viscosity solutions of Hamilton-Jacobi PDEs. This leads to bounds that are parametrized by convex functions, sets and lower Hamiltonian relaxations, a flexibility that generalizes many known results in the literature.

Explore related subjects

cs.IT cs.GT math.IT stat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Sushant Vijayan, Himadri Mandal. 2026-10-27. PDE-Based Bounds on Optimal Exponents in Active Simple Hypothesis Testing. https://arxiv.org/abs/2610.36657

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

KEEP EXPLORING

Related papers

arXiv2026

Black-Box Attack for IRS-Aided Communications with BER-Only Feedback

Intelligent reflecting surface (IRS) has emerged as a promising wireless technology for enhancing legitimate communications. In this paper, we investigate an IRS-assisted multiuser MISO downlink network in which an attacker reconfigures the IRS to degrade legitimate data transmission. Specifically, we consider a black-box attack setting in which the attacker has access to neither channel information nor symbol-level observations and can observe only the BER reported by each user. The objective of the attacker is to identify an IRS configuration that maximizes the minimum BER among all users under a limited budget of non-repeated tests. To address this BER-only black-box attack problem, we propose PRIS, an online search method that learns effective phase transitions from previous trials and progressively narrows the search from large-block modifications to single-element refinement. Specifically, an annealed user-balancing reward and prioritized replay are incorporated to exploit noisy BER feedback. Numerical results demonstrate that PRIS achieves a higher minimum BER than existing benchmarks.

cs.IT↗

arXiv2026

Pinching Antenna and Relay Assisted Joint Indoor Outdoor NOMA Communications with SWIPT

This paper presents a unified downlink architec- ture for serving indoor and outdoor users from a shared multi-antenna rooftop base station (BS). To overcome severe building-penetration loss, the BS transfers information and radio- frequency (RF) energy to an indoor access point (AP) using simultaneous wireless information and power transfer (SWIPT). The AP harvests this energy and performs amplify-and-forward (AF) relaying, enabling self-sustained indoor communication. A movable waveguide-mounted pinching antenna (PA) further improves indoor coverage by adapting its position to the prop- agation environment. For outdoor transmission, zero-forcing (ZF) beamforming suppresses inter-group interference, while power-domain non-orthogonal multiple access (NOMA) supports multiple users within each group. We maximize the outdoor weighted sum rate (WSR) while satisfying stringent indoor and outdoor quality-of-service (QoS) requirements. The resulting nonconvex problem jointly optimizes the BS power fraction, SWIPT power-splitting ratio, PA position, and NOMA power allocation. To obtain an efficient solution, we develop a two-stage method based on alternating optimization (AO) and sequential quadratic programming (SQP). Numerical results show that the proposed architecture improves outdoor spectral efficiency while maintaining reliable, energy-sustainable indoor coverage. Increasing the BS array size further raises the indoor QoS- satisfaction probability toward unity, even under demanding rate targets.

cs.IT↗

arXiv2026

Design of DoF-Robust MIMO via Generalized Pinching Antennas

Spatial degrees of freedom (DoF) are fundamental to the performance of multiple-input multiple-output (MIMO) systems. However, the use of conventional fixed-location antennas introduces disparities in the users' distances to a common base station, which makes the multi-user channel matrix more susceptible to rank deficiency and, consequently, a loss of spatial DoF. This paper shows that generalized pinching antennas can be used to design a new form of MIMO robust to the loss of spatial DoF. In particular, by deploying pinching antennas in close proximity to the users, the resulting multi-user channel Gram matrix can have a well-conditioned, almost diagonal structure, which reduces its sensitivity to the users' spatial deployment as well as the risk of rank deficiency. Two performance metrics, namely the rank-deficiency probability and the outage probability, are used to evaluate the performance of pinching-antenna-assisted MIMO transmission. The presented analytical and simulation results demonstrate the capability of pinching antennas to preserve spatial DoF and provide ubiquitous connectivity by effectively supporting users at spatially separated locations.

cs.IT↗