1 citations · 1 across the 5 of their papers we have counts for
6 papers
Computing the Girth of a Segment Intersection Graph
Timothy M. Chan, Yuancheng Yu
We present an algorithm that computes the girth of the intersection graph of given line segments in the plane in expected time. This is the first such algorithm…
Privacy without Noisy Gradients: Slicing Mechanism for Generative Model Training
Kristjan Greenewald, Yuancheng Yu, Hao Wang +1
Training generative models with differential privacy (DP) typically involves injecting noise into gradient updates or adapting the discriminator's training procedure. As a result,…
Fair Anomaly Detection For Imbalanced Groups
Ziwei Wu, Lecheng Zheng, Yuancheng Yu +3
Anomaly detection (AD) has been widely studied for decades in many real-world applications, including fraud detection in finance, and intrusion detection for cybersecurity, etc. Du…
High-Dimensional Smoothed Entropy Estimation via Dimensionality Reduction
Kristjan Greenewald, Brian Kingsbury, Yuancheng Yu
We study the problem of overcoming exponential sample complexity in differential entropy estimation under Gaussian convolutions. Specifically, we consider the estimation of the dif…
Approximation Algorithms for Min-Distance Problems
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas +3
We study fundamental graph parameters such as the Diameter and Radius in directed graphs, when distances are measured using a somewhat unorthodox but natural measure: the distance…
Nearly Optimal Separation Between Partially And Fully Retroactive Data Structures
Lijie Chen, Erik D. Demaine, Yuzhou Gu +3
Since the introduction of retroactive data structures at SODA 2004, a major unsolved problem has been to bound the gap between the best partially retroactive data structure (where…