English
Related papers

Related papers: On recovering missing values for sequences in a pa…

200 papers

We consider finite frames with high redundancy so that if half the terms transmitted from the sender are randomly deleted during transmission, then on average, the receiver can still recover the signal to within a high level of accuracy.…

Functional Analysis · Mathematics 2013-12-10 Enrico Au-Yeung

This paper is concerned with the problem of recovering a structured signal from a relatively small number of corrupted random measurements. Sharp phase transitions have been numerically observed in practice when different convex programming…

Information Theory · Computer Science 2021-01-05 Zhongxing Sun , Wei Cui , Yulong Liu

Suppose that a sequence of numbers $x_n$ (a `signal') is transmitted through a noisy channel. The receiver observes a noisy version of the signal with additive random fluctuations, $x_n + \xi_n$, where $\xi_n$ is a sequence of independent…

Probability · Mathematics 2017-03-14 Nir Lev , Ron Peled , Yuval Peres

We consider the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a…

Information Theory · Computer Science 2013-07-12 Gongguo Tang , Badri Narayan Bhaskar , Parikshit Shah , Benjamin Recht

This article presents a general framework for recovering missing dynamical systems using available data and machine learning techniques. The proposed framework reformulates the prediction problem as a supervised learning problem to…

Numerical Analysis · Mathematics 2020-10-20 John Harlim , Shixiao W. Jiang , Senwei Liang , Haizhao Yang

We formulate a unified framework for the separation of signals that are sparse in "morphologically" different redundant dictionaries. This formulation incorporates the so-called "analysis" and "synthesis" approaches as special cases and…

Information Theory · Computer Science 2016-11-17 Céline Aubel , Christoph Studer , Graeme Pope , Helmut Bölcskei

This chapter develops a theoretical analysis of the convex programming method for recovering a structured signal from independent random linear measurements. This technique delivers bounds for the sampling complexity that are similar with…

Information Theory · Computer Science 2014-12-05 Joel A. Tropp

This paper investigates gradient recovery schemes for data defined on discretized manifolds. The proposed method, parametric polynomial preserving recovery (PPPR), does not require the tangent spaces of the exact manifolds, and they have…

Numerical Analysis · Mathematics 2019-03-13 Guozhi Dong , Hailong Guo

The well-known trace reconstruction problem is the problem of inferring an unknown source string $x \in \{0,1\}^n$ from independent "traces", i.e. copies of $x$ that have been corrupted by a $\delta$-deletion channel which independently…

Data Structures and Algorithms · Computer Science 2022-11-08 Xi Chen , Anindya De , Chin Ho Lee , Rocco A. Servedio , Sandip Sinha

We study the fixed design segmented regression problem: Given noisy samples from a piecewise linear function $f$, we want to recover $f$ up to a desired accuracy in mean-squared error. Previous rigorous approaches for this problem rely on…

Machine Learning · Computer Science 2016-07-15 Jayadev Acharya , Ilias Diakonikolas , Jerry Li , Ludwig Schmidt

We use importance sampling in a redefined way to highlight and investigate rare events in the form of trajectories trapped inside a target coherent set. We take a transfer operator approach to finding these sets on a reconstructed…

Chaotic Dynamics · Physics 2020-10-16 Meagan Carney , Holger Kantz

We address the problem of recovering a sparse signal from clipped or quantized measurements. We show how these two problems can be formulated as minimizing the distance to a convex feasibility set, which provides a convex and differentiable…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Lucas Rencker , Francis Bach , Wenwu Wang , Mark D. Plumbley

This paper introduces and analyzes a search and retrieval model that adopts key semantic communication principles from retrieval-augmented generation. We specifically present an information-theoretic analysis of a remote document retrieval…

Information Retrieval · Computer Science 2025-07-17 Sara Ghasvarianjahromi , Yauhen Yakimenka , Jörg Kliewer

The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…

Information Theory · Computer Science 2015-10-22 Masahito Hayashi , Vincent Y. F. Tan

In this paper, we revisit traditional checkpointing and rollback recovery strategies, with a focus on silent data corruption errors. Contrarily to fail-stop failures, such latent errors cannot be detected immediately, and a mechanism to…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-11-01 Guillaume Aupy , Anne Benoit , Thomas Hérault , Yves Robert , Frédéric Vivien , Dounia Zaidouni

Random non-linear Fourier features have recently shown remarkable performance in a wide-range of regression and classification applications. Motivated by this success, this article focuses on a sparse non-linear Fourier feature (NFF) model.…

Machine Learning · Statistics 2020-02-13 Ayca Ozcelikkale

Phase retrieval has been an attractive but difficult problem rising from physical science, and there has been a gap between state-of-the-art theoretical convergence analyses and the corresponding efficient retrieval methods. Firstly, these…

Information Theory · Computer Science 2017-12-06 Gen Li , Yuchen Jiao , Yuantao Gu

This paper considers the problem of recovering a $k$-sparse, $N$-dimensional complex signal from Fourier magnitude measurements. It proposes a Fourier optics setup such that signal recovery up to a global phase factor is possible with very…

Information Theory · Computer Science 2014-10-28 Çağkan Yapar , Volker Pohl , Holger Boche

In this letter, we consider a problem of reconstructing an unknown discrete signal taking values in a finite alphabet from incomplete linear measurements. The difficulty of this problem is that the computational complexity of the…

Information Theory · Computer Science 2015-03-19 Masaaki Nagahara

Consider a scenario in which an unknown signal is transformed by a known linear operator, and then the pointwise absolute value of the unknown output function is reported. This scenario appears in several applications, and the goal is to…

Information Theory · Computer Science 2014-03-10 Dustin G. Mixon
‹ Prev 1 3 4 5 6 7 10 Next ›