activity
20172026
most citedSpace-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching

11 citations · 26 across the 25 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

cs.DS2026

Hadamard Flattening and Gaussian Pooling Sketch for Least Squares with Coordinate-wise Guarantee

Zhao Song, Lichen Zhang

Randomized sketch-and-solve algorithms accelerate overconstrained regression by replacing the input with a smaller problem. Standard subspace embeddings guarantee that the…

cs.DS2026

A General Framework for Metropolis-Adjusted Dikin Walks: Dimension-Square Mixing on Polytopes and Log-Det Walks on Spectrahedra

Zhao Song, Lichen Zhang

We analyze exact-metric, Metropolis-adjusted Dikin walks by keeping the proposal determinant and reverse quadratic form together. Their leading uncentered terms cancel in the compl…

math.CO2026

On the maximum number of edges of k-cacti

Yuanqiu Huang, Licheng Zhang

A cactus is a graph in which every edge lies on at most one cycle. In 2024, Zhang and Huang generalized this concept to the -cactus, defined as a graph in which every edge lies…

cs.CV2026

ArcFlow: Unleashing 2-Step Text-to-Image Generation via High-Precision Non-Linear Flow Distillation

Zihan Yang, Shuyuan Tu, Licheng Zhang +3

Diffusion models have achieved remarkable generation quality, but they suffer from significant inference cost due to their reliance on multiple sequential denoising steps, motivati…

quant-ph2026

Sublinear Time Quantum Algorithm for Attention Approximation

Zhao Song, Jianfei Xue, Jiahao Zhang +1

Given the query, key and value matrices , the attention module is defined as where wi…