Query Optimization and Evaluation 1: Output Size Bounds and Information Theory

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


Duration: 57:21
688 views
18

Hung Ngo (RelationalAI)
https://simons.berkeley.edu/talks/hung-ngo-relationalai-2023-08-21
Logic and Algorithms in Database Theory and AI Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2023-08-24Algebraic Structures in Logic and Query Evaluation 2
2023-08-23Algebraic Structures in Logic and Query Evaluation 1
2023-08-23Logic and Probabilistic Circuits 4
2023-08-23Logic and Probabilistic Circuits 3
2023-08-23Logic and Probabilistic Circuits 2
2023-08-22Logic and Probabilistic Circuits 1
2023-08-22Lightning Talks
2023-08-22Query Optimization and Evaluation 4: Instance Optimality
2023-08-22Query Optimization and Evaluation 3: Variable Elimination and Tensor Decomposition
2023-08-22Query Optimization and Evaluation 2: Worst-Case Optimal Join Algorithms
2023-08-21Query Optimization and Evaluation 1: Output Size Bounds and Information Theory
2023-08-19Short Talks
2023-08-19Short Talks
2023-08-19A data-centric view on reliable generalization: From ImageNet to LAION-5B
2023-08-19Pretraining Task Diversity and the Emergence of Non-Bayesian In-Context Learning for Regression
2023-08-18In-Context Learning: A Case Study of Simple Function Classes
2023-08-18Watermarking of Large Language Models
2023-08-18Human-AI Interaction in the Age of Large Language Models
2023-08-18Are LLMs the Beginning or End of NLP?
2023-08-18Beyond Language: Scaling up Robot Ontogeny
2023-08-18Integrating Language into Intelligent Architectures


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Logic and Algorithms in Database Theory and AI Boot Camp
Hung Ngo