Arya Mazumdar (Invited Talks)

Invited talks are now too many to list. As of 2021: I no longer update this page.

• Inaugural TILOS Seminar, A mixture of past, present, and future, Nov 17, 2021.

• NSF TRIPODS PIs Meeting, Distributed optimization with communication constraints, Sep 7, 2021.

• San Diego Machine Learning (Industry forum), Learning with distributed data, Aug 25, 2021.

• UCSD CSE Theory Seminar, Trace reconstruction and learning mixtures, May 10, 2021.

• UPenn Machine Learning Seminar, Distributed optimization with communication constraints, Apr 23, 2021.

• HDSI Seminar, UCSD, Distributed optimization with communication constraints, Apr 9, 2021.

• Asilomar Conference, Invited Talk in Special Session on Distributed Optimization, vqSGD: vector quantized stochastic gradient descent, Nov 4, 2020.

• CCSP Seminar, University of Maryland, Learning mixtures and trace reconstruction, Sep 17, 2020.

• Workshop on Inference problems: algorithms and lower bounds, Learning mixtures and trace reconstruction, Sep 3, 2020.

• SPCOM 2020, Learning mixtures and trace reconstruction, Jul 24, 2020.

• Workshop on Learning Theory (WOLT) 2020, Learning mixtures and trace reconstruction, Jul 22, 2020.

• ITA 2020, vqSGD: vector quantized stochastic gradient descent, Feb 7, 2020.

• UC Berkeley, IEOR Seminar, Learning mixtures of simple machine learning models, Nov 18, 2019.

• UC Berkeley, BLISS Seminar, Sample complexity of learning mixture of linear regressions (and what does the deletion channel have to do with it?), Sep 28, 2019

• UC San Diego, Data Science Institute, Coding theory for data summarization and reconstruction, Apr 22, 2019.

• Carnegie Mellon University, Coding theory for data summarization and reconstruction, Mar 21, 2019.

• Theory Seminar, UMass CS, Coding theory for data summarization and reconstruction, Mar 20, 2019.

• ITA 2019, High dimensional discrete integration over the hypergrid, Feb 14, 2019.

• RLE Seminar, MIT, High dimensional discrete integration over the hypergrid, Feb 7, 2019.

• Special Coding Seminar, University of Maryland, Approximations for index coding, Jan 22, 2019.

• Shannon Channel, Graph clustering: variations on the block models, Dec 7, 2018.

• Frontiers of Coding Theory, Information Theory Workshop, Capacity of locally recoverable codes, Nov 27, 2018.

• EE Seminar, University of Southern California, Finding structure in data: clustering and representation learning, Oct 16, 2018.

• Allerton Conference, Geometric block model and applications, Oct 5, 2018.

• Harvard CMSA Workshop on Information and Coding, Open Problems in LRCs, Apr 11, 2018.

• RLE Seminar, Massachusetts Institute of Technology, Cambridge, Interactive algorithms for clustering and community detection, Mar 26, 2018.

• Dagstuhl Seminar on Coding Theory for Inference, Learning and Optimization, Interactive algorithms for clustering and community detection, Mar 15, 2018.

• CSE Seminar, University of Michigan, Ann Arbor, New tools for distributed and interactive learning, Feb 22, 2018.

• Institute for Advanced Study (IAS), Princeton, Locally repairable codes, storage capacity and index coding, Feb 5, 2018.

• Bombay Information Theory Seminar 2018 (BITS), Interactive algorithms for clustering and community detection, Jan 12, 2018.

• Allerton Conference, Approximation algorithms for index coding, Oct 2, 2017.

• Caltech, Query Complexity of Clustering, Apr 12, 2017.

• ITA 2017, Storage capacity as information theoretic vertex cover, Feb 16, 2017.

• AMS-MAA Joint Mathematics Meeting Special Session, Storage capacity as an information theoretic analogue of vertex cover, Jan 4, 2017.

• Data Science Seminar, Institute of Mathematics and its Applications, Clustering with an Oracle, Oct 28, 2016.

• AMS Fall Sectional Meeting, Fundamental limits of locally repairable codes, Oct 28, 2016.

• Google, New York, Clustering with an Oracle, Oct 11, 2016.

• Allerton Conference, Clustering with an oracle, Sep 29, 2016 (Invited paper only).

• Signal Processing and Communications (SPCOM), “Index coding and local partial clique covers”, Jun 14, 2016.

• SIAM Conference on Discrete Mathematics, “Locally repairable codes and index coding”, Jun 7, 2016.

• Princeton University, Locally Repairable Codes, May 25, 2016.

• ITA 2016, “Neural auto-associative memory”, Feb 4, 2016.

• Machine Learning and Friends Lunch University of Massachusetts, Amherst, Neural Auto-associative Memory Via Sparse Recovery, Jan 29, 2016.

