AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment

Govinda Kamath, Tavor Baharav, Ilan Shomorony

NeurIPS 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Allocate min-hash comparisons adaptively using spectral estimates and successive halving, rather than uniformlySpectral top-k alignment estimation · PacBio E. colimin-hash comparisons per read: over 8500 min-hash comparisons per read at an error rate of 0.9% -> fewer than 6000 per read at an error rate of 0.1%Improved
Allocate worker responses adaptively instead of uniformlySpectral top-k product detection · Simulated crowdsourcing, 1000 productsworker responses required for equal performanceImproved
Allocate workers adaptively using thresholding and confidence intervalsSpectral thresholding · Simulated crowdsourcing, products liked by more than 65% versus less than 50%workers required for the same probability of errorImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy