default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYingbin Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j70]Peizhong Ju
, Chengzhang Li, Yingbin Liang, Ness B. Shroff:
AI-EDGE: An NSF AI institute for future edge networks and distributed intelligence. AI Mag. 45(1): 29-34 (2024)- [j69]Songtao Feng, Ming Yin, Ruiquan Huang, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Toward General Function Approximation in Nonstationary Reinforcement Learning. IEEE J. Sel. Areas Inf. Theory 5: 190-206 (2024) - [j68]Tianjiao Li, Ziwei Guan, Shaofeng Zou, Tengyu Xu, Yingbin Liang, Guanghui Lan:
Faster algorithm and sharper analysis for constrained Markov decision process. Oper. Res. Lett. 54: 107107 (2024) - [j67]Tengyu Xu, Yue Wang, Shaofeng Zou, Yingbin Liang:
Provably Efficient Offline Reinforcement Learning With Trajectory-Wise Reward. IEEE Trans. Inf. Theory 70(9): 6481-6518 (2024) - [c139]Junze Deng, Yuan Cheng, Shaofeng Zou, Yingbin Liang:
Sample Complexity Characterization for Linear Contextual MDPs. AISTATS 2024: 1693-1701 - [c138]Ziwei Guan, Yi Zhou, Yingbin Liang:
On the Hardness of Online Nonconvex Optimization with Single Oracle Feedback. ICLR 2024 - [c137]Ruiquan Huang, Yuan Cheng, Jing Yang, Vincent Tan, Yingbin Liang:
Provable Benefits of Multi-task RL under Non-Markovian Decision Making Processes. ICLR 2024 - [c136]Ruiquan Huang, Yingbin Liang, Jing Yang:
Provably Efficient UCB-type Algorithms For Learning Predictive State Representations. ICLR 2024 - [c135]Daouda Sow, Sen Lin, Zhangyang Wang, Yingbin Liang:
Doubly Robust Instance-Reweighted Adversarial Training. ICLR 2024 - [c134]Songtao Feng, Ming Yin, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games. ICML 2024 - [c133]Yu Huang, Yuan Cheng, Yingbin Liang:
In-context Convergence of Transformers. ICML 2024 - [c132]Songtao Feng, Ming Yin, Ruiquan Huang, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Towards General Function Approximation in Nonstationary Reinforcement Learning. ISIT 2024: 1-6 - [c131]Peizhong Ju, Haibo Yang, Jia Liu, Yingbin Liang, Ness B. Shroff:
Can We Theoretically Quantify the Impacts of Local Updates on the Generalization Performance of Federated Learning? MobiHoc 2024: 141-150 - [i123]Junze Deng, Yuan Cheng, Shaofeng Zou, Yingbin Liang:
Sample Complexity Characterization for Linear Contextual MDPs. CoRR abs/2402.02700 (2024) - [i122]Yuchen Liang, Peizhong Ju, Yingbin Liang, Ness B. Shroff:
Non-asymptotic Convergence of Discrete-time Diffusion Models: New Approach and Improved Rate. CoRR abs/2402.13901 (2024) - [i121]Xuxi Chen, Zhendong Wang, Daouda Sow, Junjie Yang, Tianlong Chen, Yingbin Liang, Mingyuan Zhou, Zhangyang Wang:
Take the Bull by the Horns: Hard Sample-Reweighted Continual Training Improves LLM Generalization. CoRR abs/2402.14270 (2024) - [i120]Yu Huang, Zixin Wen, Yuejie Chi, Yingbin Liang:
Transformers Provably Learn Feature-Position Correlations in Masked Image Modeling. CoRR abs/2403.02233 (2024) - [i119]Jinyin Wang, Haijing Zhang, Yihao Zhong, Yingbin Liang, Rongwei Ji, Yiru Cang:
Advanced Multimodal Deep Learning Architecture for Image-Text Matching. CoRR abs/2406.15306 (2024) - [i118]Hongbo Li, Sen Lin, Lingjie Duan, Yingbin Liang, Ness B. Shroff:
Theory on Mixture-of-Experts in Continual Learning. CoRR abs/2406.16437 (2024) - [i117]Yihao Zhong, Yijing Wei, Yingbin Liang, Xiqing Liu, Rongwei Ji, Yiru Cang:
A comparative study of generative adversarial networks for image recognition algorithms based on deep learning and traditional methods. CoRR abs/2408.03568 (2024) - [i116]Tong Yang, Yu Huang, Yingbin Liang, Yuejie Chi:
In-Context Learning with Representations: Contextual Generalization of Trained Transformers. CoRR abs/2408.10147 (2024) - [i115]Yingbin Liang, Xiqing Liu, Haohao Xia, Yiru Cang, Zitao Zheng, Yuanfang Yang:
Convolutional Neural Networks for Predictive Modeling of Lung Disease. CoRR abs/2408.12605 (2024) - [i114]Peizhong Ju, Haibo Yang, Jia Liu, Yingbin Liang, Ness B. Shroff:
Can We Theoretically Quantify the Impacts of Local Updates on the Generalization Performance of Federated Learning? CoRR abs/2409.03863 (2024) - [i113]Yuxin Dong, Jianhua Yao, Jiajing Wang, Yingbin Liang, Shuhan Liao, Minheng Xiao:
Dynamic Fraud Detection: Integrating Reinforcement Learning into Graph Neural Networks. CoRR abs/2409.09892 (2024) - [i112]Ruiquan Huang, Yingbin Liang, Jing Yang:
Non-asymptotic Convergence of Training Transformers for Next-token Prediction. CoRR abs/2409.17335 (2024) - 2023
- [j66]Kaiyi Ji, Yingbin Liang:
Lower Bounds and Accelerated Algorithms for Bilevel Optimization. J. Mach. Learn. Res. 24: 22:1-22:56 (2023) - [j65]Yu Huang, Yuan Cheng, Yingbin Liang, Longbo Huang:
Online Min-max Problems with Non-convexity and Non-stationarity. Trans. Mach. Learn. Res. 2023 (2023) - [c130]Xuyang Chen, Jingliang Duan, Yingbin Liang, Lin Zhao:
Global Convergence of Two-Timescale Actor-Critic for Solving Linear Quadratic Regulator. AAAI 2023: 7087-7095 - [c129]Junjie Yang, Tianlong Chen, Mingkang Zhu, Fengxiang He, Dacheng Tao, Yingbin Liang, Zhangyang Wang:
Learning to Generalize Provably in Learning to Optimize. AISTATS 2023: 9807-9825 - [c128]Ziwei Guan, Yi Zhou, Yingbin Liang:
Online Nonconvex Optimization with Limited Instantaneous Oracle Feedback. COLT 2023: 3328-3355 - [c127]Yuan Cheng, Ruiquan Huang, Yingbin Liang, Jing Yang:
Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs. ICLR 2023 - [c126]Ruiquan Huang, Jing Yang, Yingbin Liang:
Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-Free RL. ICLR 2023 - [c125]Peizhong Ju, Yingbin Liang, Ness B. Shroff:
Theoretical Characterization of the Generalization Performance of Overfitted Meta-Learning. ICLR 2023 - [c124]Ming Shi, Yingbin Liang, Ness B. Shroff:
Near-Optimal Adversarial Reinforcement Learning with Switching Costs. ICLR 2023 - [c123]Junjie Yang, Xuxi Chen, Tianlong Chen, Zhangyang Wang, Yingbin Liang:
M-L2O: Towards Generalizable Learning-to-Optimize by Test-Time Fast Self-Adaptation. ICLR 2023 - [c122]Ziyi Chen, Yi Zhou, Yingbin Liang, Zhaosong Lu:
Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization. ICML 2023: 5396-5427 - [c121]Songtao Feng, Ming Yin, Ruiquan Huang, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Non-stationary Reinforcement Learning under General Function Approximation. ICML 2023: 9976-10007 - [c120]Sen Lin, Peizhong Ju, Yingbin Liang, Ness B. Shroff:
Theory on Forgetting and Generalization of Continual Learning. ICML 2023: 21078-21100 - [c119]Ming Shi, Yingbin Liang, Ness B. Shroff:
A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints. ICML 2023: 31243-31268 - [c118]Yuan Cheng, Jing Yang, Yingbin Liang:
Provably Efficient Algorithm for Nonstationary Low-Rank MDPs. NeurIPS 2023 - [c117]Sen Lin, Daouda Sow, Kaiyi Ji, Yingbin Liang, Ness B. Shroff:
Non-Convex Bilevel Optimization with Time-Varying Objective Functions. NeurIPS 2023 - [i111]Hongru Yang, Ziyu Jiang, Ruizhe Zhang, Zhangyang Wang, Yingbin Liang:
Convergence and Generalization of Wide Neural Networks with Large Bias. CoRR abs/2301.00327 (2023) - [i110]Hongru Yang, Yingbin Liang, Xiaojie Guo, Lingfei Wu, Zhangyang Wang:
Pruning Before Training May Improve Generalization, Provably. CoRR abs/2301.00335 (2023) - [i109]Daouda Sow, Sen Lin, Yingbin Liang, Junshan Zhang:
Algorithm Design for Online Meta-Learning with Task Boundary Detection. CoRR abs/2302.00857 (2023) - [i108]Ming Shi, Yingbin Liang, Ness B. Shroff:
Near-Optimal Adversarial Reinforcement Learning with Switching Costs. CoRR abs/2302.04374 (2023) - [i107]Ming Shi, Yingbin Liang, Ness B. Shroff:
A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints. CoRR abs/2302.04375 (2023) - [i106]Sen Lin, Peizhong Ju, Yingbin Liang, Ness B. Shroff:
Theory on Forgetting and Generalization of Continual Learning. CoRR abs/2302.05836 (2023) - [i105]Junjie Yang, Tianlong Chen, Mingkang Zhu, Fengxiang He, Dacheng Tao, Yingbin Liang, Zhangyang Wang:
Learning to Generalize Provably in Learning to Optimize. CoRR abs/2302.11085 (2023) - [i104]Junjie Yang, Xuxi Chen, Tianlong Chen, Zhangyang Wang, Yingbin Liang:
M-L2O: Towards Generalizable Learning-to-Optimize by Test-Time Fast Self-Adaptation. CoRR abs/2303.00039 (2023) - [i103]Yuan Cheng, Ruiquan Huang, Jing Yang, Yingbin Liang:
Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs. CoRR abs/2303.10859 (2023) - [i102]Peizhong Ju, Yingbin Liang, Ness B. Shroff:
Theoretical Characterization of the Generalization Performance of Overfitted Meta-Learning. CoRR abs/2304.04312 (2023) - [i101]Songtao Feng, Ming Yin, Ruiquan Huang, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Non-stationary Reinforcement Learning under General Function Approximation. CoRR abs/2306.00861 (2023) - [i100]Peizhong Ju, Sen Lin, Mark S. Squillante, Yingbin Liang, Ness B. Shroff:
Generalization Performance of Transfer Learning: Overparameterized and Underparameterized Regimes. CoRR abs/2306.04901 (2023) - [i99]Ming Shi, Yingbin Liang, Ness B. Shroff:
Theoretical Hardness and Tractability of POMDPs in RL with Partial Hindsight State Information. CoRR abs/2306.08762 (2023) - [i98]Ruiquan Huang, Yingbin Liang, Jing Yang:
Provably Efficient UCB-type Algorithms For Learning Predictive State Representations. CoRR abs/2307.00405 (2023) - [i97]Daouda Sow, Sen Lin, Zhangyang Wang, Yingbin Liang:
Doubly Robust Instance-Reweighted Adversarial Training. CoRR abs/2308.00311 (2023) - [i96]Sen Lin, Daouda Sow, Kaiyi Ji, Yingbin Liang, Ness B. Shroff:
Non-Convex Bilevel Optimization with Time-Varying Objective Functions. CoRR abs/2308.03811 (2023) - [i95]Yuan Cheng, Jing Yang, Yingbin Liang:
Provably Efficient Algorithm for Nonstationary Low-Rank MDPs. CoRR abs/2308.05471 (2023) - [i94]Songtao Feng, Ming Yin, Yu-Xiang Wang, Jing Yang, Yingbin Liang:
Model-Free Algorithm with Improved Sample Efficiency for Zero-Sum Markov Games. CoRR abs/2308.08858 (2023) - [i93]Yu Huang, Yuan Cheng, Yingbin Liang:
In-Context Convergence of Transformers. CoRR abs/2310.05249 (2023) - [i92]Ruiquan Huang, Yuan Cheng, Jing Yang, Vincent Tan, Yingbin Liang:
Provable Benefits of Multi-task RL under Non-Markovian Decision Making Processes. CoRR abs/2310.13550 (2023) - [i91]Junjie Yang, Jinze Zhao, Peihao Wang, Zhangyang Wang, Yingbin Liang:
Meta ControlNet: Enhancing Task Adaptation via Meta Learning. CoRR abs/2312.01255 (2023) - [i90]Junjie Yang, Tianlong Chen, Xuxi Chen, Zhangyang Wang, Yingbin Liang:
Rethinking PGD Attack: Is Sign Function Necessary? CoRR abs/2312.01260 (2023) - 2022
- [j64]Kaiyi Ji, Junjie Yang, Yingbin Liang:
Theoretical Convergence of Multi-Step Model-Agnostic Meta-Learning. J. Mach. Learn. Res. 23: 29:1-29:41 (2022) - [j63]Yi Zhou, Yingbin Liang, Huishuai Zhang:
Understanding generalization error of SGD in nonconvex optimization. Mach. Learn. 111(1): 345-375 (2022) - [j62]Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai:
Self-Secure Capacity-Achieving Feedback Schemes of Gaussian Multiple-Access Wiretap Channels With Degraded Message Sets. IEEE Trans. Inf. Forensics Secur. 17: 1583-1596 (2022) - [c116]Sen Lin, Ming Shi, Anish Arora, Raef Bassily, Elisa Bertino, Constantine Caramanis, Kaushik R. Chowdhury, Eylem Ekici, Atilla Eryilmaz, Stratis Ioannidis, Nan Jiang, Gauri Joshi, Jim Kurose, Yingbin Liang, Zhiqiang Lin, Jia Liu, Mingyan Liu, Tommaso Melodia, Aryan Mokhtari, Rob Nowak, Sewoong Oh, Srini Parthasarathy, Chunyi Peng, Hulya Seferoglu, Ness B. Shroff, Sanjay Shakkottai, Kannan Srinivasan, Ameet Talwalkar, Aylin Yener, Lei Ying:
Leveraging Synergies Between AI and Networking to Build Next Generation Edge Networks. CIC 2022: 16-25 - [c115]Ziwei Guan, Tengyu Xu, Yingbin Liang:
PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Method. ICLR 2022 - [c114]Sen Lin, Jialin Wan, Tengyu Xu, Yingbin Liang, Junshan Zhang:
Model-Based Offline Meta-Reinforcement Learning with Regularization. ICLR 2022 - [c113]Yuan Cheng, Songtao Feng, Jing Yang, Hong Zhang, Yingbin Liang:
Provable Benefit of Multitask Representation Learning in Reinforcement Learning. NeurIPS 2022 - [c112]Yu Huang, Yingbin Liang, Longbo Huang:
Provable Generalization of Overparameterized Meta-learning Trained with SGD. NeurIPS 2022 - [c111]Kaiyi Ji, Mingrui Liu, Yingbin Liang, Lei Ying:
Will Bilevel Optimizers Benefit from Loops. NeurIPS 2022 - [c110]Daouda Sow, Kaiyi Ji, Yingbin Liang:
On the Convergence Theory for Hessian-Free Bilevel Algorithms. NeurIPS 2022 - [c109]Tengyu Xu, Zhuoran Yang, Zhaoran Wang, Yingbin Liang:
A Unifying Framework of Off-Policy General Value Function Evaluation. NeurIPS 2022 - [c108]Shaocong Ma, Ziyi Chen, Yi Zhou, Kaiyi Ji, Yingbin Liang:
Data sampling affects the complexity of online SGD over dependent data. UAI 2022: 1296-1305 - [c107]Huaqing Xiong, Tengyu Xu, Lin Zhao, Yingbin Liang, Wei Zhang:
Deterministic policy gradient: Convergence analysis. UAI 2022: 2159-2169 - [i89]Sen Lin, Jialin Wan, Tengyu Xu, Yingbin Liang, Junshan Zhang:
Model-Based Offline Meta-Reinforcement Learning with Regularization. CoRR abs/2202.02929 (2022) - [i88]Daouda Sow, Kaiyi Ji, Ziwei Guan, Yingbin Liang:
A Constrained Optimization Approach to Bilevel Optimization with Multiple Inner Minima. CoRR abs/2203.01123 (2022) - [i87]Shaocong Ma, Ziyi Chen, Yi Zhou, Kaiyi Ji, Yingbin Liang:
Data Sampling Affects the Complexity of Online SGD over Dependent Data. CoRR abs/2204.00006 (2022) - [i86]Kaiyi Ji, Mingrui Liu, Yingbin Liang, Lei Ying:
Will Bilevel Optimizers Benefit from Loops. CoRR abs/2205.14224 (2022) - [i85]Yuan Cheng, Songtao Feng, Jing Yang, Hong Zhang, Yingbin Liang:
Provable Benefit of Multitask Representation Learning in Reinforcement Learning. CoRR abs/2206.05900 (2022) - [i84]Tengyu Xu, Yingbin Liang:
Provably Efficient Offline Reinforcement Learning with Trajectory-Wise Reward. CoRR abs/2206.06426 (2022) - [i83]Yu Huang, Yingbin Liang, Longbo Huang:
Provable Generalization of Overparameterized Meta-learning Trained with SGD. CoRR abs/2206.09136 (2022) - [i82]Ruiquan Huang, Jing Yang, Yingbin Liang:
Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL. CoRR abs/2206.14057 (2022) - [i81]Xuyang Chen, Jingliang Duan, Yingbin Liang, Lin Zhao:
Global Convergence of Two-timescale Actor-Critic for Solving Linear Quadratic Regulator. CoRR abs/2208.08744 (2022) - 2021
- [j61]Qunwei Li, Bhavya Kailkhura, Rushil Anirudh, Jize Zhang, Yi Zhou, Yingbin Liang, Thomas Yong-Jin Han, Pramod K. Varshney:
MR-GAN: Manifold Regularized Generative Adversarial Networks for Scientific Data. SIAM J. Math. Data Sci. 3(4): 1197-1222 (2021) - [j60]Kaiyi Ji, Yi Zhou, Yingbin Liang:
Understanding Estimation and Generalization Error of Generative Adversarial Networks. IEEE Trans. Inf. Theory 67(5): 3114-3129 (2021) - [c106]Huaqing Xiong, Tengyu Xu, Yingbin Liang, Wei Zhang:
Non-asymptotic Convergence of Adam-type Reinforcement Learning Algorithms under Markovian Sampling. AAAI 2021: 10460-10468 - [c105]Tengyu Xu, Yingbin Liang:
Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms. AISTATS 2021: 811-819 - [c104]Ziwei Guan, Tengyu Xu, Yingbin Liang:
When Will Generative Adversarial Imitation Learning Algorithms Attain Global Convergence. AISTATS 2021: 1117-1125 - [c103]Ziyi Chen, Yi Zhou, Tengyu Xu, Yingbin Liang:
Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry. ICLR 2021 - [c102]Kaiyi Ji, Junjie Yang, Yingbin Liang:
Bilevel Optimization: Convergence Analysis and Enhanced Design. ICML 2021: 4882-4892 - [c101]Tengyu Xu, Yingbin Liang, Guanghui Lan:
CRPO: A New Approach for Safe Reinforcement Learning with Convergence Guarantee. ICML 2021: 11480-11491 - [c100]Tengyu Xu, Zhuoran Yang, Zhaoran Wang, Yingbin Liang:
Doubly Robust Off-Policy Actor-Critic: Convergence and Optimality. ICML 2021: 11581-11591 - [c99]Lin Zhao, Huaqing Xiong, Yingbin Liang:
Faster Non-asymptotic Convergence for Double Q-learning. NeurIPS 2021: 7242-7253 - [c98]Junjie Yang, Kaiyi Ji, Yingbin Liang:
Provably Faster Algorithms for Bilevel Optimization. NeurIPS 2021: 13670-13682 - [c97]Bowen Weng, Huaqing Xiong, Lin Zhao, Yingbin Liang, Wei Zhang:
Finite-time theory for momentum Q-learning. UAI 2021: 665-674 - [i80]Kaiyi Ji, Yingbin Liang:
Lower Bounds and Accelerated Algorithms for Bilevel Optimization. CoRR abs/2102.03926 (2021) - [i79]Ziyi Chen, Yi Zhou, Tengyu Xu, Yingbin Liang:
Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry. CoRR abs/2102.04653 (2021) - [i78]Tengyu Xu, Zhuoran Yang, Zhaoran Wang, Yingbin Liang:
Doubly Robust Off-Policy Actor-Critic: Convergence and Optimality. CoRR abs/2102.11866 (2021) - [i77]Junjie Yang, Kaiyi Ji, Yingbin Liang:
Provably Faster Algorithms for Bilevel Optimization. CoRR abs/2106.04692 (2021) - [i76]Tengyu Xu, Zhuoran Yang, Zhaoran Wang, Yingbin Liang:
A Unified Off-Policy Evaluation Approach for General Value Function. CoRR abs/2107.02711 (2021) - [i75]Ziwei Guan, Tengyu Xu, Yingbin Liang:
PER-ETD: A Polynomially Efficient Emphatic Temporal Difference Learning Method. CoRR abs/2110.06906 (2021) - [i74]Daouda Sow, Kaiyi Ji, Yingbin Liang:
ES-Based Jacobian Enables Faster Bilevel Optimization. CoRR abs/2110.07004 (2021) - [i73]Tianjiao Li, Ziwei Guan, Shaofeng Zou, Tengyu Xu, Yingbin Liang, Guanghui Lan:
Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process. CoRR abs/2110.10351 (2021) - 2020
- [j59]Bin Dai, Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai (Shitz):
Enhancing physical layer security via channel feedback: a survey. EURASIP J. Wirel. Commun. Netw. 2020(1): 58 (2020) - [j58]Zhe Wang, Yingbin Liang, Pengsheng Ji:
Spectral Algorithms for Community Detection in Directed Networks. J. Mach. Learn. Res. 21: 153:1-153:45 (2020) - [j57]Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz:
Impact of Action-Dependent State and Channel Feedback on Gaussian Wiretap Channels. IEEE Trans. Inf. Theory 66(6): 3435-3455 (2020) - [j56]Haoyu Fu, Yuejie Chi, Yingbin Liang:
Guaranteed Recovery of One-Hidden-Layer Neural Networks via Cross Entropy. IEEE Trans. Signal Process. 68: 3225-3235 (2020) - [c96]Ziwei Guan, Kaiyi Ji, Donald J. Bucci Jr., Timothy Y. Hu, Joseph Palombo, Michael Liston, Yingbin Liang:
Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack. AAAI 2020: 4036-4043 - [c95]Ziwei Guan, Timothy Y. Hu, Joseph Palombo, Michael J. Liston, Donald J. Bucci, Yingbin Liang:
Robust Dynamic Spectrum Access in Adversarial Environments. ICC 2020: 1-7 - [c94]Tengyu Xu, Zhe Wang, Yi Zhou, Yingbin Liang:
Reanalysis of Variance Reduced Temporal Difference Learning. ICLR 2020 - [c93]Kaiyi Ji, Zhe Wang, Bowen Weng, Yi Zhou, Wei Zhang, Yingbin Liang:
History-Gradient Aided Batch Size Adaptation for Variance Reduced Algorithms. ICML 2020: 4762-4772 - [c92]Yi Zhou, Zhe Wang, Kaiyi Ji, Yingbin Liang, Vahid Tarokh:
Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization. IJCAI 2020: 1445-1451 - [c91]Bowen Weng, Huaqing Xiong, Yingbin Liang, Wei Zhang:
Analysis of Q-learning with Adaptation and Momentum Restart for Gradient Descent. IJCAI 2020: 3051-3057 - [c90]Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz:
On the Capacity of Gaussian Multiple-Access Wiretap Channels with Feedback. ISITA 2020: 397-401 - [c89]Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz:
Feedback Capacity of Gaussian Multiple-Access Wiretap Channel with Degraded Message Sets. ITW 2020: 1-5 - [c88]Kaiyi Ji, Jason D. Lee, Yingbin Liang, H. Vincent Poor:
Convergence of Meta-Learning with Task-Specific Adaptation over Partial Parameters. NeurIPS 2020 - [c87]Huaqing Xiong, Lin Zhao, Yingbin Liang, Wei Zhang:
Finite-Time Analysis for Double Q-learning. NeurIPS 2020 - [c86]Tengyu Xu, Zhe Wang, Yingbin Liang:
Improving Sample Complexity Bounds for (Natural) Actor-Critic Algorithms. NeurIPS 2020 - [i72]Tengyu Xu, Zhe Wang, Yi Zhou, Yingbin Liang:
Reanalysis of Variance Reduced Temporal Difference Learning. CoRR abs/2001.01898 (2020) - [i71]Huaqing Xiong, Tengyu Xu, Yingbin Liang, Wei Zhang:
Non-asymptotic Convergence of Adam-type Reinforcement Learning Algorithms under Markovian Sampling. CoRR abs/2002.06286 (2020) - [i70]Ziwei Guan, Kaiyi Ji, Donald J. Bucci Jr., Timothy Y. Hu, Joseph Palombo, Michael Liston, Yingbin Liang:
Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack. CoRR abs/2002.07214 (2020) - [i69]Kaiyi Ji, Junjie Yang, Yingbin Liang:
Multi-Step Model-Agnostic Meta-Learning: Convergence and Improved Algorithms. CoRR abs/2002.07836 (2020) - [i68]Yi Zhou, Zhe Wang, Kaiyi Ji, Yingbin Liang, Vahid Tarokh:
Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization. CoRR abs/2002.11582 (2020) - [i67]Tengyu Xu, Zhe Wang, Yingbin Liang:
Improving Sample Complexity Bounds for Actor-Critic Algorithms. CoRR abs/2004.12956 (2020) - [i66]Tengyu Xu, Zhe Wang, Yingbin Liang:
Non-asymptotic Convergence Analysis of Two Time-scale (Natural) Actor-Critic Algorithms. CoRR abs/2005.03557 (2020) - [i65]Tengyu Xu, Zhe Wang, Yingbin Liang, H. Vincent Poor:
Enhanced First and Zeroth Order Variance Reduced Algorithms for Min-Max Optimization. CoRR abs/2006.09361 (2020) - [i64]Kaiyi Ji, Jason D. Lee, Yingbin Liang, H. Vincent Poor:
Convergence of Meta-Learning with Task-Specific Adaptation over Partial Parameters. CoRR abs/2006.09486 (2020) - [i63]Ziwei Guan, Tengyu Xu, Yingbin Liang:
When Will Generative Adversarial Imitation Learning Algorithms Attain Global Convergence. CoRR abs/2006.13506 (2020) - [i62]Bowen Weng, Huaqing Xiong, Yingbin Liang, Wei Zhang:
Analysis of Q-learning with Adaptation and Momentum Restart for Gradient Descent. CoRR abs/2007.07422 (2020) - [i61]Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai:
Feedback Capacities of Gaussian Multiple-Access Wiretap Channels. CoRR abs/2007.14555 (2020) - [i60]Bowen Weng, Huaqing Xiong, Lin Zhao, Yingbin Liang, Wei Zhang:
Momentum Q-learning with Finite-Sample Convergence Guarantee. CoRR abs/2007.15418 (2020) - [i59]Zhe Wang, Yingbin Liang, Pengsheng Ji:
Spectral Algorithms for Community Detection in Directed Networks. CoRR abs/2008.03820 (2020) - [i58]Huaqing Xiong, Lin Zhao, Yingbin Liang, Wei Zhang:
Finite-Time Analysis for Double Q-learning. CoRR abs/2009.14257 (2020) - [i57]Kaiyi Ji, Junjie Yang, Yingbin Liang:
Provably Faster Algorithms for Bilevel Optimization and Applications to Meta-Learning. CoRR abs/2010.07962 (2020) - [i56]Tengyu Xu, Yingbin Liang:
Sample Complexity Bounds for Two Timescale Value-based Reinforcement Learning Algorithms. CoRR abs/2011.05053 (2020) - [i55]Tengyu Xu, Yingbin Liang, Guanghui Lan:
A Primal Approach to Constrained Policy Optimization: Global Optimality and Finite-Time Analysis. CoRR abs/2011.05869 (2020)
2010 – 2019
- 2019
- [j55]Yi Zhou, Yingbin Liang, Lixin Shen:
A simple convergence analysis of Bregman proximal gradient algorithm. Comput. Optim. Appl. 73(3): 903-912 (2019) - [j54]Michael Dikshtein, Ruchen Duan, Yingbin Liang, Shlomo Shamai (Shitz):
MIMO Gaussian State-Dependent Channels with a State-Cognitive Helper. Entropy 21(3): 273 (2019) - [j53]Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
A note on inexact gradient and Hessian conditions for cubic regularized Newton's method. Oper. Res. Lett. 47(2): 146-149 (2019) - [j52]Yunhao Sun, Ruchen Duan, Yingbin Liang, Shlomo Shamai Shitz:
State-Dependent Interference Channel With Correlated States. IEEE Trans. Inf. Theory 65(7): 4518-4531 (2019) - [j51]Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai Shitz:
Secrecy Capacity of Colored Gaussian Noise Channels With Feedback. IEEE Trans. Inf. Theory 65(9): 5771-5782 (2019) - [j50]Tiexing Wang, Qunwei Li, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney:
K-Medoids Clustering of Data Sequences With Composite Distributions. IEEE Trans. Signal Process. 67(8): 2093-2106 (2019) - [c85]Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
Stochastic Variance-Reduced Cubic Regularization for Nonconvex Optimization. AISTATS 2019: 2731-2740 - [c84]Jayanth Regatti, Gaurav Tendolkar, Yi Zhou, Abhishek Gupta, Yingbin Liang:
Distributed SGD Generalizes Well Under Asynchrony. Allerton 2019: 863-870 - [c83]Yi Zhou, Junjie Yang, Huishuai Zhang, Yingbin Liang, Vahid Tarokh:
SGD Converges to Global Minimum in Deep Learning via Star-convex Path. ICLR (Poster) 2019 - [c82]Kaiyi Ji, Zhe Wang, Yi Zhou, Yingbin Liang:
Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization. ICML 2019: 3100-3109 - [c81]Bin Dai, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz:
The Dirty Paper Wiretap Feedback Channel with or without Action on the State. ISIT 2019: 657-661 - [c80]Haoyu Fu, Yuejie Chi, Yingbin Liang:
Local Geometry of Cross Entropy Loss in Learning One-Hidden-Layer Neural Networks. ISIT 2019: 1972-1976 - [c79]Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, Vahid Tarokh:
SpiderBoost and Momentum: Faster Variance Reduction Algorithms. NeurIPS 2019: 2403-2413 - [c78]Shaofeng Zou, Tengyu Xu, Yingbin Liang:
Finite-Sample Analysis for SARSA with Linear Function Approximation. NeurIPS 2019: 8665-8675 - [c77]Tengyu Xu, Shaofeng Zou, Yingbin Liang:
Two Time-scale Off-Policy TD Learning: Non-asymptotic Analysis over Markovian Samples. NeurIPS 2019: 10633-10643 - [c76]Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
Cubic Regularization with Momentum for Nonconvex Optimization. UAI 2019: 313-322 - [i54]Yi Zhou, Junjie Yang, Huishuai Zhang, Yingbin Liang, Vahid Tarokh:
SGD Converges to Global Minimum in Deep Learning via Star-convex Path. CoRR abs/1901.00451 (2019) - [i53]Shaofeng Zou, Tengyu Xu, Yingbin Liang:
Finite-Sample Analysis for SARSA and Q-Learning with Linear Function Approximation. CoRR abs/1902.02234 (2019) - [i52]Tengyu Xu, Shaofeng Zou, Yingbin Liang:
Two Time-scale Off-Policy TD Learning: Non-asymptotic Analysis over Markovian Samples. CoRR abs/1909.11907 (2019) - [i51]Jayanth Regatti, Gaurav Tendolkar, Yi Zhou, Abhishek Gupta, Yingbin Liang:
Distributed SGD Generalizes Well Under Asynchrony. CoRR abs/1909.13391 (2019) - [i50]Kaiyi Ji, Zhe Wang, Yi Zhou, Yingbin Liang:
Faster Stochastic Algorithms via History-Gradient Aided Batch Size Adaptation. CoRR abs/1910.09670 (2019) - [i49]Kaiyi Ji, Zhe Wang, Yi Zhou, Yingbin Liang:
Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization. CoRR abs/1910.12166 (2019) - 2018
- [j49]Yi Zhou, Yingbin Liang, Yaoliang Yu, Wei Dai, Eric P. Xing:
Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters. J. Mach. Learn. Res. 19: 19:1-19:32 (2018) - [j48]Qunwei Li, Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney:
Nonparametric Composite Hypothesis Testing in an Asymptotic Regime. IEEE J. Sel. Top. Signal Process. 12(5): 1005-1014 (2018) - [j47]Shaofeng Zou, Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai Shitz:
Degraded Broadcast Channel With Secrecy Outside a Bounded Range. IEEE Trans. Inf. Theory 64(3): 2104-2120 (2018) - [j46]Yuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli:
Estimation of KL Divergence: Optimal Minimax Rate. IEEE Trans. Inf. Theory 64(4): 2648-2674 (2018) - [j45]Huishuai Zhang, Yuejie Chi, Yingbin Liang:
Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers. IEEE Trans. Inf. Theory 64(11): 7287-7310 (2018) - [j44]Wei Yang, Yingbin Liang, Shlomo Shamai Shitz, H. Vincent Poor:
State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results. IEEE Trans. Inf. Theory 64(12): 7866-7882 (2018) - [j43]Yixian Liu, Yingbin Liang, Shuguang Cui:
Data-Driven Nonparametric Existence and Association Problems. IEEE Trans. Signal Process. 66(24): 6377-6389 (2018) - [c75]Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney:
Clustering under composite generative models. CISS 2018: 1-6 - [c74]Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney:
Exponentially Consistent K-Means Clustering Algorithm Based on Kolmogrov-Smirnov Test. ICASSP 2018: 2296-2300 - [c73]Yixian Liu, Yingbin Liang, Shuguang Cui:
Data-Driven Nonparametric Hypothesis Testing. ICASSP 2018: 4234-4238 - [c72]Yi Zhou, Yingbin Liang:
Critical Points of Linear Neural Networks: Analytical Forms and Landscape Properties. ICLR (Poster) 2018 - [c71]Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
A Coding Scheme for Colored Gaussian Wiretap Channels with Feedback. ISIT 2018: 131-135 - [c70]Yi Zhou, Zhe Wang, Yingbin Liang:
Convergence of Cubic Regularization for Nonconvex Optimization under KL Property. NeurIPS 2018: 3764-3773 - [c69]Kaiyi Ji, Yingbin Liang:
Minimax Estimation of Neural Net Distance. NeurIPS 2018: 3849-3858 - [i48]Chong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Secrecy Capacity of Colored Gaussian Noise Channels with Feedback. CoRR abs/1801.06702 (2018) - [i47]Haoyu Fu, Yuejie Chi, Yingbin Liang:
Local Geometry of One-Hidden-Layer Neural Networks for Logistic Regression. CoRR abs/1802.06463 (2018) - [i46]Yi Zhou, Yingbin Liang, Huishuai Zhang:
Generalization Error Bounds with Probabilistic Guarantee for SGD in Nonconvex Optimization. CoRR abs/1802.06903 (2018) - [i45]Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
Sample Complexity of Stochastic Variance-Reduced Cubic Regularization for Nonconvex Optimization. CoRR abs/1802.07372 (2018) - [i44]Yunhao Sun, Ruchen Duan, Yingbin Liang, Shlomo Shamai:
State-Dependent Interference Channel with Correlated States. CoRR abs/1806.00937 (2018) - [i43]Tengyu Xu, Yi Zhou, Kaiyi Ji, Yingbin Liang:
Convergence of SGD in Learning ReLU Models with Separable Data. CoRR abs/1806.04339 (2018) - [i42]Michael Dikshtein, Ruchen Duan, Yingbin Liang, Shlomo Shamai:
Parallel Gaussian Channels Corrupted by Independent States With a State-Cognitive Helper. CoRR abs/1807.03518 (2018) - [i41]Tiexing Wang, Qunwei Li, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney:
K-medoids Clustering of Data Sequences with Composite Distributions. CoRR abs/1807.11620 (2018) - [i40]Yi Zhou, Zhe Wang, Yingbin Liang:
Convergence of Cubic Regularization for Nonconvex Optimization under KL Property. CoRR abs/1808.07382 (2018) - [i39]Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
A Note on Inexact Condition for Cubic Regularized Newton's Method. CoRR abs/1808.07384 (2018) - [i38]Zhe Wang, Yi Zhou, Yingbin Liang, Guanghui Lan:
Cubic Regularization with Momentum for Nonconvex Optimization. CoRR abs/1810.03763 (2018) - [i37]Zhe Wang, Kaiyi Ji, Yi Zhou, Yingbin Liang, Vahid Tarokh:
SpiderBoost: A Class of Faster Variance-reduced Algorithms for Nonconvex Optimization. CoRR abs/1810.10690 (2018) - [i36]Kaiyi Ji, Yingbin Liang:
Minimax Estimation of Neural Net Distance. CoRR abs/1811.01054 (2018) - [i35]Qunwei Li, Bhavya Kailkhura, Rushil Anirudh, Yi Zhou, Yingbin Liang, Pramod K. Varshney:
MR-GAN: Manifold Regularized Generative Adversarial Networks. CoRR abs/1811.10427 (2018) - 2017
- [j42]Huishuai Zhang, Yingbin Liang, Yuejie Chi:
A Nonconvex Approach for Phase Retrieval: Reshaped Wirtinger Flow and Incremental Algorithms. J. Mach. Learn. Res. 18: 141:1-141:35 (2017) - [j41]Ain Ul Aisha, Lifeng Lai, Yingbin Liang, Shlomo Shamai Shitz:
Sum-Rate Capacity of Poisson MIMO Multiple-Access Channels. IEEE Trans. Commun. 65(11): 4765-4776 (2017) - [j40]Huishuai Zhang, Yingbin Liang, Lifeng Lai, Shlomo Shamai Shitz:
Multi-Key Generation Over a Cellular Model With a Helper. IEEE Trans. Inf. Theory 63(6): 3804-3822 (2017) - [j39]Ain Ul Aisha, Lifeng Lai, Yingbin Liang, Shlomo Shamai Shitz:
On the Sum-Rate Capacity of Poisson MISO Multiple Access Channels. IEEE Trans. Inf. Theory 63(10): 6457-6473 (2017) - [j38]Shaofeng Zou, Yingbin Liang, H. Vincent Poor:
Nonparametric Detection of Geometric Structures Over Networks. IEEE Trans. Signal Process. 65(19): 5034-5046 (2017) - [j37]Shaofeng Zou, Yingbin Liang, H. Vincent Poor, Xinghua Shi:
Nonparametric Detection of Anomalous Data Streams. IEEE Trans. Signal Process. 65(21): 5785-5797 (2017) - [c68]Shaofeng Zou, Yingbin Liang, Shlomo Shamai:
Gaussian fading channel with secrecy outside a bounded range. CNS 2017: 545-549 - [c67]Yi Zhou, Yingbin Liang:
Demixing sparse signals via convex optimization. ICASSP 2017: 4202-4206 - [c66]Qunwei Li, Yi Zhou, Yingbin Liang, Pramod K. Varshney:
Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization. ICML 2017: 2111-2119 - [c65]Yunhao Sun, Yingbin Liang, Ruchen Duan, Shlomo Shamai Shitz:
State-dependent Z-interference channel with correlated states. ISIT 2017: 644-648 - [c64]Wei Yang, Yingbin Liang, Shlomo Shamai Shitz, H. Vincent Poor:
Outer bounds for Gaussian multiple access channels with state known at one encoder. ISIT 2017: 869-873 - [c63]Chong Li, Yingbin Liang:
Secrecy capacity of the first-order autoregressive moving average Gaussian channel with feedback. ISIT 2017: 1963-1967 - [i34]Wei Yang, Yingbin Liang, Shlomo Shamai, H. Vincent Poor:
State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results. CoRR abs/1705.01640 (2017) - [i33]Qunwei Li, Yi Zhou, Yingbin Liang, Pramod K. Varshney:
Convergence Analysis of Proximal Gradient with Momentum for Nonconvex Optimization. CoRR abs/1705.04925 (2017) - [i32]Yuanxin Li, Yuejie Chi, Huishuai Zhang, Yingbin Liang:
Nonconvex Low-Rank Matrix Recovery with Arbitrary Outliers via Median-Truncated Gradient Descent. CoRR abs/1709.08114 (2017) - [i31]Yi Zhou, Yingbin Liang:
Characterization of Gradient Dominance and Regularity Conditions for Neural Networks. CoRR abs/1710.06910 (2017) - [i30]Yi Zhou, Yingbin Liang:
Critical Points of Neural Networks: Analytical Forms and Landscape Properties. CoRR abs/1710.11205 (2017) - [i29]Qunwei Li, Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney:
Nonparametric Composite Hypothesis Testing in an Asymptotic Regime. CoRR abs/1712.03296 (2017) - 2016
- [j36]Ruchen Duan, Yingbin Liang, Shlomo Shamai Shitz:
State-Dependent Gaussian Interference Channels: Can State Be Fully Canceled? IEEE Trans. Inf. Theory 62(4): 1957-1970 (2016) - [j35]Yunhao Sun, Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai Shitz:
Capacity Characterization for State-Dependent Gaussian Channel With a Helper. IEEE Trans. Inf. Theory 62(12): 7123-7134 (2016) - [j34]Weiguang Wang, Yingbin Liang, Eric P. Xing, Lixin Shen:
Nonparametric Decentralized Detection and Sparse Sensor Selection Via Weighted Kernel. IEEE Trans. Signal Process. 64(2): 306-321 (2016) - [c62]Weiguang Wang, Yingbin Liang, H. Vincent Poor:
Nonparametric composite outlier detection. ACSSC 2016: 1256-1260 - [c61]Yi Zhou, Yaoliang Yu, Wei Dai, Yingbin Liang, Eric P. Xing:
On Convergence of Model Parallel Proximal Gradient Algorithm for Stale Synchronous Parallel System. AISTATS 2016: 713-722 - [c60]Yi Zhou, Huishuai Zhang, Yingbin Liang:
On Compressive orthonormal Sensing. Allerton 2016: 299-305 - [c59]Yi Zhou, Huishuai Zhang, Yingbin Liang:
Geometrical properties and accelerated gradient solvers of non-convex phase retrieval. Allerton 2016: 331-335 - [c58]Shaofeng Zou, Yingbin Liang, H. Vincent Poor:
Nonparametric detection of an anomalous disk over a two-dimensional lattice network. ICASSP 2016: 2394-2398 - [c57]Yuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli:
Universal outlying sequence detection for continuous observations. ICASSP 2016: 4254-4258 - [c56]Ain Ul Aisha, Lifeng Lai, Yingbin Liang, Shlomo Shamai Shitz:
On the sum-rate capacity of poisson MISO multiple access channels. ICCS 2016: 1-5 - [c55]Huishuai Zhang, Yuejie Chi, Yingbin Liang:
Provable Non-convex Phase Retrieval with Outliers: Median TruncatedWirtinger Flow. ICML 2016: 1022-1031 - [c54]Ain Ul Aisha, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
On the sum-rate capacity of non-symmetric Poisson multiple access channel. ISIT 2016: 375-379 - [c53]Yuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli:
Estimation of KL divergence between large-alphabet distributions. ISIT 2016: 1118-1122 - [c52]Yunhao Sun, Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
Helper-assisted state cancelation for multiple access channels. ISIT 2016: 1496-1500 - [c51]Shaofeng Zou, Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai:
K-user degraded broadcast channel with secrecy outside a bounded range. ITW 2016: 31-35 - [c50]Huishuai Zhang, Yingbin Liang:
Reshaped Wirtinger Flow for Solving Quadratic System of Equations. NIPS 2016: 2622-2630 - [i28]Huishuai Zhang, Yingbin Liang:
Reshaped Wirtinger Flow for Solving Quadratic Systems of Equations. CoRR abs/1605.07719 (2016) - [i27]Yuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli:
Estimation of KL Divergence: Optimal Minimax Rate. CoRR abs/1607.02653 (2016) - [i26]Shaofeng Zou, Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai:
Degraded Broadcast Channel with Secrecy Outside a Bounded Range. CoRR abs/1609.06353 (2016) - 2015
- [j33]Phillip A. Regalia, Ashish Khisti, Yingbin Liang, Stefano Tomasin:
Secure Communications via Physical-Layer and Information-Theoretic Techniques [Scanning the Issue]. Proc. IEEE 103(10): 1698-1701 (2015) - [j32]Shaofeng Zou, Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai:
Broadcast Networks With Layered Decoding and Layered Secrecy: Theory and Applications. Proc. IEEE 103(10): 1841-1856 (2015) - [j31]Ain Ul Aisha, Lifeng Lai, Yingbin Liang:
Optimal Power Allocation for Poisson Channels With Time-Varying Background Light. IEEE Trans. Commun. 63(11): 4327-4338 (2015) - [j30]Lifeng Lai, Yingbin Liang, Shlomo Shamai (Shitz):
On the Capacity Bounds for Poisson Interference Channels. IEEE Trans. Inf. Theory 61(1): 223-238 (2015) - [j29]Ruchen Duan, Yingbin Liang:
Bounds and Capacity Theorems for Cognitive Interference Channels With State. IEEE Trans. Inf. Theory 61(1): 280-304 (2015) - [j28]Weiguang Wang, Yingbin Liang, Eric P. Xing:
Collective Support Recovery for Multi-Design Multi-Response Linear Regression. IEEE Trans. Inf. Theory 61(1): 513-534 (2015) - [j27]Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
An Information Theoretic Approach to Secret Sharing. IEEE Trans. Inf. Theory 61(6): 3121-3136 (2015) - [j26]Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai Shitz:
State-Dependent Parallel Gaussian Networks With a Common State-Cognitive Helper. IEEE Trans. Inf. Theory 61(12): 6680-6699 (2015) - [c49]Anhong He, Benika Hall, Jia Wen, Yingbin Liang, Xinghua Shi:
Sequential parallel LASSO models for eQTL analysis. BCB 2015: 533-534 - [c48]Ruchen Duan, Yingbin Liang, Shlomo Shamai:
State-dependent Gaussian Z-interference channel: Capacity results. ISIT 2015: 216-220 - [c47]Huishuai Zhang, Yingbin Liang, Lifeng Lai:
Secret key capacity: Talk or keep silent? ISIT 2015: 291-295 - [c46]Huishuai Zhang, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
Two-key generation for a cellular model with a helper. ISIT 2015: 715-719 - [c45]Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range. ISIT 2015: 1357-1361 - [c44]Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
Degraded broadcast channel: Secrecy outside of a bounded range. ITW 2015: 1-5 - [c43]Huishuai Zhang, Yi Zhou, Yingbin Liang:
Analysis of Robust PCA via Local Incoherence. NIPS 2015: 1819-1827 - [i25]Yuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli:
Universal Outlying sequence detection For Continuous Observations. CoRR abs/1509.07040 (2015) - 2014
- [j25]Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai:
A Broadcast Approach for Fading Wiretap Channels. IEEE Trans. Inf. Theory 60(2): 842-858 (2014) - [j24]Huishuai Zhang, Lifeng Lai, Yingbin Liang, Hua Wang:
The Capacity Region of the Source-Type Model for Secret Key and Private Key Generation. IEEE Trans. Inf. Theory 60(10): 6389-6398 (2014) - [c42]Huishuai Zhang, Yingbin Liang, Lifeng Lai:
Helper-assisted asymmetric two key generation. ACSSC 2014: 65-69 - [c41]Shaofeng Zou, Yingbin Liang, H. Vincent Poor, Xinghua Shi:
Unsupervised nonparametric anomaly detection: A kernel method. Allerton 2014: 836-841 - [c40]Ain Ul Aisha, Lifeng Lai, Yingbin Liang:
On fading poisson channels with varying noise levels. CISS 2014: 1-5 - [c39]Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
State-dependent parallel Gaussian channels with a common helper in high power regime. ISIT 2014: 86-90 - [c38]Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
Layered secure broadcasting over MIMO channels and application in secret sharing. ISIT 2014: 396-400 - [c37]Huishuai Zhang, Lifeng Lai, Yingbin Liang, Hua Wang:
Secret key-private key generation over three terminals: Capacity region. ISIT 2014: 1141-1145 - [c36]Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
Dirty interference cancelation for multiple access channels. ISITA 2014: 463-467 - [c35]Huishuai Zhang, Yingbin Liang, Lifeng Lai:
Key capacity region for a cellular source model. ITW 2014: 321-325 - [c34]Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
Dirty interference cancellation for Gaussian broadcast channels. ITW 2014: 551-555 - [c33]Weiguang Wang, Yingbin Liang, Eric P. Xing, Lixin Shen:
Sparse sensor selection for nonparametric decentralized detection via L1 regularization. MLSP 2014: 1-6 - [c32]Shaofeng Zou, Yingbin Liang, H. Vincent Poor:
A kernel-based nonparametric test for anomaly detection over line networks. MLSP 2014: 1-6 - [c31]Shaofeng Zou, Yingbin Liang, H. Vincent Poor, Xinghua Shi:
Kernel-based nonparametric anomaly detection. SPAWC 2014: 224-228 - [i24]Huishuai Zhang, Lifeng Lai, Yingbin Liang, Hua Wang:
The Capacity Region of the Source-Type Model for Secret Key and Private Key Generation. CoRR abs/1404.6471 (2014) - [i23]Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
Parallel Gaussian Networks with a Common State-Cognitive Helper. CoRR abs/1404.6472 (2014) - [i22]Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
An Information Theoretic Approach to Secret Sharing. CoRR abs/1404.6474 (2014) - [i21]Shaofeng Zou, Yingbin Liang, H. Vincent Poor, Xinghua Shi:
Nonparametric Detection of Anomalous Data via Kernel Mean Embedding. CoRR abs/1405.2294 (2014) - 2013
- [c30]Weiguang Wang, Yingbin Liang, Eric P. Xing:
Block Regularized Lasso for Multivariate Multi-Response Linear Regression. AISTATS 2013: 608-617 - [c29]Ruchen Duan, Yingbin Liang, Shlomo Shamai:
On the capacity region of Gaussian interference channels with state. ISIT 2013: 1097-1101 - [c28]Shaofeng Zou, Yingbin Liang, Shlomo Shamai:
Multiple access channel with state uncertainty at transmitters. ISIT 2013: 1466-1470 - [c27]Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai (Shitz):
State-dependent Gaussian Z-channel with mismatched side-information and interference. ITW 2013: 1-5 - [c26]Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
Layered decoding and secrecy over degraded broadcast channels. SPAWC 2013: 679-683 - [i20]Weiguang Wang, Yingbin Liang, Eric P. Xing:
Sharp Threshold for Multivariate Multi-Response Linear Regression via Block Regularized Lasso. CoRR abs/1307.7993 (2013) - 2012
- [j23]Matthieu R. Bloch, Mérouane Debbah, Yingbin Liang, Yasutada Oohama, Andrew Thangaraj:
Special issue on physical-layer security. J. Commun. Networks 14(4): 349-351 (2012) - [j22]Lifeng Lai, Yingbin Liang, Wenliang Du:
Cooperative Key Generation in Wireless Networks. IEEE J. Sel. Areas Commun. 30(8): 1578-1588 (2012) - [j21]Lifeng Lai, Yingbin Liang, H. Vincent Poor:
A Unified Framework for Key Agreement Over Wireless Fading Channels. IEEE Trans. Inf. Forensics Secur. 7(2): 480-490 (2012) - [c25]Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai (Shitz):
Broadcasting over fading wiretap channels. ISIT 2012: 234-238 - [c24]Jiayao Hu, Yingbin Liang, Eric P. Xing:
Nonparametric decentralized detection based on weighted count kernel. ISIT 2012: 324-328 - [c23]Ruchen Duan, Yingbin Liang:
Gaussian cognitive interference channels with state. ISIT 2012: 1822-1826 - [i19]Ruchen Duan, Yingbin Liang:
Bounds and Capacity Theorems for Cognitive Interference Channels with State. CoRR abs/1207.0016 (2012) - 2011
- [j20]Yingbin Liang, Lifeng Lai, John Halloran:
Distributed Cognitive Radio Network Management via Algorithms in Probabilistic Graphical Models. IEEE J. Sel. Areas Commun. 29(2): 338-348 (2011) - [j19]Yingbin Liang, H. Vincent Poor, Lei Ying:
Secure Communications Over Wireless Broadcast Networks: Stability and Utility Maximization. IEEE Trans. Inf. Forensics Secur. 6(3-1): 682-692 (2011) - [j18]Yingbin Liang, Gerhard Kramer, H. Vincent Poor:
On the Equivalence of Two Achievable Regions for the Broadcast Channel. IEEE Trans. Inf. Theory 57(1): 95-100 (2011) - [j17]Lalitha Sankar, Yingbin Liang, Narayan B. Mandayam, Harold Vincent Poor:
Fading Multiple Access Relay Channels: Achievable Rates and Opportunistic Scheduling. IEEE Trans. Inf. Theory 57(4): 1911-1931 (2011) - [j16]Ruoheng Liu, Yingbin Liang, H. Vincent Poor:
Fading Cognitive Multiple-Access Channels With Confidential Messages. IEEE Trans. Inf. Theory 57(8): 4992-5005 (2011) - [j15]Yingbin Liang, H. Vincent Poor, Lei Ying:
Secrecy Throughput of MANETs Under Passive and Active Attacks. IEEE Trans. Inf. Theory 57(10): 6692-6702 (2011) - [c22]Ruchen Duan, Yingbin Liang:
Capacity bounds for a class of cognitive interference channels with state. Allerton 2011: 603-608 - [c21]Lifeng Lai, Yingbin Liang, Wenliang Du:
PHY-based cooperative key generation in wireless networks. Allerton 2011: 662-669 - [c20]Jiayao Hu, Yingbin Liang, Eric P. Xing:
Nonparametric decision making based on tree-structured information aggregation. Allerton 2011: 1853-1860 - [c19]Lifeng Lai, Yingbin Liang, Wenliang Du, Shlomo Shamai:
Secret sharing via noisy broadcast channels. ISIT 2011: 1955-1959 - 2010
- [j14]Hung D. Ly, Tie Liu, Yingbin Liang:
Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages. IEEE Trans. Inf. Theory 56(11): 5477-5487 (2010) - [j13]Hong Wan, Rong-Rong Chen, Yingbin Liang:
Optimality of beamforming for MIMO multiple access channels via virtual representation. IEEE Trans. Signal Process. 58(10): 5458-5463 (2010) - [c18]Lifeng Lai, Yingbin Liang, H. Vincent Poor:
Key agreement over wireless fading channels with an active attacker. Allerton 2010: 1391-1396 - [c17]Lifeng Lai, Yingbin Liang, Shlomo Shamai:
On the capacity region of the Poisson interference channels. ISIT 2010: 330-334
2000 – 2009
- 2009
- [j12]Yingbin Liang, Gerhard Kramer, H. Vincent Poor, Shlomo Shamai (Shitz):
Compound Wiretap Channels. EURASIP J. Wirel. Commun. Netw. 2009 (2009) - [j11]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Information Theoretic Security. Found. Trends Commun. Inf. Theory 5(4-5): 355-580 (2009) - [j10]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Physical layer security in broadcast networks. Secur. Commun. Networks 2(3): 227-238 (2009) - [j9]Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai, Sergio Verdú:
Capacity of Cognitive Interference Channels With and Without Secrecy. IEEE Trans. Inf. Theory 55(2): 604-619 (2009) - [c16]Ruoheng Liu, Yingbin Liang, H. Vincent Poor:
Fading cognitive multiple-access channels with confidential messages. Allerton 2009: 371-377 - [c15]Yingbin Liang, Lifeng Lai, John Halloran:
Distributed algorithm for collaborative detection in cognitive radio networks. Allerton 2009: 394-399 - [c14]Yingbin Liang, H. Vincent Poor, Lei Ying:
Secrecy throughput of MANETs with malicious nodes. ISIT 2009: 1189-1193 - [c13]Mari Kobayashi, Yingbin Liang, Shlomo Shamai, Mérouane Debbah:
On the compound MIMO broadcast channels with confidential messages. ISIT 2009: 1283-1287 - [i18]Lalitha Sankar, Yingbin Liang, Narayan B. Mandayam, H. Vincent Poor:
Opportunistic Communications in Fading Multiaccess Relay Channels. CoRR abs/0902.1220 (2009) - [i17]Gerhard Kramer, Yingbin Liang, Shlomo Shamai:
Outer Bounds on the Admissible Source Region for Broadcast Channels with Dependent Sources. CoRR abs/0902.2370 (2009) - [i16]Mari Kobayashi, Yingbin Liang, Shlomo Shamai, Mérouane Debbah:
On the Compound MIMO Broadcast Channels with Confidential Messages. CoRR abs/0906.3200 (2009) - [i15]Hung D. Ly, Tie Liu, Yingbin Liang:
Multiple-Input Multiple-Output Gaussian Broadcast Channels with Common and Confidential Messages. CoRR abs/0907.2599 (2009) - [i14]Ruoheng Liu, Yingbin Liang, H. Vincent Poor:
Fading Cognitive Multiple-Access Channels With Confidential Messages. CoRR abs/0910.4613 (2009) - 2008
- [j8]Yingbin Liang, H. Vincent Poor:
Multiple-Access Channels With Confidential Messages. IEEE Trans. Inf. Theory 54(3): 976-1002 (2008) - [j7]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Secure Communication Over Fading Channels. IEEE Trans. Inf. Theory 54(6): 2470-2492 (2008) - [c12]Yingbin Liang:
Session MA3a: Relaying and cooperation I. ACSCC 2008: 67-68 - [c11]Yingbin Liang, Gerhard Kramer, H. Vincent Poor:
Equivalence of two inner bounds on the capacity region of the broadcast channel. Allerton 2008: 1417-1421 - [c10]Hong Wan, Rong-Rong Chen, Yingbin Liang:
Optimality of beamforming in MIMO multi-access channels via virtual representation. ISIT 2008: 2573-2577 - [c9]Yingbin Liang, Gerhard Kramer, Shlomo Shamai:
Capacity outer bounds for broadcast channels. ITW 2008: 2-4 - [c8]Yingbin Liang, Gerhard Kramer, H. Vincent Poor, Shlomo Shamai:
Recent results on compound wire-tap channels. PIMRC 2008: 1-5 - [c7]Ruoheng Liu, H. Vincent Poor, Predrag Spasojevic, Yingbin Liang:
Nested codes for secure transmission. PIMRC 2008: 1-5 - 2007
- [j6]Yingbin Liang, Venugopal V. Veeravalli:
Cooperative Relay Broadcast Channels. IEEE Trans. Inf. Theory 53(3): 900-928 (2007) - [j5]Yingbin Liang, Venugopal V. Veeravalli, H. Vincent Poor:
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution. IEEE Trans. Inf. Theory 53(10): 3432-3453 (2007) - [j4]Yingbin Liang, Gerhard Kramer:
Rate Regions for Relay Broadcast Channels. IEEE Trans. Inf. Theory 53(10): 3517-3535 (2007) - [c6]Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan B. Mandayam:
Opportunistic Communications in an Orthogonal Multiaccess Relay Channel. ISIT 2007: 1261-1265 - [c5]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Secrecy Capacity Region of Fading Broadcast Channels. ISIT 2007: 1291-1295 - [c4]Jared Grubb, Sriram Vishwanath, Yingbin Liang, H. Vincent Poor:
Secrecy Capacity of Semi-deterministic Wire-tap Channels. ITW 2007: 1-4 - [i13]Lalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan B. Mandayam:
Opportunistic Communications in an Orthogonal Multiaccess Relay Channel. CoRR abs/0704.2651 (2007) - [i12]Ruoheng Liu, Yingbin Liang, H. Vincent Poor, Predrag Spasojevic:
Secure Nested Codes for Type II Wiretap Channels. CoRR abs/0706.3752 (2007) - [i11]Yingbin Liang, Venugopal V. Veeravalli, H. Vincent Poor:
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution. CoRR abs/0707.0969 (2007) - [i10]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Secrecy Capacity Region of Fading Broadcast Channels. CoRR abs/0707.1470 (2007) - [i9]Yingbin Liang, H. Vincent Poor:
Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels. CoRR abs/0708.2732 (2007) - [i8]Yingbin Liang, H. Vincent Poor:
Secure Communications over Fading Channels. CoRR abs/0708.2733 (2007) - [i7]Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai, Sergio Verdú:
Cognitive Interference Channels with Confidential Messages. CoRR abs/0710.2018 (2007) - [i6]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Information-Theoretic Security in Wireless Networks. CoRR abs/0711.0711 (2007) - [i5]Yingbin Liang, H. Vincent Poor, Shlomo Shamai:
Secure Communication over Fading Channels. CoRR abs/cs/0701024 (2007) - 2006
- [c3]Yingbin Liang, Gerhard Kramer:
Capacity Theorems for Cooperative Relay Broadcast Channels. CISS 2006: 1719-1724 - [c2]Yingbin Liang, H. Vincent Poor:
Generalized Multiple Access Channels with Confidential Messages. ISIT 2006: 952-956 - [i4]Yingbin Liang, H. Vincent Poor:
Generalized Multiple Access Channels with Confidential Messages. CoRR abs/cs/0605014 (2006) - [i3]Yingbin Liang, Venugopal V. Veeravalli:
Cooperative Relay Broadcast Channels. CoRR abs/cs/0605016 (2006) - [i2]Yingbin Liang, H. Vincent Poor:
The Generalized Multiple Access Channel with Confidential Messages. CoRR abs/cs/0605084 (2006) - [i1]Yingbin Liang, Gerhard Kramer:
Rate Regions for Relay Broadcast Channels. CoRR abs/cs/0606074 (2006) - 2005
- [b1]Yingbin Liang:
Multiuser Communications With Relaying and User Cooperation. University of Illinois Urbana-Champaign, USA, 2005 - [j3]Venugopal V. Veeravalli, Yingbin Liang, Akbar M. Sayeed:
Correlated MIMO wireless channels: capacity, optimal signaling, and asymptotics. IEEE Trans. Inf. Theory 51(6): 2058-2072 (2005) - [j2]Yingbin Liang, Venugopal V. Veeravalli:
Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and Capacity. IEEE Trans. Inf. Theory 51(9): 3284-3289 (2005) - 2004
- [j1]Yingbin Liang, Venugopal V. Veeravalli:
Capacity of noncoherent time-selective Rayleigh-fading channels. IEEE Trans. Inf. Theory 50(12): 3095-3110 (2004) - [c1]Yingbin Liang, Venugopal V. Veeravalli:
The impact of relaying on the capacity of broadcast channels. ISIT 2004: 403
Coauthor Index
H. Vincent Poor
aka: Harold Vincent Poor
aka: Harold Vincent Poor
[j59] [c88] [i65] [i64] [j51] [j47] [j44] [c71] [i48] [j38] [j37] [c64] [i34] [c62] [c58] [c51] [i26] [j32] [j25] [c41] [c32] [c31] [i21] [j21] [c25] [j19] [j18] [j17] [j16] [j15] [c18] [j12] [j11] [j10] [j9] [c16] [c14] [i18] [i14] [j8] [j7] [c11] [c8] [c7] [j5] [c6] [c5] [c4] [i13] [i12] [i11] [i10] [i9] [i8] [i7] [i6] [i5] [c2] [i4] [i2]
[j62] [j59] [j57] [c90] [c89] [i61] [j54] [j52] [j51] [c81] [j47] [j44] [c71] [i48] [i44] [i42] [j41] [j40] [j39] [c68] [c65] [c64] [i34] [j36] [j35] [c56] [c54] [c52] [c51] [i26] [j32] [j30] [j27] [j26] [c48] [c46] [c45] [c44] [j25] [c39] [c38] [c36] [c34] [i23] [i22] [c29] [c28] [c27] [c26] [c25] [c19] [c17] [j12] [j11] [j10] [j9] [c13] [i17] [i16] [j7] [c9] [c8] [c5] [i10] [i7] [i6] [i5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
