Demo Data from VLDB 2026 / reviewers in the wild / expert
Alexander Markovich
dblp:254/0953
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0002-2435-2978ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 87% Deep learning architectures and training · 13% | |
| Computer graphics and multimedia
1 paper |
Rendering · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering › non-photorealistic rendering
artistic rendering |
0.9 | 1 | 2025 | YaART: Yet Another ART Rendering Technology · KDD (1) 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.4 | 1 | 2020 | Structured Sparsification of Gated Recurrent Neural Networks · AAAI 2020 |
Machine learning › Efficient and distributed learning › model compression › sparsity
structured sparsity |
0.4 | 1 | 2020 | Structured Sparsification of Gated Recurrent Neural Networks · AAAI 2020 |
Machine learning › Deep learning architectures and training
recurrent neural network |
0.1 | 1 | 2020 | Structured Sparsification of Gated Recurrent Neural Networks · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
gate preactivation sparsification · 0.4LSTM compression · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | YaART: Yet Another ART Rendering Technology
Sergey Kastryulin, Artem Konev, Alexander Shishenya, Eugene Lyapustin, Artem Khurshudov, Alexander Tselousov, Nikita Vinokurov, Denis Kuznedelev, Alexander Markovich, Grigoriy Livshits, Alexey Kirillov, Anastasiia Tabisheva, Liubov Chubarova, Marina Kaminskaia, Alexander Ustyuzhanin, Artemii Shvetsov, Daniil Shlenskii, Valerii Startsev, Dmitrii Kornilov, Mikhail Romanov, Dmitry Baranchuk, Artem Babenko, Sergei Ovcharenko, Valentin Khrulkov |
KDD (1) | 9 |
| 2020 | Structured Sparsification of Gated Recurrent Neural NetworksabstractOne of the most popular approaches for neural network compression is sparsification — learning sparse weight matrices. In structured sparsification, weights are set to zero by groups corresponding to structure units, e. g. neurons. We further develop the structured sparsification approach for the gated recurrent neural networks, e. g. Long Short-Term Memory (LSTM). Specifically, in addition to the sparsification of individual weights and neurons, we propose sparsifying the preactivations of gates. This makes some gates constant and simplifies an LSTM structure. We test our approach on the text classification and language modeling tasks. Our method improves the neuron-wise compression of the model in most of the tasks. We also observe that the resulting structure of gate sparsity depends on the task and connect the learned structures to the specifics of the particular tasks. Ekaterina Lobacheva, Nadezhda Chirkova, Alexander Markovich, Dmitry P. Vetrov |
AAAI | 3 |