14 citations · 71 across the 21 of their papers we have counts for
21 papers
APEER: Automatic Prompt Engineering Enhances Large Language Model Reranking
Can Jin, Hongwu Peng, Shiyu Zhao +7
Large Language Models (LLMs) have significantly enhanced Information Retrieval (IR) across various modules, such as reranking. Despite impressive performance, current zero-shot rel…
A Secure and Efficient Federated Learning Framework for NLP
Jieren Deng, Chenghong Wang, Xianrui Meng +7
In this work, we consider the problem of designing secure and efficient federated learning (FL) frameworks. Existing solutions either involve a trusted aggregator or require heavyw…
Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigm
Shaoyi Huang, Dongkuan Xu, Ian E. H. Yen +8
Conventional wisdom in pruning Transformer-based language models is that pruning reduces the model expressiveness and thus is more likely to underfit rather than overfit. However,…
TAG: Gradient Attack on Transformer-based Language Models
Jieren Deng, Yijue Wang, Ji Li +4
Although federated learning has increasingly gained attention in terms of effectively utilizing local devices for data privacy enhancement, recent studies show that publicly shared…
SAPAG: A Self-Adaptive Privacy Attack From Gradients
Yijue Wang, Jieren Deng, Dan Guo +5
Distributed learning such as federated learning or collaborative learning enables model training on decentralized data from users and only collects local gradients, where data is p…
Against Membership Inference Attack: Pruning is All You Need
Yijue Wang, Chenghong Wang, Zigeng Wang +5
The large model size, high computational operations, and vulnerability against membership inference attack (MIA) have impeded deep learning or deep neural networks (DNNs) popularit…
MSPP: A Highly Efficient and Scalable Algorithm for Mining Similar Pairs of Points
Subrata Saha, Ahmed Soliman, Sanguthevar Rajasekaran
The closest pair of points problem or closest pair problem (CPP) is an important problem in computational geometry where we have to find a pair of points from a set of points in me…
Efficient Sequential and Parallel Algorithms for Estimating Higher Order Spectra
Abdullah-Al Mamun, Zigeng Wang, Xingyu Cai +2
Polyspectral estimation is a problem of great importance in the analysis of nonlinear time series that has applications in biomedical signal processing, communications, geophysics,…
Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual Coordinate Ascent
Soumitra Pal, Tingyang Xu, Tianbao Yang +2
In prior works, stochastic dual coordinate ascent (SDCA) has been parallelized in a multi-core environment where the cores communicate through shared memory, or in a multi-processo…
On pattern matching with k mismatches and few don't cares
Marius Nicolae, Sanguthevar Rajasekaran
We consider the problem of pattern matching with mismatches, where there can be don't care or wild card characters in the pattern. Specifically, given a pattern of length $…
Efficient Algorithms for the Closest Pair Problem and Applications
Sanguthevar Rajasekaran, Sudipta Pathak
The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of clo…
An error correcting parser for context free grammars that takes less than cubic time
Sanguthevar Rajasekaran, Marius Nicolae
The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to…
An Elegant Algorithm for the Construction of Suffix Arrays
Sanguthevar Rajasekaran, Marius Nicolae
The suffix array is a data structure that finds numerous applications in string processing problems for both linguistic texts and biological data. It has been introduced as a memor…
On string matching with k mismatches
Marius Nicolae, Sanguthevar Rajasekaran
In this paper we consider several variants of the pattern matching problem. In particular, we investigate the following problems: 1) Pattern matching with k mismatches; 2) Approxim…
Efficient Sequential and Parallel Algorithms for Planted Motif Search
Marius Nicolae, Sanguthevar Rajasekaran
Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (l,d)-motif search o…
Parallel Algorithms for DNA Probe Placement on Small Oligonucleotide Arrays
Dragos Trinca, Sanguthevar Rajasekaran
Oligonucleotide arrays are used in a wide range of genomic analyses, such as gene expression profiling, comparative genomic hybridization, chromatin immunoprecipitation, SNP detect…
An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search
Dolly Sharma, Sanguthevar Rajasekaran, Hieu Dinh
Extracting meaningful patterns from voluminous amount of biological data is a very big challenge. Motifs are biological patterns of great interest to biologists. Many different ver…
A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly
Hieu Dinh, Sanguthevar Rajasekaran
An exact-match overlap graph of given strings of length is an edge-weighted graph in which each vertex is associated with a string and there is an edge of weight…
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string g…
On the Border Length Minimization Problem (BLMP) on a Square Array
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Protein/Peptide microarrays are rapidly gaining momentum in the diagnosis of cancer. High-density and highthroughput peptide arrays are being extensively used to detect tumor bioma…
Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into…