A Non-generative Framework and Convex Relaxations for Unsupervised Learning

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=ECpMEAWI_tk


Duration: 36:00
1,212 views
15

Elad Hazan, Princeton University
Representation Learning
https://simons.berkeley.edu/talks/elad-hazan-2017-3-27



Other Videos By Simons Institute for the Theory of Computing


2017-03-28Failures of Deep Learning
2017-03-28Supersizing Self-Supervision: Learning Perception and Action without Human Supervision
2017-03-28Deep Reinforcement Learning
2017-03-28Learning from Unlabeled Video
2017-03-28Unsupervised Discovery Through Adversarial Self-Play
2017-03-27Spotlight Talk: Semi-Random Units for Learning Neural Networks with Guarantees
2017-03-27Spotlight Talk: A Formalization of Representation Learning
2017-03-27Representations of Relationships in Images and Text
2017-03-27The Missing Signal
2017-03-27Representations for Language: From Word Embeddings to Sentence Meanings
2017-03-27A Non-generative Framework and Convex Relaxations for Unsupervised Learning
2017-03-27Geometry, Optimization and Generalization in Multilayer Networks
2017-03-24Understanding Silicon Valley
2017-03-16The Contextual Bandits Problem
2017-03-10A Reduction from Efficient Non-Malleable Extractors to Low-Error Two-Source Extractors
2017-03-10Randomness Intuition
2017-03-10Fast Permutation Property Testing and Metrics of Permutations
2017-03-09Query-to-Communication Lifting for BPP
2017-03-09Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas
2017-03-09PRGs for Small Space via Fourier Analysis
2017-03-09Deterministic Isolation for Bipartite Matching and Matroid Intersection


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Elad Hazan
Representation Learning