8 papers
Rigidity of stable spacelike capillary hypersurfaces in de Sitter and Minkowski spaces
Hui Ma, Jiaxu Ma, Mingxuan Yang
We prove a rigidity theorem for compact spacelike capillary hypersurfaces in de~Sitter and Minkowski spaces: volume-preserving stability forces total umbilicity when the support is…
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…
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…
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…
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…