Boaz Nadler

Prof. Boaz Nadler

orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 May 2005 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Closed access
RCR. R. Coifman
R. R. Coifman
SLS. Lafon
S. Lafon
ALA. B. Lee
A. B. Lee
MMM. Maggioni
M. Maggioni
BNBoaz Nadler
Boaz Nadler
SZS. W. Zucker
S. W. Zucker
We provide a framework for structural multiscale geometric organization of graphs and subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \setlength{\oddsidemargin}{-69pt} \begin{document} \begin{equation*}{\mathbb{R}}^{n}\end{equation*}\end{document} . We use diffusion semigroups to generate multiscale geometries in order to organize and represent complex structures. We show that appropriately selected eigenfunctions or scaling functions of Markov matrices, which describe local transitions, lead to macroscopic descriptions at different scales. The process of iterating or diffusing the Markov matrix is seen as a generalization of some aspects of the Newtonian paradigm, in which local infinitesimal transitions of a system lead to global macroscopic descriptions by integration. We provide a unified view of ideas from data analysis, machine learning, and numerical analysis.

1 July 2006 in Applied and Computational Harmonic Analysis
Verified
Journal Article
Closed access
BNBoaz Nadler
Boaz Nadler
SLStéphane Lafon
Stéphane Lafon
RCRonald R. Coifman
Ronald R. Coifman
IKIoannis G. Kevrekidis
Ioannis G. Kevrekidis

1 December 2008 in The Annals of Statistics
Verified
Journal Article
Open access
PDF file
BNBoaz Nadler
Boaz Nadler
Principal component analysis (PCA) is a standard tool for dimensional reduction of a set of n observations (samples), each with p variables. In this paper, using a matrix perturbation approach, we study the nonasymptotic relation between the eigenvalues and eigenvectors of PCA computed on a finite sample of size n, and those of the limiting population PCA as n→∞. As in machine learning, we present a finite sample theorem which holds with high probability for the closeness between the leading eigenvalue and eigenvector of sample PCA and population PCA under a spiked covariance model. In addition, we also consider the relation between finite sample PCA and the asymptotic results in the joint limit p, n→∞, with p/n=c. We present a matrix perturbation view of the “phase transition phenomenon,” and a simple linear-algebra based derivation of the eigenvalue and eigenvector overlap in this asymptotic limit. Moreover, our analysis also applies for finite p, n where we show that although there is no sharp phase transition as in the infinite case, either as a function of noise level or as a function of sample size n, the eigenvector of sample PCA may exhibit a sharp “loss of tracking,” suddenly losing its relation to the (true) eigenvector of the population PCA matrix. This occurs due to a crossover between the eigenvalue due to the signal and the largest eigenvalue due to noise, whose eigenvector points in a random direction.

1 January 2008 in Multiscale Modeling & Simulation
Verified
Journal Article
Closed access
RCR. R. Coifman
R. R. Coifman
IKI. G. Kevrekidis
I. G. Kevrekidis
SLS. Lafon
S. Lafon
MMM. Maggioni
M. Maggioni
BNBoaz Nadler
Boaz Nadler
The concise representation of complex high dimensional stochastic systems via a few reduced coordinates is an important problem in computational physics, chemistry, and biology. In this paper we use the first few eigenfunctions of the backward Fokker–Planck diffusion operator as a coarse-grained low dimensional representation for the long-term evolution of a stochastic system and show that they are optimal under a certain mean squared error criterion. We denote the mapping from physical space to these eigenfunctions as the diffusion map. While in high dimensional systems these eigenfunctions are difficult to compute numerically by conventional methods such as finite differences or finite elements, we describe a simple computational data-driven method to approximate them from a large set of simulated data. Our method is based on defining an appropriately weighted graph on the set of simulated data and computing the first few eigenvectors and eigenvalues of the corresponding random walk matrix on this graph. Thus, our algorithm incorporates the local geometry and density at each point into a global picture that merges data from different simulation runs in a natural way. Furthermore, we describe lifting and restriction operators between the diffusion map space and the original space. These operators facilitate the description of the coarse-grained dynamics, possibly in the form of a low dimensional effective free energy surface parameterized by the diffusion map reduction coordinates. They also enable a systematic exploration of such effective free energy surfaces through the design of additional “intelligently biased” computational experiments. We conclude by demonstrating our method in a few examples.

12 May 2009 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SKShira Kritchman
Shira Kritchman
BNBoaz Nadler
Boaz Nadler
Detection of the number of signals embedded in noise is a fundamental problem in signal and array processing. This paper focuses on the non-parametric setting where no knowledge of the array manifold is assumed. First, we present a detailed statistical analysis of this problem, including an analysis of the signal strength required for detection with high probability, and the form of the optimal detection test under certain conditions where such a test exists. Second, combining this analysis with recent results from random matrix theory, we present a new algorithm for detection of the number of sources via a sequence of hypothesis tests. We theoretically analyze the consistency and detection performance of the proposed algorithm, showing its superiority compared to the standard minimum description length (MDL)-based estimator. A series of simulations confirm our theoretical analysis.

11 January 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
GLGeorge Linderman
George Linderman
JZJun Zhao
Jun Zhao
MRManolis Roulis
Manolis Roulis
PBPiotr Bielecki
Piotr Bielecki
RFRichard A. Flavell
Richard A. Flavell
YKYuval Kluger
Yuval Kluger
A key challenge in analyzing single cell RNA-sequencing data is the large number of false zeros, where genes actually expressed in a given cell are incorrectly measured as unexpressed. We present a method based on low-rank matrix approximation which imputes these values while preserving biologically non-expressed genes (true biological zeros) at zero expression levels. We provide theoretical justification for this denoising approach and demonstrate its advantages relative to other methods on simulated and biological datasets.