[Sherrill Group] Summer Lecture Series in Theoretical Chemistry 2012: Coupled Cluster
An introduction to Coupled Cluster Theory from the 2012 summer lecture series at Georgia Institute of Technology.
Michael Marshall
Abstract Polymer Models and the Cluster Expansion
Will Perkins (University of Illinois at Chicago) https://simons.berkeley.edu/talks/talk-34 Deterministic Counting, Probability, and Zeros of Partition Functions.
Simons Institute
Igor Mezic: "Koopman Operator Theory for Dynamical Systems, Control and Data Analytics"
Seminar by Dr.Igor Mezic on "Koopman Operator Theory for Dynamical Systems, Control and Data Analytics"" on 09/13/2018 CICS Seminar Series.
Scientific Computing and Artificial Intelligence
Stanford Seminar - Information Theory of Deep Learning
EE380: Computer Systems Colloquium Seminar Information Theory of Deep Learning Speaker: Naftali Tishby, Computer Science, Hebrew Univerisity I will ...
stanfordonline
Statistical Rethinking Winter 2019 Lecture 02
Lecture 02 of the Dec 2018 through March 2019 edition of Statistical Rethinking: A Bayesian Course with R and Stan. This lectures covers the material in ...
Richard McElreath
Mirror symmetry and cluster algebras – Paul Hacking & Sean Keel – ICM2018
Algebraic and Complex Geometry Invited Lecture 4.15 Mirror symmetry and cluster algebras Paul Hacking & Sean Keel Abstract: We explain our proof, joint with ...
Rio ICM2018
Extreme Learning Machine: Why Tuning Is Not Required in Learning?
Neural networks (NN) and support vector machines (SVM) play key roles in machine learning and data analysis. However, it is known that these popular ...
Microsoft Research
Learning the Best Agorithm for Max-Cut, Clustering, and Other Partitioning Problems
Vaishnavh Nagarajan, Carnegie Mellon University https://simons.berkeley.edu/talks/vaishnavh-nagarajan-2016-11-16 Learning, Algorithm Design and Beyond ...
Simons Institute
One qubit as a universal approximant
CQT Online Talks - Series: Quantum Machine Learning Journal Club Talks Speakers: José Ignacio Latorre, CQT Abstract: The outcome probability of a single ...
Centre for Quantum Technologies
Approximate nearest neighbor search in high dimensions – Piotr Indyk – ICM2018
Mathematical Aspects of Computer Science Invited Lecture 14.7 Approximate nearest neighbor search in high dimensions Piotr Indyk Abstract: The nearest ...
Rio ICM2018
Indicator Function and Convolution Integrals Review
Step by Step Calculus
Grigorios Pavliotis: "Mean field limits of weakly interacting diffusions and applications"
High Dimensional Hamilton-Jacobi PDEs 2020 Workshop IV: Stochastic Analysis Related to Hamilton-Jacobi PDEs "Mean field limits of weakly interacting ...
Institute for Pure & Applied Mathematics (IPAM)
Cluster algebras and dilogarithm identities (Lecture - 01) by Tomoki Nakanishi
PROGRAM SCHOOL ON CLUSTER ALGEBRAS ORGANIZERS: Ashish Gupta and Ashish K Srivastava DATE :08 December 2018 to 22 December 2018 ...
International Centre for Theoretical Sciences
Graph Sparsification II: Barrier Functions and Rank-one Updates
Nikhil Srivastava, Microsoft Research India Algorithmic Spectral Graph Theory Boot Camp http://simons.berkeley.edu/talks/nikhil-srivastava-2014-08-26b.
Simons Institute
Tradeoffs between Robustness and Accuracy - Percy Liang
More videos on http://video.ias.edu.
Institute for Advanced Study
Soledad Villar: "Graph neural networks for combinatorial optimization problems"
Machine Learning for Physics and the Physics of Learning 2019 Workshop IV: Using Physical Insights for Machine Learning "Graph neural networks for ...
Institute for Pure & Applied Mathematics (IPAM)
Tony Yue Yu - 4/4 The Frobenius Structure Conjecture for Log Calabi-Yau Varieties
Notes: https://nextcloud.ihes.fr/index.php/s/T6zEGCcJPS5JL4d 4/4 - Scattering diagram, comparison with Gross-Hacking-Keel-Kontsevich, applications to cluster ...
Institut des Hautes Études Scientifiques (IHÉS)
Markov Logic: Theory, Algorithms and Applications
AI systems must be able to reason about complex objects as well explicitly handle uncertainty. First order logic gives the formalism to handle the first. Probability ...
Microsoft Research
Interactive Clustering
Pranjal Awasthi, Rutgers University https://simons.berkeley.edu/talks/pranjal-awasthi-02-14-2017 Interactive Learning.
Simons Institute
Zexe: Enabling Decentralized Private Computation
Pratyush Mishra, UC Berkeley https://simons.berkeley.edu/talks/zexe-0 Blockchain in Society: Applications, Economics, Law, and Ethics.
Simons Institute
N Marzari - Skype
PROGRAM: STRONGLY CORRELATED SYSTEMS: FROM MODELS TO MATERIALS DATES: Monday 06 Jan, 2014 - Friday 17 Jan, 2014 VENUE: Department ...
International Centre for Theoretical Sciences
Modular theory and QFT (Lecture 3) by Nima Lashkari
Infosys-ICTS String Theory Lectures Modular theory and QFT Speaker: Nima Lashkari (Purdue University) Date: 03 February 2020 to 05 February 2020 Venue: ...
International Centre for Theoretical Sciences
Akka.NET: The Future of Distributed Programming in .NET - Aaron Stannard
Developers are living in exciting, but more demanding times - we're expected to create applications and services that can deliver better value faster, at higher ...
NDC Conferences
Jonathan Sedar - Hierarchical Bayesian Modelling with PyMC3 and PySTAN
PyData London 2016 Can we use Bayesian inference to determine unusual car emissions test for Volkswagen? In this worked example, I'll demonstrate ...
PyData
Unexpected Applications of Polynomials in Combinatorics - Larry Guth
Larry Guth Massachusetts Institute of Technology March 12, 2013 In 2007, Zeev Dvir shocked experts by giving a one-page proof of the finite field Kakeya ...
Institute for Advanced Study
k-means and k-medians under Dimension Reduction
Yury Makarychev (Toyota Technological Institute at Chicago) https://simons.berkeley.edu/talks/k-means-and-k-medians-under-dimension-reduction Robust and ...
Simons Institute
Blind Ptychography: Theory and Algorithm - Fannjiang - Workshop 1 - CEB T1 2019
Fannjiang (UC Davis) / 08.02.2019 Blind Ptychography: Theory and Algorithm Blind ptychography is a phase retrieval method using multiple coded diffraction ...
Institut Henri Poincaré
Exploiting Structure Information in Machine Learning
Machine learning has recently witnessed revolutionary success in a wide spectrum of domains. Most of these applications involve learning with complex inputs ...
Microsoft Research
Lecture 08 : Bayes Decision Theory - Binary Features
IIT Kharagpur July 2018
Clustering Aggregation
Google TechTalks March 22, 2006 Aristides Gionis Aristides Gionis received his Ph.D. from Stanford University in 2003, and he is currently a senior researcher ...
Google
Levy Processes and Applications to Machine Learning
Levy processes are random measures that give independent mass to independent increments. I will show how they can be used to model various types of data ...
Microsoft Research
Terence Tao: Nilsequences and the Primes, UCLA
Terence Tao is UCLA's Collins Professor of Mathematics, and the first UCLA professor to win the prestigious Fields Medal. Less than a month after winning the ...
UCLA
Database Driven Machine Learning
Doug Hood Consulting Member of Technical Staff Oracle Oracle databases store business critical data. Rather than getting inputs for machine learning from log ...
Oracle Developers
An optimization perspective on mean-field games - Wei Zhang, Ohio State University
This workshop is kindly sponsored by London Mathematical Society, EPSRC and is part of the Lloyd's Register Foundation programme on Data-centric ...
The Alan Turing Institute
Solving Private Set Intersection via Cuckoo Hashing: Benny Pinkas, Bar-Ilan University, Israel
Private set intersection (PSI) allows two parties to compute the intersection of their sets without revealing any information about items that are not in the ...
The Alan Turing Institute
Distributed Graph Mining: Theory and Practice
Author: Vahab S. Mirrokni, Research at Google, Google, Inc. More on http://www.kdd.org/kdd2017/ KDD2017 Conference is published on http://videolectures.net/
KDD2017 video
Xavier Bresson: "Convolutional Neural Networks on Graphs"
New Deep Learning Techniques 2018 "Convolutional Neural Networks on Graphs" Xavier Bresson, Nanyang Technological University, Singapore Abstract: ...
Institute for Pure & Applied Mathematics (IPAM)
Workshop: Streaming data with Cassandra and Kafka
Details: https://learn.xnextcon.com/event/eventdetails/W20041409 In this interactive 3 hour workshop, you will get an overview of these powerful technologies ...
AICamp
Allen School Colloquium: Zhihao Jia (Stanford)
Presentation title: Automated Discovery of Machine Learning Optimizations As an increasingly important workload, machine learning (ML) applications require ...
Paul G. Allen School
Adaptive Antennas and Degrees of Freedom | Lecture #1 | Alan Fenn
MIT Lincoln Laboratory
Time discretization invariance in Machine Learning, applications to reinforcement learning...
While computers are well equipped to deal with discrete flows of data, the real world often provides intrisically continuous time data sequences, e.g. visual, ...
Microsoft Research
SPACE Webinar Series: Prof. John Wright
IEEE Signal Processing Society
