Organizing Committee
Abstract

Data science in low-dimensional spaces is motivated by applications in mapping, navigation, geographic resource allocation, modeling of body shapes and chemical structures, and more. In addition to datasets that naturally reside in low-dimension spaces, dimension-reduction methods can often transform high dimensional data to lower-dimensional data while preserving properties of interest. Since many computational problems are intractable for high-dimensional data but potentially tractable for low-dimensional data, it is useful to establish the algorithmic foundations of data science on low-dimensional data, to understand the special properties of such data, and to identify computational methods that are highly effective when applied to such data.

This workshop will bring together researchers in academia and industry to explore algorithmic and data analysis technique specialized for low-dimensional data, and application areas in which such problems arise. The focus of this workshop is on algorithms with provable performance guarantees. In particular, we are interested in algorithms that scale to large datasets, and algorithms that adapts to distributed environments and to online settings.

Confirmed Speakers & Participants

  • Speaker
  • Poster Presenter
  • Attendee

Workshop Schedule

Monday, May 13, 2019
TimeEventLocationMaterials
8:30 - 8:55Registration - ICERM 121 South Main Street, Providence RI 0290311th Floor Collaborative Space 
8:55 - 9:00Welcome - ICERM Director11th Floor Lecture Hall 
9:00 - 9:45Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics - Vincent Cohen-Addad, CNRS & Sorbonne Université11th Floor Lecture Hall 
10:00 - 10:30Coffee/Tea Break11th Floor Collaborative Space 
10:30 - 11:15MapReduce algorithms for center-based clustering in doubing spaces - Geppino Pucci, Università di Padova11th Floor Lecture Hall
11:30 - 12:15MapReduce algorithms for diversity maximization in doubling spaces - Andrea Pietracaprina, Università di Padova11th Floor Lecture Hall
12:30 - 2:30Break for Lunch / Free Time  
2:30 - 3:15A Global Notion of Metric Dimension - Anupam Gupta, Carnegie Mellon University11th Floor Lecture Hall 
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Towards Algorithms for Districting Plans that Perfectly Balance Population and Nearly Minimize Dispersion - Philip Klein, Brown University11th Floor Lecture Hall 
5:00 - 6:30Welcome Reception11th Floor Collaborative Space 
Tuesday, May 14, 2019
TimeEventLocationMaterials
9:00 - 9:45All geometries are wrong but some are useful - the art of simplification in GIS - Joshua Lieberman, Harvard University11th Floor Lecture Hall
10:00 - 10:30Coffee/Tea Break11th Floor Collaborative Space 
10:30 - 11:15Dimensionality Reduction - Theoretical Analysis of Practical Measures - Nova Fandina, Hebrew University of Jerusalem11th Floor Lecture Hall
11:30 - 12:15Generalization Bounds for Distance-Based Learning with High-Dimensional Domains and Codomains - Cyrus Cousins, Brown University11th Floor Lecture Hall
12:30 - 2:30Break for Lunch / Free Time  
2:30 - 3:15Covering Metric Spaces by Few Trees - Ofer Neiman, Ben-Gurion University11th Floor Lecture Hall
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Truly Optimal Euclidean Spanners in Low Dimensional Spaces - Hung Le, University of Victoria11th Floor Lecture Hall 
Wednesday, May 15, 2019
TimeEventLocationMaterials
9:00 - 9:45Flood Risk Analysis on Terrains - Pankaj Agarwal, Duke University11th Floor Lecture Hall 
10:00 - 10:30Coffee/Tea Break11th Floor Collaborative Space 
10:30 - 11:15Graphs and Computational Geometry - Sergio Cabello, University of Ljubljana11th Floor Lecture Hall
11:30 - 12:15Planar Diameter via Metric Compression - Jason Li, Carnegie Mellon University11th Floor Lecture Hall 
12:30 - 1:00Group Photo11th Floor Lecture Hall 
12:40 - 2:30Break for Lunch / Free Time  
2:30 - 3:15Distance oracles for planar graphs - Shay Mozes, Interdisciplinary Center Herzliya11th Floor Lecture Hall
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45On metric embeddings, shortest path decompositions and face cover of planar graphs - Arnold Filtser, Ben-Gurion University11th Floor Lecture Hall
Thursday, May 16, 2019
TimeEventLocationMaterials
9:00 - 9:45Algorithms for Hard Problems on Low Highway Dimension Graphs - Andreas Feldmann, Charles University11th Floor Lecture Hall
10:00 - 10:30Coffee/Tea Break11th Floor Collaborative Space 
10:30 - 11:15Scalable Algorithms for Last-Mile Delivery - Renato Werneck, Amazon11th Floor Lecture Hall 
11:30 - 12:15Approximation Algorithms for Capacitated Vehicle Routing Problems in Transportation Networks - Amariah Becker, Brown University11th Floor Lecture Hall 
12:30 - 2:30Break for Lunch / Free Time  
2:30 - 3:15Learning GGMs without Condition Number Bounds - Ankur Moitra, MIT11th Floor Lecture Hall 
3:30 - 4:00Coffee/Tea Break11th Floor Collaborative Space 
4:00 - 4:45Partisan Segregation - Ryan Enos, Harvard University11th Floor Lecture Hall 
Friday, May 17, 2019
TimeEventLocationMaterials
9:00 - 9:45Pseudodimension for data analysis - Matteo Riondato, Amherst College11th Floor Lecture Hall
10:00 - 10:30Coffee/Tea Break11th Floor Collaborative Space 
10:30 - 11:15Dimension Reduction for k-means via Random Projections - Chris Schwiegelshohn, Sapienza University of Rome11th Floor Lecture Hall 
11:30 - 12:15Algorithms for metric learning via contrastive embeddings. - Anastasios (Tasos) Sidiropoulos, University of Illinois at Chicago11th Floor Lecture Hall 

