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

Tim Bauman

dblp:58/1027 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 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
Trustworthy machine learning · 67% Language models and text generation · 33%
Computer graphics and multimedia
1 paper
Image and video coding · 87% Visual content generation and editing · 13%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training
0.612022
Adversarial training for high-stakes reliability · NeurIPS 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Adversarial training for high-stakes reliability · NeurIPS 2022
Natural language and speech › Language models and text generation › large language model safety
safe text generation
0.612022
Adversarial training for high-stakes reliability · NeurIPS 2022
Image and video coding › region-based video coding
region-of-interest coding
0.112008
Supporting region-of-interest cropping through constrained compression · ACM Multimedia 2008
Image and video coding
video compression
0.112008
Supporting region-of-interest cropping through constrained compression · ACM Multimedia 2008
Visual content generation and editing › video retargeting
video cropping
0.012008
Supporting region-of-interest cropping through constrained compression · ACM Multimedia 2008

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

human adversary tool · 0.6adversarial training · 0.6constrained compression · 0.1MPEG-2 · 0.1
YearPublicationVenuePosition
2022 Adversarial training for high-stakes reliability
abstract
In the future, powerful AI systems may be deployed in high-stakes settings, where a single failure could be catastrophic. One technique for improving AI safety in high-stakes settings is adversarial training, which uses an adversary to generate examples to train on in order to achieve better worst-case performance.In this work, we used a safe language generation task (``avoid injuries'') as a testbed for achieving high reliability through adversarial training. We created a series of adversarial training techniques---including a tool that assists human adversaries---to find and eliminate failures in a classifier that filters text completions suggested by a generator. In our task, we determined that we can set very conservative classifier thresholds without significantly impacting the quality of the filtered outputs. We found that adversarial training significantly increased robustness to the adversarial attacks that we trained on--- tripling the time to find adversarial examples without tools and doubling the time with our tool (from 13 to 26 minutes)---without affecting in-distribution performance. We hope to see further work in the high-stakes reliability setting, including more powerful tools for enhancing human adversaries and better ways to measure high levels of reliability, until we can confidently rule out the possibility of catastrophic deployment-time failures of powerful models.
Daniel M. Ziegler, Seraphina Nix, Lawrence Chan, Tim Bauman, Peter Schmidt-Nielsen, Tao Roa Lin, Adam Scherlis, Noa Nabeshima, Benjamin Weinstein-Raun, Daniel de Haas, Buck Shlegeris, Nate Thomas
NeurIPS4
2011 Supporting region-of-interest cropping through constrained compression
abstract
The ability to create super high-resolution video is becoming relative easy to do either through a single high-definition video camera or panoramic video that automatically stitches multiple views together. As an example of the former, the motion picture industry now has 6000 × 4000 pixel full-rate video cameras available. This means that supporting region-of-interest cropping will become more important in the future. In this article, we propose a mechanism to support region-of-interest adaptation of stored video. The proposed approach creates a compression-compliant stream (e.g., MPEG-2), while still allowing it to be cropped. Fortunately, video standards like MPEG-2 specify the format of a compliant stream, and not the algorithm to get there. As a result, there is an opportunity to allow system researchers and implementers ways to optimize for applications. We show various fundamental tradeoffs that are made in order to support region-of-interest cropping with super high-resolution video which we received from a local motion-picture firm.
Wu-chi Feng, Thanh Dang, John Kassebaum, Tim Bauman
ACM Trans. Multim. Comput. Commun. Appl.4
2008 Supporting region-of-interest cropping through constrained compression
abstract
The ability to create very high-resolution video is becoming relative easy to do today, either through a single high definition video camera or panoramic video stitched from multiple cameras. This means that supporting region-of-interest cropping will become more important in the future. In this paper, we propose a mechanism to support region-of-interest adaptation of stored video. The proposed approach creates a compression compliant stream (e.g., MPEG-2), while still allowing it to be cropped. Using data from a motion-picture industry video camera, we show that the proposed approach, while adding a small amount of overhead, can be used to efficiently crop large resolution video into a smaller stream.
Wu-chi Feng, Thanh Dang, John Kassebaum, Tim Bauman
ACM Multimedia4