Shang-En Huang

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 \Patrascu{} and Demaine. The(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