Internal Program Activities Breadcrumb Home Programs & Events Internal Program Activities Upcoming Past View Events by Program - All - View Events by Program No Internal Activities yet. View Events by Program - All -Quantum Research PodModern Paradigms in GeneralizationSublinear AlgorithmsError-Correcting Codes: Theory and PracticeLogic and Algorithms in Database Theory and AIData Structures and Optimization for Fast AlgorithmsAnalysis and TCS: New FrontiersSummer Cluster on Quantum ComputingMeta-ComplexityExtended Reunion: SatisfiabilityData-Driven Decision ProcessesGraph Limits and Processes on Networks: From Epidemics to MisinformationSummer Cluster: AI and HumanitySummer Cluster: Interpretable Machine LearningComputational Innovation and Data-Driven BiologySummer Cluster: Deep Learning TheoryCausalityLearning and GamesGeometric Methods in Optimization and SamplingComputational Complexity of Statistical InferenceTheoretical Foundations of Computer SystemsSatisfiability: Theory, Practice, and BeyondTheory of Reinforcement LearningProbability, Geometry, and Computation in High DimensionsLattices: Algorithms, Complexity, and CryptographyThe Quantum Wave in ComputingProofs, Consensus, and Decentralizing SocietyOnline and Matching-Based Market DesignSummer Cluster: Error-Correcting Codes and High-Dimensional ExpansionFoundations of Deep LearningData Privacy: Foundations and ApplicationsGeometry of PolynomialsFoundations of Data ScienceLower Bounds in Computational ComplexityThe Brain and ComputationReal-Time Decision MakingBridging Continuous and Discrete OptimizationFoundations of Machine LearningPseudorandomnessLogical Structures in ComputationAlgorithms and UncertaintyAlgorithmic Challenges in GenomicsCounting Complexity and Phase TransitionsFine-Grained Complexity and Algorithm DesignEconomics and ComputationCryptographyInformation TheoryAlgorithmic Spectral Graph TheoryAlgorithms and Complexity in Algebraic GeometryEvolutionary Biology and the Theory of ComputingQuantum Hamiltonian ComplexityReal Analysis in Computer ScienceTheoretical Foundations of Big Data Analysis View Events by Program Fellows Talk: Vishesh Jain Fellows Talk: Vishesh Jain Probability, Geometry, and Computation in High Dimensions Vishesh Jain (UC Berkeley) Open Problem Discussion Open Problem Discussion Theory of Reinforcement Learning Reading Group: Deep RL and Function Approximation Reading Group: Deep RL and Function Approximation Theory of Reinforcement Learning Thin Shell Estimates for Maximal Affine Surface Area Thin Shell Estimates for Maximal Affine Surface Area Probability, Geometry, and Computation in High Dimensions Elisabeth Werner (Case Western Reserve University) Reading Group: Causality and Econometrics Reading Group: Causality and Econometrics Theory of Reinforcement Learning Fellows Talk - Jalaj Bhandari Fellows Talk - Jalaj Bhandari Probability, Geometry, and Computation in High Dimensions Jalaj Bhandari (Columbia University) Open Problem Discussion Open Problem Discussion Theory of Reinforcement Learning Reading Group: Deep RL and Function Approximation Reading Group: Deep RL and Function Approximation Theory of Reinforcement Learning Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation Theory of Reinforcement Learning Marc Abeille (Criteo) Reading Group: Causality and Econometrics Reading Group: Causality and Econometrics Theory of Reinforcement Learning Pagination First page First Previous page Previous Page 79 Page 80 Current page 81 Page 82 Page 83 Next page Next Last page Last
