
Explore mathematical theories of communication, from Shannon's foundational work to modern interactive coding schemes and semantic communication, with applications to real-world scenarios.

Explore subspace clustering techniques, focusing on K-Subspaces ensembles. Learn about applications, results, and comparisons with other algorithms in this insightful talk by Laura Balzano.

Explore foundations of deep learning, focusing on SGD, overparametrization, and generalization. Delve into optimization dynamics, margin theory, and the impact of network architecture on performance.

Explore neural network learning and generalization beyond kernel methods, examining tangent kernels, learning algorithms, and complexity in over-parametrized networks.

Explore efficient model-based algorithms for reinforcement and imitation learning, addressing challenges in learning dynamics and uncertainty, with practical examples and evaluations.

Explore nearest neighbor algorithms in machine learning, covering regression, classification, consistency, and convergence rates in metric spaces. Gain insights into statistical learning frameworks and smoothness conditions.

Explore deep learning generalization with experts Peter Bartlett and Sasha Rakhlin, covering perceptron algorithms and key concepts in machine learning theory.

Insightful interview with Turing Laureate Shafi Goldwasser, exploring her groundbreaking research in theoretical computer science, interactive proofs, and zero-knowledge protocols at UC Berkeley in the 1980s.

Explore algebraic methods in computer science, focusing on invariant theory, graph isomorphism, and group actions. Learn about algorithms, moment polytopes, and open problems in the field.

Explore k-means and k-medians clustering algorithms under dimension reduction, examining distortion graphs, cost analysis, and combinatorial lemmas for robust high-dimensional statistics.

Explore stochastic optimization models, focusing on robustness, stability, and asymptotic minimax theory. Learn about weak convexity, sharp growth problems, and practical experiments.

Explore the AI trinity: data, algorithms, and infrastructure. Learn about named entity recognition, active learning, crowdsourcing, data augmentation, and neural rendering models.

Explore randomized least squares regression, combining model and algorithm uncertainties for improved statistical analysis and numerical linear algebra applications.

Explore the future of wireless technology, its potential, and innovative approaches like millimeter waves, small cells, and software-defined networks to overcome current limitations.

Explore challenges in quantum internet development, including performance, control, and routing entanglement flows. Learn about qubits, superposition, and long-distance entanglement in quantum networks.

Explore first-order stochastic optimization techniques for machine learning, covering gradient descent, adaptive learning, and convergence rates in data science applications.

Explore circuit lower bounds in computational complexity, focusing on algorithm design techniques and their implications for NP problems and Boolean functions.

Explore verification methods for quantum computations, including interactive proofs, post-quantum cryptography, and measurement protocols, with insights on challenges and potential solutions.

Explore quantum-resistant cryptography, virtual-black-box notions, indistinguishability obfuscation, and secure multiparty computation in the context of quantum computing challenges.

Explore quantum simulators and processors using Rydberg atom arrays, covering experimental setups, entanglement, spin models, and non-equilibrium quantum dynamics in programmable systems.

Explore dequantization of quantum machine learning algorithms, focusing on classical techniques for approximating quantum linear algebra and their implications for QML speedups.