Sketching Algorithms Courses and Certifications

Conf42

Sketching Algorithms: Making Sense of Big Data in a Single Stroke

Explore sketching algorithms for efficient big data processing, covering concepts, design principles, and practical applications using open-source tools like Apache DataSketches.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

Instituto de Matemática Pura e Aplicada

Sketching Algorithms

Explore advanced sketching algorithms techniques presented by UC Berkeley's Jelani Nelson at Brazil's premier mathematics conference, covering computational methods for data analysis.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

UofU Data Science

Streaming Frequency Approximation - L13

Master streaming algorithms for frequency approximation including Misra-Gries, Count Sketch, and A-Priori methods in this data science lecture.

• YouTube
• 1 hour 23 minutes
• Self-Paced
• Free Video

Simons Institute

Sketching Algorithms for Max-DICUT and Other CSPs

Explore algorithms for Maximum Directed Cut problem in graph theory, focusing on sketching techniques, space complexity, and applications to Constraint Satisfaction Problems.

• YouTube
• 1 hour
• Self-Paced
• Free Video

IAS | PCMI Park City Mathematics Institute

Quantum-Inspired Algorithms: Sketching and Beyond - Part 5

Delve into quantum-inspired algorithms and sketching techniques, exploring linear algebraic frameworks and polynomial approximation tools for quantum singular value transformation in computational analysis.

• YouTube
• 59 minutes
• Self-Paced
• Free Video

IAS | PCMI Park City Mathematics Institute

Quantum-Inspired Algorithms: Sketching and Beyond - Part 3

Delve into quantum singular value transformation (QSVT) and polynomial approximation techniques, exploring their applications in quantum algorithm design for data analysis and machine learning.

• YouTube
• 1 hour
• Self-Paced
• Free Video

UofU Data Science

Matrix Sketching - Eigendecomposition, SVD, PCA, and Streaming Algorithms - L16

Explore matrix sketching techniques including SVD, PCA, and streaming algorithms for efficient data dimensionality reduction and covariance analysis.

• YouTube
• 1 hour 18 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

On Quantum Linear Algebra for Machine Learning - IPAM at UCLA

Explore quantum singular value transformation for machine learning, its applications, limitations, and connections to classical algorithms in this technical talk on quantum linear algebra.

• YouTube
• 35 minutes
• Self-Paced
• Free Video

Simons Institute

On Quantum Linear Algebra for Machine Learning - Quantum Colloquium

Explore quantum singular value transformation for machine learning, its applications, barriers to quantum speedups, and connections to classical algorithms.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

Databricks

DataSketches: A Production Quality Sketching Library for Big Data Analysis

Explore sketching algorithms for efficient big data analysis, enabling fast approximate answers to complex queries and real-time processing of massive datasets in production environments.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

USENIX

SketchLib - Enabling Efficient Sketch-based Monitoring on Programmable Switches

Explore efficient sketch-based network monitoring on programmable switches with SketchLib. Learn optimization techniques to reduce hardware resource footprint while maintaining measurement accuracy.

• YouTube
• 15 minutes
• Self-Paced
• Conference Talk

Simons Institute

Capacity Analysis of Vector Symbolic Architectures

Explores representation capacities of vector symbolic architectures, analyzing their ability to perform symbolic tasks and comparing them to a novel Hopfield network variant.

• YouTube
• 43 minutes
• Self-Paced
• Free Video

IEEE

Streaming and Learning Algorithms - Session 7C

Explore cutting-edge streaming and learning algorithms in this IEEE session, focusing on recent advancements and applications in data processing and machine learning.

• YouTube
• 1 hour 15 minutes
• Self-Paced
• Free Video

Simons Institute

Maximum Matching in O(log log n) Passes in Dynamic Streams

Explore an algorithm for approximating maximum matching in dynamic streams, achieving O(1)-approximation in O(log log n) passes and O(n poly log n) space, with lower bound proof.

• YouTube
• 40 minutes
• Self-Paced
• Free Video

USENIX

Oasis: An Out-of-core Approximate Graph System via All-Distances Sketches

Explore Oasis, an Out-of-core Approximate Graph System that leverages All-Distances Sketches for efficient large-scale graph processing with minimal memory requirements while maintaining high accuracy.

• YouTube
• 19 minutes
• Self-Paced
• Free Video