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

Tavian Barnes

dblp:202/2533 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 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.

Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Memory systems · 50%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › memory management › virtual memory
single-level store
0.512021
The Aurora Single Level Store Operating System · SOSP 2021
Machine learning › Reinforcement learning
value function approximation
0.312017
Hybrid Reward Architecture for Reinforcement Learning · NIPS 2017
Storage systems
file systems
0.112021
The Aurora Single Level Store Operating System · SOSP 2021
Memory systems › non-volatile memory
persistent memory
0.112021
The Aurora Single Level Store Operating System · SOSP 2021
Machine learning › Reinforcement learning › reward design
reward decomposition
0.112017
Hybrid Reward Architecture for Reinforcement Learning · NIPS 2017

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

deep network value approximation · 0.3
YearPublicationVenuePosition
2024 Towards understanding barriers and mitigation strategies of software engineers with non-traditional educational and occupational backgrounds
Tavian Barnes, Ken Jen Lee, Cristina Tavares, Gema Rodríguez-Pérez, Meiyappan Nagappan
Empir. Softw. Eng.1
2021 The Aurora operating system: revisiting the single level store
abstract
Applications on modern operating systems manage their ephemeral state in memory, and persistent state on disk. Ensuring consistency between them is a source of significant developer effort, yet still a source of significant bugs in mature applications. We present the Aurora single level store (SLS), an OS that simplifies persistence by automatically persisting all traditionally ephemeral application state. With recent storage hardware like NVMe SSDs and NVDIMMs, Aurora is able to continuously checkpoint entire applications with millisecond granularity.
Emil Tsalapatis, Ryan Hancock, Tavian Barnes, Ali José Mashtizadeh
HotOS3
2021 The Aurora Single Level Store Operating System
abstract
Applications on modern operating systems manage their ephemeral state in memory and persistent state on disk. Ensuring consistency between them is a source of significant developer effort and application bugs. We present the Aurora single level store, an OS that eliminates the distinction between ephemeral and persistent application state.
Emil Tsalapatis, Ryan Hancock, Tavian Barnes, Ali José Mashtizadeh
SOSP3
2017 Hybrid Reward Architecture for Reinforcement Learning
abstract
One of the main challenges in reinforcement learning (RL) is generalisation. In typical deep RL methods this is achieved by approximating the optimal value function with a low-dimensional representation using a deep network. While this approach works well in many domains, in domains where the optimal value function cannot easily be reduced to a low-dimensional representation, learning can be very slow and unstable. This paper contributes towards tackling such challenging domains, by proposing a new method, called Hybrid Reward Architecture (HRA). HRA takes as input a decomposed reward function and learns a separate value function for each component reward function. Because each component typically only depends on a subset of all features, the corresponding value function can be approximated more easily by a low-dimensional representation, enabling more effective learning. We demonstrate HRA on a toy-problem and the Atari game Ms. Pac-Man, where HRA achieves above-human performance.
Harm van Seijen, Mehdi Fatemi, Romain Laroche, Joshua Romoff, Tavian Barnes, Jeffrey Tsang
NIPS5