Internal Program Activities Breadcrumb Home Programs & Events Internal Activities Upcoming Past View Events by Program - All - View Events by Program No Internal Activities yet. View Events by Program - All -Summer Cluster: Interpretable Machine LearningLattices: Algorithms, Complexity, and CryptographyThe Quantum Wave in Computing View Events by Program Identifying Explanatory Training Examples via Relative Influence Identifying Explanatory Training Examples via Relative Influence Summer Cluster: Interpretable Machine Learning Karolina Dziugaite (Element AI) Discovering Compositional Representations With Causal Graphs and Sketch Drawings Discovering Compositional Representations With Causal Graphs and Sketch Drawings Summer Cluster: Interpretable Machine Learning Richard Zemel Disentangled Interpretations and How We Can Use Them Disentangled Interpretations and How We Can Use Them Summer Cluster: Interpretable Machine Learning Chandan Singh (UC Berkeley) Verifiably Truthful Mechanisms Verifiably Truthful Mechanisms Summer Cluster: Interpretable Machine Learning Simina Branzei (Purdue University) A Unifying Philosophical Theory of AI Explanations A Unifying Philosophical Theory of AI Explanations Summer Cluster: Interpretable Machine Learning Atoosa Kasirzadeh (University of Toronto & Australian National University) Learning from Simple Explanations Learning from Simple Explanations Summer Cluster: Interpretable Machine Learning Sanjoy Dasgupta (UCSD) Kickoff Meeting Kickoff Meeting Summer Cluster: Interpretable Machine Learning Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification Lattices: Algorithms, Complexity, and Cryptography Aayush Jain (UCLA) Quantum Linear Algebra With Near-Optimal Complexities Quantum Linear Algebra With Near-Optimal Complexities The Quantum Wave in Computing Lin Lin (UC Berkeley) Candidate iO from Homomorphic Encryption Schemes Candidate iO from Homomorphic Encryption Schemes Lattices: Algorithms, Complexity, and Cryptography Sanjam Garg (UC Berkeley) Pagination First page First Previous page Previous Page 85 Page 86 Current page 87 Page 88 Page 89 Next page Next Last page Last
