3

A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval
In this work, we study the robust phase retrieval problem where the task is to recover an unknown signal $\Theta^*\in \mathbb{R}^d$ in …
Adarsh Barik, Anand Krishna, Vincent Y. F. Tan
PDF Cite
$p$-Mean Regret for Stochastic Bandits
In this work, we extend the concept of the $p$-mean welfare objective from social choice theory to study $p$-mean regret in stochastic …
Anand Krishna, Philips George John, Vincent Y. F. Tan, Adarsh Barik
LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization
We study a robust online convex optimization framework, where an adversary can introduce outliers by corrupting loss functions in an …
Adarsh Barik, Anand Krishna, Vincent Y. F. Tan
PDF Cite
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations
We study the problem of allocating indivisible goods among $n$ agents with the objective of maximizing Nash social welfare (NSW). This …
Siddharth Barman, Anand Krishna, Pooja Kulkarni, Shivika Narang
PDF Cite
Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations
We study the problem of allocating indivisible goods among agents in a fair manner. While envy-free allocations of indivisible goods …
Siddharth Barman, Anand Krishna, Yadati Narahari, Soumyarup Sadhukan
PDF Cite Video