Min-Max Optimization - Part II
Explore advanced min-max optimization techniques, including convergence analysis, implicit methods, and applications to multiplayer games and polynomial-type problems.
Privacy and Fairness
Explore differential privacy, stochastic optimization, and fairness in algorithms. Learn about new techniques, applications, and the importance of interaction in privacy-preserving machine learning.
A Marketplace for Data: An Algorithmic Solution
Explore algorithmic solutions for data marketplaces, addressing challenges like privacy, fairness, and revenue maximization in societal networks and real-time applications.
Polar Deconvolution of Mixed Signals - IMAGINE Seminar Series
Explore signal demixing using polar deconvolution, a novel approach for separating mixed signals with high efficiency and stability, presented by Michael Friedlander from UBC.
A Blackbox Reduction for Adaptive Adversaries Using Differential Privacy
Explore a novel black-box transformation using differential privacy to convert dynamic algorithms from oblivious to adaptive adversary resistance, enhancing algorithm design for dynamic graphs.
Designing Smart Algorithms: Traditional DSP vs. Machine Learning
Explore smart algorithm design using traditional DSP vs. machine learning. Compare approaches, discuss principles, and determine optimal techniques for your application.
Finding Eviction Sets at Scale - Prune+PlumTree Method
Explore efficient techniques for finding eviction sets at scale using the 9 Prune+PlumTree method, enhancing understanding of cache side-channel attacks and defenses.
Policy Revision Dynamics and Algorithm Design in Stochastic and Mean-Field Games
Explore policy dynamics and algorithm design in stochastic and mean-field games, focusing on decentralized learning algorithms for multi-agent systems and near-equilibrium convergence.
Sketching Big Data
Explore big data sketching techniques with Harvard's Jelani Nelson, covering approximate counting, frequent items, and graph streaming in this insightful lecture.
Robust List Decoding of Spherical Gaussians
Explore robust list decoding of spherical Gaussians, covering algorithms, error identification, and computational challenges in high-dimensional statistics.
Epsilon-Net Induced Lazy Witness Complex for Topological Data Analysis
Efficient topological data analysis using epsilon-net induced lazy witness complex. Improves scalability and approximation in persistent homology computation with theoretical guarantees and algorithmic implementations.
From Joins to Aggregates and Optimisation Problems - Professor Dan Olteanu, University of Oxford
Advanced database query processing: worst-case optimal join algorithms, functional aggregate queries, and in-database optimization for machine learning. Covers theory and practical applications in data science.
Learning-Augmented Online Optimization
Explore learning-augmented online optimization with Google's Ravi Kumar, covering computational and statistical gaps in learning and optimization techniques.
From AI to GX: The Quantum Leap in Algorithmic Evolution
Explore the evolution from AI to Generative Algorithms (GX) and its impact on algorithm design, creativity, and innovation in technology and society with insights from industry expert Jepson Taylor.
Randomized Linear Algebra for Interior Point Methods
Explore randomized linear algebra techniques for efficient interior point methods in linear programming, focusing on applications in data science and scientific computing.
How to Conduct Medical R&D with QiML Algorithms and Architectures
Explore quantum-inspired machine learning algorithms and architectures for advancing medical research and development in healthcare.
Convex Optimization IV - Sebastien Bubeck, Microsoft Research
Explore advanced concepts in convex optimization, including gradient flow, comparison techniques, and optimal algorithms with Sebastien Bubeck from Microsoft Research.
Graph Theory and Fixed-Parameter Tractability
Explore fixed-parameter tractability in graph theory, focusing on counting patterns, galactic algorithms, and key concepts like minors and topological minors.
Graph Theory and Algorithms
Explore graph theory fundamentals, Kcut algorithms, and weighted min cut problems in this comprehensive overview of advanced algorithmic concepts.
Near-Optimal Fully Dynamic Densest Subgraph
Explore near-optimal algorithms for dynamic densest subgraph problems, covering applications, definitions, and techniques for efficient graph orientation and load balancing.
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
Explore efficient algorithms for constructing directed hopsets and parallel approximate shortest paths, enhancing graph analysis and routing applications.