Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, April 4, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Sina Baghal

Title: High dimensional probability: Estimation in high dimensions

Speaker: Sina Baghal
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

In this talk, we discuss high dimensional estimation problems. The aim is to estimate some point x in a given ambient bounded space K using a small number of independent random observations.

Friday, April 5, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Maryam Fazel

Title: Online Competitive Algorithms for Resource Allocation

Speaker: Maryam Fazel
Affiliation: University of Washington
Room: MC 5501

Abstract:

In online optimization with budgets, the data in the optimization problem is revealed over time. At each step a decision variable needs to be set without knowing the future inputs, while there is a budget constraint that couples the decisions across time.

Thursday, April 11, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Steve Vavasis

Title: Optimal detection of sparse principal components in high dimension

Speaker: Steve Vavasis
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

I will present the paper with this title by Berthet and Rigollet (Ann. Stat., 41 (2013) 1780-1815, https://projecteuclid.org/download/pdfview_1/euclid.aos/1378386239). 

Thursday, April 18, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Akshay Ramachandran

Title: Graph Sparsification by Effective Resistances

Speaker: Akshay Ramachandran
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

We will discuss an application of the matrix concentration inequalities of Tropp to spectral sparsification of graphs.

Thursday, April 25, 2019 4:00 pm - 4:00 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Tao Jiang

Title: Recovery of a mixture of Gaussians by sum-of-norms clustering

Speaker: Tao Jiang
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

Sum-of-norms clustering is a method for assigning n points in Rd to K clusters, 1 ≤ K ≤ n, using convex optimization.

Friday, May 3, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Chris Godsil

Title: From Warragul to Waterloo

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

As Tom Lehrer once said “Some of you may have run into mathematicians, and therefore had occasion to wonder how they got that way”; this talk will be a partial explanation of how I got this way.

Wednesday, May 8, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids Seminar - Jim Geelen

Title: The Erdős-Pósa property for A-paths

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room:  MC 5417

Abstract:

Let A be a set of vertices in a graph G. An A-path is a path whose ends are in A. Gallai proved, for any integer k, that there are either k disjoint A-paths or there is a set of at most 2k vertices that hit all A-paths.

Friday, May 10, 2019 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - Justin Toth

Title: Stable Matching Overview

Speaker: Justin Toth
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

This semester, the CombOpt Reading Group studies Stable Matching. In this talk we will introduce the basic concepts in stable matching, provide an overview of the planned papers to be discussed this semester, and mention interesting open questions along the way.

Friday, May 10, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Katya Scheinberg

Title: Stochastic optimization methods beyond stochastic gradient descent

Speaker: Katya Scheinberg
Affiliation: Lehigh University
Room: MC 5501

Abstract:

We will present a very general framework for unconstrained stochastic optimization which encompasses standard frameworks such as line search and trust region using random models.