English
Related papers

Related papers: UNO: Unlimited Sampling Meets One-Bit Quantization

200 papers

This paper presents an efficient optimization technique for gridless {2-D} line spectrum estimation, named decoupled atomic norm minimization (D-ANM). The framework of atomic norm minimization (ANM) is considered, which has been…

Signal Processing · Electrical Eng. & Systems 2022-04-27 Zhe Zhang , Yue Wang , Zhi Tian

In non-linear estimations, it is common to assess sampling uncertainty by bootstrap inference. For complex models, this can be computationally intensive. This paper combines optimization with resampling: turning stochastic optimization into…

Econometrics · Economics 2022-05-09 Jean-Jacques Forneron

A {\em universal 1-bit compressive sensing (CS)} scheme consists of a measurement matrix $A$ such that all signals $x$ belonging to a particular class can be approximately recovered from $\textrm{sign}(Ax)$. 1-bit CS models extreme…

Information Theory · Computer Science 2022-05-19 Sidhant Bansal , Arnab Bhattacharyya , Anamay Chaturvedi , Jonathan Scarlett

We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and…

Information Theory · Computer Science 2015-03-19 David L. Donoho , Adel Javanmard , Andrea Montanari

This paper develops an asymptotically efficient recursive identification algorithm for autoregressive systems with exogenous inputs under one-bit communications. In particular, the proposed method asymptotically achieves the Cramer-Rao…

Optimization and Control · Mathematics 2026-03-13 Xingrui Liu , Jieming Ke , Mingjie Shao , Yanlong Zhao

Current LLM unlearning methods are not robust. A few steps of finetuning can revert their effects. We begin by showing that this is true even for an idealized form of unlearning: training to imitate a model that was never trained on…

This paper deals with the problem of reconstructing a band-limited signal when a finite subset of its samples and of its derivative are missing. The technique used, due to P.J.S.G. Ferreira, is based on the use of a particular frame for…

Functional Analysis · Mathematics 2010-09-13 Paola Brianzi , Vincenza Del Prete

This paper studies the matrix completion problem under arbitrary sampling schemes. We propose a new estimator incorporating both max-norm and nuclear-norm regularization, based on which we can conduct efficient low-rank matrix recovery…

Machine Learning · Statistics 2016-09-27 Ethan X. Fang , Han Liu , Kim-Chuan Toh , Wen-Xin Zhou

We consider the problem of recovering the superposition of $R$ distinct complex exponential functions from compressed non-uniform time-domain samples. Total Variation (TV) minimization or atomic norm minimization was proposed in the…

Information Theory · Computer Science 2017-11-07 Weiyu Xu , Jirong Yi , Soura Dasgupta , Jian-Feng Cai , Mathews Jacob , Myung Cho

Diffusion models (DMs) have demonstrated to be powerful priors for signal recovery, but their application to 1-bit quantization tasks, such as 1-bit compressed sensing and logistic regression, remains a challenge. This difficulty stems from…

Machine Learning · Computer Science 2026-01-13 Youming Chen , Zhaoqiang Liu

Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time…

Data Structures and Algorithms · Computer Science 2014-08-22 Michael B. Cohen , Yin Tat Lee , Cameron Musco , Christopher Musco , Richard Peng , Aaron Sidford

In this paper, we study the problem of robust phase recovery. We investigate a novel approach based on extremely quantized (one-bit) phase-less measurements and a corresponding recovery scheme. The proposed approach has surprising…

Information Theory · Computer Science 2013-12-10 Youssef Mroueh , Lorenzo Rosasco

Diffusion probabilistic models (DPMs) have demonstrated a very promising ability in high-resolution image synthesis. However, sampling from a pre-trained DPM is time-consuming due to the multiple evaluations of the denoising network, making…

Machine Learning · Computer Science 2023-10-18 Wenliang Zhao , Lujia Bai , Yongming Rao , Jie Zhou , Jiwen Lu

In this study, we generalize a problem of sampling a scalar Gauss Markov Process, namely, the Ornstein-Uhlenbeck (OU) process, where the samples are sent to a remote estimator and the estimator makes a causal estimate of the observed…

Information Theory · Computer Science 2022-02-14 Tasmeen Zaman Ornee , Yin Sun

Constrained optimization problems are ubiquitous in science and industry. Quantum algorithms have shown promise in solving optimization problems, yet none of the current algorithms can effectively handle arbitrary constraints. We introduce…

Moment-based distributionally robust optimization (DRO) provides an optimization framework to integrate statistical information with traditional optimization approaches. Under this framework, one assumes that the underlying joint…

Optimization and Control · Mathematics 2023-11-01 Shiyi Jiang , Jianqiang Cheng , Kai Pan , Zuo-Jun Max Shen

The mathematical theory of super-resolution developed recently by Cand\`{e}s and Fernandes-Granda states that a continuous, sparse frequency spectrum can be recovered with infinite precision via a (convex) atomic norm technique given a set…

Information Theory · Computer Science 2015-10-19 Zai Yang , Lihua Xie

Antenna selection (AS) is regarded as one of the most prospective technologies to reduce hardware cost but keep relatively high spectral efficiency in multi-antenna systems. By selecting a subset of antennas to transceive messages, AS…

Signal Processing · Electrical Eng. & Systems 2019-07-17 Chongjun Ouyang , Hongwen Yang

This paper discusses sample allocation problem (SAP) in frequency-domain Compressive Sampling (CS) of time-domain signals. An analysis that is relied on two fundamental CS principles; the Uniform Random Sampling (URS) and the Uncertainty…

Information Theory · Computer Science 2014-12-22 Andriyan B. Suksmono

The use of one-bit analog-to-digital converter (ADC) has been considered as a viable alternative to high resolution counterparts in realizing and commercializing massive multiple-input multiple-output (MIMO) systems. However, the issue of…

Information Theory · Computer Science 2024-03-04 Majdoddin Esfandiari , Sergiy A. Vorobyov , Robert W. Heath