• University of California, San Diego, Theory of codes for network and inference problems, Nov 6, 2015.

• University of California, Santa Barbara, Theory of codes for network and inference problems, Nov 4, 2015.

• IEEE Information Theory Workshop (ITW), “Small alphabet problems in distributed storage,” Jeju Island, Korea, Oct 12, 2015.

• University of California, Berkeley, Graph capacity, broadcast rate and local repair, Sep 28, 2015.

• Communication Theory Workshop (CTW), Dana Point, CA, “Recent Results in Local Repair,” May 13, 2015.

• Information Theory Workshop (ITW), Jerusalem, “Associative Memory via Linear Neural Network,” Apr 30, 2015.

• University of Maryland, Can we do Local Repair over a Network?, Apr 13, 2015.

• University of Massachusetts, Amherst, Networks of Reliable Distributed Storage, Apr 3, 2015.

• Between Shannon and Hamming: Network Information Theory and Combinatorics, Banff Workshop, “Memoryless Adversary,” Mar 2, 2015.

• Simons Institute Workshop on Coding, “A Student's View of Locally Repairable Codes,” Feb 12, 2015.

• ITA 2015, “Locality of Secret-Sharing Schemes,” Feb 6, 2015.

• Allerton 2014, “Achievable Schemes and Limits for Local Recovery on a Graph,” Oct 2, 2014.

• Allerton 2014, “Group testing with Unreliable Elements and Rule Learning,” Oct 1, 2014.

• University of Minnesota, CS Colloquium (Nov 3, 2014), ECE Colloquium (Sep 11, 2014), “Storage Capacity of Repairable Networks.”

• CTW 2014, Curacao, “Local processing in distributed storage systems,” May 28, 2014.

• Dartmouth College, CS Colloquium, Coding theory of next-gen storage and beyond, Apr 28, 2014.

• Virginia Tech, ECE Seminar, “Communication methods in storage systems,” Apr 5, 2014.

• CISS 2014, Princeton, “On cooperative local repair for distributed storage,” Mar 20, 2014.

• CISS 2014, Princeton, “Smooth compression of rankings,” Mar 19, 2014.

• Zurich Seminar, “Noisy Boolean compressed sensing and error-correcting codes,” Feb 28, 2014.

• ITA 2014, “On a duality between recoverable distributed storage and index coding,” Feb 13, 2014.

• Communications/ICWS Seminar, University of Illinois, Urbana, Error-reducing codes, Oct 14, 2013.

• Johns Hopkins University, “Reliability in memory: the spectrum of codes,” Mar 5, 2013.

• ITA 2013, “Local recovery properties of capacity achieving codes,” Feb 15, 2013.

• University of Minnesota, Twin Cities, “Reliability in memory: the spectrum of codes,” Apr 2, 2012.

• Rutgers, State University of New Jersey, Reliability in memory: the spectrum of codes, Mar 29, 2012.

• SUNY Buffalo, “Reliability in memory: the spectrum of codes,” Mar 14, 2012,

• CISE Seminar, Boston University, Error correction codes for Flash memory: rank modulation, Feb 17, 2012.

• ITA 2012, “Explicit group testing scheme that identifies almost all defective configurations,” Feb 10, 2012.

• Allerton 2011, “Sparse-recovery properties of statistical RIP matrices,” Sep 30, 2011.

• Massachusetts Institute of Technology (MIT), “Constructions of sampling matrices for compressed sensing,” Apr 15, 2011.

• Bell Labs, Murray Hill, NJ, "General construction of compressed sensing matrices, Apr 14, 2011.

• Princeton University, EE Department, “General construction of compressed sensing matrices,” Apr 13, 2011.

• University of Southern California, EE Department, Sensing compressed signal, codes on graphs and reliability in memory, Jan 21, 2011.

• Duke University, ECE Seminar Series, “Codes in Permutation,” Nov 17, 2010.

• Link-A-Media Devices, ‘‘Error correcting codes for magnetic recording," Oct 26, 2010.

• Allerton 2010, “On the capacity of high-density magnetic recording on a 1-D granular medium,” Sep 28, 2010.

• IBM Watson Research Center, NY, “Rank modulation codes: error correction for Flash memory,” Sep 27, 2010.

• NEC Labs, Princeton, “Sampling matrices from coding theory,” May 4, 2010.

• AT&T Shannon Labs, Florham Park, NJ, “Linear balancing sets,” Jul 24, 2009.

• Bell Labs, Murray Hill, NJ, “Error correcting capabilities of codes on graphs,” Jun 25, 2009.

• Hewlett-Packard Labs, Palo Alto, CA, “Design of efficient encoding and decoding algorithms for balanced codes,” Aug 26, 2008.