1 citations · 2 across the 9 of their papers we have counts for
13 papers
Sublinear Time Eigenvector Approximation via Column Sampling
Rajarshi Bhattacharjee, Cameron Musco, Dominic Rutkowski
We study sublinear time sampling methods for approximating the outlying eigenvectors of large matrices. Our main result is an algorithm that uniformly samples just $\tilde{O}(\log…
Fast Length-Squared Sampling for Positive-Semidefinite Matrices
Rajarshi Bhattacharjee, Ethan N. Epperly, Cameron Musco +1
We describe a simple rejection-sampling-based algorithm to perform length-squared sampling on an positive-semidefinite (psd) matrix: that is, to sample a column with p…
Safe RLHF Beyond Expectation: Stochastic Dominance for Universal Spectral Risk Control
Yaswanth Chittepu, Ativ Joshi, Rajarshi Bhattacharjee +1
Safe Reinforcement Learning from Human Feedback (RLHF) typically enforces safety through expected cost constraints, but the expectation captures only a single statistic of the cost…
Improved Spectral Density Estimation via Explicit and Implicit Deflation
Rajarshi Bhattacharjee, Rajesh Jayaram, Cameron Musco +2
We study algorithms for approximating the spectral density of a symmetric matrix that is accessed through matrix-vector product queries. By combining a previously studied Cheby…
Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco +3
Let satisfy , where is the all ones matrix and is the spectral norm. It is well-kno…
No-regret Algorithms for Fair Resource Allocation
Abhishek Sinha, Ativ Joshi, Rajarshi Bhattacharjee +2
We consider a fair resource allocation problem in the no-regret setting against an unrestricted adversary. The objective is to allocate resources equitably among several agents in…
Optimizing Age-of-Information in Adversarial Environments with Channel State Information
Avijit Mandal, Rajarshi Bhattacharjee, Abhishek Sinha
This paper considers a multi-user downlink scheduling problem with access to the channel state information at the transmitter (CSIT) to minimize the Age-of-Information (AoI) in a n…
Sublinear Time Eigenvalue Approximation via Random Sampling
Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas +2
We study the problem of approximating the eigenspectrum of a symmetric matrix with bounded entries (i.e., ).…
Optimizing Age-of-Information in Adversarial and Stochastic Environments
Abhishek Sinha, Rajarshi Bhattacharjee
We design efficient online scheduling policies to maximize the freshness of information delivered to the users in a cellular network under both adversarial and stochastic channel a…
Competitive Algorithms for Minimizing the Maximum Age-of-Information
Rajarshi Bhattacharjee, Abhishek Sinha
In this short paper, we consider the problem of designing a near-optimal competitive scheduling policy for mobile users, to maximize the freshness of available information unif…
Fundamental Limits of Online Network-Caching
Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha
Optimal caching of files in a content distribution network (CDN) is a problem of fundamental and growing commercial interest. Although many different caching algorithms are in use…
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments
Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha
We study the multi-user scheduling problem for minimizing the Age of Information (AoI) in cellular wireless networks under stationary and non-stationary regimes. We derive fundamen…
Online Algorithms for Multiclass Classification using Partial Labels
Rajarshi Bhattacharjee, Naresh Manwani
In this paper, we propose online algorithms for multiclass classification using partial labels. We propose two variants of Perceptron called Avg Perceptron and Max Perceptron to de…