Simons Institute | Efficiently Computing Similarities to Private Datasets @SimonsInstituteTOC | Uploaded 2 months ago | Updated 5 hours ago
Sandeep Silwal (MIT)
https://simons.berkeley.edu/talks/sandeep-silwal-mit-2024-06-17
Extroverted Sublinear Algorithms

$Online Algorithms for Spectral Hypergraph Sparsification Yuichi Yoshida (National Institute of Informatics) https://simons.berkeley.edu/talks/yuichi-yoshida-national-institute-informatics-2024-07-29 Sublinear Graph Simplification We provide the first online algorithm for spectral hypergraph sparsification. In the online setting, hyperedges with positive weights are arriving in a stream, and upon the arrival of each hyperedge, we must irrevocably decide whether or not to include it in the sparsifier. Our algorithm produces an (ϵ,δ)-spectral sparsifier with multiplicative error ϵ and additive error δ that has O(ϵ^{-2} n log n log r log(1+ϵW/δn)) hyperedges with high probability, where ϵ,δ ∈ (0,1), n is the number of nodes, and W is the sum of edge weights. The space complexity of our algorithm is O(n2), while previous algorithms require the space complexity of Ω(m), where m is the number of hyperedges. This provides an exponential improvement in the space complexity since m can be exponential in n. Based on a joint work with Tasuku Soma and Kam Chuen Tung.$

Emerging interactions in humans and machines: from Social Physiology to Social Neuro-AI

Parallel Algorithms for Local Problems in Sparse Graphs

What can be passively learned about causality?

Computation with sequences of neuronal assemblies

Panel: Reactive Synthesis - Open Questions and Challenges

Dynamic Matching and (Ordered) Ruzsa-Szemerédi Graphs: Towards Constructive Matching Sparsifiers

Whistle variability and social acoustic interactions in bottlenose dolphins

Efficiently Computing Similarities to Private Datasets @SimonsInstituteTOC