#### Filter Results:

#### Publication Year

2015

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie
- SODA
- 2017

Dynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n) 2) amortized expected update time and O(log n/ log log log n) query time, which comes within an O((log log n) 2) factor of a lower bound due to Pˇatra¸scu and Demaine. The new structure… (More)

Assume we are given the following: • Loss : R → R. Define the risk R (w) = E[(yw, x)]. Note that we said we needed convexity of our loss function last time, but it turns out we don't necessarily need it. We also make the following important assumptions: • ∃ w ∈ W with R (w) = inf v∈W R (v). That is, we assume there exists a minimizer, though this need not… (More)

- ‹
- 1
- ›