2 citations · 2 across the 12 of their papers we have counts for
15 papers
The Asymptotics of Language Model Alignment with Memory
Haricharan Balasundaram, V. Arvind Rameshwar
Language model (LM) alignment broadly aims to perturb a given LM into an aligned LM such that i) the outputs produced by and are 'close' in probability, ii) has…
Fundamental Limits of Sequence Reconstruction Problems in Immunogenomics
Jaswanthi Mandalapu, Deepak Charan, V. Arvind Rameshwar +1
The goal of personalized immunogenomics is to recover an individual's germline immunoglobulin gene segments from 'repertoire sequences' altered by trimming, extension, and mutation…
-Diversity: Linkage-Robustness via a Composition Theorem
V. Arvind Rameshwar, Anshoo Tandon
In this paper, we consider the problem of degradation of anonymity upon linkages of anonymized datasets. We work in the setting where an adversary links together anonymiz…
Bounding User Contributions for User-Level Differentially Private Mean Estimation
V. Arvind Rameshwar, Anshoo Tandon
We revisit the problem of releasing the sample mean of bounded samples in a dataset, privately, under user-level -differential privacy (DP). We aim to derive the optim…
On Achievable Rates Over Noisy Nanopore Channels
V. Arvind Rameshwar, Nir Weinberger
In this paper, we consider a recent channel model of a nanopore sequencer proposed by McBain, Viterbo, and Saunderson (2024), termed the noisy nanopore channel (NNC). In essence, a…
Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs
V. Arvind Rameshwar, Anshoo Tandon, Abhay Sharma
This paper considers the -differentially private (DP) release of an approximate cumulative distribution function (CDF) of the samples in a dataset. We assume that the…
Information Rates Over Multi-View Channels
V. Arvind Rameshwar, Nir Weinberger
We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a…
On Improving the Composition Privacy Loss in Differential Privacy for Fixed Estimation Error
V. Arvind Rameshwar, Anshoo Tandon
This paper considers the private release of statistics of disjoint subsets of a dataset, in the setting of data heterogeneity, where users could contribute more than one sample, wi…
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
Shreyas Jain, V. Arvind Rameshwar, Navin Kashyap
This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the pa…
Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets
V. Arvind Rameshwar, Anshoo Tandon, Prajjwal Gupta +3
This paper considers the problem of the private release of sample means of speed values from traffic datasets. Our key contribution is the development of user-level differentially…
Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels
V. Arvind Rameshwar, Navin Kashyap
In this work, we address the question of the largest rate of linear subcodes of Reed-Muller (RM) codes, all of whose codewords respect a runlength-limited (RLL) constraint. Our int…
A Feedback Capacity-Achieving Coding Scheme for the -RLL Input-Constrained Binary Erasure Channel
V. Arvind Rameshwar, Navin Kashyap
This paper considers the memoryless input-constrained binary erasure channel (BEC). The channel input constraint is the -runlength limited (RLL) constraint, which manda…
On the Performance of Reed-Muller Codes Over -RLL Input-Constrained BMS Channels
V. Arvind Rameshwar, Navin Kashyap
This paper considers the input-constrained binary memoryless symmetric (BMS) channel, without feedback. The channel input sequence respects the -runlength limited (RLL)…
Bounds on the Feedback Capacity of the -RLL Input-Constrained Binary Erasure Channel
V. Arvind Rameshwar, Navin Kashyap
The paper considers the input-constrained binary erasure channel (BEC) with causal, noiseless feedback. The channel input sequence respects the -runlength limited (RLL)…
Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible Parameter Values
V. Arvind Rameshwar, Navin Kashyap
This paper addresses the problem of constructing secure exact-repair regenerating codes at the MSR point for all feasible values of the parameters. The setting involves a passive e…