The research group at Google New York holds a regular weekly seminar, besides seminars in various areas (algorithms, machine learning, natural language processing, and many others).  Some of these seminars are internal-only, but many are public talks open to our academic colleagues from or visiting the New York area.  If you want to attend one of these seminars, please contact a Google colleague you know; do the same if you want to give a talk at this venue.

Recent Seminars (Past seminars, see here):

    Algorithms Research Seminar, Nov 7, 2017

    "Balanced Policy Learning from Observational Data"

            Nathan Kallus, Cornell


    Algorithms Research Seminar, Oct 31, 2017

    "When the Optimum is also Blind: a New Perspective on Universal Optimization"

            Michał Włodarczyk, Univ. of Warsaw


    Algorithms Research Seminar, Oct 27, 2017

    "Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems"

            André Linhares, Waterloo


    Algorithms Research Seminar, Oct 18, 2017

    "Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs"

            Michal Feldman, Tel-Aviv


    Algorithms Research Seminar, Oct 12, 2017

    "Learning Multi-item Auctions with (or without) Samples"

            Yang Cai, McGill


    Algorithms Research Seminar, Oct 11, 2017

    "Spectral Algorithms and Sum-of-Squares Analyses"

            Tselil Schramm, Berkeley


    Algorithms Research Seminar, Oct 10, 2017

    "The Limit of Rationality in Choice Modeling"

           Paat Rusmevichientong, USC


    Algorithms Research Seminar, Oct 9, 2017

    "A Framework for Interactive Learning"

            David Kempe, USC


    Algorithms Research Seminar, Oct 6, 2017

    "Deferred-Acceptance Auctions: Worst-Case Approximation Guarantees"

            Vasilis Gkatzelis, Drexel


    Algorithms Research Seminar, Sept 29, 2017

    "Credible Mechanism Design"

            Shengwu Li, Harvard


    Algorithms Research Seminar, Sept 26, 2017

    "deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph"

            Prashant Pandey, Stony Brook


    Algorithms Research Seminar, Sept 19, 2017

    "Thompson Sampling for Learning in Online Decision Making"

            Shipra Agrawal, Columbia


    Algorithms Research Seminar, August 23, 2017

    "Randomized Online Matching in Regular Graphs"

            David Wajc, CMU


    Algorithms Research Seminar, August 10, 2017

    "Applications of Strongly Rayleigh Measures in Counting and Optimization"

            Nima Anari, Stanford University


    Algorithms Research Seminar, July 18, 2017    

    "Bernoulli Factories and Blackbox Reductions in Mechanism Design"

            Rad Niazadeh, Stanford University


    Algorithms Research Seminar, May 23, 2017    

    "What Data Science can tell us about the sharing economy and the structure of hidden networks"

            Bruno Abrahao, New York University


    Algorithms Research Seminar, May 18, 2017    

    "Hardness of Approximation Between P and NP"

            Aviad Rubinstein, UC Berkeley

    

    Algorithms Research Seminar, May 9, 2017    

    "The k-peak Decomposition: Mapping the Global Structure of Graphs"

            Priya Govindan, Rutgers


    Algorithms Research Seminar, April 25, 2017    

    "On Simultaneous Two-player Combinatorial Auctions"

             Jieming Mao, Princeton


    Algorithms Research Seminar, April 18, 2017    

    "Practical Load Balancing with Consistent Hashing"

            Andrew Rodland, Vimeo


    Algorithms Research Seminar, April 14, 2017    

    "Learning from Untrusted Data"

            Greg Valiant, Stanford


    Algorithms Research Seminar, April 4, 2017

    "Signaling in Routing Games"

            Yu Cheng, USC


    Algorithms Research Seminar, March 28, 2017

    "Assortment Optimization under a Mixture of Mallows distribution over Preferences"

            Vineet Goyal, Columbia


     Algorithms Research Seminar, March 10, 2017

    "Efficient Massively Parallel Methods for Dynamic Programming"

            Sungjin Im, UC Merced 


    Algorithms Research Seminar, March 3, 2017

    "Generalization and Equilbrium in GANs"

            Sanjeev Arora, Princeton University


    Algorithms Research Seminar, February 28, 2017

    "LSD: The Distortion of Locality Sensitive Hashing"

            Alessandro Panconesi, Sapienza University of Rome


    Algorithms Research Seminar, February 21, 2017

    "A System for Distributed Graph Mining"

            Marco Serafini, Qatar Computing Research Institute


    Algorithms Research Seminar, February 14, 2017

    "Tackling network interference with hierarchical randomized designs"

            Jean Pouget-Abadie, Harvard


    Algorithms Research Seminar, December 16, 2016  

    "Lazifying Conditional Gradients"

            Sebastian Pokutta, Georgia Tech


    Algorithms Research Seminar, December 15, 2016  

    "Approximation Algorithms for Regret-Bounded Vehicle Routing and Related Problems via LPs"

            Chaitanya Swamy, University of Waterloo


    Algorithms Research Seminar, December 1, 2016  

    "Tight Bounds for the Single-Pass Streaming Complexity of the Set Cover Problem"

            Sepehr Assadi, U-Penn


    Algorithms Research Seminar, November 29, 2016  

    "Deep-dive on Fast Algorithms for Packing and Covering LPs"

            Neal Young, UC Riverside


    Algorithms Research Seminar, November 11, 2016  

    "MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension"

            Eli Upfal, Brown University


    Algorithms Research Seminar, November 8, 2016  

    "Mixed Integer Convex Optimization"

            Miles Lubin, MIT


    Algorithms Research Seminar, October 27, 2016  

