23 citations · 58 across the 13 of their papers we have counts for
14 papers
Weakly Supervised Monocular 3D Object Detection using Multi-View Projection and Direction Consistency
Runzhou Tao, Wencheng Han, Zhongying Qiu +2
Monocular 3D object detection has become a mainstream approach in automatic driving for its easy application. A prominent advantage is that it does not need LiDAR point clouds duri…
A Convergence Theory for Federated Average: Beyond Smoothness
Xiaoxiao Li, Zhao Song, Runzhou Tao +1
Federated learning enables a large amount of edge computing devices to learn a model without data sharing jointly. As a leading algorithm in this setting, Federated Average FedAvg,…
Sublinear Time Algorithm for Online Weighted Bipartite Matching
Hang Hu, Zhao Song, Runzhou Tao +3
Online bipartite matching is a fundamental problem in online algorithms. The goal is to match two sets of vertices to maximize the sum of the edge weights, where for one set of ver…
A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework
Baihe Huang, Shunhua Jiang, Zhao Song +2
This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. This paper follows from the existing robust SD…
Giallar: Push-Button Verification for the Qiskit Quantum Compiler
Runzhou Tao, Yunong Shi, Jianan Yao +5
This paper presents Giallar, a fully-automated verification toolkit for quantum compilers. Giallar requires no manual specifications, invariants, or proofs, and can automatically v…
A Formally Certified End-to-End Implementation of Shor's Factorization Algorithm
Yuxiang Peng, Kesha Hietala, Runzhou Tao +4
Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but these are only useful if computed answers are correct. While hardware-level…
Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)
Runzhou Tao, Yunong Shi, Jianan Yao +3
Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs…
Symmetric Sparse Boolean Matrix Factorization and Applications
Sitan Chen, Zhao Song, Runzhou Tao +1
In this work, we study a variant of nonnegative matrix factorization where we wish to find a symmetric factorization of a given input matrix into a sparse, Boolean matrix. Formally…
Solving SDP Faster: A Robust IPM Framework and Efficient Implementation
Baihe Huang, Shunhua Jiang, Zhao Song +2
This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hy…
InstaHide's Sample Complexity When Mixing Two Private Images
Baihe Huang, Zhao Song, Runzhou Tao +3
Training neural networks usually require large numbers of sensitive training data, and how to protect the privacy of training data has thus become a critical topic in deep learning…
Edge-Weighted Online Bipartite Matching
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao +1
Online bipartite matching and its variants are among the most fundamental problems in the online algorithms literature. Karp, Vazirani, and Vazirani (STOC 1990) introduced an elega…
CertiQ: A Mostly-automated Verification of a Realistic Quantum Compiler
Yunong Shi, Runzhou Tao, Xupeng Li +4
We present CertiQ, a verification framework for writing and verifying compiler passes of Qiskit, the most widely-used quantum compiler. To our knowledge, CertiQ is the first effort…
Streaming Hardness of Unique Games
Venkatesan Guruswami, Runzhou Tao
We study the problem of approximating the value of a Unique Game instance in the streaming model. A simple count of the number of constraints divided by , the alphabet size of t…
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang +3
Huang et al.~(STOC 2018) introduced the fully online matching problem, a generalization of the classic online bipartite matching problem in that it allows all vertices to arrive on…