activity
20072026
most citedAnalysis of Fisher Information and the Cramér-Rao Bound for Nonlinear Parameter Estimation after Compressed Sensing

56 citations · 198 across the 34 of their papers we have counts for

collaborators

40 papers

cs.LG2026

Dynamics to decision: A mathematical theory of Lyapunov spectra and decision boundaries in deep classifiers

Shirin Panahi, Amirhossein Nazerian, Ali Pezeshki

A deep classifier is defined not only by the decision it produces, but also by the sequence of transformations through which that decision is formed. Treating this evolution as a d…

cs.LG2026

Manifold-Stable Flow Matching

Amirhossein Nazerian, Ali Pezeshki, Jianguo Zhao

Flow matching (FM) learns generative dynamics through velocity regression. Geometric FM variants commonly assume a prior supported on the data manifold, requiring geometric knowled…

cs.IT2026

Complementary Waveform Coordination for Doppler-Resilient MIMO Radar

Maksim Antonik, Wenbing Dang, Ali Pezeshki +2

Complementary waveform libraries yield impulse-like aggregate delay responses at zero Doppler, but pulse-dependent Doppler phases degrade their sidelobe cancellation. This paper de…

eess.SY2024

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems

Brandon Van Over, Bowen Li, Edwin K. P. Chong +1

We present a simple performance bound for the greedy scheme in string optimization problems that obtains strong results. Our approach vastly generalizes the group of previously est…

eess.SY2024

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures

Bowen Li, Brandon Van Over, Edwin K. P. Chong +1

We consider the celebrated bound introduced by Conforti and Cornuéjols (1984) for greedy schemes in submodular optimization. The bound assumes a submodular function defined on a co…

cs.DS2023

An Improved Greedy Curvature Bound in Finite-Horizon String Optimization with Application to a Sensor Coverage Problem

Brandon Van Over, Bowen Li, Edwin K. P. Chong +1

We study the optimization problem of choosing strings of finite length to maximize string submodular functions on string matroids, which is a broader class of problems than maximiz…