← Search

Andrey Kuznetsov

11 accepted papers

2026

BREPS: Bounding-Box Robustness Evaluation of Promptable Segmentation

AAAI 2026technical

Promptable segmentation models such as SAM have established a powerful paradigm, enabling strong generalization to unseen objects and domains with minimal user input, including points, bounding boxes, and text prompts. Among these, bounding boxes stand out as particularly effective, often outperform

Cited by 0SourcePDFScholar
2026

Logit‑KL Flow Matching: Non‑Autoregressive Text Generation via Sampling‑Hybrid Inference

ICLR 2026poster

Non-autoregressive (NAR) language models offer notable efficiency in text generation by circumventing the sequential bottleneck of autoregressive decoding. However, accurately modeling dependencies in discrete sequences remains challenging in this paradigm. In this work, we advance the field of NAR…

Cited by 0SourcecodeScholar
2026

MMReD: a Cross-Modal Benchmark for Dense Context Reasoning

ICLR 2026poster

Despite recent advancements in extending context windows of large language models (LLMs) and large vision-language models (LVLMs), their ability to perform complex multi-modal reasoning over extended contexts remains critically limited. To underline this challenge, we present MMReD, a benchmark spec…

Cited by 0SourcecodeScholar
2026

Progressive Cramming: Reliable Token Compression and What It Reveals

ICML 2026poster

Token cramming compresses sequences into learned embeddings with near-perfect reconstruction, but prior work used fixed token budgets and 99\% accuracy thresholds, obscuring whether residual errors reflect optimization failures or fundamental limits. We introduce progressive cramming, which grows th…

Cited by 0SourceScholar
2026

Scalable Kronecker-Factored Fisher Approximation for Neural Network Parameter Sensitivity

ICML 2026poster

The Fisher Information Matrix (FIM) provides a principled geometric framework for parameter sensitivity in neural networks, but directly computing and using the full FIM is infeasible in high-dimensional models. As a result, most existing methods rely on diagonal approximations that discard importan…

Cited by 0SourceScholar
2026

Speech-to-LaTeX: New Models and Datasets for Converting Spoken Equations and Sentences

ICLR 2026poster

Conversion of spoken mathematical expressions is a challenging task that involves transcribing speech into a strictly structured symbolic representation while addressing the ambiguity inherent in the pronunciation of equations. Although significant progress has been achieved in automatic speech reco…

Cited by 0SourcecodeScholar
2026

T-LoRA: Single Image Diffusion Model Customization Without Overfitting

AAAI 2026technical

While diffusion model fine-tuning offers a powerful approach for customizing pre-trained models to generate specific objects, it frequently suffers from overfitting when training samples are limited, compromising both generalization capability and output diversity. This paper tackles the challenging

Cited by 11SourcePDFScholar
2025

LLM-Microscope: Uncovering the Hidden Role of Punctuation in Context Memory of Transformers

NAACL 2025findings

We introduce methods to quantify how Large Language Models (LLMs) encode and store contextual information, revealing that tokens often seen as minor (e.g., determiners, punctuation) carry surprisingly high context. Notably, removing these tokens — especially stopwords, articles, and commas — consist…

Cited by 1SourcePDFScholar
2024

Kandinsky 3: Text-to-Image Synthesis for Multifunctional Generative Framework

EMNLP 2024system demonstrations

Text-to-image (T2I) diffusion models are popular for introducing image manipulation methods, such as editing, image fusion, inpainting, etc. At the same time, image-to-video (I2V) and text-to-video (T2V) models are also built on top of T2I models. We present Kandinsky 3, a novel T2I model based on l…

2024

Your Transformer is Secretly Linear

ACL 2024long

This paper reveals a novel linear characteristic exclusive to transformer decoders, including models like GPT, LLaMA, OPT, BLOOM and others. We analyze embedding transformations between sequential layers, uncovering an almost perfect linear relationship (Procrustes similarity score of 0.99). However…