We conduct research in the general area of information processing, storage, machine learning, and communication. Some of the most significant topics of current and recent research are explained below, with some of our example publications on these topics.
Machine Learning
Machine learning has made tremendous advances in recent years. However, theoretical understanding of learning algorithms, particularly deep neural networks, has not kept up at the same level. We studied the generalization error using information theoretical approach. Another area of interest is reinforcement learning, where new algorithms have been proposed dealing with diverse settings.
- W.-Y. Zhao, H.-Y. Chen, T. Liu, R. Tuo, and C. Tian, “From deep additive kernel learning to last-layer Bayesian neural networks via induced prior approximation,” 2025 International Conference on Artificial Intelligence and Statistics (AISTATS) (acceptance rate: 31.3%).
- C. Tian, and S. Shamai, “Broadcast channel cooperative gain: An operational interpretation of partial information decomposition,” MDPI-Entropy (invited), Vol. 27, No. 3, pp. 310(1-10), Mar. 2025.
- M.-Z. Fan, R.-D. Zhou, C. Tian, X.-N. Qian, “Path-guided particle-based sampling,” 2024 International Conference on Machine Learning (ICML), Jul. 2024 (acceptance rate: 27.5%).
- Y.-N. You, R.-D. Zhou, J. Park, H. Xu, C. Tian, Z.-Y. Wang, and Y. Shen, “Latent 3D graph diffusion,” 2024 International Conference on Learning Representations (ICLR), May 2024 (acceptance rate: 31%).
- M. Cheng, R.-D. Zhou, C. Tian, and P. R. Kumar, “Provable policy gradient methods for average-reward Markov potential games,” 2024 International Conference on Artificial Intelligence and Statistics (AISTATS), May 2024 (acceptance rate: 27.6%).
- R.-D. Zhou, T. Liu, M. Cheng, D. Kalathil, P.R. Kumar, C. Tian, “Natural actor-critic for robust reinforcement learning with function approximation,” Thirty-seventh Annual Conference on Neural Information Processing Systems (NeurIPS 2023), Dec. 2023 (acceptance rate: 26.1%).
- L. Fan, R.-D. Zhou, C. Tian, and C. Shen, “Federated linear bandits with finite adversarial actions,” Thirty-seventh Annual Conference on Neural Information Processing Systems (NeurIPS 2023), Dec. 2023 (acceptance rate: 26.1%).
- R. Zhou, C. Tian, and T. Liu, “Stochastic chaining and strengthened information-theoretic generalization bounds,” Journal of the Franklin Institute, Vol. 360, No. 6, pp. 4114-4134, Apr. 2023.
- R. Zhou, T. Liu, D. Kalathil, P.R. Kumar, C. Tian, “Anchor-changing regularized natural policy gradient for multi-objective reinforcement learning,” NeurIPS 2022, Dec. 2022 (acceptance rate: 25.6%).
- R. Zhou and C. Tian, “Approximate top-m arm identification with heterogeneous reward variances,” AISTATS 2022, Mar. 2022 (acceptance rate: 29.2%).
- R.-D. Zhou, C. Tian, and T. Liu, “Individually conditional individual mutual information bound on generalization error,” IEEE Trans. Inform. Theory, Vol. 68, No. 5, pp. 3304-3316, May 2022.
- T. Liu, R. Zhou, D. Kalathil, P.R. Kumar, and C. Tian, “Learning policies with zero or bounded constraint violation for constrained MDPs,” NeurIPS 2021, Dec. 2021 (acceptance rate: 26%).
Joint Source-Channel Coding and Semantic Communication
The current communication network is built with the well known layered structure, however, underlying this structure is the assumption of such separations do not cause much loss of performance. As machine learning becomes prevalent, the question of whether this separation continues to be a good choice becomes less clear.
- C. Tian, J. Chen, and K. Narayanan, “Source-channel separation theorems for distortion perception coding,” Arxiv preprint Jan. 2025.
- C. Tian, J. Chen, S. Diggavi, and S. Shamai, “Matched multiuser Gaussian source channel communications via uncoded schemes,” IEEE Trans. Inform. Theory, Vol. 63, No. 7, pp. 4155-4171, Jul. 2017.
- L. Song, J. Chen, and C. Tian, “Broadcasting correlated vector Gaussians,” IEEE Trans. Inform. Theory, Vol. 61, No. 5, pp. 2465-2477, May 2015.
- J. W. Yoo, T. Liu, S. Shamai, and C. Tian, “Worst-case expected-capacity loss of slow-fading channels,” IEEE Trans. Inform. Theory, Vol. 59, No. 6, pp. 3764-3779, Jun. 2013.
- C. Tian, S. Diggavi, and S. Shamai, “The achievable distortion region of sending a bivariate Gaussian source on the Gaussian broadcast channel,” IEEE Trans. Inform. Theory, Vol. 57, No. 10, pp. 6419-6427, Oct. 2011.
- C. Tian, A. Steiner, S. Shamai, and S. N. Diggavi, “Successive refinement via broadcast: optimizing expected distortion of a Gaussian source over a Gaussian fading channel,” IEEE Trans. Inform. Theory, Vol. 54, No. 7, pp. 2903-2918, Jul. 2008.
Coding for Privacy, Security, and Caching
Modern information system must provide security and privacy guarantees, in addition to the regular data retrieval functionality. Furthermore, caching can be viewed as part of system to be optimized. How can coding be used to improve the efficiency of such systems? We rely on algebraic and combinatoric structures to construct codes, where information theoretic outer bounds can not only provide theoretic performance limit (some of which are obtained computationally), but also clues in code constructions.
- Y.-S. Huang, W.-Y Zhao, R.-D Zhou, and C. Tian, “Weakly private information retrieval from heterogeneously trusted servers,” IEEE Int. Symp. Information Theory (ISIT), Athens, Greece, Jun. 2024
- C. Tian, H. Sun, and J. Chen, “A Shannon-theoretic approach to the storage–retrieval trade-off in PIR systems,” MDPI-Information (invited), Jan. 2023.
- C.-Y. Qian, R.-D. Zhou, C. Tian, and T. Liu, “Improved weakly private information retrieval codes,” IEEE Int. Symp. Information Theory (ISIT), Espoo, Finland, Jun. 2022.
- R.-D. Zhou, C. Tian, H. Sun, and J. S. Plank, “Two-level private information retrieval,” IEEE Journal on Selected Areas in Information Theory, to appear, 2022.
- T. Guo, R.-D. Zhou, and C. Tian, “New results on the storage-retrieval tradeoff in private information retrieval systems,” IEEE Journal on Selected Areas in Information Theory, Vol. 2, No. 1, pp. 403-414, Mar. 2021.
- C. Tian, “On the storage cost of private information retrieval,” IEEE Trans. Inform. Theory, Vol. 66, No. 11, pp. 7539-7549, Dec. 2020.
- R.-D. Zhou, C. Tian, H. Sun, and T. Liu, “Capacity-achieving private information retrieval codes from MDS-coded databases with minimum message size,” IEEE Trans. Inform. Theory, Vol. 66, No. 8, pp. 4904-4916, Aug. 2020.
- T. Guo, R.-D. Zhou, and C. Tian, “On the information leakage in private information retrieval systems,” IEEE Trans. on Information Forensics and Security, Vol. 15, pp. 2999-3012, Mar. 2020.
- C. Tian, H. Sun, and J. Chen, “Capacity-achieving private information retrieval codes with optimal message size and upload cost,” IEEE Trans. Inform. Theory, Vol. 65, No. 11, pp. 7613-7627, Nov. 2019.
- K. Zhang and C. Tian, “Fundamental limits of coded caching: from uncoded prefetching to coded prefetching,” IEEE Journal of Selected Areas in Communications, Vol. 36, No. 6, pp. 1153-1164, Jun. 2018.
- C. Tian, “Symmetry, outer bounds, and code constructions: A computer-aided investigation on the fundamental limits of caching,” Entropy, Vol. 20, No. 8, 603.1-43, Aug. 2018.
- C. Tian and J. Chen, “Caching and delivery via interference elimination,” IEEE Trans. Inform. Theory, Vol. 64, No. 3, pp. 1548-1560, Mar. 2018.
Computational Approaches to Information Theoretic Converses
Proving outer bounds or converses for complex information systems require specialized skills and extensive training in information theory, which means significant human diligence and intelligence. As modern computer software and hardware become more and more powerful, bordering on the edge of true artificial intelligence, we must ask whether computers can be used to at least aid this human-heavy process? We show that this is indeed possible, and in fact can be tremendously effective, by providing concrete solutions to several important problems of current research interest.
- W.-J. Chen and C. Tian, “A new approach to compute information theoretic outer bounds and its application to regenerating codes,” IEEE Int. Symp. Information Theory (ISIT), Espoo, Finland, Jun. 2022.
- C. Tian, J. S. Plank, B. Hurst, and R.-D. Zhou, “Computational techniques for investigating information theoretic limits of information systems,” MDPI-Information (invited), Vol. 12, No. 2, Feb. 2021, pp. 82.1-16.
- C. Tian, “On the storage cost of private information retrieval,” IEEE Trans. Inform. Theory, Vol. 66, No. 11, pp. 7539-7549, Dec. 2020.
- C. Tian, “Symmetry, outer bounds, and code constructions: A computer-aided investigation on the fundamental limits of caching,” Entropy, Vol. 20, No. 8, 603.1-43, Aug. 2018.
- K. Zhang and C. Tian, “On the symmetry reduction of information inequalities,” IEEE Trans. Communications, Vol. 66, No. 6, pp. 2396-2408, Jun. 2018.
- S. Shao, T. Liu, C. Tian, and C. Shen, “On the tradeoff region of secure exact-repair regenerating codes,” IEEE Trans. Inform. Theory, Vol. 63, No. 11, pp. 7253-7266, Nov. 2017.
- C. Tian, “Characterizing the rate-region of the (4,3,3) exact-repair regenerating codes,” IEEE Journal on Selected Areas in Communications, Vol. 32, No. 5, 967-975, May 2014.
Coding for Distributed Data Storage
In this information age, users and digital devices are constantly producing data, and the need for reliable data storage for the data in the cloud environment has grown exponentially. Next generation of data storage systems have to be reliable, distributed and agile, with a high-availability guarantee. We are working on various aspects of this problem, which includes, e.g., new erasure codes with reduced repair bandwidth requirement, system designs for distributed data storage, secure distributed storage codes, distributed data storage for lossy compression.
- T. Zhou and C. Tian, “Fast erasure coding for data storage: A comprehensive study of the acceleration techniques,” The 17th USENIX Conference on File and Storage Technologies (FAST ’19), Feb. 2019 (acceptance rate: 18%); source code repository.
- J. Li, X.-H. Tang, and C. Tian, “A generic transformation to enable optimal repair in MDS codes for distributed storage systems,” IEEE Trans. Inform. Theory, Vol. 64, No. 9, pp. 6257-6267, Sep. 2018.
- C. Tian and T. Liu, “Multilevel diversity coding with regeneration,” IEEE Trans. Inform. Theory, Vol. 62, No. 9, pp. 4833-4847, Sep. 2016.
- C. Tian, B. Sasidharan, V. Aggarwal, V. Vaishampayan, and P. Vijay Kumar, “Layered exact-repair regenerating codes via embedded erasure correction and block designs,” IEEE Trans. Inform. Theory, Vol. 61, No. 4, pp. 1933-1947, Apr. 2015.
- C. Tian, “Characterizing the rate-region of the (4,3,3) exact-repair regenerating codes,” IEEE Journal on Selected Areas in Communications, Vol. 32, No. 5, 967-975, May 2014.
Coding and Processing of Visual Information
Images as a special type of signals have its own characteristics, and require many special techniques in coding and processing. For example, in multiple description image coding, information theoretic optimal solutions may not suit the best for images. In 3D image processing and object reconstruction, tools such as bilateral filtering turn out to be quite effective, and optimization techniques can be more effectively used by incorporating visual clues. Even for the classical image compression problem, simpler codec proves to be useful: the TCE embedded image codec (ICASSP 04) (available in QccPack software library) has been used by many researchers.
- C. Tian and S. Krishnan, “Accelerated bilateral filtering with block skipping,” IEEE Signal Processing Letters, Vol. 20, No. 5, pp. 419-422, May 2013.
- U. Samarawickrama, J. Liang, and C. Tian, “M-channel multiple description coding with two-rate predictive coding and staggered quantization,” IEEE Trans. Circuits and Systems for Video Technology, Vol. 20, No. 7, pp. 933-944, Jul. 2010.
- G. Sun, U. Samarawickrame, J. Liang, C. Tian, C. Tu, and T. D. Tran, “Multiple description coding with prediction compensation,” IEEE Trans. Image Processing, Vol. 18, No. 5, pp. 1037-1047, May 2009.
- C. Tian, M. Masry, and H. Lipson, “Physical sketching: reconstruction and analysis of 3D objects from freehand sketches,,” Journal of Computer Aided Design, Special Issue on Computer Support for Conceptual Design, Vol. 41, No. 3, pp. 147-158, Mar. 2009.
- C. Tian and S. S. Hemami, “A new class of multiple description scalar quantizers and its application to image coding,” IEEE Signal Processing Letters, Vol 12, No. 4, pp. 329-332, Apr. 2005.
An Approximate Approach to Network Information Theory
Network information theory traditionally asks for complete characterizations of network communication problems, partly motivated by the elegant solution on point-to-point channels given by Shannon. However on most cases, such characterizations turn out to be extremely difficult to find. We develop a methodology to instead find approximate solutions, which in most cases are much tractable and in fact leads to nontrivial insight into the problem.
- S. Avestimehr, S. N. Diggavi, C. Tian, and D. N. S. Tse, “An approximation approach to network information theory,” Foundations and Trends in Communications and Information Theory, Vol. 12, No. 1-2, pp. 1-183, Sep. 2015.
- C. Tian, J. Chen, S. N. Diggavi, and S. Shamai, “Optimality and approximate optimality of source-channel separation in networks,” IEEE Trans. Inform. Theory, Vol. 60, No. 2, pp. 904-918, Feb. 2014.
- C. Tian, S. Diggavi and S. Shamai, “Approximate characterizations for the Gaussian source broadcast distortion region,” IEEE Trans. Inform. Theory, Vol. 57, No. 1, pp. 124-136, Jan. 2011.
- S. Mohajer, C. Tian, and S. N. Diggavi, “Asymmetric multilevel diversity coding and asymmetric multiple descriptions,” IEEE Trans. Inform. Theory, Vol. 56, No. 9, pp. 4367-4387, Sep. 2010.
- C. Tian, S. Mohajer, and S. N. Diggavi, “Approximating the Gaussian multiple description rate region under symmetric distortion constraints,” IEEE Trans. Inform. Theory, Vol. 55, No. 8, pp. 3869-3891, Aug. 2009.
Lossy Multiuser Source Coding
When multiple users are present in a communication problem, source coding techniques to combat the uncertainty in the communication systems become necessary. Moreover, various additional information may be available to the encoder or the decoders, and “side information” is a general term to model such information. The dependence structure between the source and the side information is not fixed, and more complex coding strategy has to be used.
- C.T.K. Ng, C. Tian, A. Goldsmith, and S. Shamai, “Distortion minimization in Gaussian source coding with fading side-information channel,” IEEE Trans. Inform. Theory, Vol. 58, No. 9, pp. 5725-5739, Sep. 2012.
- C. Tian and J. Chen, “New coding schemes for the symmetric K-description problem ,” IEEE Trans. Inform. Theory, Vol. 56, No. 10, pp. 5344-5365, Oct. 2010.
- C. Tian and J. Chen, “Remote vector Gaussian source coding with decoder side information under mutual information and distortion constraints,” IEEE Trans. Inform. Theory, Vol. 55, No. 10, pp. 4676-4680, Oct. 2009.
- C. Tian and S. Diggavi, “Side-information scalable source coding,” IEEE Trans. Inform. Theory, Vol. 54, No. 12, pp. 5591-5608, Dec. 2008.
- C. Tian and S. Diggavi, “On multistage successive refinement for Wyner-Ziv source coding with degraded side information,” IEEE Trans. Inform. Theory, Vol. 53, No. 8, pp. 2946-2960, Aug. 2007.
Channel Capacity and Code Designs
Channel capacity characterization and code designs are two central themes in information and communication theory. For broadcast channels, the capacity region is unknown, and the two papers below include some progress toward solving this difficult problem. Constant weight code is a classical problem for which we developed a novel algorithm; polar code, on the other hand, is a new development in the field, based on which we developed optimal codes for communication on the parallel channel.
- Q. Shi, L. Song, C. Tian, J. Chen, and S. Dumitrescu, “Polar codes for multiple descriptions,” IEEE Trans. Inform. Theory, Vol. 61, No. 1, pp. 107-119, Jan. 2015.
- J. W. Yoo, T. Liu, S. Shamai, and C. Tian, “Worst-case expected-capacity loss of slow-fading channels,” IEEE Trans. Inform. Theory, Vol. 59, No. 6, pp. 3764-3779, Jun. 2013.
- E. Hof, I. Sason, S. Shamai and C. Tian, “Capacity-achieving polar codes for arbitrarily permuted parallel channels,” IEEE Trans. Inform. Theory, Vol. 59, No. 3, pp. 1505-1516, Mar. 2013.
- C. Tian, “Latent capacity region: a case study on symmetric broadcast with common messages,” IEEE Trans. Inform. Theory, Vol. 57, No. 6, pp. 3273-3285, Jun. 2011.
- C. Tian, V. Vaishampayan and N.J.A. Sloane, “A coding algorithm for constant weight vectors: a geometric approach based on dissections,” IEEE Trans. Inform. Theory, Vol. 55, No. 3, pp. 1051-1060, Mar. 2009.