← Search

Agniva Chowdhury

7 accepted papers

2026

RACE Attention: A Strictly Linear-Time Attention for Long-Sequence Training

ICLR 2026poster

Softmax Attention has a quadratic time complexity in sequence length, which becomes prohibitive to run at long contexts, even with highly optimized GPU kernels. For example, FlashAttention-2/3 (exact, GPU-optimized implementations of Softmax Attention) cannot complete a single forward–backward pass…

Cited by 0SourcecodeScholar
2024

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

AAAI 2024technical

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for l…

2024

Patch2Self2: Self-supervised Denoising on Coresets via Matrix Sketching

CVPR 2024poster

Diffusion MRI (dMRI) non-invasively maps brain white matter yet necessitates denoising due to low signal-to-noise ratios. Patch2Self (P2S) employing self-supervised techniques and regression on a Casorati matrix effectively denoises dMRI images and has become the new de-facto standard in this field.…

Cited by 3SourcePDFScholar
2022

On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming

ICML 2022oral

Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear system of equations at each iteration. In common applications of…

Cited by 9SourcePDFScholar
2020

Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs

NeurIPS 2020poster

Linear programming (LP) is used in many machine learning applications, such as $\ell_1$-regularized SVMs, basis pursuit, nonnegative matrix factorization, etc. Interior Point Methods (IPMs) are one of the most popular methods to solve LPs both in theory and in practice. Their underlying complexity…

Cited by 13SourcePDFScholar