Arya Mazumdar

J. ACM, October, 2024

Competing Bandits in Non-Stationary Matching Markets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, April, 2024

Improved Support Recovery in Universal 1-bit Compressed Sensing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2024

An Improved Federated Clustering Algorithm with Model-based Clustering.

[BibT_eX]

[DOI]

Harsh Vardhan

Trans. Mach. Learn. Res., 2024

Random Subgraph Detection Using Queries.

[BibT_eX]

[DOI]

Wasim Huleihel

J. Mach. Learn. Res., 2024

Clustering with Non-adaptive Subset Queries.

[BibT_eX]

[DOI]

CoRR, 2024

Transfer Learning for Latent Variable Network Models.

[BibT_eX]

[DOI]

Akhil Jalan

Soumendu Sundar Mukherjee

Purnamrita Sarkar

CoRR, 2024

The TILOS AI Institute: Integrating optimization and AI for chip design, networks, and robotics.

[BibT_eX]

[DOI]

AI Mag., 2024

Robust 1-bit Compressed Sensing with Iterative Hard Thresholding.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Distributed Local Sketching for £2 Embeddings.

[BibT_eX]

[DOI]

Neophytos Charalambides

Proceedings of the IEEE International Symposium on Information Theory, 2024

Agnostic Learning of Mixed Linear Regressions with EM and AM Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

On the sample complexity of parameter estimation in logistic regression with normal design.

[BibT_eX]

[DOI]

Daniel Hsu

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Capacity of Locally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Community Recovery in the Geometric Block Model.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2023

On the sample complexity of estimation in logistic regression.

[BibT_eX]

[DOI]

Daniel Hsu

CoRR, 2023

Optimization using Parallel Gradient Evaluations on Multiple Parameters.

[BibT_eX]

[DOI]

CoRR, 2023

Optimal Compression of Unit Norm Vectors in the High Distortion Regime.

[BibT_eX]

[DOI]

Heng Zhu

Proceedings of the IEEE International Symposium on Information Theory, 2023

Async-HFL: Efficient and Robust Asynchronous Federated Learning in Hierarchical IoT Networks.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation, 2023

2022

vqSGD: Vector Quantized Stochastic Gradient Descent.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Improved Support Recovery in Universal One-bit Compressed Sensing.

[BibT_eX]

[DOI]

CoRR, 2022

An Improved Algorithm for Clustered Federated Learning.

[BibT_eX]

[DOI]

Harsh Vardhan

CoRR, 2022

Decentralized Competing Bandits in Non-Stationary Matching Markets.

[BibT_eX]

[DOI]

CoRR, 2022

Support Recovery in Universal One-Bit Compressed Sensing.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

On Learning Mixture of Linear Regressions in the Non-Realizable Setting.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

On Learning Mixture Models with Sparse Parameters.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Semisupervised Clustering by Queries and Locally Encodable Source Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Trace Reconstruction: Generalized and Parameterized.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Communication-Efficient and Byzantine-Robust Distributed Learning With Error Feedback.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Escaping Saddle Points in Distributed Newton's Method with Communication efficiency and Byzantine Resilience.

[BibT_eX]

[DOI]

CoRR, 2021

Support Recovery of Sparse Signals from a Mixture of Linear Measurements.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fuzzy Clustering with Similarity Queries.

[BibT_eX]

[DOI]

Wasim Huleihel

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Session-Aware Query Auto-completion using Extreme Multi-Label Ranking.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Probabilistic Group Testing with a Linear Number of Tests.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Byzantine Resilient Distributed Clustering with Redundant Data Assignment.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

A workload-adaptive mechanism for linear queries under local differential privacy.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

High Dimensional Discrete Integration over the Hypergrid.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

Multilabel Classification by Hierarchical Partitioning and Data-dependent Grouping.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Distributed Newton Can Communicate Less and Resist Byzantine Workers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Recovery of sparse linear classifiers from mixture of responses.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Communication-Efficient and Byzantine-Robust Distributed Learning.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2020

Communication Efficient Distributed Approximate Newton Method.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Communication Efficient and Byzantine Tolerant Distributed Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Reliable Distributed Clustering with Redundant Data Assignment.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Recovery of Sparse Signals from a Mixture of Linear Samples.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Algebraic and Analytic Approaches for Parameter Learning in Mixture Models.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

2019

Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate.

[BibT_eX]

[DOI]

Andrew McGregor

Sofya Vorotnikova

IEEE Trans. Inf. Theory, 2019

Linear Programming Approximations for Index Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

vqSGD: Vector Quantized Stochastic Gradient Descent.

[BibT_eX]

[DOI]

CoRR, 2019

Sample Complexity of Learning Mixtures of Sparse Linear Regressions.

[BibT_eX]

[DOI]

CoRR, 2019

Sample Complexity of Learning Mixture of Sparse Linear Regressions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Same-Cluster Querying for Overlapping Clusters.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Superset Technique for Approximate Recovery in One-Bit Compressed Sensing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Robust Gradient Descent via Moment Encoding and LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Connectivity of Random Annulus Graphs and the Geometric Block Model.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

Learning and Recovery in the ReLU Model.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018

Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Coding Theory for Inference, Learning and Optimization (Dagstuhl Seminar 18112).

[BibT_eX]

[DOI]

Po-Ling Loh

Dimitris S. Papailiopoulos

Rüdiger L. Urbanke

Dagstuhl Reports, 2018

High Dimensional Discrete Integration by Hashing and Optimization.

[BibT_eX]

[DOI]

CoRR, 2018

Robust Gradient Descent via Moment Encoding with LDPC Codes.

[BibT_eX]

[DOI]

CoRR, 2018

Representation Learning and Recovery in the ReLU Model.

[BibT_eX]

[DOI]

CoRR, 2018

Novel Impossibility Results for Group-Testing.

[BibT_eX]

[DOI]

Sidharth Jaggi

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Geometric Block Model and Applications.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

The Geometric Block Model.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Low Rank Approximation and Decomposition of Large Matrices Using Error Correcting Codes.

[BibT_eX]

[DOI]

Yousef Saad

IEEE Trans. Inf. Theory, 2017

Group Testing Schemes From Codes and Designs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Clustering with Noisy Queries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Query Complexity of Clustering with Side Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Storage capacity as an information-theoretic analogue of vertex cover.

[BibT_eX]

[DOI]

Andrew McGregor

Sofya Vorotnikova

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Estimation of sparsity via simple measurements.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Multilabel Classification with Group Testing and Codes.

[BibT_eX]

[DOI]

Proceedings of the 34th International Conference on Machine Learning, 2017

Compressive Traffic Analysis: A New Paradigm for Scalable Traffic Analysis.

[BibT_eX]

[DOI]

Milad Nasr

Amir Houmansadr

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Efficient Rank Aggregation via Lehmer Codes.

[BibT_eX]

[DOI]

Pan Li

Olgica Milenkovic

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

A Theoretical Analysis of First Heuristics of Crowdsourced Entity Resolution.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Associative Memory Using Dictionary Learning and Expander Decoding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Nonadaptive Group Testing With Random Set of Defectives.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Security in Locally Repairable Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Clustering Via Crowdsourcing.

[BibT_eX]

[DOI]

CoRR, 2016

Local Partial Clique Covers for Index Coding.

[BibT_eX]

[DOI]

CoRR, 2016

Hamming codes as error-reducing codes.

[BibT_eX]

[DOI]

William Rurik

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Group testing schemes from low-weight codewords of BCH codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Distance preserving maps and combinatorial joint source-channel coding for large alphabets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Local Partial Clique and Cycle Covers for Index Coding.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Globecom Workshops, Washington, DC, USA, December 4-8, 2016, 2016

Clustering with an oracle.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

Bounds on the rate of linear locally repairable codes over small alphabets.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Compression in the Space of Permutations.

[BibT_eX]

[DOI]

Da Wang

IEEE Trans. Inf. Theory, 2015

Storage Capacity of Repairable Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Bounds on the Size of Locally Recoverable Codes.

[BibT_eX]

[DOI]

Viveck R. Cadambe

IEEE Trans. Inf. Theory, 2015

Restricted Isometry Property of Random Subdictionaries.

[BibT_eX]

[DOI]

Rongrong Wang

IEEE Trans. Inf. Theory, 2015

Cooperative local repair in distributed storage.

[BibT_eX]

[DOI]

