Pushing the Limits of High-Resolution Weather Forecasting through Data Scaling
arXiv:2608. 14652v1 Announce Type: cross Abstract: The development of 0.
The paper investigates the impact of low‑resolution data on machine learning models, especially when high‑resolution data is scarce. It provides a theoretical analysis using Kullback‑Leibler divergence to quantify how data resolution affects a datapoint’s influence and derives bounds on information loss from downsampling. Empirical results with a vision transformer and a convolutional neural network show that incorporating low‑resolution data consistently improves performance in such settings.
arXiv:2608. 14652v1 Announce Type: cross Abstract: The development of 0.
The paper presents an empirical benchmark of nine modern deep‑learning models for time‑series forecasting of smart‑meter energy consumption, evaluated on two publicly available datasets. It examines how historical input length, prediction horizon, and model architecture affect accuracy, finding that longer historical context improves performance up to a saturation point and that accuracy declines with longer horizons. The study also compares computational complexity, showing that lightweight architectures achieve similar performance to heavier models, and notes that model choice has limited impact across most demographic and household subgroups.
The paper presents an empirical benchmark of nine deep learning models for smart meter energy forecasting, evaluating them on two public datasets. It examines how historical input length, prediction horizon, and model architecture affect accuracy, finding that longer historical context improves performance up to a saturation point while accuracy declines with longer horizons. The study also compares computational cost, showing lightweight models achieve similar accuracy to heavier ones, and notes that model choice matters less across most population segments.
arXiv:2607. 09402v1 Announce Type: new Abstract: Deep learning models dependency on large-scale inertial datasets presents a significant bottleneck in inertial sensor-based classification tasks, such as human activity recognition and smartphone location recognition.
arXiv:2603.16497v3 Announce Type: replace-cross Abstract: Time series foundation models (TSFMs) require diverse, real-world datasets to adapt across varying domains and temporal frequencies. However,...
arXiv:2606. 14353v1 Announce Type: new Abstract: Error-bounded lossy compression is a fundamental technique for managing the rapidly growing volumes of scientific data produced by modern simulations and observational instruments.
arXiv:2512. 21315v2 Announce Type: replace Abstract: The data processing inequality is an information-theoretic principle stating that the information content of a signal cannot be increased by processing the observations.
arXiv:2606. 04857v1 Announce Type: new Abstract: Standard IMVC evaluation retrains separate models for different missing-data configurations.
arXiv:2602.01437v2 Announce Type: replace-cross Abstract: The problem of corrupted data, missing features, or missing modalities continues to plague the modern machine learning landscape. To address...
arXiv:2510. 18668v4 Announce Type: replace Abstract: Wearable cardiovascular sensor patches promise continuous, unobtrusive monitoring, but their tight energy, memory, and compute budgets make it unclear whether physiological signals should be analyzed on the device or streamed to the cloud for processing.
arXiv:2606. 04409v1 Announce Type: cross Abstract: Modern deep neural networks usually have large parameter scales and nonlinear hierarchical structures, and they have achieved strong performance in computer vision.
The paper introduces the concept of Information Capacity (IC) to quantify how much bandwidth savings a unit of decoder compute can achieve in generative video compression (GVC). By modeling reconstruction quality as a two‑factor power law in data rate and compute, the authors fit measured DISTS of two GVC decoders with high accuracy and define IC as the negative logarithmic slope along an iso‑quality contour. IC is dimensionless, enabling architecture‑agnostic comparisons and revealing that a 14B decoder trades compute for rate far more efficiently than a 1.3B decoder, with significant variation across datasets.