"Time-Space Trade-Offs in Population Protocols"

            Rati Gelashvili, MIT


    Algorithms Research Seminar, October 18, 2016  

    "Approximate Gaussian Elimination for Laplacians"

            Rasmus Kyng, Yale


    Algorithms Research Seminar, October 17, 2016  

    "Multi-Label Classification: from Local Inference to Global Optimization"

            Seffi Naor, Technion


    Algorithms Research Seminar, October 14, 2016  

    "Online Budgeted Allocation with General Budgets"

            Debmalya Panigrahi, Duke University


     Algorithms Research Seminar, October 11, 2016

    "Clustering with an Oracle"

            Arya Mazumdar, University of Massachusetts Amherst        


    Algorithms Research Seminar, September 20, 2016

"Lower Bounds for MapReduce Computations"

  Sergei Vassilvitskii, Google Research

Algorithms Research Seminar, September 6, 2016

"Testing Distribution Properties"

  Constantinos Daskalakis, MIT


Algorithms Research Seminar, August 23, 2016

"Tractable Approximation Algorithms for the NP-Hard Problem of Growing Linear Consensus Networks"

  Milad Siami, Lehigh University


Algorithms Research Seminar, August 16, 2016

"Directed Laplacians and Faster Linear System Solving for Computing the Stationary Distribution"

  Adrian Vladu, MIT


Algorithms Research Seminar, August 9, 2016

"Algorithms for Massive Graphs"

  Mauro Sozio, Télécom Paristech


Algorithms Research Seminar, August 2, 2016

"The Statistical and Computational Power of Tree Decompositions for Graph Inference"

  Dylan Foster, Cornell University


Algorithms Research Seminar, July 19, 2016

"Online optimization and learning under long-term convex constraints and objective"

  Shipra Agrawal, Columbia University


Algorithms Research Seminar, July 12, 2016

"An Integrated Analysis of Mobile Application Usage and In-App Advertising Response"

  Liye Ma, University of Maryland


Algorithms Research Seminar, June 28, 2016

"The Power and Limitations of Optimization from Samples"

  Eric Balkanski, Harvard University


Algorithms Research Seminar, June 21, 2016

"Optimizing promotion planning; from vendor deals to pricing and promotion vehicle selection"

  Georgia Pirakis, MIT


Algorithms Research Seminar, June 9, 2016

"Tangles and the Mona Lisa"

  Reinhard Diestel, University of Hamburg


Algorithms Research Seminar, June 7, 2016

"Challenges and Opportunities in Data Analysis (Or: Applying Theoretical Computer Science to Big Data)"

  Justin Thaler, Georgetown University


Algorithms Research Seminar, May 17, 2016

"Matching in Data Streams"

  Morteza Monemizadeh, Charles University, Prague


Algorithms Research Seminar, May 24, 2016

"Unbalanced Matching Markets: The Stark Effect of Competition"

  Jacob Leshno, Columbia University


Algorithms Research Seminar, May 17, 2016

"Firefighting on Trees Beyond Integrality Gaps"

  David Adjiashvili, ETH Zurich


Algorithms Research Seminar, March 8, 2016

"Exploration vs. Exploitation: Reducing Uncertainty in Operational Problems"

  Retsef Levi, MIT


Algorithms Research Seminar, February 9, 2016

"Local Spectral Graph Clustering at Scale: Principles and Applications"

  Yixuan Li, Cornell University


Algorithms Research Seminar, February 2, 2016

"Learning and Efficiency in Games with Dynamic Population"

  Thodoris Lykouris, Cornell University


Algorithms Research Seminar, January 26, 2016

"Online Boosting Algorithms"

  Satyen Kale, Yahoo Labs!


Algorithms Research Seminar, January 15, 2016

"The Sample Complexity of Learning Near-Optimal Auctions and Heuristics"

  Tim Roughgarden, Stanford University


Algorithms Research Seminar, January 8, 2016

"Algorithmic Complexity of Power Law Networks"

  Jakub Łącki, Sapienza University of Rome

Comments