Communication channel, Channel capacity, Computer network, Secrecy and Topology are his primary areas of study. The Communication channel study combines topics in areas such as Transmitter, Relay, Information-theoretic security and Computer security. He works mostly in the field of Transmitter, limiting it down to concerns involving Channel state information and, occasionally, Fading and Gaussian noise.
His Channel capacity research is multidisciplinary, relying on both Signal-to-noise ratio, Mathematical optimization, Decoding methods and Additive white Gaussian noise. His work in Secrecy covers topics such as Entropy which are related to areas like Message authentication code, Decodes and Covariance matrix. Yingbin Liang has included themes like Wiretap channels and MIMO in his Topology study.
Yingbin Liang mainly investigates Communication channel, Computer network, Algorithm, Topology and Transmitter. His study in Communication channel is interdisciplinary in nature, drawing from both Decoding methods and Secrecy. He has researched Computer network in several fields, including Relay channel, Relay, Broadcast channels and Computer security.
His work carried out in the field of Algorithm brings together such families of science as Gradient descent, Rate of convergence, Convergence and Logarithm. His Topology research includes elements of Dirty paper coding, Precoding, Gaussian noise and Spatial correlation. Within one scientific family, Yingbin Liang focuses on topics pertaining to Channel state information under Fading, and may sometimes address concerns connected to Additive white Gaussian noise.
His scientific interests lie mostly in Algorithm, Rate of convergence, Convergence, Reinforcement learning and Gradient descent. His work on Bilevel optimization as part of general Algorithm study is frequently connected to Initialization, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. The concepts of his Rate of convergence study are interwoven with issues in Computational complexity theory, Q-learning and Mathematical optimization.
His work deals with themes such as Path and Backtracking, which intersect with Convergence. His studies in Gradient descent integrate themes in fields like Function, Optimization problem, Sublinear function and Minimax. His Channel capacity study deals with the bigger picture of Communication channel.
The scientist’s investigation covers issues in Algorithm, Rate of convergence, Convergence, Markov process and Reinforcement learning. His Algorithm research integrates issues from Empirical risk minimization, Data classification and Sigmoid function. Many of his studies on Convergence apply to Computational complexity theory as well.
His Markov process study combines topics from a wide range of disciplines, such as Sampling and Stationary point. His research in the fields of Temporal difference learning overlaps with other disciplines such as Variance reduction. The study incorporates disciplines such as Resampling and Mathematical optimization in addition to Supervised learning.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Secure Communication Over Fading Channels
Yingbin Liang;H.V. Poor;S. Shamai.
IEEE Transactions on Information Theory (2008)
Information Theoretic Security
Yingbin Liang;H. Vincent Poor;Shlomo Shamai.
(2009)
Compound wiretap channels
Yingbin Liang;Gerhard Kramer;H. Vincent Poor;Shlomo Shamai.
Eurasip Journal on Wireless Communications and Networking (2009)
Multiple-Access Channels With Confidential Messages
Yingbin Liang;H.V. Poor.
IEEE Transactions on Information Theory (2008)
Gaussian orthogonal relay channels: optimal resource allocation and capacity
Yingbin Liang;V.V. Veeravalli.
IEEE Transactions on Information Theory (2005)
Cooperative Relay Broadcast Channels
Yingbin Liang;V.V. Veeravalli.
IEEE Transactions on Information Theory (2007)
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
Yingbin Liang;V.V. Veeravalli;H.V. Poor.
IEEE Transactions on Information Theory (2007)
Rate Regions for Relay Broadcast Channels
Yingbin Liang;G. Kramer.
IEEE Transactions on Information Theory (2007)
Capacity of noncoherent time-selective Rayleigh-fading channels
Yingbin Liang;V.V. Veeravalli.
IEEE Transactions on Information Theory (2004)
Capacity of Cognitive Interference Channels With and Without Secrecy
Yingbin Liang;A. Somekh-Baruch;H.V. Poor;S. Shamai.
IEEE Transactions on Information Theory (2009)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Technion – Israel Institute of Technology
Princeton University
University of California, Davis
University of Illinois at Urbana-Champaign
Technical University of Munich
Carnegie Mellon University
University of Toronto
Syracuse University
Duke University
Syracuse University
University of Zaragoza
NORCE Research
Jiangnan University
Queensland University of Technology
Shanghai Jiao Tong University
National Institute of Advanced Industrial Science and Technology
Jeonbuk National University
National University of General San Martín
University of Debrecen
University of Arizona
University of Montreal
Cornell University
University of California, Berkeley
University of Tübingen
University of Virginia
Harvard University