Sriram Vishwanath

EURASIP J. Adv. Signal Process., 2015

Nonadaptive group testing with random set of defectives via constant-weight codes.

[BibT_eX]

[DOI]

CoRR, 2015

Almost disjunct matrices from codes and designs.

[BibT_eX]

[DOI]

CoRR, 2015

Associative Memory via a Sparse Recovery Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Alphabet-size dependent bounds for exact repair in distributed storage.

[BibT_eX]

[DOI]

Viveck R. Cadambe

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

On adversarial joint source channel coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Local recovery in data compression for general sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Low Rank Approximation using Error Correcting Coding Matrices.

[BibT_eX]

[DOI]

Yousef Saad

Proceedings of the 32nd International Conference on Machine Learning, 2015

2014

Review of Classic Papers in Combinatorics Edited by Ira Gessel and Gian-Carlo Rota.

[BibT_eX]

[DOI]

SIGACT News, 2014

Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

Lossy compression of permutations.

[BibT_eX]

[DOI]

Da Wang

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the capacity of memoryless adversary.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On a duality between recoverable distributed storage and index coding.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Smooth representation of rankings.

[BibT_eX]

[DOI]

Olgica Milenkovic

Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

Group testing with unreliable elements.

[BibT_eX]

[DOI]

Soheil Mohajer

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Achievable schemes and limits for local recovery on a graph.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

Constructions of Rank Modulation Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Random Subdictionaries and Coherence Conditions for Sparse Signal Recovery

[BibT_eX]

[DOI]

Rongrong Wang

CoRR, 2013

An upper bound on the size of locally recoverable codes.

[BibT_eX]

[DOI]

Viveck R. Cadambe

Proceedings of the International Symposium on Network Coding, 2013

Local recovery properties of capacity achieving codes.

[BibT_eX]

[DOI]

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

A rate-distortion theory for permutation spaces.

[BibT_eX]

[DOI]

Da Wang

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On Chebyshev radius of a set in Hamming space and the closest string problem.

[BibT_eX]

[DOI]

Yury Polyanskiy

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Results on combinatorial joint source-channel coding.

[BibT_eX]

[DOI]

Yuval Kochman

Yury Polyanskiy

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Update efficient codes for error correction.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

The adversarial joint source-channel problem.

[BibT_eX]

[DOI]

Yuval Kochman

Yury Polyanskiy

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On Almost Disjunct Matrices for Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Covering arbitrary point patterns.

[BibT_eX]

[DOI]

Ligong Wang

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Combinatorial Methods in Coding Theory.

[BibT_eX]

[DOI]

PhD thesis, 2011

Coding for High-Density Recording on a 1-D Granular Magnetic Medium.

[BibT_eX]

[DOI]

Navin Kashyap

IEEE Trans. Inf. Theory, 2011

On the Number of Errors Correctable with Codes on Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Explicit Group Testing Scheme that Identifies Almost All Defective Configurations

[BibT_eX]

[DOI]

CoRR, 2011

Channels with intermittent errors.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

General constructions of deterministic (S)RIP matrices for compressive sampling.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Parameters of rank modulation codes: Examples.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Sparse recovery properties of statistical RIP matrices.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Codes in permutations and error correction for rank modulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

On linear balancing sets.

[BibT_eX]

[DOI]

Ron M. Roth

Pascal O. Vontobel

Adv. Math. Commun., 2010

Coding for high-density magnetic recording.

[BibT_eX]

[DOI]

Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2010

Small ensembles of sampling matrices constructed from coding theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

On the capacity of high-density recording on a 1-D granular magnetic medium.

[BibT_eX]

[DOI]

Navin Kashyap

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2008

Codes on hypergraphs

[BibT_eX]

[DOI]

CoRR, 2008

Weight distribution and decoding of codes on hypergraphs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2008

Weight distribution of codes on hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2006

Construction of turbo code interleaves from 3-regular Hamiltonian graphs.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2006

2005

Construction of Turbo Code Interleavers from 3-Regular Hamiltonian Graphs

[BibT_eX]

[DOI]

CoRR, 2005

On the Spread of Random Interleaver

[BibT_eX]

[DOI]

CoRR, 2005

On the spread of random interleavers.

[BibT_eX]

[DOI]