Zhenliang Zhang

Orcid: 0000-0003-4450-9987

Affiliations:
  • Alibaba.com, Bellevue, WA, USA
  • Colorado State University, Department of Electrical and Computer Engineering, Fort Collins, CO, USA (PhD)
  • Qualcomm Flarion Technology, Bridgewater, NJ, USA


According to our database1, Zhenliang Zhang authored at least 26 papers between 2011 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling.
SIAM J. Optim., 2022

2021
A General Framework for Bounding Approximate Dynamic Programming Schemes.
IEEE Control. Syst. Lett., 2021

2020
Finding the Equilibrium for Continuous Constrained Markov Games Under the Average Criteria.
IEEE Trans. Autom. Control., 2020

Submodular optimization problems and greedy strategies: A survey.
Discret. Event Dyn. Syst., 2020

SCOBO: Sparsity-Aware Comparison Oracle Based Optimization.
CoRR, 2020

2019
Using mm-Waves for Secret Key Establishment.
IEEE Commun. Lett., 2019

2018
Performance Bounds with Curvature for Batched Greedy Optimization.
J. Optim. Theory Appl., 2018

Leveraging mm-Wave Communication for Security.
CoRR, 2018

2017
Subspace Selection for Projection Maximization With Matroid Constraints.
IEEE Trans. Signal Process., 2017

Near-Optimal Distributed Detection in Balanced Binary Relay Trees.
IEEE Trans. Control. Netw. Syst., 2017

2016
String Submodular Functions With Curvature Constraints.
IEEE Trans. Autom. Control., 2016

Performance bounds for the k-batch greedy strategy in optimization problems with curvature.
Proceedings of the 2016 American Control Conference, 2016

2015
Subspace selection for projection maximization with matroid constraints.
CoRR, 2015

2013
Detection Performance in Balanced Binary Relay Trees With Node and Link Failures.
IEEE Trans. Signal Process., 2013

Learning in Hierarchical Social Networks.
IEEE J. Sel. Top. Signal Process., 2013

Hypothesis Testing in Feedforward Networks With Broadcast Failures.
IEEE J. Sel. Top. Signal Process., 2013

Near Optimality of Greedy Strategies for String Submodular Functions with Forward and Backward Curvature Constraints
CoRR, 2013

Asymptotic learning in feedforward networks with binary symmetric channels.
Proceedings of the IEEE International Conference on Acoustics, 2013

Near optimality of greedy strategies for string submodular functions with forward and backward curvature constraints.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012
Error Probability Bounds for Balanced Binary Relay Trees.
IEEE Trans. Inf. Theory, 2012

Sequential Hypothesis Testing with Broadcast Failures
CoRR, 2012

Detection performance of M-ary relay trees with non-binary message alphabets.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

Submodularity and optimality of fusion rules in balanced binary relay trees.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

Rate of learning in hierarchical social networks.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Error Probability Bounds for Binary Relay Trees with Crummy Sensors
CoRR, 2011

Error probability bounds for binary relay trees with unreliable communication links.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011


  Loading...