default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaewon Jeong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Alon Albalak, Yanai Elazar, Sang Michael Xie, Shayne Longpre, Nathan Lambert, Xinyi Wang, Niklas Muennighoff, Bairu Hou, Liangming Pan, Haewon Jeong, Colin Raffel, Shiyu Chang, Tatsunori Hashimoto, William Yang Wang:
A Survey on Data Selection for Language Models. Trans. Mach. Learn. Res. 2024 (2024)- [c20]Jin Lee, Zheng Zhang, Sofía González-García, Haewon Jeong:
Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm. ISIT 2024: 3095-3100 - [i13]Alon Albalak, Yanai Elazar, Sang Michael Xie, Shayne Longpre, Nathan Lambert, Xinyi Wang, Niklas Muennighoff, Bairu Hou, Liangming Pan, Haewon Jeong, Colin Raffel, Shiyu Chang, Tatsunori Hashimoto, William Yang Wang:
A Survey on Data Selection for Language Models. CoRR abs/2402.16827 (2024) - [i12]Jin Lee, Sofía González-García, Zheng Zhang, Haewon Jeong:
Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm. CoRR abs/2405.13946 (2024) - [i11]Sajani Vithana, Viveck R. Cadambe, Flávio P. Calmon, Haewon Jeong:
Correlated Privacy Mechanisms for Differentially Private Distributed Mean Estimation. CoRR abs/2407.03289 (2024) - [i10]Youngseok Yoon, Dainong Hu, Iain Weissburg, Yao Qin, Haewon Jeong:
ReDiFine: Reusable Diffusion Finetuning for Mitigating Degradation in the Chain of Diffusion. CoRR abs/2407.17493 (2024) - 2023
- [c19]Viveck R. Cadambe
, Haewon Jeong, Flávio P. Calmon:
Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise. ISIT 2023: 2207-2212 - [i9]Viveck R. Cadambe, Ateet Devulapalli, Haewon Jeong, Flávio P. Calmon:
Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise. CoRR abs/2309.16105 (2023) - [i8]Quang Minh Nguyen, Iain Weissburg, Haewon Jeong:
Coded Computing for Fault-Tolerant Parallel QR Decomposition. CoRR abs/2311.11943 (2023) - 2022
- [c18]Haewon Jeong, Hao Wang, Flávio P. Calmon:
Fairness without Imputation: A Decision Tree Approach for Fair Prediction with Missing Values. AAAI 2022: 9558-9566 - [c17]Ateet Devulapalli, Viveck R. Cadambe, Flávio P. Calmon, Haewon Jeong:
Differentially Private Distributed Matrix Multiplication: Fundamental Accuracy-Privacy Trade-Off Limits. ISIT 2022: 2016-2021 - [c16]Wael Alghamdi, Hsiang Hsu, Haewon Jeong, Hao Wang, Peter Michalák, Shahab Asoodeh, Flávio P. Calmon:
Beyond Adult and COMPAS: Fair Multi-Class Prediction via Information Projection. NeurIPS 2022 - [i7]Wael Alghamdi, Hsiang Hsu, Haewon Jeong, Hao Wang, P. Winston Michalak, Shahab Asoodeh, Flávio P. Calmon:
Beyond Adult and COMPAS: Fairness in Multi-Class Prediction. CoRR abs/2206.07801 (2022) - 2021
- [j4]Haewon Jeong, Ateet Devulapalli, Viveck R. Cadambe, Flávio P. Calmon:
ϵ-Approximate Coded Matrix Multiplication Is Nearly Twice as Efficient as Exact Multiplication. IEEE J. Sel. Areas Inf. Theory 2(3): 845-854 (2021) - [c15]Viveck R. Cadambe, Flávio P. Calmon, Ateet Devulapalli, Haewon Jeong:
E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication. ISIT 2021: 1582-1587 - [i6]Haewon Jeong, Ateet Devulapalli, Viveck R. Cadambe, Flávio P. Calmon:
ε-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication. CoRR abs/2105.01973 (2021) - [i5]Haewon Jeong, Hao Wang, Flávio P. Calmon:
Fairness without Imputation: A Decision Tree Approach for Fair Prediction with Missing Values. CoRR abs/2109.10431 (2021) - 2020
- [j3]Sanghamitra Dutta, Haewon Jeong, Yaoqing Yang, Viveck R. Cadambe, Tze Meng Low, Pulkit Grover:
Addressing Unreliability in Emerging Devices and Non-von Neumann Architectures Using Coded Computing. Proc. IEEE 108(8): 1219-1234 (2020) - [j2]Sanghamitra Dutta, Mohammad Fahim, Farzin Haddadpour, Haewon Jeong, Viveck R. Cadambe, Pulkit Grover:
On the Optimal Recovery Threshold of Coded Matrix Multiplication. IEEE Trans. Inf. Theory 66(1): 278-301 (2020) - [c14]Haewon Jeong, Yaoqing Yang, Vipul Gupta, Christian Engelmann, Tze Meng Low, Viveck R. Cadambe, Kannan Ramchandran, Pulkit Grover:
3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication. Euro-Par 2020: 392-407 - [c13]Quang Minh Nguyen, Haewon Jeong, Pulkit Grover:
Coded QR Decomposition. ISIT 2020: 191-196
2010 – 2019
- 2019
- [j1]Haewon Jeong, Pulkit Grover:
Energy-Adaptive Error Correcting for Dynamic and Heterogeneous Networks. Proc. IEEE 107(4): 765-777 (2019) - [c12]Yuk Wong, Yuqiu Zhang, Haewon Jeong, Pulkit Grover:
Robust Molecular Dynamics Simulations Using Coded FFT Algorithm. ICASSP 2019: 8197-8201 - [c11]Haewon Jeong, Yaoqing Yang, Pulkit Grover:
Systematic Matrix Multiplication Codes. ISIT 2019: 1-5 - 2018
- [c10]Haewon Jeong, Fangwei Ye, Pulkit Grover:
Locally Recoverable Coded Matrix Multiplication. Allerton 2018: 715-722 - [c9]Haewon Jeong, Tze Meng Low, Pulkit Grover:
Masterless Coded Computing: A Fully-Distributed Coded FFT Algorithm. Allerton 2018: 887-894 - [c8]Utsav Sheth, Sanghamitra Dutta, Malhar Chaudhari, Haewon Jeong, Yaoqing Yang, Jukka Kohonen, Teemu Roos, Pulkit Grover:
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation. IEEE BigData 2018: 1113-1120 - [c7]Sanghamitra Dutta, Ziqian Bai, Haewon Jeong, Tze Meng Low, Pulkit Grover:
A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codes. ISIT 2018: 1585-1589 - [i4]Sanghamitra Dutta, Mohammad Fahim, Farzin Haddadpour, Haewon Jeong, Viveck R. Cadambe, Pulkit Grover:
On the Optimal Recovery Threshold of Coded Matrix Multiplication. CoRR abs/1801.10292 (2018) - [i3]Haewon Jeong, Tze Meng Low, Pulkit Grover:
Coded FFT and Its Communication Overhead. CoRR abs/1805.09891 (2018) - [i2]Sanghamitra Dutta, Ziqian Bai, Haewon Jeong, Tze Meng Low, Pulkit Grover:
A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication. CoRR abs/1811.10751 (2018) - [i1]Utsav Sheth, Sanghamitra Dutta, Malhar Chaudhari, Haewon Jeong, Yaoqing Yang, Jukka Kohonen, Teemu Roos, Pulkit Grover:
An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation. CoRR abs/1811.11811 (2018) - 2017
- [c6]Mohammad Fahim, Haewon Jeong, Farzin Haddadpour, Sanghamitra Dutta, Viveck R. Cadambe, Pulkit Grover:
On the optimal recovery threshold of coded matrix multiplication. Allerton 2017: 1264-1270 - [c5]Haewon Jeong, Christopher G. Blake, Pulkit Grover:
Energy-adaptive polar codes: Trading off reliability and decoder circuit energy. ISIT 2017: 2608-2612 - 2015
- [c4]Haewon Jeong, Pulkit Grover:
Energy-adaptive codes. Allerton 2015: 132-139 - [c3]Pulkit Grover, Jeffrey A. Weldon, Shawn K. Kelly, Praveen Venkatesh, Haewon Jeong:
An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEG. Allerton 2015: 901-908 - 2014
- [c2]Eunyoung Jeong, Shinae Woo, Muhammad Asim Jamshed, Haewon Jeong, Sunghwan Ihm, Dongsu Han, KyoungSoo Park:
mTCP: a Highly Scalable User-level TCP Stack for Multicore Systems. NSDI 2014: 489-502 - 2012
- [c1]Haewon Jeong, Si-Hyeon Lee, Sae-Young Chung:
Flashcast. APCC 2012: 448-449
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-12 23:00 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:
