Soumyabrata Pal

Orcid: 0000-0003-2949-3761

According to our database1, Soumyabrata Pal authored at least 37 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved Support Recovery in Universal 1-bit Compressed Sensing.
IEEE Trans. Inf. Theory, February, 2024

Random Subgraph Detection Using Queries.
J. Mach. Learn. Res., 2024

Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD.
CoRR, 2024

Annotation Efficiency: Identifying Hard Samples via Blocked Sparse Linear Bandits.
CoRR, 2024

FiRST: Finetuning Router-Selective Transformers for Input-Adaptive Latency Reduction.
CoRR, 2024

Online Matrix Completion: A Collaborative Approach with Hott Items.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Improving Mobile Maternal and Child Health Care Programs: Collaborative Bandits for Time Slot Selection.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

Sample-Efficient Personalization: Modeling User Parameters as Low Rank Plus Sparse Components.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Community Recovery in the Geometric Block Model.
J. Mach. Learn. Res., 2023

Nash Regret Guarantees for Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Online Low Rank Matrix Completion.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Optimal Algorithms for Latent Bandits with Cluster Structure.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Improved Support Recovery in Universal One-bit Compressed Sensing.
CoRR, 2022

Private and Efficient Meta-Learning with Low Rank and Sparse Decomposition.
CoRR, 2022

Support Recovery in Universal One-Bit Compressed Sensing.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

On Learning Mixture of Linear Regressions in the Non-Realizable Setting.
Proceedings of the International Conference on Machine Learning, 2022

Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

On Learning Mixture Models with Sparse Parameters.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Semisupervised Clustering by Queries and Locally Encodable Source Coding.
IEEE Trans. Inf. Theory, 2021

Trace Reconstruction: Generalized and Parameterized.
IEEE Trans. Inf. Theory, 2021

Support Recovery of Sparse Signals from a Mixture of Linear Measurements.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fuzzy Clustering with Similarity Queries.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Learning User Preferences in Non-Stationary Environments.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
High Dimensional Discrete Integration over the Hypergrid.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

Recovery of sparse linear classifiers from mixture of responses.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Search Result Diversification with Guarantee of Topic Proportionality.
Proceedings of the ICTIR '20: The 2020 ACM SIGIR International Conference on the Theory of Information Retrieval, 2020

Recovery of Sparse Signals from a Mixture of Linear Samples.
Proceedings of the 37th International Conference on Machine Learning, 2020

Algebraic and Analytic Approaches for Parameter Learning in Mixture Models.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Sample Complexity of Learning Mixtures of Sparse Linear Regressions.
CoRR, 2019

Sample Complexity of Learning Mixture of Sparse Linear Regressions.
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.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Connectivity of Random Annulus Graphs and the Geometric Block Model.
Proceedings of the Approximation, 2019

2018
High Dimensional Discrete Integration by Hashing and Optimization.
CoRR, 2018

The Geometric Block Model and Applications.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

The Geometric Block Model.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017


  Loading...