Request Reimbursement

Acceptable Costs
  • 1 roundtrip between your home institute and ICERM
  • Flights on U.S. or E.U. airlines – economy class to either Providence airport (PVD) or Boston airport (BOS)
  • Ground Transportation to and from airports and ICERM.
Unacceptable Costs
  • Flights on non-U.S. or non-E.U. airlines
  • Flights on U.K. airlines
  • Seats in economy plus, business class, or first class
  • Change ticket fees of any kind
  • Multi-use bus passes
  • Meals or incidentals
Advance Approval Required
  • Personal car travel to ICERM from outside New England
  • Multiple-destination plane ticket; does not include layovers to reach ICERM
  • Arriving or departing from ICERM more than a day before or day after the program
  • Multiple trips to ICERM
  • Rental car to/from ICERM
  • Flights on a Swiss, Japanese, or Australian airlines
  • Arriving or departing from airport other than PVD/BOS or home institution's local airport
  • 2 one-way plane tickets to create a roundtrip (often purchased from Expedia, Orbitz, etc.)
Reimbursement Request Form

https://icerm.brown.edu/money/

Refer to the back of your ID badge for more information. Checklists are available at the front desk.

Reimbursement Tips
  • Scanned original receipts are required for all expenses
  • Airfare receipt must show full itinerary and payment
  • ICERM does not offer per diem or meal reimbursement
  • Allowable mileage is reimbursed at prevailing IRS Business Rate and trip documented via pdf of Google Maps result
  • Keep all documentation until you receive your reimbursement!
Reimbursement Timing

6 - 8 weeks after all documentation is sent to ICERM. All reimbursement requests are reviewed by numerous central offices at Brown who may request additional documentation.

Reimbursement Deadline

Submissions must be received within 30 days of ICERM departure to avoid applicable taxes. Submissions after thirty days will incur applicable taxes. No submissions are accepted more than six months after the program end.

Lecture Videos

Algorithms for metric learning via contrastive embeddings

Anastasios (Tasos) Sidiropoulos
University of Illinois at Chicago
May 17, 2019

Dimension Reduction for k-means via Random Projections

Chris Schwiegelshohn
Sapienza University of Rome
May 17, 2019

Partisan Segregation

Ryan Enos
Harvard University
May 16, 2019

Distance oracles for planar graphs

Shay Mozes
Interdisciplinary Center Herzliya
May 15, 2019

Graphs and Computational Geometry

Sergio Cabello
University of Ljubljana
May 15, 2019

Better algorithms for the k-cut problem

Anupam Gupta
Carnegie Mellon University
May 13, 2019