DSML Kazakhstan LogoDSMLKZ
HomeAboutPeopleNewsAI RadarJobsResearchEventsArticles
DSML Kazakhstan Logo© 2026 DSML Kazakhstan.
AboutCollaborateCommunity GuidelinesTelegramAI Radar RSSYouTubeLinkedInInstagram

    News

    Latest news and updates from DSML Kazakhstan community
    Stay up to date with the latest events

    Showing 94 news posts

    DSML Reading Club #2 recording: VGGT

    Fresh news17 May 2025
    DSML Reading Club #2 recording: VGGT

    Anuar Taskynov presented Visual Geometry Grounded Transformer.

    VGGT is a next-generation foundation model for 3D computer-vision tasks. From one, several, or even hundreds of scene images, it can immediately predict key 3D properties: camera parameters, depth maps, dense point clouds, and 3D tracking.

    Unlike traditional approaches, VGGT works as a single universal model without complex post-processing. It remains fast—under one second per reconstruction—and accurate, achieving state-of-the-art results across several 3D tasks.

    Seminar host: Yelaman Abdullin. Download the presentation.

    Watch the video: youtube.com/watch?v=TVZoU1m5WKI

    Discuss · 01
    Telegram

    DSML Reading Club #1 recording: Byte Latent Transformer

    Fresh news16 May 2025
    DSML Reading Club #1 recording: Byte Latent Transformer

    Yelaman Abdullin presented Byte Latent Transformer.

    Modern LLMs rely on tokenization, which limits flexibility, reduces efficiency, and makes them vulnerable to rare and irregular inputs. The paper proposes Byte Latent Transformer (BLT), a new architecture that works directly with bytes. BLT uses dynamic patches that adapt to data complexity and, for the first time, matches the quality of tokenized models while providing better efficiency and scalability.

    Watch the video: youtu.be/JN-adAvbAcs

    Discuss · 01
    Telegram

    DSML Reading Club #3: efficient random-walk graph kernels

    Fresh news13 May 2025
    DSML Reading Club #3: efficient random-walk graph kernels

    This week, Mikhail Shkorin will present graph embeddings through the paper “Optimal Time Complexity Algorithms for Computing General Random Walk Graph Kernels on Sparse Graphs”.

    Current graph-embedding methods either lack theoretical grounding, as with GNNs, or have high computational complexity, as with kernel approaches.

    The paper proposes a simple and scalable algorithm that compares graphs and their nodes efficiently through a linear approximation of random-walk kernels.

    At the meeting, we will discuss:

    • Why graph embeddings are needed
    • How to create node embeddings in linear time
    • How to move from node embeddings to graph embeddings on the fly without computing a huge adjacency matrix
    • Graph transformers on point clouds in robotics
    • Add to calendar: calendar.app.google/wci6yDfF8M68tHCv7
    • Thursday, May 15, 11:00 Kazakhstan time
    • Google Meet
    • Host: Yelaman Abdullin
    Discuss · 01
    Telegram

    The first offline LLM arena for Kazakh

    Fresh news11 May 2025
    The first offline LLM arena for Kazakh

    Community residents Sanzhar Murzakhmetov, Sanzhar Umbet, Beksultan Sagyndyk, and Kirill Yakunin launched the first offline LLM arena for Kazakh. Its main goal is to test not merely next-token generation, but understanding of cultural context as a whole.

    What the team built:

    • A custom culture-focused QA dataset
    • Topics and keywords assembled with linguists using Serper, Perplexity, and LLM generation
    • Pairwise model comparisons, first judged by GPT-4o and finalized with a Bradley–Terry model

    Current results:

    • Google DeepMind's Gemma models are consistently strong
    • Sherkala-8B from MBZUAI ranks second, outperforming even larger models
    • ISSAI at Nazarbayev University has good multiple-choice scores but some of the weakest generation results
    Discuss · 01
    Telegram

    Kazakhstan's first national school AI olympiad concludes

    Fresh news5 May 2025
    Kazakhstan's first national school AI olympiad concludes

    It was a demanding AI marathon with seven Kaggle competitions and an entirely new competition format for participants and organizers alike. Forty finalists reached the end after two remote rounds and two days of in-person competition in Astana.

    We hope the olympiad draws talented young people in Kazakhstan toward this promising field and contributes to the development of artificial intelligence in our region.

    Congratulations to all the prize winners, and we are proud of every finalist who put in tremendous effort to become a pioneer of this new olympiad. We look forward to welcoming all of you to our small DSML.kz community!

    Discuss · 00
    Telegram
    PreviousPage 9 of 19Next