Clustering Players' Strategies for Generation of Non-Player Characters in Mythic Legends
Discover how machine learning and clustering techniques streamline NPC development in gaming, focusing on army formations in Mythic Legends and practical solutions to complex distance function challenges.
Random Separating Hyperplane Theorem and Learning Polytopes
Delve into advanced mathematical concepts of hyperplane theorem, polytope learning, and optimization oracles with applications in machine learning's hidden variable problems.
Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits
Delve into stochastic combinatorial semi-bandits with a focus on risk-controlled online decision making, exploring algorithms for optimal subset selection while maintaining variance constraints.
Scalable Linear Invariant Generation with Farkas' Lemma
Explore scalable linear invariant generation techniques using Farkas' Lemma, improving efficiency and accuracy for affine programs without compromising completeness.
Approximation Algorithms for Hard Augmentation Problems - Lecture III
Explore advanced network design techniques for increasing graph connectivity, focusing on recent approaches and advances in augmentation problems like Tree Augmentation and Connectivity Augmentation.
The Power of Randomization - Distributed Submodular Maximization on Massive Datasets
Explore distributed algorithms for submodular maximization in machine learning, focusing on a parallel approach that achieves constant factor approximation guarantees for large-scale problems.
An O(1)-Approximation for Minimum Spanning Tree Interdiction
Explore an O(1)-approximation algorithm for minimum spanning tree interdiction, improving upon previous O(log(m)) solutions. Learn about network interdiction and its applications in infrastructure protection.
Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP
Optimizing algorithms for the many-visits TSP problem, improving time and space complexity while maintaining logarithmic dependence on tour length. Discusses applications and compares with previous work.
Unique Games and Expansion
Explore algorithms for Unique Games on certifiable small-set expanders and graphs with certifiable global hypercontractivity, providing insights into the 2-2 Games hardness result.
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.
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.
Tropical Tensor Networks
Unified tensor network approach for spin glasses using tropical algebra, enabling ground state energy computation, optimal configuration identification, and solution counting. Combines graphical models and quantum circuit simulation.
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
Explore a hybrid approach combining reinforcement learning and constraint programming for solving complex combinatorial optimization problems, with applications in various fields.
Reasoning on Natural Inputs
Explore neural algorithmic reasoning for natural inputs, bridging classical algorithms with deep learning to solve real-world problems more effectively in reinforcement learning environments.
Can ML Help in Solving Cargo Capacity Management Booking Control Problems
Explore ML applications in cargo capacity management, focusing on booking control problems and predicting solution costs for discrete optimization in revenue management.
The Transformer Network for the Traveling Salesman Problem
Explore how Transformer networks can tackle the Traveling Salesman Problem, improving upon existing heuristics with promising results for combinatorial optimization challenges.
Robust Regression by Purushottam Kar
Explore robust regression techniques for learning and estimation in algorithms and optimization, focusing on practical applications and theoretical foundations.
Constraint Satisfaction Problem - What Makes the Problem Easy
Explore constraint satisfaction problems, their complexity, and variants. Learn about polynomial-time solvable cases and NP-complete instances in this mathematical deep dive.
Quantum Optimization of Maximum Independent Set Using Rydberg Atom Arrays
Explore quantum optimization techniques for solving the Maximum Independent Set problem using Rydberg atom arrays in this advanced physics lecture.
Prediction + Optimisation - Without and With Decision-Focused Learning
Explore AI-enhanced combinatorial optimization, including preference learning, decision-focused learning, and explanation generation. Discover CPMpy, a modern constraint programming language integrating multiple solving paradigms with machine learning.
Restricted Boltzmann Machines for Maximum Satisfiability - IPAM at UCLA
Explore how Restricted Boltzmann Machines can be applied to Maximum Satisfiability problems, leveraging neural network accelerators for efficient stochastic search in combinatorial optimization.