default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHansi Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Zhen Hao Wong, Hansi Yang, Xiaoyi Fu, Quanming Yao:
Loss-aware Curriculum Learning for Heterogeneous Graph Neural Networks. CoRR abs/2402.18875 (2024)- [i9]Lifeng Shen, Jincheng Yu, Hansi Yang, James T. Kwok:
Mixup Augmentation with Multiple Interpolations. CoRR abs/2406.01417 (2024) - [i8]Hansi Yang, James T. Kwok:
Communication-Efficient and Privacy-Preserving Decentralized Meta-Learning. CoRR abs/2406.13183 (2024) - [i7]Bin Yang, Boda Liu, Yilong Han, Xin Meng, Yifan Wang, Hansi Yang, Jianzhuang Xia:
Multiagent Reinforcement Learning Enhanced Decision-making of Crew Agents During Floor Construction Process. CoRR abs/2409.01060 (2024) - 2023
- [c7]Hansi Yang
, Yongqi Zhang, Quanming Yao, James T. Kwok:
Positive-Unlabeled Node Classification with Structure-aware Graph Learning. CIKM 2023: 4390-4394 - [c6]Yunhao Gou, Tom Ko, Hansi Yang, James T. Kwok, Yu Zhang, Mingxuan Wang:
Leveraging per Image-Token Consistency for Vision-Language Pre-training. CVPR 2023: 19155-19164 - [c5]Weisen Jiang, Hansi Yang, Yu Zhang, James T. Kwok:
An Adaptive Policy to Employ Sharpness-Aware Minimization. ICLR 2023 - [c4]Zhenqian Shen, Hansi Yang, Yong Li, James T. Kwok, Quanming Yao:
Efficient Hyper-parameter Optimization with Cubic Regularization. NeurIPS 2023 - [i6]Weisen Jiang, Hansi Yang, Yu Zhang, James T. Kwok:
An Adaptive Policy to Employ Sharpness-Aware Minimization. CoRR abs/2304.14647 (2023) - [i5]Hansi Yang, Yongqi Zhang, Quanming Yao, James T. Kwok:
Positive-Unlabeled Node Classification with Structure-aware Graph Learning. CoRR abs/2310.13538 (2023) - 2022
- [j1]Quanming Yao, Hansi Yang, En-Liang Hu, James T. Kwok:
Efficient Low-Rank Semidefinite Programming With Robust Loss Functions. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 6153-6168 (2022) - [c3]Hansi Yang, James T. Kwok:
Efficient Variance Reduction for Meta-learning. ICML 2022: 25070-25095 - [i4]Hansi Yang, Yongqi Zhang, Quanming Yao:
AutoWeird: Weird Translational Scoring Function Identified by Random Search. CoRR abs/2207.11673 (2022) - [i3]Yunhao Gou, Tom Ko, Hansi Yang, James T. Kwok, Yu Zhang, Mingxuan Wang:
Leveraging per Image-Token Consistency for Vision-Language Pre-training. CoRR abs/2211.15398 (2022) - 2021
- [i2]Hansi Yang, Quanming Yao, James T. Kwok:
Tensorizing Subgraph Search in the Supernet. CoRR abs/2101.01078 (2021) - 2020
- [c2]Quanming Yao, Hansi Yang, Bo Han, Gang Niu, James Tin-Yau Kwok:
Searching to Exploit Memorization Effect in Learning with Noisy Labels. ICML 2020: 10789-10798
2010 – 2019
- 2019
- [c1]Hansi Yang, Wei-Qiang Zhang:
Music Genre Classification Using Duplicated Convolutional Layers in Neural Networks. INTERSPEECH 2019: 3382-3386 - [i1]Hansi Yang, Quanming Yao, Bo Han, Gang Niu:
Searching to Exploit Memorization Effect in Learning from Corrupted Labels. CoRR abs/1911.02377 (2019)
Coauthor Index
aka: James Tin-Yau Kwok
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-11 17:31 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:
