J.1.1 27 Jun, 2022, 6:50 pm - 7:10 pm (JST) Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander Aviv Adler MIT Jennifer Tang MIT Yury Polyanskiy MIT
J.1.2 27 Jun, 2022, 7:10 pm - 7:30 pm (JST) A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling (JKW Award Finalist) Spencer P Compton Massachusetts Institute of Technology, USA; MIT-IBM Watson AI Lab, USA
J.1.3 27 Jun, 2022, 7:30 pm - 7:50 pm (JST) On Information-Theoretic Determination of Misspecified Rates of Convergence Nir Weinberger Technion Meir Feder Tel-Aviv University
J.1.4 27 Jun, 2022, 7:50 pm - 8:10 pm (JST) Probability Distribution on Rooted Trees Yuta Nakahara Waseda University Shota Saito Gunma University Akira Kamatsuka Shonan Institute of Technology Toshiyasu Matsushima Waseda University