activity
20142022
most citedOn Sketching Quadratic Forms

52 citations · 173 across the 14 of their papers we have counts for

collaborators

15 papers

cs.CL2022★ 3 cited

FiD-Light: Efficient and Effective Retrieval-Augmented Text Generation

Sebastian Hofstätter, Jiecao Chen, Karthik Raman +1

Retrieval-augmented generation models offer many benefits over standalone language models: besides a textual answer to a given query they provide provenance items retrieved from an…

cs.CL2020★ 16 cited

DICT-MLM: Improved Multilingual Pre-Training using Bilingual Dictionaries

Aditi Chaudhary, Karthik Raman, Krishna Srinivasan +1

Pre-trained multilingual language models such as mBERT have shown immense gains for several natural language processing (NLP) tasks, especially in the zero-shot cross-lingual setti…

cs.CL2020★ 23 cited

DiPair: Fast and Accurate Distillation for Trillion-Scale Text Matching and Pair Modeling

Jiecao Chen, Liu Yang, Karthik Raman +6

Pre-trained models like BERT (Devlin et al., 2018) have dominated NLP / IR applications such as single sentence classification, text pair classification, and question answering. Ho…

cs.LG2019★ 2 cited

Sampled Softmax with Random Fourier Features

Ankit Singh Rawat, Jiecao Chen, Felix Yu +2

The computational cost of training with softmax cross entropy loss grows linearly with the number of classes. For the settings where a large number of classes are involved, a commo…

cs.DS2018★ 1 cited

Distinct Sampling on Streaming Data with Near-Duplicates

Jiecao Chen, Qin Zhang

In this paper we study how to perform distinct sampling in the streaming model where data contain near-duplicates. The goal of distinct sampling is to return a distinct element uni…

cs.LG2018★ 27 cited

Stochastic Negative Mining for Learning with Large Output Spaces

Sashank J. Reddi, Satyen Kale, Felix Yu +3

We consider the problem of retrieving the most relevant labels for a given input when the size of the output space is very large. Retrieval methods are modeled as set-valued classi…

cs.DC2018★ 12 cited

A Practical Algorithm for Distributed Clustering and Outlier Detection

Jiecao Chen, Erfan Sadeqi Azer, Qin Zhang

We study the classic -means/median clustering, which are fundamental problems in unsupervised learning, in the setting where data are partitioned across multiple sites, and wher…

cs.LG2018★ 8 cited

Tight Bounds for Collaborative PAC Learning via Multiplicative Weights

Jiecao Chen, Qin Zhang, Yuan Zhou

We study the collaborative PAC learning problem recently proposed in Blum et al.~\cite{BHPQ17}, in which we have players and they want to learn a target function collaborativel…

cs.LG2017★ 7 cited

Adaptive Multiple-Arm Identification

Jiecao Chen, Xi Chen, Qin Zhang +1

We study the problem of selecting arms with the highest expected rewards in a stochastic -armed bandit game. This problem has a wide range of applications, e.g., A/B testing…

cs.DS2017★ 20 cited

Communication-Optimal Distributed Clustering

Jiecao Chen, He Sun, David P. Woodruff +1

Clustering large datasets is a fundamental problem with a number of applications in machine learning. Data is often collected on different sites and clustering needs to be performe…

cs.DS2016

Submodular Maximization over Sliding Windows

Jiecao Chen, Huy L. Nguyen, Qin Zhang

In this paper we study the extraction of representative elements in the data stream model in the form of submodular maximization. Different from the previous work on streaming subm…

cs.DS2016★ 1 cited

Bias-Aware Sketches

Jiecao Chen, Qin Zhang

Linear sketching algorithms have been widely used for processing large-scale distributed and streaming datasets. Their popularity is largely due to the fact that linear sketches ca…

cs.DS2015★ 52 cited

On Sketching Quadratic Forms

Alexandr Andoni, Jiecao Chen, Robert Krauthgamer +3

We undertake a systematic study of sketching a quadratic form: given an matrix , create a succinct sketch which can produce (without further access…

cs.DS2014★ 1 cited

A Sketching Algorithm for Spectral Graph Sparsification

Jiecao Chen, Bo Qin, David P. Woodruff +1

We study the problem of compressing a weighted graph on vertices, building a "sketch" of , so that given any vector , the value can b…

cs.DS2014

Improved Algorithms for Distributed Entropy Monitoring

Jiecao Chen, Qin Zhang

Modern data management systems often need to deal with massive, dynamic and inherently distributed data sources. We collect the data using a distributed network, and at the same ti…