1 citations · 1 across the 7 of their papers we have counts for
9 papers
Unlocking Fractional Moments in Delphic Set Streams
Aranya Kumar Bal, Sourav Chakraborty, Arijit Ghosh +1
We consider estimation of non-integer frequency moments and related Bernstein-type statistics in the Delphic set stream model under a bounded-frequency assumption: every univ…
Learning from Local Walks on Dynamic Graphs with Bandit Feedback
Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni +1
We study stochastic multi-armed bandits on dynamic graphs, where arms correspond to the vertices of a network with time-varying edges. In this setting, the learner is restricted to…
Dimension Agnostic Testing of Survey Data Credibility through the Lens of Regression
Debabrota Basu, Sourav Chakraborty, Debarshi Chanda +3
Assessing whether a sample survey credibly represents the population is a critical question for ensuring the validity of downstream research. Generally, this problem reduces to est…
Incentivized Lipschitz Bandits
Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni +1
We study incentivized exploration in multi-armed bandit (MAB) settings with infinitely many arms modeled as elements in continuous metric spaces. Unlike classical bandit models, we…
Testing vs Estimation for Index-Invariant Properties in the Huge Object Model
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh +3
The Huge Object model of property testing [Goldreich and Ron, TheoretiCS 23] concerns properties of distributions supported on , where is so large that even reading…
Testing Credibility of Public and Private Surveys through the Lens of Regression
Debabrota Basu, Sourav Chakraborty, Debarshi Chanda +3
Testing whether a sample survey is a credible representation of the population is an important question to ensure the validity of any downstream research. While this problem, in ge…
Approximate Degree Composition for Recursive Functions
Sourav Chakraborty, Chandrima Kayal, Rajat Mittal +2
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have conc…
Structure of sparse Boolean functions over Abelian groups, and its application to testing
Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta +2
We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function is -sparse if it has at most non-zero Fourier coeffici…
Incentivized Exploration of Non-Stationary Stochastic Bandits
Sourav Chakraborty, Lijun Chen
We study incentivized exploration for the multi-armed bandit (MAB) problem with non-stationary reward distributions, where players receive compensation for exploring arms other tha…