Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mikhail Gorbunov

dblp:380/0295 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0006-9461-4266ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
2 papers
Learning theory · 29% Efficient and distributed learning · 29% Trustworthy machine learning · 23%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
robustness
1.022024
Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers · ECCV (89) 2024
Group and Shuffle: Efficient Structured Orthogonal Parametrization · NeurIPS 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Group and Shuffle: Efficient Structured Orthogonal Parametrization · NeurIPS 2024
Machine learning › Learning theory › neural network theory
neural network analysis
0.812024
Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers · ECCV (89) 2024
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.812024
Group and Shuffle: Efficient Structured Orthogonal Parametrization · NeurIPS 2024
Machine learning › Learning theory › random matrix theory
spectral norm bound
0.812024
Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers · ECCV (89) 2024
Machine learning › Generative modeling › diffusion model
diffusion model adaptation
0.212024
Group and Shuffle: Efficient Structured Orthogonal Parametrization · NeurIPS 2024
Machine learning › Trustworthy machine learning › robustness › certified robustness
lipschitz-constrained networks
0.212024
Group and Shuffle: Efficient Structured Orthogonal Parametrization · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

structured orthogonal matrices · 0.8orthogonal convolution · 0.8
YearPublicationVenuePosition
2024 Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers
Ekaterina Grishina, Mikhail Gorbunov, Maksim Rakhuba
ECCV (89)2
2024 Group and Shuffle: Efficient Structured Orthogonal Parametrization
abstract
The increasing size of neural networks has led to a growing demand for methods of efficient finetuning. Recently, an orthogonal finetuning paradigm was introduced that uses orthogonal matrices for adapting the weights of a pretrained model. In this paper, we introduce a new class of structured matrices, which unifies and generalizes structured classes from previous works. We examine properties of this class and build a structured orthogonal parametrization upon it. We then use this parametrization to modify the orthogonal finetuning framework, improving parameter efficiency. We empirically validate our method on different domains, including adapting of text-to-image diffusion models and downstream task finetuning in language modeling. Additionally, we adapt our construction for orthogonal convolutions and conduct experiments with 1-Lipschitz neural networks.
Mikhail Gorbunov, Nikolay Yudin, Vera Soboleva, Aibek Alanov, Alexey Naumov, Maksim Rakhuba
NeurIPS1