Haewon Jeong

Orcid: 0009-0008-3254-4834

According to our database1, Haewon Jeong authored at least 32 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Survey on Data Selection for Language Models.
Trans. Mach. Learn. Res., 2024

LLMs are Biased Teachers: Evaluating LLM Bias in Personalized Education.
CoRR, 2024

ReDiFine: Reusable Diffusion Finetuning for Mitigating Degradation in the Chain of Diffusion.
CoRR, 2024

Correlated Privacy Mechanisms for Differentially Private Distributed Mean Estimation.
CoRR, 2024

Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Coded Computing for Fault-Tolerant Parallel QR Decomposition.
CoRR, 2023

Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise.
CoRR, 2023

Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Beyond Adult and COMPAS: Fairness in Multi-Class Prediction.
CoRR, 2022

Beyond Adult and COMPAS: Fair Multi-Class Prediction via Information Projection.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Differentially Private Distributed Matrix Multiplication: Fundamental Accuracy-Privacy Trade-Off Limits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Fairness without Imputation: A Decision Tree Approach for Fair Prediction with Missing Values.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
ϵ-Approximate Coded Matrix Multiplication Is Nearly Twice as Efficient as Exact Multiplication.
IEEE J. Sel. Areas Inf. Theory, 2021

E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
On the Optimal Recovery Threshold of Coded Matrix Multiplication.
IEEE Trans. Inf. Theory, 2020

Addressing Unreliability in Emerging Devices and Non-von Neumann Architectures Using Coded Computing.
Proc. IEEE, 2020

Coded QR Decomposition.
Proceedings of the IEEE International Symposium on Information Theory, 2020

3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication.
Proceedings of the Euro-Par 2020: Parallel Processing, 2020

2019
Energy-Adaptive Error Correcting for Dynamic and Heterogeneous Networks.
Proc. IEEE, 2019

Systematic Matrix Multiplication Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Robust Molecular Dynamics Simulations Using Coded FFT Algorithm.
Proceedings of the IEEE International Conference on Acoustics, 2019

2018
A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication.
CoRR, 2018

Coded FFT and Its Communication Overhead.
CoRR, 2018

A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

Locally Recoverable Coded Matrix Multiplication.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

Masterless Coded Computing: A Fully-Distributed Coded FFT Algorithm.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Energy-adaptive polar codes: Trading off reliability and decoder circuit energy.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2015
Energy-adaptive codes.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

An information theoretic technique for harnessing attenuation of high spatial frequencies to design ultra-high-density EEG.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
mTCP: a Highly Scalable User-level TCP Stack for Multicore Systems.
Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, 2014

2012
Flashcast.
Proceedings of the 18th Asia-Pacific Conference on Communications, 2012


  Loading...