Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
28
|
29
|
30
|
31
|
1
|
3
|
|
|
|
|
|
|
|
|
4
|
5
|
6
|
10
|
|||
|
|
|
|
|||
11
|
12
|
13
|
17
|
|||
|
|
|
|
|||
18
|
19
|
20
|
24
|
|||
|
|
|
|
|||
25
|
26
|
1
|
||||
|
|
|
Title: Approximating k-Median via Pseudo-Approximation
Speaker: Sharat Ibrahimpur Affiliation: University of Waterloo Room: MC 5479Abstract: In the last two talks we saw two approaches for approximating k-median.
Title: Razborov's flag algebras: Ten years on
Speaker: Sergey Norin Affiliation: McGill University Room: MC 5501Abstract:
Many of the classical results in extremal combinatorics were obtained by ingenious application of elementary techniques, such as induction and Cauchy-Schwarz inequality.
Title: Hamiltonian Descent Methods
Speaker: Guojun Zhang Affiliation: University of Waterloo Room: MC 5479Abstract: 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 5417Abstract: 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 5501Abstract:
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 5479Abstract: 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 6486Abstract: 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 5479Abstract: 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 5501Abstract:
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 5479Abstract: 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 5417Abstract: Given a complete graph $K_n$, whose edges are coloured in red and blue, what is the longest monochromatic path one can find?
Title: Implementing supersingular isogeny cryptography
Speaker: David Jao Affiliation: University of Waterloo Room: MC 5501Abstract:
Recent years have seen dramatic progress and improvements in the implementation of supersingular isogeny-based cryptosystems.
The "blood, sweat, tears, toil and triumphs" of commercializing technology
Title: Convergence Rate of Block-Coordinate Maximization Burer-Monteiro Method for Solving Large SDP
Speaker: Sina Rezazadeh Affiliation: University of Waterloo Room: MC 5479Abstract: Burer and Monteiro in 2003 proposed a nonlinear algorithm for solving semidefinite programs.
Title: Flag algebras and subgraph density problems
Speaker: Kris Siy Affiliation: University of Waterloo Room: MC 5417Abstract: Flag algebras are a tool introduced by Razborov in 2007 that has since been successfully used to approach or solve many problems in asymptotic extremal combinatorics.
Title: Clustering under Ordered Norms
Speaker: Sharat Ibrahimpur Affiliation: University of Waterloo Room: MC 5479Abstract: In this talk we will see approximation algorithms for a broad class of objective functions called as ordered norms.
Title: Aggregation-based cutting-planes for packing and covering integer programs
Speaker: Merve Bodur Affiliation: University of Toronto Room: MC 5501Abstract:
We study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs).
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Office of Indigenous Relations.