В каталог

    Algorithms

    2 594 курсов
    Models, Inference and Algorithms - Lightning Talks
    Broad Institute

    Models, Inference and Algorithms - Lightning Talks

    The Challenges of Training Infinitely Large Neural Networks
    Broad Institute

    The Challenges of Training Infinitely Large Neural Networks

    C++ Iteration Revisited 2024 - Safer Abstractions for Sequence Iteration
    cpponsea

    C++ Iteration Revisited 2024 - Safer Abstractions for Sequence Iteration

    Space Complexity of Recursive Algorithms - Solved Problem 2
    Neso Academy

    Space Complexity of Recursive Algorithms - Solved Problem 2

    The Price of Implicit Bias in Robust Machine Learning
    Institute for Pure & Applied Mathematics (IPAM)

    The Price of Implicit Bias in Robust Machine Learning

    Regular Types: From Stepanov to C++ Concepts
    ACCU Conference

    Regular Types: From Stepanov to C++ Concepts

    Using Algorithms to Understand Transformers and Using Transformers to Understand Algorithms
    Simons Institute for the Theory of Computing

    Using Algorithms to Understand Transformers and Using Transformers to Understand Algorithms

    Optimal Binary Search Tree Using Dynamic Programming - Successful Searches Only
    Sundeep Saradhi Kanthety

    Optimal Binary Search Tree Using Dynamic Programming - Successful Searches Only

    Iterated Models: Expressive Power, Learning, and Chain of Thought
    Simons Institute for the Theory of Computing

    Iterated Models: Expressive Power, Learning, and Chain of Thought

    The Parallelism Tradeoff: Understanding Transformer Expressivity Through Circuit Complexity
    Simons Institute for the Theory of Computing

    The Parallelism Tradeoff: Understanding Transformer Expressivity Through Circuit Complexity

    Limitations of Attention Mechanism in Transformers - Implications for Generalization and Optimization
    Simons Institute for the Theory of Computing

    Limitations of Attention Mechanism in Transformers - Implications for Generalization and Optimization

    Transformers, Parallel Computation, and Logarithmic Depth
    Simons Institute for the Theory of Computing

    Transformers, Parallel Computation, and Logarithmic Depth

    Reading Alan Turing - Exploring Turing's Influential Ideas in Theoretical Computer Science
    Institute for Advanced Study

    Reading Alan Turing - Exploring Turing's Influential Ideas in Theoretical Computer Science

    The Power of Noise: Redefining Retrieval for RAG Systems - Session M3.1
    Association for Computing Machinery (ACM)

    The Power of Noise: Redefining Retrieval for RAG Systems - Session M3.1

    Space Complexity of Recursive Algorithms - Solved Problem 3
    Neso Academy

    Space Complexity of Recursive Algorithms - Solved Problem 3

    Dimension Importance Estimation for Dense Information Retrieval - Tutorial 2.1
    Association for Computing Machinery (ACM)

    Dimension Importance Estimation for Dense Information Retrieval - Tutorial 2.1

    The Fast Fourier Transform - Efficient Algorithm for Signal Processing
    Serrano.Academy

    The Fast Fourier Transform - Efficient Algorithm for Signal Processing

    Prospects and Challenges for Quantum Machine Learning - Class 2
    ICTP-SAIFR

    Prospects and Challenges for Quantum Machine Learning - Class 2

    Prospects and Challenges for Quantum Machine Learning - Class 1
    ICTP-SAIFR

    Prospects and Challenges for Quantum Machine Learning - Class 1

    Know When You Know: Handling Adversarial Data by Abstaining
    Simons Institute for the Theory of Computing

    Know When You Know: Handling Adversarial Data by Abstaining

    When Do Dependencies in Your Data Help? - Emerging Generalization Settings
    Simons Institute for the Theory of Computing

    When Do Dependencies in Your Data Help? - Emerging Generalization Settings