Reinforcement Learning in Feature Space: Complexity and Regret
Explore reinforcement learning in feature space, focusing on complexity, regret analysis, and innovative approaches like MatrixRL. Learn about state feature mapping and its applications in real-world scenarios.
Turing Lecture 2021 - Abstractions, Their Algorithms, and Their Compilers
Explore computational thinking through abstractions, algorithms, and compilers. Delve into compiler design, large dataset handling, and quantum computation, with insights from renowned computer scientists.
Understanding Parameter Spaces Using Local Optima Networks
Explores using Local Optima Networks to analyze parameter landscapes of Particle Swarm Optimization, revealing complex structures influenced by underlying objective functions.
SIGCOMM 2020 - Routing on Multiple Optimality Criteria
Explore new fundamental results in optimal path routing, including isotonicity, partial orders, and multi-criteria optimization for advanced network protocols and algorithms.
STOC 2020 - Online Algorithms
Explore online algorithms, including caching with time windows, vector balancing, and primal-dual matching. Learn about recent advancements and open problems in this dynamic field of computer science.
Approximation Algorithms
Explore approximation algorithms for network design, including connectivity augmentation, Steiner trees, and spectral rounding techniques. Learn about linear programming and future research directions.
Optimization
Explore advanced optimization techniques for tall dense linear programs, including faster energy maximization for maximum flow problems.
Complexity I
Explore multiplicity theorem, programsized complexity, and algorithmic questions in this deep dive into computational complexity theory and its applications.
Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A
Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.
Algorithms for Heavy-Tailed Statistics - Regression, Covariance Estimation, and Beyond
Explore advanced statistical techniques for handling heavy-tailed data, including regression and covariance estimation, with a focus on SOS assumptions and median of means framework.
Dynamic Algorithms for LIS and Distance to Monotonicity
Explore dynamic algorithms for Longest Increasing Subsequence and Distance to Monotonicity, covering Patience Sorting, runtime improvements, and grid packing techniques.
Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
Explore quantum-inspired classical algorithms for machine learning, focusing on sublinear low-rank matrix arithmetic and singular value transformation techniques.
An Improved Approximation Algorithm for ATSP
Explore an advanced approximation algorithm for the Asymmetric Traveling Salesman Problem, covering linear programming relaxation, reductions, and recursive techniques to improve solution quality.
Constant Factor Approximations to Edit Distance in Nearly Linear Time
Explore efficient algorithms for approximating edit distance in near-linear time, merging insights from two papers to tackle dense and sparse graph scenarios.
Nearly Optimal Static Las Vegas Succinct Dictionary
Explore advanced data structures for efficient dictionary operations, focusing on succinct representations and optimizing space usage for various input types.
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Explore efficient parallel algorithms for approximating undirected shortest paths using low hop emulators, with applications and open problems in graph theory and network analysis.
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
Explore circuit lower bounds and derandomization, focusing on AC circuits, algorithmic methods, and pseudorandom generators. Learn about recent developments in average-case circuit analysis.
Towards a Better Understanding of Randomized Greedy Matching
Explores randomized greedy matching algorithms, introducing Modified Randomized Greedy (MRG) and analyzing its performance in various graph scenarios, including weighted and oblivious matching.
Breaching the 2-Approximation Barrier for Connectivity Augmentation
Explore advanced techniques in network design, focusing on connectivity augmentation and its reduction to the Steiner Tree problem. Learn about novel approximation algorithms and open challenges in the field.
Catalytic Approaches to the Tree Evaluation Problem
Explore catalytic approaches to the Tree Evaluation Problem, including pebbling games and catalytic space. Learn about multiplication lemmas and formulas for TEP.
Strong Self-Concordance and Sampling
Explore an algorithm for efficient polytope sampling, its connection to the KLS conjecture, and the properties of strong self-concordance in barrier functions.