collaborators

18 papers

cs.AR2026

Lonic: Algorithm-Hardware Co-Design for Energy-Efficient Fully Local Online SNN Training with INT4 Precision

Peilin Chen, Xiaoxuan Yang

Spiking neural networks (SNNs) have recently attracted increasing attention as an energy-efficient learning paradigm. Existing works also propose temporally and fully local online…

cs.DS2026

The matrix-vector complexity of

Michał Dereziński, Ethan N. Epperly, Raphael A. Meyer

Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establ…

math.NA2026

Linear algebra at exponential scale via tensor network dimension reduction

Chris Camaño, Ethan N. Epperly, Raphael A. Meyer +1

Many problems in modern scientific computing are challenging because of a \emph{curse of dimension}, where their mathematical formulation involves objects whose dimension is \emph{…

math.NA2026

Sharp analysis of sketched least squares and randomized low-rank approximation

Ethan N. Epperly, Robert J. Webber

Two widely used randomized algorithms are the sketch-and-solve method for least-squares regression and the randomized SVD for low-rank approximation. These algorithms apply a rando…

math.NA2026

Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement

Michał Dereziński, Ethan N. Epperly, Deanna Needell +1

The randomized Kaczmarz method and its accelerated variants are a powerful class of iterative methods for solving large-scale linear systems, offering guaranteed convergence with l…

stat.ML2026

Adaptive randomized pivoting and volume sampling

Ethan N. Epperly

Adaptive randomized pivoting (ARP) is a recently proposed and highly effective algorithm for column subset selection. This paper reinterprets the ARP algorithm by drawing connectio…