English
Related papers

Related papers: Recovery from Power Sums

200 papers

In this paper, we consider the generalized phase retrieval from affine measurements. This problem aims to recover signals ${\mathbf x} \in {\mathbb F}^d$ from the affine measurements $y_j=\norm{M_j^*\vx +{\mathbb b}_j}^2,\; j=1,\ldots,m,$…

Information Theory · Computer Science 2018-05-29 Meng Huang , Zhiqiang Xu

This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…

Computational Complexity · Computer Science 2023-04-27 Louis Gaillard , Gorav Jindal

We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…

Data Structures and Algorithms · Computer Science 2013-12-24 Boaz Barak , Jonathan Kelner , David Steurer

A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Bernhard Kaufmann

Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…

Data Structures and Algorithms · Computer Science 2017-05-16 Aubrey Alston

The recovery of signals with finite-valued components from few linear measurements is a problem with widespread applications and interesting mathematical characteristics. In the compressed sensing framework, tailored methods have been…

Optimization and Control · Mathematics 2019-07-24 Sophie M. Fosson , Mohammad Abuabiah

We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover…

Information Theory · Computer Science 2008-05-30 Emmanuel J. Candes , Benjamin Recht

We introduce and study four optimization problems that generalize the well-known subset sum problem. Given a node-weighted digraph, select a subset of vertices whose total weight does not exceed a given budget. Some additional constraints…

Computational Complexity · Computer Science 2016-09-06 Laurent Gourvès , Jérôme Monnot , Lydia Tlilane

In this paper, we consider the problem of sparse recovery from nonlinear measurements, which has applications in state estimation and bad data detection for power networks. An iterative mixed $\ell_1$ and $\ell_2$ convex program is used to…

Information Theory · Computer Science 2013-01-08 Weiyu Xu , Meng Wang , Jianfeng Cai , Ao Tang

In this paper, we investigate the problem of recovering source information from an incomplete set of network coded data. We first study the theoretical performance of such systems under maximum a posteriori (MAP) decoding and derive the…

Information Theory · Computer Science 2015-03-16 Eirina Bourtsoulatze , Nikolaos Thomos , Pascal Frossard

This paper develops a novel framework for phase retrieval, a problem which arises in X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Our approach combines multiple structured illuminations…

Information Theory · Computer Science 2011-09-21 Emmanuel J. Candes , Yonina Eldar , Thomas Strohmer , Vlad Voroninski

We give a new approach to the dictionary learning (also known as "sparse coding") problem of recovering an unknown $n\times m$ matrix $A$ (for $m \geq n$) from examples of the form \[ y = Ax + e, \] where $x$ is a random vector in $\mathbb…

Data Structures and Algorithms · Computer Science 2014-11-11 Boaz Barak , Jonathan A. Kelner , David Steurer

In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known…

Machine Learning · Statistics 2022-01-14 Georgina Hall , Laurent Massoulié

We study certain sequences involving sums of powers of positive integers and in connection with this, we give examples to show that power majorization does not imply majorization.

Classical Analysis and ODEs · Mathematics 2015-06-26 Peng Gao

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

Systems and Control · Electrical Eng. & Systems 2026-04-02 Neelay Junnarkar , Peter Seiler , Murat Arcak

This paper aims to recover a multi-subspace matrix from permuted data: given a matrix, in which the columns are drawn from a union of low-dimensional subspaces and some columns are corrupted by permutations on their entries, recover the…

Machine Learning · Computer Science 2024-12-18 Liangqi Xie , Jicong Fan

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

Combinatorics · Mathematics 2021-05-21 Kunle Adegoke

The problem of phase retrieval, i.e., the problem of recovering a function from the magnitudes of its Fourier transform, naturally arises in various fields of physics, such as astronomy, radar, speech recognition, quantum mechanics and,…

Functional Analysis · Mathematics 2020-02-17 Philipp Grohs , Sarah Koppensteiner , Martin Rathmair

Motivated by mass-spectrometry protein sequencing, we consider a simply-stated problem of reconstructing a string from the multiset of its substring compositions. We show that all strings of length 7, one less than a prime, or one less than…

Discrete Mathematics · Computer Science 2014-03-12 Jayadev Acharya , Hirakendu Das , Olgica Milenkovic , Alon Orlitsky , Shengjun Pan

We study two new classes of sums with inverse binomial coefficients and harmonic numbers. In addition we establish recursive solutions to the following power sums \begin{equation*} U_d(n) = \sum_{k=1}^n \frac{2^{2k}}{\binom{2k}{k}} \cdot…

Number Theory · Mathematics 2026-02-09 Micheal Bataille , Robert Frontczak