English
Related papers

Related papers: Randomization Approaches for Reducing PAPR with Pa…

200 papers

High peak-to-average power ratio (PAPR) has long posed a challenge for multi-carrier systems, impacting amplifier efficiency and overall system performance. This paper introduces dynamic angle fractional Fourier division multiplexing…

Information Theory · Computer Science 2024-11-14 Yewen Cao , Yulin Shao , Rose Qingyang Hu

Rerandomization enforces covariate balance across treatment groups in the design stage of experiments. Despite its intuitive appeal, its theoretical justification remains unsatisfying because its benefits of improving efficiency for…

Statistics Theory · Mathematics 2025-05-05 Xin Lu , Peng Ding

The topics dicussed in this paper take their origin inthe estimation of the Gram matrix of a random vector from a sample made of n independent copies. They comprise the estimation of the covariance matrix and the study of least squares…

Statistics Theory · Mathematics 2016-03-17 Olivier Catoni

We investigate energy efficient packet scheduling and power allocation problem for the services which require reliable communication to guarantee a certain quality of experience (QoE). We establish links between average transmit power and…

Information Theory · Computer Science 2018-07-27 M. Majid Butt , Eduard A. Jorswieck , Nicola Marchetti

We propose a new method for generating semidefinite relaxations of optimal power flow problems. The method is based on chordal conversion techniques: by dropping some equality constraints in the conversion, we obtain semidefinite…

Optimization and Control · Mathematics 2013-12-09 Martin S. Andersen , Anders Hansson , Lieven Vandenberghe

The method of Alternating Projections (AP) is a fundamental iterative technique with applications to problems in machine learning, optimization and signal processing. Examples include the Gauss-Seidel algorithm which is used to solve…

Numerical Analysis · Mathematics 2025-06-03 Alireza Entezari , Arunava Banerjee , Leila Kalantari

We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure.…

Machine Learning · Computer Science 2020-07-30 Charu Sharma , Deepak Nathani , Manohar Kaul

We propose a new method for simplification of Gaussian process (GP) models by projecting the information contained in the full encompassing model and selecting a reduced number of variables based on their predictive relevance. Our results…

Methodology · Statistics 2017-12-18 Juho Piironen , Aki Vehtari

Multiple matrix sampling is a survey methodology technique that randomly chooses a relatively small subset of items to be presented to survey respondents for the purpose of reducing respondent burden. The data produced are missing…

Methodology · Statistics 2017-10-03 Stanislav Kolenikov , Heather Hammer

A distributed average consensus algorithm in which every sensor transmits with bounded peak power is proposed. In the presence of communication noise, it is shown that the nodes reach consensus asymptotically to a finite random variable…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-06-15 Sivaraman Dasarathan , Cihan Tepedelenlioglu , Mahesh Banavar , Andreas Spanias

Although signal distortion-based peak-to-average power ratio (PAPR) reduction is a feasible candidate for orthogonal frequency division multiplexing (OFDM) to meet standard/regulatory requirements, the error vector magnitude (EVM) stemming…

Signal Processing · Electrical Eng. & Systems 2022-05-26 Shashi Kant , Mats Bengtsson , Gabor Fodor , Bo Göransson , Carlo Fischione

In many applications, one is faced with an inverse problem, where the known signal depends in a bilinear way on two unknown input vectors. Often at least one of the input vectors is assumed to be sparse, i.e., to have only few non-zero…

Information Theory · Computer Science 2018-04-25 Jakob Geppert , Felix Krahmer , Dominik Stöger

Sparse reduced rank regression is an essential statistical learning method. In the contemporary literature, estimation is typically formulated as a nonconvex optimization that often yields to a local optimum in numerical computation. Yet,…

Methodology · Statistics 2022-12-06 Canhong Wen , Ruipeng Dong , Xueqin Wang , Weiyu Li , Heping Zhang

As a typical dimensionality reduction technique, random projection can be simply implemented with linear projection, while maintaining the pairwise distances of high-dimensional data with high probability. Considering this technique is…

Machine Learning · Computer Science 2014-10-14 Weizhi Lu , Weiyu Li , Kidiyo Kpalma , Joseph Ronsin

Given a linear dynamical system, we consider the problem of constructing an approximate system using only a subset of the sensors out of the total set such that the observability Gramian of the new system is approximately equal to that of…

Systems and Control · Computer Science 2018-11-08 Shaunak D. Bopardikar

We consider the problem of constructing a reduced-rank regression model whose coefficient parameter is represented as a singular value decomposition with sparse singular vectors. The traditional estimation procedure for the coefficient…

Machine Learning · Statistics 2019-11-04 Kohei Yoshikawa , Shuichi Kawano

Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…

Numerical Analysis · Mathematics 2021-09-23 Congzhou M Sha , Nikolay V Dokholyan

In comparative studies, such as in causal inference and clinical trials, balancing important covariates is often one of the most important concerns for both efficient and credible comparison. However, chance imbalance still exists in many…

Methodology · Statistics 2018-07-30 Yichen Qin , Yang Li , Wei Ma , Feifang Hu

Phase retrieval refers to the problem of recovering a high-dimensional vector $\boldsymbol{x} \in \mathbb{C}^N$ from the magnitude of its linear transform $\boldsymbol{z} = A \boldsymbol{x}$, observed through a noisy channel. To improve the…

Computation · Statistics 2024-10-10 Hajime Ueda , Shun Katakami , Masato Okada

Vector approximate message passing (VAMP) is a computationally simple approach to the recovery of a signal $\mathbf{x}$ from noisy linear measurements $\mathbf{y}=\mathbf{Ax}+\mathbf{w}$. Like the AMP proposed by Donoho, Maleki, and…

Information Theory · Computer Science 2018-03-09 Alyson K. Fletcher , Philip Schniter