Error probability bounds for binary relay trees with unreliable communication links. - Zhenliang Zhang 001; Ali Pezeshki; William Moran 001; Stephen D. Howard; Edwin K. P. Chong (ACSCC, 2011)

Error Probability Bounds for Binary Relay Trees with Crummy Sensors - Zhenliang Zhang 001; Ali Pezeshki; William Moran 001; Stephen D. Howard; Edwin K. P. Chong (CoRR, 2011)

Rate of learning in hierarchical social networks. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001; Stephen D. Howard (Allerton Conference, 2012)

Submodularity and optimality of fusion rules in balanced binary relay trees. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001; Stephen D. Howard (CDC, 2012)

Detection performance of M-ary relay trees with non-binary message alphabets. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001; Stephen D. Howard (SSP, 2012)

Sequential Hypothesis Testing with Broadcast Failures - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001 (CoRR, 2012)

Error Probability Bounds for Balanced Binary Relay Trees. - Zhenliang Zhang 001; Ali Pezeshki; William Moran 001; Stephen D. Howard; Edwin K. P. Chong (IEEE Trans. Inf. Theory, 2012)

Near optimality of greedy strategies for string submodular functions with forward and backward curvature constraints. - Zhenliang Zhang 001; Zengfu Wang; Edwin K. P. Chong; Ali Pezeshki; William Moran 001 (CDC, 2013)

Asymptotic learning in feedforward networks with binary symmetric channels. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001 (ICASSP, 2013)

Near Optimality of Greedy Strategies for String Submodular Functions with Forward and Backward Curvature Constraints - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001 (CoRR, 2013)

Hypothesis Testing in Feedforward Networks With Broadcast Failures. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001 (IEEE J. Sel. Top. Signal Process., 2013)

Learning in Hierarchical Social Networks. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001; Stephen D. Howard (IEEE J. Sel. Top. Signal Process., 2013)

Detection Performance in Balanced Binary Relay Trees With Node and Link Failures. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001; Stephen D. Howard (IEEE Trans. Signal Process., 2013)

Subspace selection for projection maximization with matroid constraints. - Zhenliang Zhang 001; Yuan Wang; Edwin K. P. Chong; Ali Pezeshki; Louis L. Scharf (CoRR, 2015)

Performance bounds for the k-batch greedy strategy in optimization problems with curvature. - Yajing Liu; Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki (ACC, 2016)

String Submodular Functions With Curvature Constraints. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001 (IEEE Trans. Autom. Control., 2016)

Near-Optimal Distributed Detection in Balanced Binary Relay Trees. - Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki; William Moran 001; Stephen D. Howard (IEEE Trans. Control. Netw. Syst., 2017)

Subspace Selection for Projection Maximization With Matroid Constraints. - Zhenliang Zhang 001; Yuan Wang; Edwin K. P. Chong; Ali Pezeshki (IEEE Trans. Signal Process., 2017)

Leveraging mm-Wave Communication for Security. - Mohammed Karmoose; Christina Fragouli; Suhas N. Diggavi; Rafael Misoczki; Lily L. Yang; Zhenliang Zhang 001 (CoRR, 2018)

Performance Bounds with Curvature for Batched Greedy Optimization. - Yajing Liu; Zhenliang Zhang 001; Edwin K. P. Chong; Ali Pezeshki (J. Optim. Theory Appl., 2018)

Using mm-Waves for Secret Key Establishment. - Mohammed Karmoose; Christina Fragouli; Suhas N. Diggavi; Rafael Misoczki; Lily L. Yang; Zhenliang Zhang 001 (IEEE Commun. Lett., 2019)

SCOBO: Sparsity-Aware Comparison Oracle Based Optimization. - HanQin Cai; Daniel McKenzie; Wotao Yin; Zhenliang Zhang 001 (CoRR, 2020)

Submodular optimization problems and greedy strategies: A survey. - Yajing Liu; Edwin K. P. Chong; Ali Pezeshki; Zhenliang Zhang 001 (Discret. Event Dyn. Syst., 2020)

Finding the Equilibrium for Continuous Constrained Markov Games Under the Average Criteria. - Xiaofeng Jiang; Shuangwu Chen; Jian Yang 014; Han Hu 003; Zhenliang Zhang 001 (IEEE Trans. Autom. Control., 2020)

A General Framework for Bounding Approximate Dynamic Programming Schemes. - Yajing Liu; Edwin K. P. Chong; Ali Pezeshki; Zhenliang Zhang 001 (IEEE Control. Syst. Lett., 2021)

Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. - HanQin Cai; Daniel McKenzie; Wotao Yin; Zhenliang Zhang 001 (SIAM J. Optim., 2022)