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

Frederick Hoffman

dblp:45/4995 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 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
Representation and self-supervised learning · 60% Generative modeling · 20% Trustworthy machine learning · 20%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.712023
Improving Visual Representation Learning Through Perceptual Understanding · CVPR 2023
Machine learning › Generative modeling
generative adversarial network
0.712023
Improving Visual Representation Learning Through Perceptual Understanding · CVPR 2023
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
masked autoencoder
0.712023
Improving Visual Representation Learning Through Perceptual Understanding · CVPR 2023
Machine learning › Representation and self-supervised learning
perceptual representation learning
0.712023
Improving Visual Representation Learning Through Perceptual Understanding · CVPR 2023
Machine learning › Representation and self-supervised learning › representation learning
visual representation learning
0.712023
Improving Visual Representation Learning Through Perceptual Understanding · CVPR 2023
Coding theory
error-correcting codes
0.011977
Some results related to generalized Varshamov-Gilbert bounds (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory › error-correcting codes
error detection
0.011977
Some results related to generalized Varshamov-Gilbert bounds (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory › error-correcting codes › coding bounds › minimum distance bounds
gilbert-varshamov bound
0.011977
Some results related to generalized Varshamov-Gilbert bounds (Corresp.) · IEEE Trans. Inf. Theory 1977
Coding theory › error-correcting codes › block codes
linear code
0.011977
Some results related to generalized Varshamov-Gilbert bounds (Corresp.) · IEEE Trans. Inf. Theory 1977

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

perceptual similarity loss · 0.7multi-scale training · 0.7adaptive discriminator augmentation · 0.7subspace bounds · 0.0finite vector spaces · 0.0
YearPublicationVenuePosition
2023 Improving Visual Representation Learning Through Perceptual Understanding
abstract
We present an extension to masked autoencoders (MAE) which improves on the representations learnt by the model by explicitly encouraging the learning of higher scene-level features. We do this by: (i) the introduction of a perceptual similarity term between generated and real images (ii) incorporating several techniques from the adversarial training literature including multi-scale training and adaptive discriminator augmentation. The combination of these results in not only better pixel reconstruction but also representations which appear to capture better higher-level details within images. More consequentially, we show how our method, Perceptual MAE, leads to better performance when used for downstream tasks outperforming previous methods. We achieve 78.1% top-1 accuracy linear probing on ImageNet-1K and up to 88.1% when fine-tuning, with similar results for other downstream tasks, all without use of additional pre-trained models or data.
Samyakh Tukra, Frederick Hoffman, Ken Chatfield
CVPR2
1977 Some results related to generalized Varshamov-Gilbert bounds (Corresp.)
abstract
Two generalizations of the Varshamov-Gilbert bound for error-correcting and error-detecting codes are developed. Sufficient intrinsic conditions are given for classes of linear codes over GF(q)to include "good" codes, and these classes are related to other known classes. A lower bound on the maximal order of subspaces contained in subsets of certain finite vector spaces is given and related to a bound on error-detecting codes.
Mikhail Deza, Frederick Hoffman
IEEE Trans. Inf. Theory2