Sparsifying Set Systems for Coverage Problems

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=yujeUUTA3OE


Duration: 0:00
36 views
0

Andrew McGregor (University of Massachusetts Amherst)
https://simons.berkeley.edu/talks/andrew-mcgregor-university-massachusetts-amherst-2024-08-02
Sublinear Graph Simplification

We will survey recent work on sparsifying set systems for coverage problems.



Other Videos By Simons Institute for the Theory of Computing


2024-10-02Verifiable Data Science via Interactive Proofs
2024-10-02Dana is NOT average
2024-10-02Monotonicity testing, routing, and a theorem of Lehman and Ron
2024-10-02Conditional Sampling for Distribution Testing
2024-09-05Challenges in Making LLMs Safe and Robust
2024-09-04Understanding and Steering Generative AI Systems
2024-08-04On counting subgraphs and why counting seeds makes more sense (if one thinks about it clearly)
2024-08-04Testing Intersectingness of Uniform Families or how Dana and I intersected
2024-08-04Recent Developments in Testing Bounded-Degree Graphs
2024-08-04Property Testing with Incomplete or Manipulated Inputs
2024-08-01Sparsifying Set Systems for Coverage Problems
2024-07-31Recent Progress on Euclidean Spanners
2024-07-31Space is a latent sequence: A theory of hippocampus and PFC
2024-06-21Robust Equation Discovery and Sparse Sensing with Guarantees
2024-06-21Data is as Data Does: The Influence of Computation on Inference
2024-06-21Some thoughts on ML-based protein engineering
2024-06-21Machine learning models of differential gene expression
2024-06-21Open challenges in AI for molecular design: representation, experimental alignment, and...
2024-06-21Illuminating protein space with generative models
2024-06-21Symmetries in Machine Learning for Materials Science
2024-06-21Large ML potentials for chemistry: generalization, inductive biases, and cancellation of errors