Sarah Brockman

dblp:255/7003 · 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 · 2 · 1 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
Representation and self-supervised learning · 41% Reinforcement learning · 20% Trustworthy machine learning · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › domain-aware representation learning
geospatial representation learning
0.712023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
masked autoencoder
0.712023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Computer vision › 3D vision
remote sensing
0.712023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Machine learning › Reinforcement learning › bandit
contextual bandit
0.412019
Offline Contextual Bandits with High Probability Fairness Guarantees · NeurIPS 2019
Machine learning › Trustworthy machine learning
fairness
0.412019
Offline Contextual Bandits with High Probability Fairness Guarantees · NeurIPS 2019
Machine learning › Trustworthy machine learning › fairness
fairness guarantees
0.412019
Offline Contextual Bandits with High Probability Fairness Guarantees · NeurIPS 2019
Machine learning › Reinforcement learning › bandit › contextual bandit
offline contextual bandit
0.412019
Offline Contextual Bandits with High Probability Fairness Guarantees · NeurIPS 2019
Machine learning › Representation and self-supervised learning › representation learning
multi-scale representation learning
0.212023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023

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

positional encoding · 0.7masked image modeling · 0.7high-probability bounds · 0.4
YearPublicationVenuePosition
2023 Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning
abstract
Large, pretrained models are commonly finetuned with imagery that is heavily augmented to mimic different conditions and scales, with the resulting models used for various tasks with imagery from a range of spatial scales. Such models overlook scale-specific information in the data for scale-dependent domains, such as remote sensing. In this paper, we present Scale-MAE, a pretraining method that explicitly learns relationships between data at different, known scales throughout the pretraining process. Scale-MAE pre-trains a network by masking an input image at a known input scale, where the area of the Earth covered by the image determines the scale of the ViT positional encoding, not the image resolution. Scale-MAE encodes the masked image with a standard ViT backbone, and then decodes the masked image through a bandpass filter to reconstruct low/high frequency images at lower/higher scales. We find that tasking the network with reconstructing both low/high frequency images leads to robust multiscale representations for remote sensing imagery. Scale-MAE achieves an average of a 2.4 − 5.6% non-parametric kNN classification improvement across eight remote sensing datasets compared to current state-of-the-art and obtains a 0.9 mIoU to 1.7 mIoU improvement on the SpaceNet building segmentation transfer task for a range of evaluation scales.
Colorado Reed, Ritwik Gupta, Sarah Brockman, Christopher Funk, Brian Clipp, Kurt Keutzer, Salvatore Candido, Matthew Uyttendaele, Trevor Darrell
ICCV4
2019 Offline Contextual Bandits with High Probability Fairness Guarantees
abstract
We present RobinHood, an offline contextual bandit algorithm designed to satisfy a broad family of fairness constraints. Our algorithm accepts multiple fairness definitions and allows users to construct their own unique fairness definitions for the problem at hand. We provide a theoretical analysis of RobinHood, which includes a proof that it will not return an unfair solution with probability greater than a user-specified threshold. We validate our algorithm on three applications: a tutoring system in which we conduct a user study and consider multiple unique fairness definitions; a loan approval setting (using the Statlog German credit data set) in which well-known fairness definitions are applied; and criminal recidivism (using data released by ProPublica). In each setting, our algorithm is able to produce fair policies that achieve performance competitive with other offline and online contextual bandit algorithms.
Blossom Metevier, Stephen Giguere 0001, Sarah Brockman, Ari Kobren, Yuriy Brun, Emma Brunskill, Philip S. Thomas
NeurIPS3