Search for tag: "arc colloquium"

54 Media

44:54 Maryam Aliakbarpour - Distribution testing: … Maryam Aliakbarpour - Distribution testing: Classical and new paradigms	Maryam Aliakbarpour - Distribution testing: Classical and new paradigms One of the most fundamental problems in learning theory is to view input data as random samples from an unknown distribution and then to make statistical inferences about the underlying distribution.… arc colloquium algorithms and randomness center georgia tech recorded by gtlibrary spring 2020 From Katie Gentilello on March 9th, 2020 16 plays 0 name Maryam Aliakbarpour Date March 2nd, 2020
53:36 Vedat Levi Alev - Improved Analysis of Higher… Vedat Levi Alev - Improved Analysis of Higher Order Random Walks and Applications	Vedat Levi Alev - Improved Analysis of Higher Order Random Walks and Applications Local spectral expansion is a very useful method for arguing about the spectral properties of several random walk matrices over simplicial complexes. The motivation of this work is to extend this… arc colloquium algorithms and randomness center georgia tech recorded by gtlibrary spring 2020 From Katie Gentilello on February 18th, 2020 31 plays 0 name Vedat Levi Alev Date February 10th, 2020
57:11 Kuikui Liu - Spectral Independence in… Kuikui Liu - Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model	Kuikui Liu - Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model We say a probability distribution µ is spectrally independent if an associated correlation matrix has a bounded largest eigenvalue for the distribution and all of its conditional distributions.… algorithms and randomness center arc colloquium georgia tech recorded by gtlibrary spring 2020 From Katie Gentilello on February 3rd, 2020 17 plays 0 name Kuikui Liu Date January 27th, 2020
56:43 Samuel Hopkins - Robust Mean Estimation in… Samuel Hopkins - Robust Mean Estimation in Nearly-Linear Time	Samuel Hopkins - Robust Mean Estimation in Nearly-Linear Time Robust mean estimation is the following basic estimation question: given i.i.d. copies of a random vector X in d-dimensional Euclidean space of which a small constant fraction are corrupted, how well… arc colloquium algorithms and randomness center georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on December 6th, 2019 12 plays 0 name Samuel Hopkins Date December 2nd, 2019
01:00:15 Jelani Nelson - Some new approaches to the heavy… Jelani Nelson - Some new approaches to the heavy hitters problem	Jelani Nelson - Some new approaches to the heavy hitters problem In the 'frequent items' problem one sees a sequence of items in a stream (e.g. a stream of words coming into a search query engine likeGoogle) and wants to report a small list of items… arc colloquium georgia tech algorithms and randomness center recorded by gtlibrary fall 2019 From Katie Gentilello on December 3rd, 2019 20 plays 0 name Jelani Nelson Date September 16th, 2019
57:21 Yuhao Yi - Fast Approximation Algorithms and… Yuhao Yi - Fast Approximation Algorithms and Complexity Analysis for Design of Networked Systems	Yuhao Yi - Fast Approximation Algorithms and Complexity Analysis for Design of Networked Systems This talk focuses on network design algorithms for optimizing average consensus dynamics, dynamics that are widely used for information diﬀusion and distributed coordination in networked control… arc colloquium georgia tech algorithms and randomness center recorded by gtlibrary fall 2019 From Katie Gentilello on December 3rd, 2019 13 plays 0 name Yuhao Yi Date November 18th, 2019
01:41:57 Nima Anari - Rapidly Mixing Random Walks via… Nima Anari - Rapidly Mixing Random Walks via Log-Concave Polynomials (Part 2)	Nima Anari - Rapidly Mixing Random Walks via Log-Concave Polynomials (Part 2) (This is Part 2, continuation of Tuesday's lecture.)A fundamental tool used in sampling, counting, and inference problems is the Markov Chain Monte Carlo method, which uses random walks to solve… algorithms and randomness center arc colloquium georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on November 13th, 2019 24 plays 0 name Nima Anari Date November 6th, 2019
01:26:39 Nima Anari - Rapidly Mixing Random Walks via… Nima Anari - Rapidly Mixing Random Walks via Log-Concave Polynomials (Part 1)	Nima Anari - Rapidly Mixing Random Walks via Log-Concave Polynomials (Part 1) A fundamental tool used in sampling, counting, and inference problems is the Markov Chain Monte Carlo method, which uses random walks to solve computational problems. The main parameter defining the… arc colloquium algorithms and randomness center georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on November 13th, 2019 34 plays 0 name Nima Anari Date November 5th, 2019
49:05 Ravi Kumar - Algorithmic Discrete Choice Ravi Kumar - Algorithmic Discrete Choice	Ravi Kumar - Algorithmic Discrete Choice In this talk we consider random utility models for discrete choice. In discrete choice, the task is to select exactly one element from a discrete set of alternatives. We focus on algorithmic… algorithms and randomness center arc colloquium georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on November 13th, 2019 16 plays 0 name Ravi Kumar Date November 4th, 2019
55:49 Rong Ge - What 2-layer neural nets can we… Rong Ge - What 2-layer neural nets can we optimize?	Rong Ge - What 2-layer neural nets can we optimize? Optimizing neural networks is a highly nonconvex problem, and even optimizing a 2-layer neural network can be challenging. In the recent years many different approaches were proposed to learn 2-layer… arc colloquium georgia tech algorithms and randomness center recorded by gtlibrary fall 2019 From Katie Gentilello on November 12th, 2019 28 plays 0 name Rong Ge Date October 28th, 2019
56:41 Umang Bhaskar - Partial Function Extension with… Umang Bhaskar - Partial Function Extension with Applications to Learning and Property Testing	Umang Bhaskar - Partial Function Extension with Applications to Learning and Property Testing In partial function extension, we are given a partial function consisting of points from a domain and a function value at each point.Our objective is to determine if this partial function can be… arc colloquium algorithms and randomness center georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on October 30th, 2019 1 plays 0 name Umang Bhaskar Date October 18th, 2019
55:21 Thomas Rothvoss - Linear Size Sparsifier and the… Thomas Rothvoss - Linear Size Sparsifier and the Geometry of the Operator Norm Ball	Thomas Rothvoss - Linear Size Sparsifier and the Geometry of the Operator Norm Ball The Matrix Spencer Conjecture asks whether given n symmetric matrices in ℝn×n with eigenvalues in [−1,1] one can always find signs so that their signed sum has singular values bounded by… algorithms and randomness center arc colloquium georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on October 17th, 2019 9 plays 0 name Thomas Rothvoss Date October 7th, 2019
57:28 Nikhil Devanur - Lagrangian Duality in Mechanism… Nikhil Devanur - Lagrangian Duality in Mechanism Design	Nikhil Devanur - Lagrangian Duality in Mechanism Design This talk surveys the usage of Lagrangian Duality in the design and analysis of auctions. Designing optimal (revenue maximizing) auctions in multi-parameter settings has been among the most active… arc colloquium algorithms and randomness center georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on October 14th, 2019 14 plays 0 name Nikhil Devanur Date September 30th, 2019
56:16 Shipra Agrawal - Thompson Sampling for learning… Shipra Agrawal - Thompson Sampling for learning in online decision making	Shipra Agrawal - Thompson Sampling for learning in online decision making Modern online marketplaces feed themselves. They rely on historical data to optimize content and user-interactions, but further, the data generated from these interactions is fed back into the system… arc colloquium georgia tech algorithms and randomness center recorded by gtlibrary fall 2019 From Katie Gentilello on October 7th, 2019 31 plays 0 name Shipra Agrawal Date September 23rd, 2019
54:19 Moses Charikar - Approximating Profile Maximum… Moses Charikar - Approximating Profile Maximum Likelihood Efficiently	Moses Charikar - Approximating Profile Maximum Likelihood Efficiently Symmetric properties of distributions arise in multiple settings. For each of these, separate estimators and analysis techniques have been developed. Recently, Orlitsky et al showed that a single… algorithms and randomness center arc colloquium georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on September 30th, 2019 21 plays 0 name Moses Charikar Date September 9th, 2019
01:06:41 Aleksandar Nikolov - The Power of Factorization… Aleksandar Nikolov - The Power of Factorization Mechanisms in Differential Privacy	Aleksandar Nikolov - The Power of Factorization Mechanisms in Differential Privacy A central goal in private data analysis is to estimate statistics about an unknown distribution from a dataset possibly containing sensitive information, so that the privacy of any individual… algorithms and randomness center arc colloquium georgia tech recorded by gtlibrary fall 2019 From Katie Gentilello on August 28th, 2019 11 plays 0 name Aleksandar Nikolov Date August 19th, 2019