"Optimization in Modern Computational Settings: Algorithms and Impossibility Results"- Santhoshini.V

Originally presented on: Monday, January 17th, 2025 at 12:30 pm CT, TTIC, 6045 S. Kenwood Avenue, 5th Floor, Room 530

Title: "Optimization in Modern Computational Settings: Algorithms and Impossibility Results"

Speaker: Santhoshini Velusamy, TTIC

Abstract: The amount of data being generated and stored has increased rapidly over the past few decades. While data is measured in massive units like terabytes and petabytes, the capacity of a device's readily accessible memory, such as RAM, is only a few gigabytes. As a result, classical algorithms that assume the entire input is readily accessible have become less relevant. My research focuses on addressing fundamental problems in newer models of computation that consider the storage limitations of local memory. In this talk, I will discuss my work on Constraint Satisfaction Problems (CSPs)—a well-studied class of combinatorial optimization problems with wide-ranging applications in Computer Science—in the streaming model. In addition to fully characterizing the solvability of CSPs in this model through new algorithms and matching impossibility results, my work also reveals exciting new connections to other models. I will conclude the talk by discussing future directions.

Timestamps:
00:00
00:05 Intro
00:40 Lecture
45:10 Q&A

#artificialintelligence #ai #machinelearning #algorithm #computervision #robotics #research