The Kikuchi Hierarchy and Tensor PCA
Explores advanced algorithms for tensor PCA, introducing a new hierarchy inspired by Kikuchi free energy to improve belief propagation performance and match sum-of-squares methods.
Fast FPT-Approximation of Branchwidth
Explore efficient graph decomposition techniques and FPT algorithms for approximating branchwidth, with applications in structural graph theory and dynamic programming.
Francisco Criado - The Dual 1-Fair Packing Problem and Applications to Linear Programming
Explore proportional fairness in resource allocation, its dual problem, and applications to linear programming algorithms, focusing on geometric relationships and potential improvements.
Hardness Results in Discrete Morse Theory for 2-Complexes
Explore inapproximability and parameterized complexity in discrete Morse theory for 2-complexes, focusing on minimizing critical simplices and presenting new hardness results and an approximation algorithm.
Maximizing Monotone Submodular Functions over the Integer Lattice
Explore advanced algorithms for maximizing monotone submodular functions on integer lattices, with applications in machine learning and combinatorial optimization.
Reassembling Trees for the Traveling Salesman
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
Computing Optimal Homotopies
Explore optimal curve similarity measures using homotopy-based approaches, examining structural properties, algorithms, and open questions in topology and computational geometry.
X-Ramanujan Graphs
Explore X-Ramanujan graphs and their applications in computer science, focusing on advanced concepts beyond randomized rounding and the probabilistic method in graph theory.
High Dimensional Robust Sparse Regression
Explore advanced techniques for robust sparse regression in high-dimensional data, focusing on sublinear algorithms and nearest-neighbor search methods.
Decision-Focused Learning - Integrating Downstream Combinatorics in ML
Explore the integration of machine learning and discrete optimization to enhance problem-solving in real-world scenarios, focusing on decision-focused learning and tailored solution strategies.
Performance of Steepest Descent in 0/1 LPs
Explores steepest descent in 0/1 LPs, proving polynomial-length paths and developing a new pivot rule for the Simplex method. Unifies circuit and edge steps, advancing understanding of combinatorial optimization.
Large Scale Machine Learning and Convex Optimization - Lecture 1
Explore advanced stochastic optimization techniques for large-scale machine learning, including novel Newton-based algorithms and hybrid approaches that achieve improved convergence rates and efficiency.
Parallel Batch-Dynamic Graph Representations
Explore efficient dynamic graph representations with Aspen and CPAM frameworks, enabling faster updates and space-efficient algorithms for practical applications like dynamic connectivity.
Dynamic Algorithms for Center on Graphs
Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.
Matrix Methods in Computer Science - Session 6B
Explore advanced matrix methods and their applications in computer science, focusing on cutting-edge research and algorithmic developments.
A Characterization of Graph Properties Testable for General Planar Graphs with One-Sided Error
Explore graph properties testable for general planar graphs with one-sided error, focusing on characterization and analysis techniques.
Dynamic PageRank: Additive Error and Batch Recomputation
Explores dynamic PageRank algorithms, proving hardness of relative error approximations and demonstrating efficiency of batch recomputation for L1 error metric in dynamic graph settings.
Decremental Shortest Paths Against an Adaptive Adversary
Explore efficient algorithms for maintaining shortest paths in dynamic graphs undergoing deletions, with a focus on near-optimal deterministic data structures and adaptive adversary scenarios.
Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems
Explore a powerful new tool for solving minimum cut problems in combinatorial optimization, with applications to global, Steiner, and all-pairs min-cut algorithms.
On Dynamic Graph Approximations - The Case of J-Trees
Explores dynamic maintenance of j-trees in graph theory, discussing implications for cut-based optimization, maximum flows, and minimum cost-flow computations in algorithmic design.
On Engineering Dynamic Graph Algorithms
Explore challenges, techniques, and best practices for engineering dynamic graph algorithms, with insights on experimental approaches and design considerations.