Skip to content
View karas3vv's full-sized avatar
:shipit:
:shipit:

Block or report karas3vv

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
karas3vv/README.md

Hello, World! I'm Vadim 👋

Keanu Reeves

I'm a fourth-year Software Engineering student at Saratov State University, focused on machine learning, information retrieval, and time-series analysis.

My coursework explores text representations and efficient document retrieval, and my search engine brings these interests into a working application. For my undergraduate thesis, I'm studying how to detect changes in the relationships between signals in multivariate time series. I'm also exploring deep learning, LLMs, and NLP applications.

Alongside my studies, I help prepare lectures for the machine learning club at Development Students Club.

Projects & research

In progress · Fourth year

Studying how to detect changes in relationships between channels of a multivariate time series—even when individual signals retain their usual behaviour.

  • The planned approach represents channels as nodes in graphs of dependencies built over successive time windows.
  • Exploring Pearson correlation and mutual information to capture linear and nonlinear relationships.
  • Currently reviewing the literature and designing experiments to evaluate detection quality, delay, and false alarms.

A search engine for Habr articles with a web interface and API.

  • Built a pipeline for collecting articles, cleaning text, splitting it into chunks, and indexing embeddings.
  • Used BGE-M3 and Qdrant for semantic search, with a local Tantivy lexical search mode and an experimental hybrid mode.
  • Added spelling suggestions and compared retrieval quality and latency to choose the default search method.

Third-year coursework

Investigated the trade-off between retrieval speed and recall when searching for similar news documents.

  • Implemented locality-sensitive hashing with random hyperplanes for TF-IDF document vectors.
  • Compared approximate retrieval with exact cosine-similarity search.
  • Examined how index parameters affect the number of candidates, search time, and recall.

Second-year coursework

Compared ways to represent documents and retrieve texts relevant to a user query.

  • Implemented retrieval with TF-IDF, Word2Vec, and MiniLM embeddings using cosine similarity.
  • Added text preprocessing, including lemmatisation and stop-word removal.
  • Visualised results to explore how document representations affect retrieval.

Additional work

Service listing retrieval — Avito test assignment
Combined TF-IDF and BM25 candidate retrieval with LightGBM ranking. Achieved Recall@50 of 0.924 on 400 locally held-out queries.

Teaching & community

I help prepare and write lectures for the machine learning club at Development Students Club. This is another way I engage with ML alongside coursework and coding: organising concepts into learning materials for other students.

Tools I use

Python SQL

NumPy Pandas Matplotlib Scikit-learn Hugging Face Docker LaTeX Typst FastAPI

Currently exploring

  • NLP & LLMs: sentiment analysis, text summarisation, and question answering.
  • Information retrieval: text representations, semantic search, and ranking evaluation.
  • Time series: changes in dependencies between signals, as part of my thesis.

Beyond code

I also experiment with 3D modelling in Blender — some of my work is collected in blender-projects.

Let's connect

Feel free to reach out about ML and NLP projects, learning materials, or collaboration.

Telegram Email

Pinned Loading

  1. My name, with a little XOR My name, with a little XOR
    1
    secret = [124, 75, 78, 67, 71]
    2
    key = 42
    3
    
                  
    4
    print("".join(chr(x ^ key) for x in secret))
  2. ssu-search-engine ssu-search-engine Public

    Search engine for Habr articles with BGE-M3 embeddings, Qdrant vector storage, Tantivy full-text search, spelling suggestions, and a web interface.

    Python