Formal Presentations

Note: If you use any part of the slides, notes, or other material here, please acknowledge or cite the source.

  • Reconstruction on 2D Regular Grids, IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia, 12-20 July 2021. [slides] [highlight]

  • Learning and Inference in Adverse Settings: Tournament Rankings and Information Propagation in Networks, Department of Computer Science, Purdue University, West Lafayette, IN, USA, 25 March 2021.

  • Estimation of Skill Distribution from a Tournament, Advances in Neural Information Processing Systems 34 (NeurIPS), Vancouver, BC, Canada, 9 December 2020. [slides] [poster]

  • On Estimation of Modal Decompositions, IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020. [slides]

  • Bounds on Permutation Channel Capacity, IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020. [slides]

  • Information Contraction and Decomposition, Doctoral Thesis Defense, MIT, Cambridge, MA, USA, 15 May 2019. [slides]

  • Reconstruction on Graphs, MIT, Cambridge, MA, USA, 14 and 15 February 2019. [notes]

  • Information Capacity of the BSC Permutation Channel, 56th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, 5 October 2018. [slides]

  • Less Noisy Domination by Symmetric Channels, IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 29 June 2017. [slides]

  • Comparison of Channels: Criteria for Domination by a Symmetric Channel, LIDS Student Conference, MIT, Cambridge, MA, USA, 3 February 2017. [slides]

  • Polynomial Spectral Decomposition of Conditional Expectation Operators, 54th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, 29 September 2016. [slides]

  • Bounds between Contraction Coefficients, 53rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, 1 October 2015. [slides]

Informal Presentations

Note: If you use any part of the slides, notes, or other material here, please acknowledge or cite the source.

  • Reconstruction Problems in Very Noisy Settings, MIT, USA, 5 February 2021.

  • Gradient-Based Optimization via Local Polynomial Regression, MIT, USA, 6 November 2020.

  • Capacity of Permutation Channels, MIT, USA, 7 October 2020. [slides]

  • Permutation Channels, MIT, USA, 10 July 2020. [slides]

  • Minimax Estimation of the Bradley-Terry Model, MIT, USA, 7 February 2020. [notes]

  • Broadcasting on Random Networks, MIT, USA, 1 November 2018. (related [slides] for conference presentation at IEEE International Symposium on Information Theory, Paris, France, 10 July 2019)

  • Broadcasting on Directed Acyclic Graphs, MIT, USA, 30 April 2018. [notes]

  • Broadcasting on Bounded Degree Directed Acyclic Graphs, Seminar on Combinatorial Statistics, MIT, USA, 2 April 2018. [notes]

  • Spiking Neural Networks, Seminar on Reliable Circuits and Systems, MIT, USA, 6 December 2017. [notes] (based on Nancy Lynch, Cameron Musco, and Merhav Parter's paper)

  • Modified Logarithmic Sobolev Inequalities, MIT, USA, 30 October 2017. [notes] (based on Section 4 of Michel Ledoux's lecture notes)

  • Vapnik-Chervonenkis Theory, Seminar on Reliable Circuits and Systems, MIT, USA, 18 October 2017. (based on Chapter 12 of Luc Devroye, László Györfi, and Gábor Lugosi's book)

  • Fault Tolerant Computation, MIT, USA, 18 May 2017. [notes] (based on Falk Unger's paper)

  • Logarithmic Sobolev Inequalities using the Transportation Method, Seminar on Ising Models, MIT, USA, 3 May 2017. [notes] (based on Katalin Marton's paper)

  • An Information Inequality using the Blowing-Up Lemma, MIT, USA, 5 December 2016. [notes]

  • New Results on the Less Noisy Preorder over Channels, MIT, USA, 10 November 2016. [slides]

  • The Circular Law: Mehta's Proof of the Complex Gaussian Case, Seminar on Random Matrix Theory, MIT, USA, 20 June 2016. [notes on Ginibre formula] (short exposition by Stephen Ge)

  • Markov Chain Mixing and Coefficients of Ergodicity, Seminar on Markov Chains, MIT, USA, 8 June 2016. [notes]

  • Orthogonal Polynomial Singular Value Decompositions of Divergence Transition Operators, Nanyang Technological University (NTU), Singapore, 11 January 2016.

  • Comparison of Local and Global Contraction Coefficients for KL Divergence, MIT, USA, 5 November 2015. [slides]

  • Unsupervised Learning using Contraction Coefficients, Seminar on Signal Processing, MIT, USA, 23 September 2015.

  • Bounds between Contraction Coefficients of Strong Data Processing Inequalities, Seminar on Theoretical Computer Science, MIT, USA, 3 September 2015.

  • A Tutorial on Calculus of Variations, Seminar on Signal Processing, MIT, USA, 20 March 2015. [notes]

  • Quantum Chernoff and Sphere Packing Bounds, MIT, USA, 25 September 2014. [notes] (based on Marco Dalai's paper)

  • Quantum Information Theoretic View of Zero Error Capacity and Lovász \(\vartheta\) Function, MIT, USA, 18 September 2014. [notes] (based on Marco Dalai's paper)