default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhenhuan Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Haoqian Li, Yong Wang, Jing Zeng, Fansong Li
, Zhenhuan Yang, Guiming Mei, Yunguang Ye:
Virtual point tracking method for online detection of relative wheel-rail displacement of railway vehicles. Reliab. Eng. Syst. Saf. 246: 110087 (2024)- [c9]Li Lin, Yamini Sri Krubha, Zhenhuan Yang, Cheng Ren, Thuc Duy Le, Irene Amerini, Xin Wang, Shu Hu:
Robust COVID-19 Detection in CT Images with CLIP. MIPR 2024: 586-592 - [i9]Li Lin, Yamini Sri Krubha, Zhenhuan Yang, Cheng Ren, Thuc Duy Le, Irene Amerini, Xin Wang, Shu Hu:
Robust COVID-19 Detection in CT Images with CLIP. CoRR abs/2403.08947 (2024) - 2023
- [j8]Yi Xu, Zhenhuan Yang:
Economic policy uncertainty and green innovation based on the viewpoint of resource endowment. Technol. Anal. Strateg. Manag. 35(7): 785-798 (2023) - [c8]Zhenhuan Yang, Yan Lok Ko, Kush R. Varshney, Yiming Ying:
Minimax AUC Fairness: Efficient Algorithm with Provable Convergence. AAAI 2023: 11909-11917 - [c7]Shu Hu, Zhenhuan Yang, Xin Wang, Yiming Ying, Siwei Lyu:
Outlier Robust Adversarial Training. ACML 2023: 454-469 - [c6]Zhenhuan Yang, Yingqiang Ge, Congzhe Su, Dingxian Wang, Xiaoting Zhao, Yiming Ying:
Fairness-aware Differentially Private Collaborative Filtering. WWW (Companion Volume) 2023: 927-931 - [i8]Zhenhuan Yang, Yingqiang Ge, Congzhe Su, Dingxian Wang, Xiaoting Zhao, Yiming Ying:
Fairness-aware Differentially Private Collaborative Filtering. CoRR abs/2303.09527 (2023) - [i7]Shu Hu, Zhenhuan Yang, Xin Wang, Yiming Ying, Siwei Lyu:
Outlier Robust Adversarial Training. CoRR abs/2309.05145 (2023) - 2022
- [j7]Meng Xing, Yanbo Zhang, Hongmei Yu, Zhenhuan Yang, Xueling Li, Qiong Li, Yanlin Zhao, Zhiqiang Zhao, Yanhong Luo:
Predict DLBCL patients' recurrence within two years with Gaussian mixture model cluster oversampling and multi-kernel learning. Comput. Methods Programs Biomed. 226: 107103 (2022) - [j6]Xiaoyan Xu, Zhenhuan Yang:
The use of deep learning and AIoT technology in loan word translation. Int. J. Grid Util. Comput. 13(1): 49-56 (2022) - [c5]Zhenhuan Yang, Shu Hu, Yunwen Lei, Kush R. Varshney, Siwei Lyu, Yiming Ying:
Differentially private SGDA for minimax problems. UAI 2022: 2192-2202 - [i6]Zhenhuan Yang, Shu Hu, Yunwen Lei, Kush R. Varshney, Siwei Lyu, Yiming Ying:
Differentially Private SGDA for Minimax Problems. CoRR abs/2201.09046 (2022) - [i5]Zhenhuan Yang, Yan Lok Ko, Kush R. Varshney, Yiming Ying:
Minimax AUC Fairness: Efficient Algorithm with Provable Convergence. CoRR abs/2208.10451 (2022) - 2021
- [j5]Shuanglong Fan, Zhiqiang Zhao, Yanbo Zhang, Hongmei Yu, ChuChu Zheng, XueQian Huang, Zhenhuan Yang, Meng Xing, Qing Lu, Yanhong Luo:
Probability calibration-based prediction of recurrence rate in patients with diffuse large B-cell lymphoma. BioData Min. 14(1) (2021) - [j4]Puyu Wang, Zhenhuan Yang, Yunwen Lei, Yiming Ying, Hai Zhang:
Differentially private empirical risk minimization for AUC maximization. Neurocomputing 461: 419-437 (2021) - [j3]Shuanglong Fan, Zhiqiang Zhao, Hongmei Yu, Lei Wang, ChuChu Zheng, XueQian Huang, Zhenhuan Yang, Meng Xing, Qing Lu, Yanhong Luo:
Applying probability calibration to ensemble methods to predict 2-year mortality in patients with DLBCL. BMC Medical Informatics Decis. Mak. 21(1): 14 (2021) - [c4]Zhenhuan Yang, Yunwen Lei, Siwei Lyu, Yiming Ying:
Stability and Differential Privacy of Stochastic Gradient Descent for Pairwise Learning with Non-Smooth Loss. AISTATS 2021: 2026-2034 - [c3]Yunwen Lei, Zhenhuan Yang, Tianbao Yang, Yiming Ying:
Stability and Generalization of Stochastic Gradient Methods for Minimax Problems. ICML 2021: 6175-6186 - [c2]Zhenhuan Yang, Yunwen Lei, Puyu Wang, Tianbao Yang, Yiming Ying:
Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning. NeurIPS 2021: 20160-20171 - [i4]Yunwen Lei, Zhenhuan Yang, Tianbao Yang, Yiming Ying:
Stability and Generalization of Stochastic Gradient Methods for Minimax Problems. CoRR abs/2105.03793 (2021) - [i3]Zhenhuan Yang, Yunwen Lei, Puyu Wang, Tianbao Yang, Yiming Ying:
Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning. CoRR abs/2111.12050 (2021) - 2020
- [c1]Zhenhuan Yang, Baojian Zhou, Yunwen Lei, Yiming Ying:
Stochastic Hard Thresholding Algorithms for AUC Maximization. ICDM 2020: 741-750 - [i2]Zhenhuan Yang, Baojian Zhou, Yunwen Lei, Yiming Ying:
Stochastic Hard Thresholding Algorithms for AUC Maximization. CoRR abs/2011.02396 (2020)
2010 – 2019
- 2019
- [j2]Zhenhuan Yang, Yiming Ying, Qilong Min:
Online optimization for residential PV-ESS energy system scheduling. Math. Found. Comput. 2(1): 55-71 (2019) - [i1]Wei Shen, Zhenhuan Yang, Yiming Ying, Xiaoming Yuan:
Stability and Optimization Error of Stochastic Gradient Descent for Pairwise Learning. CoRR abs/1904.11316 (2019) - 2012
- [j1]Guoqiang Cui, Xin Chen, Wei Li, Shuyan Wang, Zhenhuan Yang, Cuiqing Meng:
College Students' Perceptions of Cell Phone Integration in Language Learning. Int. J. Inf. Commun. Technol. Educ. 8(4): 11-28 (2012)
Coauthor Index
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-31 21:07 CET 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:
