Changho Suh

Orcid: 0000-0002-3101-4291

According to our database1, Changho Suh authored at least 106 papers between 2002 and 2024.

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

Awards

IEEE Fellow

IEEE Fellow 2023, "For contributions to interference management and distributed storage codes".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs.
IEEE Trans. Inf. Theory, 2024

2023
Improving Fair Training under Correlation Shifts.
Proceedings of the International Conference on Machine Learning, 2023

A Fair Generative Model Using LeCam Divergence.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Communication Principles for Data Science
Springer, ISBN: 978-981-19-8007-7, 2023

2022
Mc2g: An Efficient Algorithm for Matrix Completion With Social and Item Similarity Graphs.
IEEE Trans. Signal Process., 2022

Guest Editorial.
IEEE J. Sel. Areas Inf. Theory, 2022

Equal Experience in Recommender Systems.
CoRR, 2022

Graph-assisted Matrix Completion in a Multi-clustered Graph Model.
Proceedings of the IEEE International Symposium on Information Theory, 2022

The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Community Detection and Matrix Completion With Social and Item Similarity Graphs.
IEEE Trans. Signal Process., 2021

On the Sum Capacity of Dual-Class Parallel Packet-Erasure Broadcast Channels.
IEEE Trans. Commun., 2021

Predicting vehicle collisions using data collected from video games.
Mach. Vis. Appl., 2021

Group Match Prediction via Neural Networks (Long paper).
Proceedings of the Joint Workshop Proceedings of the 3rd Edition of Knowledge-aware and Conversational Recommender Systems (KaRS) and the 5th Edition of Recommendation in Complex Environments (ComplexRec) co-located with 15th ACM Conference on Recommender Systems (RecSys 2021), 2021

Sample Selection for Fair and Robust Training.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

When to Use Graph Side Information in Matrix Completion.
Proceedings of the IEEE International Symposium on Information Theory, 2021

FairBatch: Batch Selection for Model Fairness.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Two-Way Function Computation.
IEEE Trans. Inf. Theory, 2020

Reprogramming GANs via Input Noise Design.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Matrix Completion with Hierarchical Graph Side Information.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A Fair Classifier Using Kernel Density Estimation.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

A Fair Classifier Using Mutual Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

FR-Train: A Mutual Information-Based Approach to Fair and Robust Training.
Proceedings of the 37th International Conference on Machine Learning, 2020

Autoencoder-Based Graph Construction for Semi-supervised Learning.
Proceedings of the Computer Vision - ECCV 2020, 2020

2019
Community Recovery in Hypergraphs.
IEEE Trans. Inf. Theory, 2019

Longer distance continuous variable quantum key distribution protocol with photon subtraction at the receiver.
Quantum Inf. Process., 2019

Community Detection and Matrix Completion with Two-Sided Graph Side-Information.
CoRR, 2019

Synthesizing Differentially Private Datasets using Random Mixing.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Wasserstein GAN Can Perform PCA.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Crash to Not Crash: Learn to Identify Dangerous Vehicles Using a Simulator.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too.
IEEE Trans. Inf. Theory, 2018

A Relay Can Increase Degrees of Freedom in Bursty Interference Networks.
IEEE Trans. Inf. Theory, 2018

Top-K Rank Aggregation From M-Wise Comparisons.
IEEE J. Sel. Top. Signal Process., 2018

Hypergraph Spectral Clustering in the Weighted Stochastic Block Model.
IEEE J. Sel. Top. Signal Process., 2018

Binary Rating Estimation with Graph Side Information.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Hierarchical Coding for Distributed Computing.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

SGD on Random Mixtures: Private Machine Learning under Data Breach Threats.
Proceedings of the 6th International Conference on Learning Representations, 2018

Simulated+Unsupervised Learning With Adaptive Data Generation and Bidirectional Mappings.
Proceedings of the 6th International Conference on Learning Representations, 2018

Alternating Autoencoders for Matrix Completion.
Proceedings of the 2018 IEEE Data Science Workshop, 2018

On the Joint Recovery of Community Structure and Community Features.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Opportunistic Downlink Interference Alignment for Multi-Cell MIMO Networks.
IEEE Trans. Wirel. Commun., 2017

Adversarial Top-K Ranking.
IEEE Trans. Inf. Theory, 2017

Understanding GANs: the LQG Setting.
CoRR, 2017

Optimal Sample Complexity of M-wise Data for Top-K Ranking.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

High-dimensional coded matrix multiplication.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Coding across heterogeneous parallel erasure broadcast channels is useful.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Information-theoretic limits of subspace clustering.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Reconciliation with polar codes constructed using Gaussian approximation for long-distance continuous-variable quantum key distribution.
Proceedings of the International Conference on Information and Communication Technology Convergence, 2017

Active Learning for Top-K Rank Aggregation from Noisy Comparisons.
Proceedings of the 34th International Conference on Machine Learning, 2017

Matrix sparsification for coded matrix multiplication.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Capacity of a two-way function multicast channel.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Computation in Multicast Networks: Function Alignment and Converse Theorems.
IEEE Trans. Inf. Theory, 2016

Degrees of Freedom of Uplink-Downlink Multiantenna Cellular Networks.
IEEE Trans. Inf. Theory, 2016

Information Recovery From Pairwise Measurements.
IEEE Trans. Inf. Theory, 2016

Role of a Relay in Bursty Multiple Access Channels.
CoRR, 2016

Top-K Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal.
CoRR, 2016

To feedback or not to feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Role of a relay in bursty networks with correlated transmissions.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Community Recovery in Graphs with Locality.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Active top-K ranking from noisy comparisons.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Euclidean Information Theory of Networks.
IEEE Trans. Inf. Theory, 2015

Degrees of Freedom of the Rank-Deficient Interference Channel With Feedback.
IEEE Trans. Inf. Theory, 2015

Top-K ranking: An information-theoretic perspective.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

A relay can increase degrees of freedom in bursty mimo interference networks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Information recovery from pairwise measurements: A shannon-theoretic approach.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisons.
Proceedings of the 32nd International Conference on Machine Learning, 2015

Degrees of freedom of bursty multiple access channels with a relay.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Linear Degrees of Freedom of the $X$ -Channel With Delayed CSIT.
IEEE Trans. Inf. Theory, 2014

Information Theory of Matrix Completion.
CoRR, 2014

Opportunistic downlink interference alignment.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Opportunistic interference alignment for MIMO interfering broadcast channels.
Proceedings of the IEEE International Conference on Acoustics, 2014

2013
Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage.
IEEE Trans. Inf. Theory, 2013

Network decomposition for function computation.
Proceedings of the 14th IEEE Workshop on Signal Processing Advances in Wireless Communications, 2013

Bursty interference channel with feedback.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Interactive function computation.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A new achievable scheme for interference relay channels.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Feedback can increase the degrees of freedom of the rank-deficient interference channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A rank ratio inequality and the linear degrees of freedom of X-channel with delayed CSIT.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Degrees of freedom of the MIMO rank-deficient interference channel with feedback.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Interference Channels With Rate-Limited Feedback.
IEEE Trans. Inf. Theory, 2012

Network coding with computation alignment.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Two-way interference channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Approximate feedback capacity of the Gaussian multicast channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Feedback in the K-user interference channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Feedback increases the degrees of freedom of two unicast Gaussian networks.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Feedback and Interference Alignment in Networks.
PhD thesis, 2011

Feedback Capacity of the Gaussian Interference Channel to Within 2 Bits.
IEEE Trans. Inf. Theory, 2011

Exact-Repair MDS Code Construction Using Interference Alignment.
IEEE Trans. Inf. Theory, 2011

Downlink Interference Alignment.
IEEE Trans. Commun., 2011

A Survey on Network Codes for Distributed Storage.
Proc. IEEE, 2011

2010
On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
CoRR, 2010

Exact Regeneration Codes for Distributed Storage Repair Using Interference Alignment
CoRR, 2010

Exact-repair MDS codes for distributed storage using interference alignment.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Feedback Capacity of the Gaussian Interference Channel to Within 1.7075 Bits: the Symmetric Case
CoRR, 2009

Symmetric feedback capacity of the Gaussian interference channel to within one bit.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Resource Allocation for Multicast Services in Multicarrier Wireless Communications.
IEEE Trans. Wirel. Commun., 2008

Interference Alignment for Cellular Networks.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2006
Designing training sequences for carrier frequency estimation in frequency-selective channels.
IEEE Trans. Veh. Technol., 2006

2004
Adaptive spatial modulation for MIMO-OFDM.
Proceedings of the 2004 IEEE Wireless Communications and Networking Conference , 2004

Orthogonal frequency division multiple access with an aggregated sub-channel structure and statistical channel quality measurement.
Proceedings of the 60th IEEE Vehicular Technology Conference, 2004

Dynamic subchannel and bit allocation multicast OFDM systems.
Proceedings of the IEEE 15th International Symposium on Personal, 2004

Recursive construction of Golay sequences.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Channel estimation technique for mitigating ICI in MIMO-OFDM cellular systems.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Comparative study of time-domain and frequency-domain channel estimation in MIMO-OFDM systems.
Proceedings of the IEEE 14th International Symposium on Personal, 2003

Preamble design for channel estimation in MIMO-OFDM systems.
Proceedings of the Global Telecommunications Conference, 2003

2002
Carrier frequency estimation for transmissions with antenna diversity.
Proceedings of the 55th IEEE Vehicular Technology Conference, 2002


  Loading...