Searcharxiv⌕ Search

arXiv subjects

Konrad Schultka

Publications and source records attributed to Konrad Schultka.

2 recordsLinked to original sources

Benchmarking for Practice: Few-Shot Time-Series Crop-Type Classification on the EuroCropsML Dataset

Accurate crop-type classification from satellite time series is essential for agricultural monitoring. While various machine learning algorithms have been developed to enhance performance on data-scarce tasks, their evaluation often lacks real-world scenarios. Consequently, their efficacy in challenging practical applications has not yet been profoundly assessed. To facilitate future research in this domain, we present the first comprehensive benchmark for evaluating supervised and SSL methods for crop-type classification under real-world conditions. This benchmark study relies on the EuroCropsML time-series dataset, which combines farmer-reported crop data with Sentinel-2 satellite observations from Estonia, Latvia, and Portugal. Our findings indicate that MAML-based meta-learning algorithms achieve slightly higher accuracy compared to supervised transfer learning and SSL methods. However, compared to simpler transfer learning, the improvement of meta-learning comes at the cost of increased computational demands and training time. Moreover, supervised methods benefit most when pre-trained and fine-tuned on geographically close regions. In addition, while SSL generally lags behind meta-learning, it demonstrates advantages over training from scratch, particularly in capturing fine-grained features essential for real-world crop-type classification, and also surpasses standard transfer learning. This highlights its practical value when labeled pre-training crop data is scarce. Our insights underscore the trade-offs between accuracy and computational demand in selecting supervised machine learning methods for real-world crop-type classification tasks and highlight the difficulties of knowledge transfer across diverse geographic regions. Furthermore, they demonstrate the practical value of SSL approaches when labeled pre-training crop data is scarce.

cs.LG↗

Toric geometry and regularization of Feynman integrals

We study multivariate Mellin transforms of Laurent polynomials by considering special toric compactifications which make their singular structure apparent. This gives a precise description of their convergence domain, refining results of Nilsson, Passare, Berkesch and Forsgård. We also reformulate the geometric sector decomposition approach of Kaneko and Ueda in terms of these compactifications. Specializing to the case of Feynman integrals in the parametric representation, we construct multiple such compactifications given by certain systems of subgraphs. As particular cases, we recover the sector decompositions of Hepp, Speer and Smirnov, as well as the iterated blow-up constructions of Brown and Bloch-Esnault-Kreimer. A fundamental role is played by the Newton polytope of the product of the Symanzik polynomials, which we show to be a generalized permutahedron for generic kinematics. As an application, we review two approaches to dimensional regularization of Feynman integrals, based on sector decomposition and on analytic continuation.

math-ph↗