Introduction to Cubical Complexes and Persistence - 2020
Explore cubical complexes and cubical homology for efficient analysis of digital images using persistent homology, with applications in topological data analysis.
The Persistence Mayer-Vietoris Spectral Sequence
Explore the persistent Mayer-Vietoris spectral sequence, its applications in parallelizing persistent homology computations, and its ability to provide locality-enriched persistence barcodes.
Unsupervised Features Learning for Sampled Vector Fields
Explore innovative techniques for analyzing sampled vector fields using graph structures and unsupervised learning, revealing hidden features correlated with known dynamics in analytical models.
The History and Historiography of the Discovery of Calculus in India
Explore the evolution of calculus in India, from Āryabhaṭa to Mādhava's pioneering work, uncovering mathematical breakthroughs hidden in Sanskrit verses and examining historiographical aspects.
Visualizing 2 Dimensional Persistent Homology
Explore techniques for visualizing 2D persistent homology, a powerful tool in topological data analysis, to gain insights into complex datasets and their underlying structures.
CLIP, T-SNE, and UMAP - Master Image Embeddings and Vector Analysis
Master image embeddings and vector analysis techniques like CLIP, T-SNE, and UMAP. Learn to cluster MNIST images, detect duplicates, and explore essential concepts in computer vision and data science through hands-on practice.
Geometric Aspects of Sampling and Optimization
Explore geometric perspectives on sampling and optimization techniques, uncovering insights for data science applications and algorithm design.
Sketching High-Dimensional Data
Explore techniques for efficiently summarizing and analyzing large datasets in high-dimensional spaces, focusing on probability, geometry, and computational methods.
Adaptive Sparse Recovery with Limited Adaptivity
Explore techniques for efficient sparse signal recovery using limited adaptive measurements, with applications in sublinear algorithms and nearest-neighbor search.
Sketching for Linear Algebra - Basics of Dimensionality Reduction and CountSketch II
Explore dimensionality reduction and CountSketch techniques in linear algebra, focusing on advanced applications and theoretical foundations for data science.
Mergeable Summaries and the Data Sketches Library
Explore mergeable summaries and the Data Sketches Library, focusing on mathematical and computational challenges in real-time decision making for big data analytics.
Helmut Bölcskei - Lossy Compression on General Data Structures
Explore lossy compression for data on manifolds and fractals, with bounds on rate-distortion function and quantization error. Applications in data science and image processing.
The 17 Best Traps in the London System
Discover 17 powerful traps in the London System to gain a strategic advantage. Learn clever tactics and surprising moves to outmaneuver your opponents and improve your chess game.
Graph Neural Networks Are Dynamic Programmers
Explore how Graph Neural Networks function as dynamic programmers, bridging classical algorithms with neural approaches for optimal path finding and algorithmic reasoning.
The Forgotten Route: Making Apache Camel Work for You
Discover Apache Camel's hidden potential for efficient data flow and integration. Learn configuration tricks, implement Enterprise Integration Patterns, and explore real-world examples with JMS, FTP, and HTTP endpoints.
The Craziest Definition of the Derivative You Have Ever Seen
Explore an unconventional approach to defining derivatives, offering a fresh perspective on calculus concepts and challenging traditional mathematical thinking.
Fitting Manifolds to Data with Large Noise by Hari Narayanan
Explore techniques for fitting manifolds to noisy data, focusing on probabilistic and optimization methods in data science. Learn from expert Hari Narayanan in this comprehensive lecture.
The Unreasonable Effectiveness of Mathematics in Large Scale Deep Learning
Exploring the profound impact of mathematical principles on large-scale deep learning, unveiling unexpected connections and insights that drive advancements in artificial intelligence.
Learning from Dependent Data - Lecture 1
Explore techniques for learning from dependent data, focusing on probabilistic and optimization methods in data science. Gain insights into handling interconnected information effectively.
Graph Alignment: Informational and Computational Limits - Lecture 1
Explore graph alignment challenges, focusing on informational and computational limits in data science. Gain insights into probabilistic methods for analyzing complex network structures.
Causal Matrix Completion - Applications to Offline
Explore causal matrix completion and its applications in offline settings, focusing on probabilistic and optimization methods in data science.