English
Related papers

Related papers: Off-the-grid prediction and testing for linear com…

200 papers

Blind deconvolution over graphs involves using (observed) output graph signals to obtain both the inputs (sources) as well as the filter that drives (models) the graph diffusion process. This is an ill-posed problem that requires additional…

Signal Processing · Electrical Eng. & Systems 2023-09-19 Victor M. Tenorio , Samuel Rey , Antonio G. Marques

Detection of a signal under noise is a classical signal processing problem. When monitoring spatial phenomena under a fixed budget, i.e., either physical, economical or computational constraints, the selection of a subset of available…

Signal Processing · Electrical Eng. & Systems 2018-08-01 Mario Coutino , Sundeep Prabhakar Chepuri , Geert Leus

In this paper, we study the issue of estimating a structured signal $x_0 \in \mathbb{R}^n$ from non-linear and noisy Gaussian observations. Supposing that $x_0$ is contained in a certain convex subset $K \subset \mathbb{R}^n$, we prove that…

Statistics Theory · Mathematics 2017-02-21 Martin Genzel

We consider the transmission of a memoryless bivariate Gaussian source over an average-power-constrained one-to-two Gaussian broadcast channel. The transmitter observes the source and describes it to the two receivers by means of an…

Information Theory · Computer Science 2009-03-20 Shraga Bross , Amos Lapidoth , Stephan Tinguely

In this paper, tight upper and lower bounds are derived on the weighted sum of minimum mean-squared errors for additive Gaussian noise channels. The bounds are obtained by constraining the input distribution to be close to a Gaussian…

Information Theory · Computer Science 2020-01-23 Michael Fauß , Abdelhak M. Zoubir , Alex Dytso , H. Vincent Poor , K. G. Nagananda

An additive noise channel is considered, in which the distribution of the noise is nonparametric and unknown. The problem of learning encoders and decoders based on noise samples is considered. For uncoded communication systems, the problem…

Information Theory · Computer Science 2021-11-17 Nir Weinberger

In compressive sensing, a small collection of linear projections of a sparse signal contains enough information to permit signal recovery. Distributed compressive sensing (DCS) extends this framework by defining ensemble sparsity models,…

Information Theory · Computer Science 2013-03-29 Marco F. Duarte , Michael B. Wakin , Dror Baron , Shriram Sarvotham , Richard G. Baraniuk

We consider a compound testing problem within the Gaussian sequence model in which the null and alternative are specified by a pair of closed, convex cones. Such cone testing problem arise in various applications, including detection of…

Statistics Theory · Mathematics 2018-03-28 Yuting Wei , Martin J. Wainwright , Adityanand Guntuboyina

Minimax decentralized detection is studied under two scenarios: with and without a fusion center when the source of uncertainty is the Bayesian prior. When there is no fusion center, the constraints in the network design are determined.…

Information Theory · Computer Science 2016-04-26 Gökhan Gül , Abdelhak M. Zoubir

In this paper we build provably near-optimal, in the minimax sense, estimates of linear forms and, more generally, "$N$-convex functionals" (the simplest example being the maximum of several fractional-linear functions) of unknown "signal"…

Statistics Theory · Mathematics 2019-04-01 Anatoli Juditsky , Arkadi Nemirovski

We study the problem of selecting limited features to observe such that models trained on them can perform well simultaneously across multiple subpopulations. This problem has applications in settings where collecting each feature is…

Machine Learning · Computer Science 2025-10-27 Maitreyi Swaroop , Tamar Krishnamurti , Bryan Wilder

We study least-squares trace regression when the parameter is the sum of a $r$-low-rank matrix and a $s$-sparse matrix and a fraction $\epsilon$ of the labels is corrupted. For subgaussian distributions and feature-dependent noise, we…

Statistics Theory · Mathematics 2024-01-08 Philip Thompson

Generative neural networks (GNNs) have gained renown for efficaciously capturing intrinsic low-dimensional structure in natural images. Here, we investigate the subgaussian demixing problem for two Lipschitz signals, with GNN demixing as a…

Information Theory · Computer Science 2020-10-15 Aaron Berk

A sensor network is considered where at each sensor a sequence of random variables is observed. At each time step, a processed version of the observations is transmitted from the sensors to a common node called the fusion center. At some…

Statistics Theory · Mathematics 2023-07-19 Taposh Banerjee , Venugopal V. Veeravalli

Unsupervised anomaly detection aims to identify anomalous samples from highly complex and unstructured data, which is pervasive in both fundamental research and industrial applications. However, most existing methods neglect the complex…

Machine Learning · Computer Science 2020-10-20 Haoyi Fan , Fengbin Zhang , Ruidong Wang , Liang Xi , Zuoyong Li

This paper investigates two issues on identification of switched linear systems: persistence of excitation and numerical algorithms. The main contribution is a much weaker condition on the regressor to be persistently exciting that…

Systems and Control · Electrical Eng. & Systems 2021-12-07 Biqiang Mu , Tianshi Chen , Changming Cheng , Er-Wei Bai

The problem of remotely stabilizing a noisy linear time invariant plant over a Gaussian relay network is addressed. The network is comprised of a sensor node, a group of relay nodes and a remote controller. The sensor and the relay nodes…

Optimization and Control · Mathematics 2013-07-30 Ali A. Zaidi , Tobias J. Oechtering , Serdar Yuksel , Mikael Skoglund

In this paper we derive lower bounds in minimax sense for estimation of the instantaneous volatility if the diffusion type part cannot be observed directly but under some additional Gaussian noise. Three different models are considered. Our…

Statistics Theory · Mathematics 2010-02-17 Axel Munk , Johannes Schmidt-Hieber

A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribution, and achieving accurate reconstruction on average, is…

Computer Vision and Pattern Recognition · Computer Science 2015-05-27 Guoshen Yu , Guillermo Sapiro

The detection of hidden two-dimensional Gauss-Markov random fields using sensor networks is considered. Under a conditional autoregressive model, the error exponent for the Neyman-Pearson detector satisfying a fixed level constraint is…

Information Theory · Computer Science 2016-11-15 Youngchul Sung , H. Vincent Poor , Heejung Yu