English
Related papers

Related papers: Optimal Trade-offs in Multi-Processor Approximate …

200 papers

A malleable coding scheme considers not only compression efficiency but also the ease of alteration, thus encouraging some form of recycling of an old compressed version in the formation of a new one. Malleability cost is the difficulty of…

Information Theory · Computer Science 2008-07-01 Lav R. Varshney , Julius Kusuma , Vivek K Goyal

This paper addresses joint transceiver and relay design for a wireless multiple-input-multiple-output (MIMO) switching scheme that enables data exchange among multiple users. Here, a multi-antenna relay linearly precodes the received…

Information Theory · Computer Science 2016-11-18 Fanggang Wang , Xiaojun Yuan , Soung Chang Liew , Dongning Guo

We study the scalability of consensus-based distributed optimization algorithms by considering two questions: How many processors should we use for a given problem, and how often should they communicate when communication is not free?…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-09-06 Konstantinos I. Tsianos , Sean Lawlor , Michael G. Rabbat

In this paper, we consider hybrid beamforming designs for multiuser massive multiple-input multiple-output (MIMO)-orthogonal frequency division multiplexing (OFDM) systems. Aiming at maximizing the weighted spectral efficiency, we propose…

Signal Processing · Electrical Eng. & Systems 2019-07-30 Jingbo Du , Wei Xu , Chunming Zhao , Luc Vandendorpe

When recovering an unknown signal from noisy measurements, the computational difficulty of performing optimal Bayesian MMSE (minimum mean squared error) inference often necessitates the use of maximum a posteriori (MAP) inference, a special…

Machine Learning · Statistics 2016-09-23 Madhu Advani , Surya Ganguli

We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high dimensions. In the distributed sparse Gaussian mean estimation problem, each of the $m$ machines receives $n$…

Machine Learning · Computer Science 2016-05-11 Mark Braverman , Ankit Garg , Tengyu Ma , Huy L. Nguyen , David P. Woodruff

In this paper, we investigate the trade-off between convergence rate and computational cost when minimizing a composite functional with proximal-gradient methods, which are popular optimisation tools in machine learning. We consider the…

Machine Learning · Computer Science 2012-10-23 Pierre Machart , Sandrine Anthoine , Luca Baldassarre

This paper studies a high-dimensional inference problem involving the matrix tensor product of random matrices. This problem generalizes a number of contemporary data science problems including the spiked matrix models used in sparse…

Information Theory · Computer Science 2020-12-18 Galen Reeves

Approximate-message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated…

Information Theory · Computer Science 2022-04-20 Cédric Gerbelot , Raphaël Berthier

We consider a communication problem in which an update of the source message needs to be conveyed to one or more distant receivers that are interested in maintaining specific linear functions of the source message. The setting is one in…

Information Theory · Computer Science 2018-08-07 N. Prakash , Muriel Medard

This paper introduces weighted-BMP, a variant of the Bandwidth Minimization Problem (BMP), with a significant application in optimizing quantum emulation. Weighted-BMP optimizes particles ordering to reduce the emulation costs, by designing…

In this paper, we extend the bilinear generalized approximate message passing (BiG-AMP) approach, originally proposed for high-dimensional generalized bilinear regression, to the multi-layer case for the handling of cascaded problem such as…

Information Theory · Computer Science 2021-09-08 Qiuyun Zou , Haochuan Zhang , Hongwen Yang

In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not "embarrassingly parallel," the finer we partition the work of the reducers so that more parallelism can…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-21 Foto N. Afrati , Anish Das Sarma , Semih Salihoglu , Jeffrey D. Ullman

Solving the error correcting code is an important goal with regard to communication theory.To reveal the error correcting code characteristics, several researchers have applied a statistical-mechanical approach to this problem. In our…

Disordered Systems and Neural Networks · Physics 2007-05-23 Masami Takata , Hayaru Shouno , Kazuki Joe , Masato Okada

We study coding schemes for error correction in interactive communications. Such interactive coding schemes simulate any $n$-round interactive protocol using $N$ rounds over an adversarial channel that corrupts up to $\rho N$ transmissions.…

Data Structures and Algorithms · Computer Science 2014-04-17 Mohsen Ghaffari , Bernhard Haeupler

In this paper, we propose a sparse signal estimation algorithm that is suitable for many wireless communication systems, especially for the future millimeter wave and underwater communication systems. This algorithm is not only…

Information Theory · Computer Science 2018-07-20 Chongwen Huang , Lei Liu , Chau Yuen

We study the performance of a Bayesian statistician who estimates a rank-one signal corrupted by non-symmetric rotationally invariant noise with a generic distribution of singular values. As the signal-to-noise ratio and the noise structure…

Information Theory · Computer Science 2023-02-09 Teng Fu , YuHao Liu , Jean Barbier , Marco Mondelli , ShanSuo Liang , TianQi Hou

The estimation of a random vector with independent components passed through a linear transform followed by a componentwise (possibly nonlinear) output map arises in a range of applications. Approximate message passing (AMP) methods, based…

Information Theory · Computer Science 2016-05-03 Sundeep Rangan , Philip Schniter , Erwin Riegler , Alyson Fletcher , Volkan Cevher

In this paper, robust transceiver design based on minimum-mean-square-error (MMSE) criterion for dual-hop amplify-and-forward MIMO relay systems is investigated. The channel estimation errors are modeled as Gaussian random variables, and…

Information Theory · Computer Science 2016-11-17 Chengwen Xing , Shaodan Ma , Yik-Chung Wu , Tung-Sang Ng

Existing Machine Translation (MT) research often suggests a single, fixed set of hyperparameters for word segmentation models, symmetric Byte Pair Encoding (BPE), which applies the same number of merge operations (NMO) to train tokenizers…

Computation and Language · Computer Science 2026-02-16 Saumitra Yadav , Manish Shrivastava