Copyright notice: the material here is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons using this information are expected to adhere to the terms and constraints by author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.
Selected Journal Publications
R.-D. Zhou, C. Tian, and T. Liu, “Exactly tight information-theoretic generalization error bound for the quadratic Gaussian problem,” IEEE Journal on Selected Areas in Information Theory (JSAIT), Vol. 5, pp. 94-104, Mar. 2024.
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. (2020-2021 IEEE Data Storage Best Student Paper Award).
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; conference version (IEEE Jack Wolf ISIT Best Student Paper Award (to Jie Li)).
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, pp. 967-975, May 2014 (2014 IEEE Data Storage Best Paper Award).
Selected Conference Publications
M.-Z. Fan, R.-D. Zhou, C. Tian, X.-N. Qian, “Path-guided particle-based sampling,” 2024 International Conference on Machine Learning (ICML), accepted (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), accepted (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) (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.-D. Zhou, T. Liu, D. Kalathil, P.R. Kumar, C. Tian, “Anchor-changing regularized natural policy gradient for multi-objective reinforcement learning,” Thirty-sixth Annual Conference on Neural Information Processing Systems (NeurIPS 2022), Dec. 2022 (acceptance rate: 25.6%).
R.-D. Zhou and C. Tian, “Approximate top-m arm identification with heterogeneous reward variances,” 2022 International Conference on Artificial Intelligence and Statistics (AISTATS), Mar. 2022 (acceptance rate: 29.2%).
T. Liu, R.-D. Zhou, D. Kalathil, P.R. Kumar, C. Tian, “Learning policies with zero or bounded constraint violation for constrained MDPs,” Thirty-fifth Annual Conference on Neural Information Processing Systems (NeurIPS 2021), Dec. 2021 (acceptance rate: 26%).
T.-L. 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.
V. Aggarwal, C. Tian, V. Vaishampayan, Y.-F. Chen, “Distributed data storage systems with opportunistic repair,” IEEE Infocom, Toronto, Canada, Apr. 2014 (acceptance rate: 19.4%).
Edited Book and Monograph
1. 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.
2. Information Theory and Machine Learning, MDPI, 2022, L. Zheng and C. Tian (Eds.)
Recent Journal Publications
65. S. Majumder, L. Dong, F. Doudi, Y.-T Cai, C. Tian, D. Kalathil, K. Ding, A. A. Thatte, N. Li, and L. Xie, “Exploring the capabilities and limitations of large language models in the electric energy sector,” Joule, Vol. 8, No. 6, pp. 1544-1549, Jun. 2024.
64. R.-D. Zhou, C. Tian, and T. Liu, “Exactly tight information-theoretic generalization error bound for the quadratic Gaussian problem,” IEEE Journal on Selected Areas in Information Theory (JSAIT), Vol. 5, pp. 94-104, Mar. 2024.
63. R.-D. 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.
62. C. Tian, H. Sun, and J. Chen, “A Shannon-theoretic approach to the storage–retrieval trade-off in PIR systems,” MDPI-Information, Vol. 14, No. 1, pp. 44(1-14), Jan. 2023.
61. R.-D. Zhou, C. Tian, H. Sun, and J. S. Plank, “Two-level private information retrieval,” IEEE Journal on Selected Areas in Information Theory (JSAIT), Vol. 3, No. 2, pp. 337-349, Jul. 2022.
60. M. Makovenko, M. Cheng, and C. Tian, “Revisiting the optimization of Cauchy Reed-Solomon coding matrix for fault-tolerant data storage”, IEEE Transactions on Computers, Vol. 71, No. 8, pp. 1839-1846, Aug. 2022.
59. R.-D. Zhou, C. Tian, and T. Liu, “Individually conditional individual mutual information bound on generalization error,” Trans. Inform. Theory, Vol. 68, No. 5, pp. 3304-3316, May 2022.
58. W.-J. Chen, R.-D. Zhou, C. Tian, and C. Shen, “On top-k selection from m-wise partial rankings via Borda counting,” IEEE Trans. Signal Processing, Vol. 70, pp. 2031-2045, 2022.
57. S. Ulukus, S. Avestimehr, M. Gastpar, S. Jafar, R. Tandon, and C. Tian, “Private retrieval, computing and learning: Recent progress and future challenges,” IEEE Journal on Selected Areas in Communications (JSAC), Vol. 40, No. 3, pp. 729-748, Mar. 2022.
56. L. Zheng, C. Tian, and Q. Chen, “Coding overhead analysis of decentralized coded caching,” IEEE Communications Letters, Vol. 26, No. 2, pp. 254-258, Feb. 2022.
55. 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 (JSAIT), Vol. 2, No. 1, pp. 403-414, Mar. 2021.
54. 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, pp. 82.1-16, Feb. 2021.
53. S. Shao, J. Gómez-Vilardebó, K. Zhang, and C. Tian, “On the fundamental limits of coded caching systems with restricted demand types,” IEEE Trans. on Communications, Vol. 69, No. 2, pp. 863-873, Feb. 2021.
52. C. Tian, “On the storage cost of private information retrieval,” IEEE Trans. Inform. Theory, Vol. 66, No. 11, pp. 7539-7549, Dec. 2020.
51. T. Guo, C. Tian, T. Liu, and R. Yeung, “Weakly secure symmetric multilevel diversity coding,” IEEE Trans. Inform. Theory, Vol. 66, No. 11, pp. 7033-7055, Nov. 2020.
50. 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 (2020-2021 IEEE Data Storage Best Student Paper Award IEEE).
49. J. Ren, K. Yang, C. Tian, J. Wang, and H. V. Poor, “Decoding binary linear codes over channels with synchronization errors,” IEEE Journal of Selected Areas in Communications (JSAC), Vol. 38, No. 12, pp. 2853-2863, Jul. 2020.
48. 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.
47. T.-L. Zhou and C. Tian, “Fast erasure coding for data storage: A comprehensive study of the acceleration techniques,” ACM Transactions on Storage, Vol. 16, No. 1, pp. 7:1–24, Mar. 2020; source code repository.
Journal Publications (less recent)
46. 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.
45. H. Sun and C. Tian, “Breaking the MDS-PIR capacity barrier via joint storage coding,” MDPI-Information (invited), Vol. 10, No. 9, 265.1-16, Sep. 2019.
44. S. Shao, T. Liu, C. Tian, and C. Shen, “New results on multilevel diversity coding with secure regeneration,” Science China Information Sciences, Special Focus on Distributed Storage Coding, Vol. 61, No. 10, Oct. 2018.
43. 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.
42. S. Shao, T. Liu, C. Tian, and C. Shen, “Multilevel diversity coding with secure regeneration: Separate coding achieves the MBR point,” MDPI-Entropy, Vol. 20, No. 10, 751.1-23, Sep. 2018.
41. C. Tian, “Symmetry, outer bounds, and code constructions: A computer-aided investigation on the fundamental limits of caching,” MDPI-Entropy, Vol. 20, No. 8, 603.1-43, Aug. 2018.
40. 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.
39. K. Zhang and C. Tian, “On the symmetry reduction of information inequalities,” IEEE Trans. Communications, Vol. 66, No. 6, pp. 2396-2408, Jun. 2018.
38. C. Tian and J. Chen, “Caching and delivery via interference elimination,” IEEE Trans. Inform. Theory, Vol. 64, No. 3, pp. 1548-1560, Mar. 2018.
37. 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.
36. 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.
35. C. Tian and T. Liu, “Multilevel diversity coding with regeneration,” IEEE Trans. Inform. Theory, Vol. 62, No. 9, pp. 4833-4847, Sep. 2016.
34. C. Tian, B. Bandemer, and S. Shamai, “Gaussian state amplification with noisy observations,” IEEE Trans. Inform. Theory, Vol. 61, No. 9, pp. 4587-4597, Sep. 2015.
33. L. Song, J. Chen, and C. Tian, “Broadcasting correlated vector Gaussians,” IEEE Trans. Inform. Theory, Vol. 61, No. 5, pp. 2465-2477, May 2015.
32. 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.
31. 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.
30. 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 (2014 IEEE Data Storage Best Paper Award).
29. 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.
28. C. Tian and S. Krishnan, “Accelerated bilateral filtering with block skipping,” IEEE Signal Processing Letters, Vol. 20, No. 5, pp. 419-422, May 2013.
27. 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.
26. 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.
25. 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.
24. 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.
23. 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.
22. 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.
21. U. Samarawickrama, J. Liang, and C. Tian, “A three-layer scheme for M-channel multiple description image coding,” Signal Processing (Elsevier), Vol. 91, No. 10, pp. 2277-2289, Oct. 2011.
20. 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.
19. 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.
18. 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.
17. Y. Li, C. Tian, S. N. Diggavi, M. Chiang, and R. Calderbank, “Network resource allocation for competing multiple description transmissions,” IEEE Trans. Communications, Vol. 58, No. 5, pp. 1493-1504, May 2010.
16. Z. Sun, C. Tian, J. Chen, and Kon Max Wong, “LDPC code design for asynchronous Slepian-Wolf coding,” IEEE Trans. Communications, Vol. 58, No. 2, pp. 511-520, Feb. 2010.
15. 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. (erratum: eqn. (32) is missing a multiplication with λiD)
14. 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.
13. J. Chen, C. Tian, and S. N. Diggavi, “Multiple description coding for stationary Gaussian sources,” IEEE Trans. Inform. Theory, Vol. 55, No. 6, pp. 2868-2881, Jun. 2009.
12. 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.
11. 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.
10. 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.
9. C. Tian and S. Diggavi, “Side-information scalable source coding,” IEEE Trans. Inform. Theory, Vol. 54, No. 12, pp. 5591-5608, Dec. 2008.
8. C. Tian and J. Chen, “Successive refinement for hypothesis testing and lossless one-helper problem,” IEEE Trans. Inform. Theory, Vol. 54, No. 10, pp. 4666-4681, Oct. 2008.
7. 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.
6. C. Tian, J. Chen, and S. N. Diggavi, “Multiuser successive refinement and multiple description coding,” IEEE Trans. Inform. Theory, Vol. 54, No. 2, pp. 921-931, Feb. 2008.
5. 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.
4. J. Chen, C. Tian, T. Berger, and S. S. Hemami, “Multiple description quantization via Gram-Schmidt orthogonalization,”IEEE Trans. Inform. Theory, Vol. 52, No. 12, pp. 5197-5217, Dec. 2006.
3. 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.
2. C. Tian and S. S. Hemami, “Optimality and sub-optimality of multiple description vector quantization with a lattice codebook,” IEEE Trans. Inform. Theory, Vol. 50, No. 10, pp. 2458-2468, Oct. 2004.
1. C. Tian and S. S. Hemami, “Universal multiple description scalar quantization: analysis and design,” IEEE Trans. Inform. Theory, Vol. 50, No. 9, pp. 2089-2102, Sep. 2004.
Other Conference Publications
Note: Only recent results, results not listed above, or not documented in a journal form yet.