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

Jesse Johnson

dblp:116/2784 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
Deep learning architectures and training · 50% Learning theory · 50%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
neural network expressivity
0.412019
Deep, Skinny Neural Networks are not Universal Approximators · ICLR (Poster) 2019
Machine learning › Learning theory › approximation theory › neural network approximation
universal approximation
0.412019
Deep, Skinny Neural Networks are not Universal Approximators · ICLR (Poster) 2019
Computational complexity
approximation properties of neural networks
0.412019
Deep, Skinny Neural Networks are not Universal Approximators · ICLR (Poster) 2019

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

depth-width tradeoff analysis · 0.4depth-width trade-off analysis · 0.4
YearPublicationVenuePosition
2026 Improved Wildfire Spread Prediction with Time-Series Data and the WSTS+ Benchmark
abstract
Recent research has demonstrated the potential of deep neural networks (DNNs) to accurately predict wildfire spread on a given day based upon high-dimensional explanatory data from a single preceding day, or from a time series of T preceding days. For the first time, we investigate a large number of existing data-driven wildfire modeling strategies under controlled conditions, revealing the best modeling strategies and resulting in models that achieve state-of-the-art (SOTA) accuracy for both single-day and multi-day input scenarios, as evaluated on a large public benchmark for next-day wildfire spread, termed the WildfireSpreadTS (WSTS) benchmark. Consistent with prior work, we found that models using time-series input obtained the best overall accuracy, suggesting this is an important future area of research. Furthermore, we create a new benchmark, WSTS+, by incorporating four additional years of historical wildfire data into the WSTS benchmark. Our benchmark doubles the number of unique years of historical data, expands its geographic scope, and, to our knowledge, represents the largest public benchmark for time-series-based wildfire spread prediction. Code, model weights, and data can be found at this repo.
Saad Lahrichi, Jake Bova, Jesse Johnson, Jordan M. Malof
WACV3
2020 Estimating Global Evapotranspiration Using Smap Surface and Root-Zone Moisture Content
abstract
Evapotranspiration (ET) is a key link between the global carbon, water and energy cycles. ET generally occurs from soil, vegetation and intercepted precipitation. ET components are commonly estimated using a combination of variables, including meteorology, vegetation, and soil moisture conditions. Although vegetation transpiration has a major effect on global ET variations, soil evaporation can also contribute significant water loss to the atmosphere. This study utilizes satellite derived soil moisture data from the NASA SMAP mission to produce global ET estimates using a modified Penman Monteith algorithm. The global ET results were assessed using other available ET benchmarks. In addition, the ET estimates were evaluated for monitoring spring onset in relation to other complementary satellite observations of vegetation phenology and landscape freeze/thaw metrics. The comparisons between global ET products showed similar latitudinal variation, but with larger differences in tropical rainforests. The spring onset results showed landscape thawing related to rising temperature facilitating the new release of plant-available soil moisture that accompanies a dramatic seasonal rise in both vegetation photosynthesis and ET.
Youngwook Kim 0004, Hotaek Park, John S. Kimball, Andreas Colliander, Jesse Johnson
IGARSS5
2019 Deep, Skinny Neural Networks are not Universal Approximators
Jesse Johnson
ICLR (Poster)1
2014 Computable categoricity for pseudo-exponential fields of size ℵ1
Jesse Johnson
Ann. Pure Appl. Log.1
2013 Pinch Ratio Clustering from a Topologically Intrinsic Lexicographic Ordering
abstract
This paper introduces an algorithm for determining data clusters called TILO/PRC (Topologically Intrinsic Lexicographic Ordering/Pinch Ratio Clustering). The theoretical foundation for this algorithm, developed in [14], uses ideas from topology (particularly knot theory) suggesting that it should be very flexible and robust with respect to noise. The TILO portion of the algorithm progressively improves a linear ordering of the points in a data set until the ordering satisfies a topological condition called strongly irreducible. The PRC algorithm then divides the data set based on this ordering and a heuristic metric called the pinch ratio. We demonstrate the effectiveness of TILO/PRC for finding clusters in a wide variety of real and synthetic data sets and compare the results to existing clustering methods. Moreover, because the output of TILO depends on the initial ordering, we consider the effects of different random orderings on the final clusters defined by PRC, and show that choosing an initial ordering based on a different clustering algorithm can improve the final clusters. These results verify that both the theoretical foundations of TILO and the heuristic notion of pinch ratio are reasonable.
Douglas R. Heisterkamp, Jesse Johnson
SDM2