相关论文: A Derandomized Sparse Johnson-Lindenstrauss Transf…

This study addresses the blind deconvolution problem with modulated inputs, focusing on a measurement model where an unknown blurring kernel $\boldsymbol{h}$ is convolved with multiple random modulations…

We show it is possible to obtain quantum pseudorandomness and pseudoentanglement from random subset states -- i.e. quantum states which are equal superpositions over (pseudo)random subsets of strings. This answers an open question of…

In this study, we investigate the bias and variance properties of the debiased Lasso in linear regression when the tuning parameter of the node-wise Lasso is selected to be smaller than in previous studies. We consider the case where the…

We give a simple proof of L^p boundedness of iterated commutators of Riesz transforms and a product BMO function. We use a representation of the Riesz transforms by means of simple dyadic operators - dyadic shifts - which in turn reduces…

We assume the direct sum <A> o <B> for the signal subspace. As a result of post- measurement, a number of operational contexts presuppose the a priori knowledge of the LB -dimensional "interfering" subspace <B> and the goal is to estimate…

Scalable algorithms to solve optimization and regression tasks even approximately, are needed to work with large datasets. In this paper we study efficient techniques from matrix sketching to solve a variety of convex constrained regression…

Time-frequency analysis has been applied successfully in many fields. However, the traditional methods, like short time Fourier transform and Cohen distribution, suffer from the low resolution or the interference of the cross terms. To…

We consider the problem of super-resolving the line spectrum of a multisinusoidal signal from a finite number of samples, some of which may be completely corrupted. Measurements of this form can be modeled as an additive mixture of a…

We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if…

We consider a dependent percolation model on the square lattice $\mathbb{Z}^2$. The range of dependence is infinite in vertical and horizontal directions. In this context, we prove the existence of a phase transition. The proof exploits a…

We consider the numerical solution of time-harmonic acoustic scattering by obstacles with uncertain geometries for Dirichlet, Neumann, impedance and transmission boundary conditions. In particular, we aim to quantify diffracted fields…

The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This…

Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox and Zhao [Adv. Math. 256 (2014), 206--290]. These inheritance…

We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for decomposable functions, improving Janson's Hoeffding-type…

This paper refines the main results from our previous study on sparse bounds of generalized commutators of multilinear fractional singular integral operators in \cite{CenSong2412}. The key improvements are: 1. We replace pointwise…

We devise a one-shot approach to distributed sparse regression in the high-dimensional setting. The key idea is to average "debiased" or "desparsified" lasso estimators. We show the approach converges at the same rate as the lasso as long…

Let $A_n$ be an $n\times n$ matrix with iid entries distributed as Bernoulli random variables with parameter $p = p_n$. Rudelson and Tikhomirov, in a beautiful and celebrated paper, show that the distribution of eigenvalues of $A_n \cdot…

We consider the Klein-Gordon operator on an $n$-dimensional asymptotically anti-de Sitter spacetime $(M,g)$ together with arbitrary boundary conditions encoded by a self-adjoint pseudodifferential operator on $\partial M$ of order up to…

The security of code-based cryptography relies primarily on the hardness of decoding generic linear codes. Until very recently, all the best algorithms for solving the decoding problem were information set decoders (ISD). However, recently…

We study the fluctuations of random surfaces on a two-dimensional discrete torus. The random surfaces we consider are defined via a nearest-neighbor pair potential which we require to be twice continuously differentiable on a (possibly…