default search action
Che-Ping Tsai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Yu-Hsiang Wang, Andrew Bai, Che-Ping Tsai, Cho-Jui Hsieh:
CLUE: Concept-Level Uncertainty Estimation for Large Language Models. CoRR abs/2409.03021 (2024) - 2023
- [j1]Che-Ping Tsai, Chih-Kuan Yeh, Pradeep Ravikumar:
Faith-Shap: The Faithful Shapley Interaction Index. J. Mach. Learn. Res. 24: 94:1-94:42 (2023) - [c7]Che-Ping Tsai, Jiong Zhang, Hsiang-Fu Yu, Eli Chien, Cho-Jui Hsieh, Pradeep Kumar Ravikumar:
Representer Point Selection for Explaining Regularized High-dimensional Models. ICML 2023: 34469-34490 - [c6]Che-Ping Tsai, Chih-Kuan Yeh, Pradeep Ravikumar:
Sample based Explanations via Generalized Representers. NeurIPS 2023 - [i8]Che-Ping Tsai, Jiong Zhang, Eli Chien, Hsiang-Fu Yu, Cho-Jui Hsieh, Pradeep Ravikumar:
Representer Point Selection for Explaining Regularized High-dimensional Models. CoRR abs/2305.20002 (2023) - [i7]Che-Ping Tsai, Chih-Kuan Yeh, Pradeep Ravikumar:
Sample based Explanations via Generalized Representers. CoRR abs/2310.18526 (2023) - 2022
- [c5]Che-Ping Tsai, Adarsh Prasad, Sivaraman Balakrishnan, Pradeep Ravikumar:
Heavy-tailed Streaming Statistical Estimation. AISTATS 2022: 1251-1282 - [i6]Che-Ping Tsai, Chih-Kuan Yeh, Pradeep Ravikumar:
Faith-Shap: The Faithful Shapley Interaction Index. CoRR abs/2203.00870 (2022) - 2021
- [i5]Che-Ping Tsai, Adarsh Prasad, Sivaraman Balakrishnan, Pradeep Ravikumar:
Heavy-tailed Streaming Statistical Estimation. CoRR abs/2108.11483 (2021) - 2020
- [c4]Che-Ping Tsai, Hung-yi Lee:
Order-Free Learning Alleviating Exposure Bias in Multi-Label Classification. AAAI 2020: 6038-6045
2010 – 2019
- 2019
- [c3]Che-Ping Tsai, Hung-yi Lee:
Adversarial Learning of Label Dependency: A Novel Framework for Multi-class Classification. ICASSP 2019: 3847-3851 - [c2]Kuan-Yu Chen, Che-Ping Tsai, Da-Rong Liu, Hung-yi Lee, Lin-Shan Lee:
Completely Unsupervised Phoneme Recognition by a Generative Adversarial Network Harmonized with Iteratively Refined Hidden Markov Models. INTERSPEECH 2019: 1856-1860 - [i4]Kuan-Yu Chen, Che-Ping Tsai, Da-Rong Liu, Hung-yi Lee, Lin-Shan Lee:
Completely Unsupervised Phoneme Recognition By A Generative Adversarial Network Harmonized With Iteratively Refined Hidden Markov Models. CoRR abs/1904.04100 (2019) - [i3]Che-Ping Tsai, Hung-yi Lee:
Order-free Learning Alleviating Exposure Bias in Multi-label Classification. CoRR abs/1909.03434 (2019) - 2018
- [c1]Che-Ping Tsai, Yi-Lin Tuan, Lin-Shan Lee:
Transcribing Lyrics from Commercial Song Audio: the First Step Towards Singing Content Processing. ICASSP 2018: 5749-5753 - [i2]Che-Ping Tsai, Yi-Lin Tuan, Lin-Shan Lee:
Transcribing Lyrics From Commercial Song Audio: The First Step Towards Singing Content Processing. CoRR abs/1804.05306 (2018) - [i1]Che-Ping Tsai, Hung-yi Lee:
Adversarial Learning of Label Dependency: A Novel Framework for Multi-class Classification. CoRR abs/1811.04689 (2018)
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-10 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint