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

Nicholas I. Kolkin

dblp:155/9989 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
6since 2021 · last 2025
0000-0003-1233-1969ORCID · reported

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

Artificial intelligence and machine learning · 9 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 9 · 2 first-author · 6 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.

Computer graphics and multimedia
6 papers
Visual content generation and editing · 86% Rendering · 11% Image and video processing · 2%
Artificial intelligence
4 papers
Generative modeling · 70% Probabilistic and Bayesian machine learning · 17% Segmentation and scene understanding · 6%
Databases, data mining, and information retrieval
1 paper
Data mining · 67% Information retrieval · 33%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 19 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.932025
SliderSpace: Decomposing the Visual Capabilities of Diffusion Models · ICCV 2025
TurboEdit: Instant Text-Based Image Editing · ECCV (80) 2024
Personalized Residuals for Concept-Driven Text-to-Image Generation · CVPR 2024
Machine learning › Generative modeling › diffusion model
controllable generation
0.912025
SliderSpace: Decomposing the Visual Capabilities of Diffusion Models · ICCV 2025
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
latent space factorization
0.912025
SliderSpace: Decomposing the Visual Capabilities of Diffusion Models · ICCV 2025
Visual content generation and editing
style transfer
0.822020
Deformable Style Transfer · ECCV (26) 2020
Style Transfer by Relaxed Optimal Transport and Self-Similarity · CVPR 2019
Machine learning › Generative modeling › diffusion model
text-to-image generation
0.812024
Personalized Residuals for Concept-Driven Text-to-Image Generation · CVPR 2024
Visual content generation and editing › image editing
text-guided image editing
0.812024
TurboEdit: Instant Text-Based Image Editing · ECCV (80) 2024
Visual content generation and editing › style transfer
artistic style transfer
0.612022
ARF: Artistic Radiance Fields · ECCV (31) 2022
Rendering
neural radiance fields
0.612022
ARF: Artistic Radiance Fields · ECCV (31) 2022
Visual content generation and editing
image-to-image translation
0.512021
Harnessing the Conditioning Sensorium for Improved Image Translation · ICCV 2021
Visual content generation and editing
image editing
0.412020
Deformable Style Transfer · ECCV (26) 2020
Mathematical optimization
optimal transport
0.412019
Style Transfer by Relaxed Optimal Transport and Self-Similarity · CVPR 2019
Computer vision › Image recognition and object detection
saliency prediction
0.312017
Training Deep Networks to be Spatially Sensitive · ICCV 2017
Computer vision › Segmentation and scene understanding
semantic segmentation
0.312017
Training Deep Networks to be Spatially Sensitive · ICCV 2017
Visual content generation and editing › style control
artistic style control
0.312025
SliderSpace: Decomposing the Visual Capabilities of Diffusion Models · ICCV 2025
Data mining › predictive modeling › classification › instance-based learning
k-nearest neighbor
0.212015
From Word Embeddings To Document Distances · ICML 2015
Data mining › text mining
text classification
0.212015
From Word Embeddings To Document Distances · ICML 2015
Information retrieval › similarity measure
word mover's distance
0.212015
From Word Embeddings To Document Distances · ICML 2015
Image and video processing
image similarity
0.112019
Style Transfer by Relaxed Optimal Transport and Self-Similarity · CVPR 2019
Machine learning › Deep learning architectures and training
loss function design
0.112017
Training Deep Networks to be Spatially Sensitive · ICCV 2017

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

low-rank adaptor · 1.7compositional control · 1.7text conditioning · 1.5diffusion model · 1.5user-guided control · 0.8self-similarity · 0.8low-rank residual · 0.8cross-attention localization · 0.8neural radiance field · 0.6reconstruction objectives · 0.5pre-trained feature extractors · 0.5deformable style transfer · 0.4user study · 0.4weighted f-measure approximation · 0.3differentiable objective · 0.3word embeddings · 0.2earth mover's distance · 0.2
YearPublicationVenuePosition
2025 SliderSpace: Decomposing the Visual Capabilities of Diffusion Models
abstract
We present SliderSpace, a framework for automatically decomposing the visual capabilities of diffusion models into controllable and human-understandable directions. Unlike existing control methods that require a user to specify attributes for each edit direction individually, SliderSpace discovers multiple interpretable and diverse directions simultaneously from a single text prompt. Each direction is trained as a low-rank adaptor, enabling compositional control and the discovery of surprising possibilities in the model's latent space. Through extensive experiments on state-of-the-art diffusion models, we demonstrate SliderSpace's effectiveness across three applications: concept decomposition, artistic style exploration, and diversity enhancement. Our quantitative evaluation shows that SliderSpace-discovered directions decompose the visual structure of model's knowledge effectively, offering insights into the latent capabilities encoded within diffusion models. User studies further validate that our method produces more diverse and useful variations compared to baselines. Our code, data and trained weights are available at https://sliderspace.baulab.info
Rohit Gandikota, Zongze Wu 0002, Richard Zhang 0001, David Bau, Eli Shechtman, Nicholas I. Kolkin
ICCV6
2025 A Data Perspective on Enhanced Identity Preservation for Diffusion Personalization
abstract
Large text-to-image models have revolutionized the ability to generate imagery using natural language. However, particularly unique or personal visual concepts, such as pets and furniture, will not be captured by the original model. This has led to interest in how to personalize a text-to-image model. Despite significant progress, this task remains a formidable challenge, particularly in preserving the subject's identity. Most researchers attempt to address this issue by modifying model architectures. These methods are capable of keeping the subject structure and color but fail to preserve identity details. Towards this issue, our approach takes a data-centric perspective. We introduce a novel regularization dataset generation strategy on both the text and image level. This strategy enables the model to preserve fine details of the desired subjects, such as text and logos. Our method is architecture-agnostic and can be flexibly applied on various text-to-image models. We show on established benchmarks that our data-centric approach forms the new state of the art in terms of identity preservation and text alignment.
Xingzhe He, Zhiwen Cao, Nicholas I. Kolkin, Lantao Yu, Kun Wan 0001, Helge Rhodin, Ratheesh Kalarot
WACV3
2024 Personalized Residuals for Concept-Driven Text-to-Image Generation
abstract
We present personalized residuals and localized attention-guided sampling for efficient concept-driven generation using text-to-image diffusion models. Our method first represents concepts by freezing the weights of a pretrained text-conditioned diffusion model and learning low-rank residuals for a small subset of the model's layers. The residual-based approach then directly enables application of our proposed sampling technique, which applies the learned residuals only in areas where the concept is localized via cross-attention and applies the original diffusion weights in all other regions. Localized sampling therefore combines the learned identity of the concept with the existing generative prior of the underlying diffusion model. We show that personalized residuals effectively capture the identity of a concept in$\sim$3 minutes on a single GPU without the use of regularization images and with fewer parameters than previous models, and localized sampling allows using the original model as strong prior for large parts of the image.
Cusuh Ham, Matthew Fisher, James Hays, Nicholas I. Kolkin, Yuchen Liu 0002, Richard Zhang 0001, Tobias Hinz
CVPR4
2024 TurboEdit: Instant Text-Based Image Editing
Zongze Wu 0002, Nicholas I. Kolkin, Jonathan Brandt, Richard Zhang 0001, Eli Shechtman
ECCV (80)2
2022 ARF: Artistic Radiance Fields
Kai Zhang 0045, Nicholas I. Kolkin, Sai Bi, Fujun Luan, Zexiang Xu, Eli Shechtman, Noah Snavely
ECCV (31)2
2021 Harnessing the Conditioning Sensorium for Improved Image Translation
abstract
Multi-modal domain translation typically refers to synthesizing a novel image that inherits certain localized attributes from a ‘content’ image (e.g. layout, semantics, or geometry), and inherits everything else (e.g. texture, lighting, sometimes even semantics) from a ‘style’ image. The dominant approach to this task is attempting to learn disentangled ‘content’ and ‘style’ representations from scratch. However, this is not only challenging, but ill-posed, as what users wish to preserve during translation varies depending on their goals. Motivated by this inherent ambiguity, we define ‘content’ based on conditioning information extracted by off-the-shelf pre-trained models. We then train our style extractor and image decoder with an easy to optimize set of reconstruction objectives. The wide variety of high-quality pre-trained models available and simple training procedure makes our approach straightforward to apply across numerous domains and definitions of ‘content’. Additionally it offers intuitive control over which aspects of ’content’ are preserved across domains. We evaluate our method on traditional, well-aligned, datasets such as CelebA-HQ, and propose two novel datasets for evaluation on more complex scenes: ClassicTV and FFHQ-Wild. Our approach, Sensorium, enables higher quality domain translation for more complex scenes.
Cooper Nederhood, Nicholas I. Kolkin, Deqing Fu, Jason Salavon
ICCV2
2020 Deformable Style Transfer
Sunnie S. Y. Kim, Nicholas I. Kolkin, Jason Salavon, Gregory Shakhnarovich
ECCV (26)2
2019 Style Transfer by Relaxed Optimal Transport and Self-Similarity
abstract
The goal of style transfer algorithms is to render the content of one image using the style of another. We propose Style Transfer by Relaxed Optimal Transport and Self-Similarity (STROTSS), a new optimization-based style transfer algorithm. We extend our method to allow user specified point-to-point or region-to-region control over visual similarity between the style image and the output. Such guidance can be used to either achieve a particular visual effect or correct errors made by unconstrained style transfer. In order to quantitatively compare our method to prior work, we conduct a large-scale user study designed to assess the style-content tradeoff across settings in style transfer algorithms. Our results indicate that for any desired level of content preservation, our method provides higher quality stylization than prior work.
Nicholas I. Kolkin, Jason Salavon, Gregory Shakhnarovich
CVPR1
2017 Training Deep Networks to be Spatially Sensitive
abstract
In many computer vision tasks, for example saliency prediction or semantic segmentation, the desired output is a foreground map that predicts pixels where some criteria is satisfied. Despite the inherently spatial nature of this task commonly used learning objectives do not incorporate the spatial relationships between misclassified pixels and the underlying ground truth. The Weighted F-measure, a recently proposed evaluation metric, does reweight errors spatially, and has been shown to closely correlate with human evaluation of quality, and stably rank predictions with respect to noisy ground truths (such as a sloppy human annotator might generate). However it suffers from computational complexity which makes it intractable as an optimization objective for gradient descent, which must be evaluated thousands or millions of times while learning a model's parameters. We propose a differentiable and efficient approximation of this metric. By incorporating spatial information into the objective we can use a simpler model than competing methods without sacrificing accuracy, resulting in faster inference speeds and alleviating the need for pre/post-processing. We match (or improve) performance on several tasks compared to prior state of the art by traditional metrics, and in many cases significantly improve performance by the weighted F-measure.
Nicholas I. Kolkin, Gregory Shakhnarovich, Eli Shechtman
ICCV1
2015 From Word Embeddings To Document Distances
abstract
We present the Word Mover’s Distance (WMD), a novel distance function between text documents. Our work is based on recent results in word embeddings that learn semantically meaningful representations for words from local co-occurrences in sentences. The WMD distance measures the dissimilarity between two text documents as the minimum amount of distance that the embedded words of one document need to "travel" to reach the embedded words of another document. We show that this distance metric can be cast as an instance of the Earth Mover’s Distance, a well studied transportation problem for which several highly efficient solvers have been developed. Our metric has no hyperparameters and is straight-forward to implement. Further, we demonstrate on eight real world document classification data sets, in comparison with seven state-of-the-art baselines, that the WMD metric leads to unprecedented low k-nearest neighbor document classification error rates.
Matt J. Kusner, Yu Sun 0020, Nicholas I. Kolkin, Kilian Q. Weinberger
ICML3