Title: Hamiltonian Descent Methods
| Speaker: | Guojun Zhang |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: In this talk, I will present a paper on the Hamiltonian descent methods
Title: 2-universality of random graphs.
| Speaker: | Gal Kronenberg |
| Affiliation: | Tel Aviv University |
| Room: | *MC 6486* |
Abstract: For a family of graphs F, a graph G is F-universal if G contains every graph in F as a (not necessarily induced) subgraph.
Title: Approximate Clustering without the Approximation
| Speaker: | Thomas Baxter |
| Affiliation: | University of Waterloo |
| Room: | MC 5417 |
Abstract: Previously in this CombOpt Reading Group series, we have discussed improving approximation factors for particular distance-based objective functions in clustering problems.
Title: Approximation Algorithms for Distributionally Robust Stochastic Optimization
| Speaker: | Chaitanya Swamy |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Two-stage stochastic optimization is a widely-used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: we make first-stage decisions knowing only the underlying distribution and before a scenario is realized, and may take additional second-stage recourse actions after a scenario is realized.
Title: Why Random Reshuffling Beats Stochastic Gradient Descent
| Speaker: | Julian Romero |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: Over the first few lectures in the seminar we studied the Stochastic Gradient Descent (SGD) method
Title: A Short Proof of the Containers Theorem for Hypergraphs
| Speaker: | Michelle Delcourt |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: A modern trend in extremal combinatorics is extending classical results from the dense setting (e.g. Szemerédi's theorem)
Title: Stability Yields a PTAS for k-Median and k-Means Clustering
| Speaker: | Adam Brown |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: Previously, we have seen a variety of approximation methods for k-median, and last week we saw
Title: Solving DNN Relaxations of the Quadratic Assignment Problem with ADMM and Facial Reduction
| Speaker: | Henry Wolkowicz |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
The quadratic assignment problem, QAP, has many important applications ranging from the planning of building locations of a university, to the positioning of modules on a computer chip (VLSI design), to the design of keyboards.
Title: Tutorial on Convolutional Neural Networks
| Speaker: | Haesol Im |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: We have seen stochastic gradient descent and automatic differentiation to help handle the big dimensionality of problems that often occur in machine learning.
Title: The upper density of monochromatic infinite paths
| Speaker: | Richard Lang |
| Affiliation: | University of Waterloo |
| Room: | MC 5417 |
Abstract: Given a complete graph $K_n$, whose edges are coloured in red and blue, what is the longest monochromatic path one can find?