Papers by Gleb Kuzmin

8 papers
Exploring Large Language Models for Detecting Mental Disorders (2025.emnlp-main)

Copied to clipboard

Challenge: Detecting mental disorders and patient emotions through text analysis and machine learning is of increasing interest to researchers over the past decade.
Approach: They compare the performance of traditional machine learning methods and encoder-based models on Russian-language datasets to those of large language models.
Outcome: The proposed models outperform traditional methods on small and noisy datasets, but can perform comparable to language models when trained on patients with clinically confirmed depression.
Hybrid Uncertainty Quantification for Selective Text Classification in Ambiguous Tasks (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for text classification tasks are inherently ambiguous and can cause errors.
Approach: They propose a method that combines epistemic and aleatoric uncertainty to estimate toxicity detection errors.
Outcome: The proposed method outperforms existing methods for toxicity detection and other ambiguous text classification tasks.
Uncertainty Estimation of Transformer Predictions for Misclassification Detection (2022.acl-long)

Copied to clipboard

Challenge: Uncertainty estimation (UE) of model predictions is crucial step for a variety of tasks such as active learning, misclassification detection, adversarial attack detection, etc.
Approach: They propose to modify UE methods for Transformer models for misclassification detection in named entity recognition and text classification tasks to improve model expressiveness and computational performance.
Outcome: The proposed methods outperform computationally intensive methods on misclassification detection tasks and are based on a large dataset of simulated datasets.
Unconditional Truthfulness: Learning Unconditional Uncertainty of Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Uncertainty quantification (UQ) is a promising approach for detecting hallucinations and low-quality outputs of Large Language Models (LLMs).
Approach: They propose to learn conditional dependency between autoregressive LLM generation steps from attention-based features and a two-staged training procedure to incorporate recurrent features.
Outcome: The proposed method is highly effective for selective generation, achieving substantial improvements over rivaling unsupervised and supervised approaches.
Fact-Checking the Output of Large Language Models via Token-Level Uncertainty Quantification (2024.findings-acl)

Copied to clipboard

Challenge: Large language models are notorious for producing erroneous claims in their output.
Approach: They propose a fact-checking and hallucination detection pipeline based on token-level uncertainty quantification that removes the impact of uncertainty about what claim to generate on the current step and what surface form to use.
Outcome: The proposed method can fact-check the atomic claims in the output of large language models.
Inference-Time Selective Debiasing to Enhance Fairness in Text Classification Models (2025.naacl-short)

Copied to clipboard

Challenge: Several studies have investigated and promoted fairness, and a variety of definitions have been proposed to address this problem.
Approach: They propose a selective debiasing method that removes bias from model predictions instead of discarding them at inference time.
Outcome: The proposed method achieves better results than standard uncertainty quantification methods on text classification datasets with encoder-based classification models.
ALToolbox: A Set of Tools for Active Learning Annotation of Natural Language Texts (2022.emnlp-demos)

Copied to clipboard

Challenge: Currently, the framework supports text classification, sequence tagging, and seq2seq tasks.
Approach: They propose an open-source framework for active learning annotation in natural language processing that provides an easy-to-deploy GUI annotation tool directly in the Jupyter IDE.
Outcome: The proposed framework reduces computational overhead and duration of AL iterations and increases annotated data reusability.
Towards Computationally Feasible Deep Active Learning (2022.findings-naacl)

Copied to clipboard

Challenge: Active learning (AL) is a technique for reducing the amount of annotation required for training machine learning models.
Approach: They propose two techniques that reduce the amount of time required for AL . they use pseudo-labeling and distilled models to train a successor model .
Outcome: The proposed algorithm reduces the time and computational overhead required to train an acquisition model and estimate uncertainty on instances in the unlabeled pool.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations