default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYin-Wen Chang
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c8]Pu-Chin Chen, Henry Tsai, Srinadh Bhojanapalli, Hyung Won Chung, Yin-Wen Chang, Chun-Sung Ferng:
A Simple and Effective Positional Encoding for Transformers. EMNLP (1) 2021: 2974-2988- [i4]Pu-Chin Chen, Henry Tsai, Srinadh Bhojanapalli, Hyung Won Chung, Yin-Wen Chang, Chun-Sung Ferng:
Demystifying the Better Performance of Position Encoding Variants for Transformer. CoRR abs/2104.08698 (2021) - [i3]Srinadh Bhojanapalli, Ayan Chakrabarti, Andreas Veit, Michal Lukasik, Himanshu Jain, Frederick Liu, Yin-Wen Chang, Sanjiv Kumar:
Leveraging redundancy in attention with Reuse Transformers. CoRR abs/2110.06821 (2021) - 2020
- [c7]Wei-Cheng Chang, Felix X. Yu, Yin-Wen Chang, Yiming Yang, Sanjiv Kumar:
Pre-training Tasks for Embedding-based Large-scale Retrieval. ICLR 2020 - [c6]Chulhee Yun, Yin-Wen Chang, Srinadh Bhojanapalli, Ankit Singh Rawat, Sashank J. Reddi, Sanjiv Kumar:
O(n) Connections are Expressive Enough: Universal Approximability of Sparse Transformers. NeurIPS 2020 - [i2]Wei-Cheng Chang, Felix X. Yu, Yin-Wen Chang, Yiming Yang, Sanjiv Kumar:
Pre-training Tasks for Embedding-based Large-scale Retrieval. CoRR abs/2002.03932 (2020) - [i1]Chulhee Yun, Yin-Wen Chang, Srinadh Bhojanapalli, Ankit Singh Rawat, Sashank J. Reddi, Sanjiv Kumar:
$O(n)$ Connections are Expressive Enough: Universal Approximability of Sparse Transformers. CoRR abs/2006.04862 (2020)
2010 – 2019
- 2017
- [j2]Yin-Wen Chang, Michael Collins:
A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit. Trans. Assoc. Comput. Linguistics 5: 59-71 (2017) - [c5]Yin-Wen Chang, Michael Collins:
Source-Side Left-to-Right or Target-Side Left-to-Right? An Empirical Comparison of Two Phrase-Based Decoding Algorithms. EMNLP 2017: 1495-1499 - 2015
- [b1]Yin-Wen Chang:
Exact and Approximate Methods for Machine Translation Decoding. Columbia University, USA, 2015 - 2014
- [c4]Yin-Wen Chang, Alexander M. Rush
, John DeNero, Michael Collins:
A Constrained Viterbi Relaxation for Bidirectional Word Alignment. ACL (1) 2014: 1481-1490 - 2013
- [c3]Alexander M. Rush, Yin-Wen Chang, Michael Collins:
Optimal Beam Search for Machine Translation. EMNLP 2013: 210-221 - 2011
- [c2]Yin-Wen Chang, Michael Collins:
Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation. EMNLP 2011: 26-37 - 2010
- [j1]Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Michael Ringgaard, Chih-Jen Lin:
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM. J. Mach. Learn. Res. 11: 1471-1490 (2010)
2000 – 2009
- 2008
- [c1]Yin-Wen Chang, Chih-Jen Lin:
Feature Ranking Using Linear SVM. WCCI Causation and Prediction Challenge 2008: 53-64
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-06-20 20:41 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:
