Research

Publications

Preprints

[Z1] H. K. Miyamoto and S. Yang, “Universal decoding over finite-state additive channels via noise guessing”, arXiv, 2025, doi: 10.48550/arXiv.2501.12971. [arXiv]

Journal papers

[J4] H. K. Miyamoto, F. C. C. Meneghetti, J. Pinele and S. I. R. Costa, “On closed-form expressions for the Fisher-Rao distance”, Information Geometry, vol. 8, pp. 311-354, 2024, doi: 10.1007/s41884-024-00143-2. [Link] [arXiv]

[J3] H. K. Miyamoto, F. C. C. Meneghetti and S. I. R. Costa, “The Fisher-Rao loss for learning under label noise”, Information Geometry, vol. 6, pp. 107-126, 2023, doi: 10.1007/s41884-022-00076-8. [Link] [arXiv]

[J2] H. K. Miyamoto and S. Yang, “Context-tree-based lossy compression and its application to CSI representation”, IEEE Transactions on Communications, vol. 70, no. 7, pp. 4417-4428, 2022, doi: 10.1109/TCOMM.2022.3173002. [Link] [arXiv]

[J1] H. K. Miyamoto, S. I. R. Costa and H. N. Sá Earp, “Constructive spherical codes by Hopf foliations”, IEEE Transactions on Information Theory, vol. 67, no. 12, pp. 7925-7939, 2021, doi: 10.1109/TIT.2021.3114094. [Link] [arXiv]

Conference papers

[C9] H. K. Miyamoto and S. Yang, “On universal decoding over discrete additive channels by noise guessing”, IEEE Information Theory Workshop (ITW), Sydney, 2025, to appear. [HAL]

[C8] H. K. Miyamoto and S. Yang, “On universal decoding over memoryless channels with the Krichevsky–Trofimov estimator”, IEEE International Symposium on Information Theory (ISIT), Athens, 2024, pp. 1498-1503, doi: 10.1109/ISIT57864.2024.10619414. [Link]

[C7] H. K. Miyamoto, “Geometria, Estatística e Aplicações a Comunicações e Aprendizado”, Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, vol. 10, no. 1, 2023 (in Portuguese), doi: 10.5540/03.2023.010.01.0004. [Link] *Extended abstract of [T1], published on the occasion of the Clóvis Caesar Gonzaga Award (SBMAC 2023).

[C6] F. C. C. Meneghetti, H. K. Miyamoto, S. I. R. Costa and M. H. M. Costa, “Revisiting lattice tiling decomposition and dithered quantisation”, Geometric Science of Information (GSI), Saint-Malo, 2023. In: F. Nielsen and F. Barbaresco (eds.), GSI 2023, LNCS 14071, pp. 318-327, Springer, 2023, doi: 10.1007/978-3-031-38271-0_319. [Link]

[C5] F. C. C. Meneghetti, H. K. Miyamoto and S. I. R. Costa, “Information properties of a random variable decomposition through lattices”, 41st International Conference on Bayesian and Maximum Entropy Methods in Science and Engineering (MaxEnt 2022), Paris (hybrid), 2022. In: Physical Sciences Forum, vol. 5, no. 1, 2022, doi: 10.3390/psf2022005019. [Link]

[C4] H. K. Miyamoto and S. Yang, “A CSI compression scheme using context trees”, International Zurich Seminar on Information and Communication (IZS), Zurich, 2022, pp. 24-28, doi: 10.3929/ethz-b-000535273. [Link]

[C3] H. K. Miyamoto, H. N. Sá Earp and S. I. R. Costa, “Constructive spherical codes in \(2^k\) dimensions”, IEEE International Symposium on Information Theory (ISIT), Paris, 2019, pp. 1612-1616, doi: 10.1109/ISIT.2019.8849464. [Link]

[C2] H. K. Miyamoto, H. N. Sá Earp and S. I. R. Costa, “Construção de códigos esféricos usando a fibração de Hopf”, Jornada Nacional de Iniciação Científica (JNIC), 70ª Reunião Anual da SBPC, Maceió, 2018 (in Portuguese), ISSN: 2176-1221. [Link]

[C1] H. K. Miyamoto, H. N. Sá Earp and S. I. R. Costa, “Construction of spherical codes using the Hopf fibration”, XXV Congresso de Iniciação Científica da Unicamp, Campinas, 2017, doi: 10.19146/pibic-2017-78809. [Link]

Presentations (without proceedings)

[A7] “On universal decoding over memoryless channels with the Krichevsky–Trofimov estimator” (poster presentation), IEEE European School on Information Theory (ESIT), Eindhoven, The Netherlands, 2024.

[A6] “On universal decoding over memoryless channels with the Krichevsky–Trofimov estimator” (poster presentation), France PhD Workshop on Information Theory, Palaiseau, France, 2024.

[A5] “Universal decodig with context trees” (poster presentation), IEEE European School on Information Theory (ESIT), Bristol, UK, 2023.

[A4] “The Fisher-Rao loss for learning under label noise” (oral presentation), International Conference on Information Geometry for Data Science (IG4DS), Hamburg, Germany (virtual), 2022.

[A3] “Construction of spherical codes using the Hopf fibration” (short communication), International Congress of Mathematicians (ICM), Rio de Janeiro, Brazil, 2018. [Link]

[A2] “A recursive algorithmic construction for spherical codes in dimensions \(\mathbb{R}^{2^k}\)” (poster presentation), Latin American Week on Coding and Information (LAWCI), Campinas, Brazil, 2018.

[A1] “Construção de códigos esféricos usando a fibração de Hopf” (oral presentation), Jornada de Matemática, Matemática Aplicada e Educação Matemática (J3M), Curitiba, Brazil, 2017.

Patent applications

[P1] I. Land, H. K. Miyamoto, A. Destounis and J. C. Belfiore, “Transfer Learning between Neural Networks”, patent applications WO202207097, CN117121020, EP2021716362, 2021. [WIPO] [EPO]

Theses

[T1] H. K. Miyamoto, “Geometria, Estatística e Aplicações a Comunicações e Aprendizado”, M.Sc. dissertation in applied mathematics, Universidade Estadual de Campinas, 2022, doi: 20.500.12733/6633. [Link] [PDF] [Errata]
*Received the Clóvis Caesar Gonzaga Award for best master’s dissertation in applied and computational mathematics (SBMAC 2023).

Collaborators

This is a list of people with whom I have collaborated:

  • Apostolos Destounis (Ericsson, France)
  • Fábio C. C. Meneghetti (Unicamp, Brazil)
  • Henrique N. Sá Earp (Unicamp, Brazil)
  • Ingmar Land (Nokia, France)
  • Jean-Claude Belfiore (Huawei, France)
  • Julianna Pinele (UFRB, Brazil)
  • Max H. M. Costa (Unicamp, Brazil)
  • Sheng Yang (CentraleSupélec, France)
  • Sueli I. R. Costa (Unicamp, Brazil)

“Mathematical discovery is by no means a matter of systematic deductive procedure. It involves insight, imagination, and long explorations along paths that sometime lead nowhere.”

— Robert Goldblatt in Topoi: The Categorial Analysis of Logic, p. 14