Search Results - "Ramchandran, Kannan"

Epistatic Net allows the sparse spectral regularization of deep neural networks for inferring fitness functions by Aghazadeh, Amirali, Nisonoff, Hunter, Ocal, Orhan, Brookes, David H., Huang, Yijie, Koyluoglu, O. Ozan, Listgarten, Jennifer, Ramchandran, Kannan

“…Despite recent advances in high-throughput combinatorial mutagenesis assays, the number of labeled sequences available to predict molecular functions has…”
Get full text

Efficient Algorithms for the Data Exchange Problem by Milosavljevic, Nebojsa, Pawar, Sameer, El Rouayheb, Salim, Gastpar, Michael, Ramchandran, Kannan

“…In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial…”
Get full text

One extra bit of download ensures perfectly private information retrieval by Shah, Nihar B., Rashmi, K. V., Ramchandran, Kannan

“…Private information retrieval (PIR) systems allow a user to retrieve a record from a public database without revealing to the server which record is being…”
Get full text

Toward Compression of Encrypted Images and Video Sequences by Schonberg, D., Draper, S.C., Chuohao Yeo, Ramchandran, K.

“…We present a framework for compressing encrypted media, such as images and videos. Encryption masks the source, rendering traditional compression algorithms…”
Get full text

Robust Predictive Quantization: Analysis and Design Via Convex Optimization by Fletcher, A.K., Rangan, S., Goyal, V.K., Ramchandran, K.

“…Predictive quantization is a simple and effective method for encoding slowly-varying signals that is widely used in speech and audio coding. It has been known…”
Get full text

An Efficient Framework for Clustered Federated Learning by Ghosh, Avishek, Chung, Jichan, Yin, Dong, Ramchandran, Kannan

“…We address the problem of federated learning (FL) where users are distributed and partitioned into clusters. This setup captures settings where different…”
Get full text

Speeding Up Distributed Machine Learning Using Codes by Lee, Kangwook, Lam, Maximilian, Pedarsani, Ramtin, Papailiopoulos, Dimitris, Ramchandran, Kannan

“…Codes are widely used in many engineering applications to offer robustness against noise . In large-scale systems, there are several types of noise that can…”
Get full text

FFAST: An Algorithm for Computing an Exactly k -Sparse DFT in O( k\log k) Time by Pawar, Sameer, Ramchandran, Kannan

“…It is a well-known fact that the Discrete Fourier Transform (DFT) X̅ of an arbitrary n-length input signal x̅, can be computed from all the n time-domain…”
Get full text

A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels by Sandeep Pradhan, S., Suhan Choi, Ramchandran, K.

“…In this paper, we consider a graph-based framework for transmission of correlated sources over multiple-access channels. It is well known that the separation…”
Get full text

R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT by Pawar, Sameer, Ramchandran, Kannan

“…The fast Fourier transform is the most efficiently known way to compute the discrete Fourier transform (DFT) of an arbitrary n-length signal, and has a…”
Get full text

Multiplexed coded illumination for Fourier Ptychography with an LED array microscope by Tian, Lei, Li, Xiao, Ramchandran, Kannan, Waller, Laura

“…Fourier Ptychography is a new computational microscopy technique that achieves gigapixel images with both wide field of view and high resolution in both phase…”
Get full text

Efficient Private Information Retrieval Over Unsynchronized Databases by Fanti, Giulia, Ramchandran, Kannan

“…Web search histories can reveal detailed and sensitive information about people. Private information retrieval (PIR) tackles this potential privacy violation…”
Get full text

Model Selection for Generic Contextual Bandits by Ghosh, Avishek, Sankararaman, Abishek, Ramchandran, Kannan

“…We consider the problem of model selection for the general stochastic contextual bandits under the realizability assumption. We propose a successive refinement…”
Get full text

Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity by Pawar, Sameer, Ramchandran, Kannan

“…Given an n-length input signal x, it is well known that its Discrete Fourier Transform (DFT), X, can be computed in O(nlogn) complexity using a Fast Fourier…”
Get full text

SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes by Kangwook Lee, Pedarsani, Ramtin, Ramchandran, Kannan

“…The group testing problem is to identify a population of K defective items from a set of n items by pooling groups of items. The result of a test for a group…”
Get full text

Best wavelet packet bases in a rate-distortion sense by Ramchandran, K., Vetterli, M.

“…A fast rate-distortion (R-D) optimal scheme for coding adaptive trees whose individual nodes spawn descendents forming a disjoint and complete basis cover for…”
Get full text

Competing Bandits in Non-Stationary Matching Markets by Ghosh, Avishek, Sankararaman, Abishek, Ramchandran, Kannan, Javidi, Tara, Mazumdar, Arya

“…Understanding complex dynamics of two-sided online matching markets, where the demand-side agents compete to match with the supply-side (arms), has recently…”
Get full text

Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes by Yin, Dong, Pedarsani, Ramtin, Chen, Yudong, Ramchandran, Kannan

“…In this paper, we consider the mixture of sparse linear regressions model. Let <inline-formula> <tex-math notation="LaTeX">\boldsymbol {\beta }^{(1)},\ldots,…”
Get full text

Max-Affine Regression: Parameter Estimation for Gaussian Designs by Ghosh, Avishek, Pananjady, Ashwin, Guntuboyina, Adityanand, Ramchandran, Kannan

“…Max-affine regression refers to a model where the unknown regression function is modeled as a maximum of <inline-formula> <tex-math notation="LaTeX">k…”
Get full text

ACTIVE RANKING FROM PAIRWISE COMPARISONS AND WHEN PARAMETRIC ASSUMPTIONS DO NOT HELP by Heckel, Reinhard, Shah, Nihar B., Ramchandran, Kannan, Wainwright, Martin J.

“…We consider sequential or active ranking of a set of n items based on noisy pairwise comparisons. Items are ranked according to the probability that a given…”
Get full text