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

Ben Krause

dblp:64/2350 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author

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
Language models and text generation · 50% Generative modeling · 30% Deep learning architectures and training · 20%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › diffusion model › controllable generation
attribute-controlled generation
0.512021
Deep Extrapolation for Attribute-Enhanced Generation · NeurIPS 2021
Natural language and speech › Language models and text generation
text generation
0.512021
Deep Extrapolation for Attribute-Enhanced Generation · NeurIPS 2021
Natural language and speech › Language models and text generation › large language model evaluation › large language model benchmarking
dynamic evaluation
0.312018
Dynamic Evaluation of Neural Sequence Models · ICML 2018
Machine learning › Deep learning architectures and training › sequence modeling
neural sequence models
0.312018
Dynamic Evaluation of Neural Sequence Models · ICML 2018
Bioinformatics and computational biology
protein design
0.112021
Deep Extrapolation for Attribute-Enhanced Generation · NeurIPS 2021
Bioinformatics and computational biology › structural biology › protein structure and function
protein stability
0.112021
Deep Extrapolation for Attribute-Enhanced Generation · NeurIPS 2021

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

latent space learning · 1.0gradient descent · 0.3dynamic evaluation · 0.3
YearPublicationVenuePosition
2021 Deep Extrapolation for Attribute-Enhanced Generation
abstract
Attribute extrapolation in sample generation is challenging for deep neural networks operating beyond the training distribution. We formulate a new task for extrapolation in sequence generation, focusing on natural language and proteins, and propose GENhance, a generative framework that enhances attributes through a learned latent space. Trained on movie reviews and a computed protein stability dataset, GENhance can generate strongly-positive text reviews and highly stable protein sequences without being exposed to similar data during training. We release our benchmark tasks and models to contribute to the study of generative modeling extrapolation and data-driven design in biology and chemistry.
Alvin Chan, Ali Madani, Ben Krause, Nikhil Naik 0002
NeurIPS3
2018 Dynamic Evaluation of Neural Sequence Models
abstract
We explore dynamic evaluation, where sequence models are adapted to the recent sequence history using gradient descent, assigning higher probabilities to re-occurring sequential patterns. We develop a dynamic evaluation approach that outperforms existing adaptation approaches in our comparisons. We apply dynamic evaluation to outperform all previous word-level perplexities on the Penn Treebank and WikiText-2 datasets (achieving 51.1 and 44.3 respectively) and all previous character-level cross-entropies on the text8 and Hutter Prize datasets (achieving 1.19 bits/char and 1.08 bits/char respectively).
Ben Krause, Emmanuel Kahembwe, Iain Murray 0001, Steve Renals
ICML1
2018 Dimension-Free Lp-Maximal Inequalities for Spherical Means in the Hypercube
abstract
We extend the main result of Harrow, Kolla, and Schulman---the existence of dimension-free $L^2$-bounds for the spherical maximal function in the hypercube, $\{0,1\}^N$---to all $L^p, p > 1$. Our approach is motivated by the spectral technique developed by Nevo and Stein, and by Stein, in the context of pointwise ergodic theorems on general groups. We provide an example which demonstrates that no dimension-free weak-type $1-1$ bound exists at the endpoint.
Ben Krause
SIAM J. Discret. Math.1