Arnab Bhattacharyya

Orcid: 0000-0002-3648-5957

Affiliations:

National University of Singapore
Indian Institute of Science, Bengaluru, India

According to our database¹, Arnab Bhattacharyya authored at least 105 papers between 2004 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Learnability of Parameter-Bounded Bayes Nets.

[BibT_eX]

[DOI]

CoRR, 2024

Total Variation Distance for Product Distributions is #P-Complete.

[BibT_eX]

[DOI]

CoRR, 2024

Distribution Learning Meets Graph Structure Sampling.

[BibT_eX]

[DOI]

CoRR, 2024

Online bipartite matching with imperfect advice.

[BibT_eX]

[DOI]

Davin Choo

Themistoklis Gouleakis

Chun Kai Ling

Arnab Bhattacharyya

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

Total Variation Distance Meets Probabilistic Inference.

[BibT_eX]

[DOI]

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

Outlier Robust Multivariate Polynomial Regression.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Learning bounded-degree polytrees with known skeleton.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2024

Optimal estimation of Gaussian (poly)trees.

[BibT_eX]

[DOI]

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

2023

Model Counting Meets F0 Estimation.

[BibT_eX]

[DOI]

A. Pavan

N. Variyam Vinodchandran

Arnab Bhattacharyya

Kuldeep S. Meel

ACM Trans. Database Syst., September, 2023

Model Counting Meets Distinct Elements.

[BibT_eX]

[DOI]

Commun. ACM, September, 2023

Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu.

[BibT_eX]

[DOI]

SIAM J. Comput., June, 2023

Total Variation Distance Estimation Is as Easy as Probabilistic Inference.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Near-Optimal Degree Testing for Bayes Nets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

On Approximating Total Variation Distance.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Active causal structure learning with advice.

[BibT_eX]

[DOI]

Davin Choo

Themistoklis Gouleakis

Arnab Bhattacharyya

Proceedings of the International Conference on Machine Learning, 2023

On the Interventional Kullback-Leibler Divergence.

[BibT_eX]

[DOI]

Jonas Bernhard Wildberger

Siyuan Guo

Arnab Bhattacharyya

Bernhard Schölkopf

Proceedings of the Conference on Causal Learning and Reasoning, 2023

Sample Complexity of Distinguishing Cause from Effect.

[BibT_eX]

[DOI]

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

Constraint Optimization over Semirings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Model Counting Meets Distinct Elements in a Data Stream.

[BibT_eX]

[DOI]

SIGMOD Rec., 2022

Low Degree Testing over the Reals.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Independence Testing for Bounded Degree Bayesian Network.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Clément L. Canonne

Joy Qiping Yang

CoRR, 2022

An Adaptive Kernel Approach to Federated Learning of Heterogeneous Causal Effects.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Verification and search algorithms for causal DAGs.

[BibT_eX]

[DOI]

Davin Choo

Kirankumar Shiragur

Arnab Bhattacharyya

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Independence Testing for Bounded Degree Bayesian Networks.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Clément L. Canonne

Joy Qiping Yang

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficient interventional distribution learning in the PAC framework.

[BibT_eX]

[DOI]

N. Variyam Vinodchandran

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

Learning Sparse Fixed-Structure Gaussian Bayesian Networks.

[BibT_eX]

[DOI]

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

Identifiability of Linear AMP Chain Graph Models.

[BibT_eX]

[DOI]

Yuhao Wang

Arnab Bhattacharyya

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Property Testing - Problems and Techniques

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Yuichi Yoshida

Springer, ISBN: 978-981-16-8621-4, 2022

2021

Efficient inference of interventional distributions.

[BibT_eX]

[DOI]

CoRR, 2021

Identifiability of AMP chain graph models.

[BibT_eX]

[DOI]

Yuhao Wang

Arnab Bhattacharyya

CoRR, 2021

Model Counting meets F0 Estimation.

[BibT_eX]

[DOI]

CoRR, 2021

Predicting winner and estimating margin of victory in elections using sampling.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Palash Dey

Artif. Intell., 2021

A formal methods approach to predicting new features of the eukaryotic vesicle traffic system.

[BibT_eX]

[DOI]

Acta Informatica, 2021

Near-optimal learning of tree-structured distributions by Chow-Liu.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Model Counting meets F0 Estimation.

[BibT_eX]

[DOI]

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Testing Product Distributions: A Closer Look.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2021

Efficient Statistics for Sparse Graphical Models from Truncated Samples.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Improved learning of k-parities.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Ameet Gadekar

Ninad Rajgopal

Theor. Comput. Sci., 2020

Efficiently Learning and Sampling Interventional Distributions from Observations.

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning.

[BibT_eX]

[DOI]

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

Combinatorial Lower Bounds for 3-Query LDCs.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

L. Sunil Chandran

Suprovat Ghoshal

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Learning and Sampling of Atomic Interventions from Observations.

[BibT_eX]

[DOI]

N. Variyam Vinodchandran

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

2019

An Optimal Algorithm for ℓ1-Heavy Hitters in Insertion Streams and Related Problems.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Palash Dey

David P. Woodruff

ACM Trans. Algorithms, 2019

Average Bias and Polynomial Sources.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Parameterized Intractability of Even Set and Shortest Vector Problem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Minimum Intervention Cover of a Causal Graph.

[BibT_eX]

[DOI]

Saravanan Kandasamy

Arnab Bhattacharyya

Vasant G. Honavar

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue.

[BibT_eX]

[DOI]

Aravindan Vijayaraghavan

Qin Zhang

ACM Trans. Algorithms, 2018

Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

Learning and Testing Causal Models with Interventions.

[BibT_eX]

[DOI]

Jayadev Acharya

Arnab Bhattacharyya

Constantinos Daskalakis

Saravanan Kandasamy

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Testing Sparsity over Known and Unknown Bases.

[BibT_eX]

[DOI]

Siddharth Barman

Arnab Bhattacharyya

Suprovat Ghoshal

Proceedings of the 35th International Conference on Machine Learning, 2018

Improved Learning of k-Parities.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Ameet Gadekar

Ninad Rajgopal

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Hardness of learning noisy halfspaces using polynomial thresholds.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Suprovat Ghoshal

Rishi Saket

Electron. Colloquium Comput. Complex., 2017

Improved bounds for universal one-bit compressive sensing.

[BibT_eX]

[DOI]

Jayadev Acharya

Arnab Bhattacharyya

Pritish Kamath

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

On the Gap between Outcomes of Voting Rules.

[BibT_eX]

[DOI]

Anurita Mathur

Arnab Bhattacharyya

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Lower Bounds for 2-Query LCCs over Large Alphabet.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Sivakanth Gopi

Avishay Tal

Proceedings of the Approximation, 2017

2016

Lower bounds for 2-query LCCs over large alphabet.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Sivakanth Gopi

Electron. Colloquium Comput. Complex., 2016

The Dictionary Testing Problem.

[BibT_eX]

[DOI]

Siddharth Barman

Arnab Bhattacharyya

Suprovat Ghoshal

CoRR, 2016

Tight lower bounds for linear 2-query LCCs over finite fields.

[BibT_eX]

[DOI]

Comb., 2016

An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Palash Dey

David P. Woodruff

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

On Higher-Order Fourier Analysis over Non-Prime Fields.

[BibT_eX]

[DOI]

Arnab Bhattacharyya

Abhishek Bhowmick

Chetan Gupta

Proceedings of the Approximation, 2016

2015

On the hardness of learning sparse parities.

[BibT_eX]

[DOI]