Henrique K. Miyamoto

M.S. student

Research

Information geometry and applications

Information geometry consists in studying the intrinsic geometry of probability distribution families—regarded as statistical manifolds—using the tools from differential geometry. For instance, it is knwon that the metric given by the Fisher information matrix is essentially the unique Riemannian metric invariant under sufficient statistics on such manifolds; this metric induces a natural notion of distance between probability distributions from the same family. In this project, we aim to apply information-geometric methods to problems in signal processing and machine learning.

This is a master's project under supervision of Prof. Sueli I. R. Costa at the Laboratory of Discrete Mathematics and Codes (LMDC), Institute of Mathematics, Statistics and Scientific Computing (IMECC), Unicamp. This project is supported by FAPESP (grant no. 21/04516-8).

Connections between data compression and Bayesian inference

We study the connections between data compression and Bayesian inference, particularly through the so-called context-tree algorithms (CTW and CTM). For different purposes in communications, such as feedback and storage, it is necessary to represent the channel state information (CSI) in an ‘economical’ way. We propose a context-tree-based approach for compressing time-varying CSI, which combines lossy vector quantisation, by means of data-adapted companders, with lossless compression, based on symbol probabilities estimated by a context-tree model.

This project was developped under supervision of Prof. Sheng Yang, at the Laboratory of Signals and Systems (L2S), CentraleSupélec.

See the page of this work here
Journal paper
Conference paper

Spherical codes by Hopf foliations

Spherical codes are discrete sets of points on the surface of an Euclidean sphere, and have several applications in sicences and engineering. Problems with spherical codes involve finding optimal distributions of points relative to some parameter of interest, such as the minimum distance between two points. We address the spherical packing problem by exploiting the Hopf foliations in dimensions \(2^k\), which yield a method for constructing spherical codes in such dimensions, for a given minimum distance. This procedure outperforms some current constructive methods in several small-distance regimes and constitutes a compromise between coding rate and effective constructiveness with low encoding complexity.

This was a scientific initiation project developped from 2016 to 2018 at the Institute of Mathematics, Statistics and Scientific Computing (IMECC), Unicamp, under supervision of Prof. Henrique N. Sá Earp and Prof. Sueli I. R. Costa. The project was supported by FAPESP (grant no. 16/05126-0) as part of the thematic project Security and reliability of information: theory and practice (grant no. 13/25977-7), of which Prof. Costa was one of the main researchers.

Journal paper
Conference papers
Presentations