2 citations · 5 across the 10 of their papers we have counts for
4 papers · 1 filter
Dueling Optimization with a Monotone Adversary
Avrim Blum, Meghal Gupta, Gene Li +3
We introduce and study the problem of dueling optimization with a monotone adversary, which is a generalization of (noiseless) dueling convex optimization. The goal is to design an…
A Nearly Optimal Size Coreset Algorithm with Nearly Linear Time
Yichuan Deng, Zhao Song, Yitan Wang +1
A coreset is a point set containing information about geometric properties of a larger point set. A series of previous works show that in many machine learning problems, especially…
Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
Zhao Song, Xin Yang, Yuanyuan Yang +1
Projection maintenance is one of the core data structure tasks. Efficient data structures for projection maintenance have led to recent breakthroughs in many convex programming alg…
Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures
Zhao Song, Zhaozhuo Xu, Yuanyuan Yang +1
In this paper, we study the problem of speeding up a type of optimization algorithms called Frank-Wolfe, a conditional gradient method. We develop and employ two novel inner produc…