Improved hydrological models using LSTM networks on large datasets.
problem Traditional hydrological models degrade when applied to multiple basins.
method Long Short-Term Memory (LSTM) networks trained on 531 basins from CAMELS data.
result Single LSTM model outperforms regional and basin-specific models.
Deep learning framework predicts streamflow and flood probabilities in Australian catchments.
problem Large-scale flooding prediction challenges due to model calibration and missing data.
method Ensemble quantile-based deep learning framework using quantile regression and CAMELS dataset.
result Notable efficacy and uncertainties in streamflow forecasts with varied catchment properties.
New framework uses time series features for predicting streamflow in ungauged areas.
problem Predicting streamflow in areas without gauging stations.
method Developed regression-based streamflow regionalization using a wide range of time series features from large datasets.
result Certain time series features, like entropy and autocorrelation, are better predictors of streamflow than traditional catchment attributes.
This paper presents a novel Inter Catchment Wastewater Transfer (ICWT) method for mitigating sewer overflow. The ICWT aims at balancing the spatial mismatch of sewer flow and treatment capacity of Wastewater Treatment Plant (WWTP), through collaborative operation of sewer system facilities. Using a hydraulic model, the…
Machine learning models estimate nutrient concentrations from water quality surrogates.
problem Estimating high frequency nutrient concentrations from limited in-situ measurements.
method Used machine learning (Random Forests) to estimate nutrient concentrations using surrogate measures.
result Reduced RMSE by up to 60.1% compared to linear models, with additional sensors not providing significant benefits.
Exploiting capacity of sewer system using decentralized control is a cost effective mean of minimizing the overflow. Given the size of the real sewer system, exploiting all the installed control structures in the sewer pipes can be challenging. This paper presents a divide and conquer solution to implement decentralize…
Dataset for rainfall modeling in central Europe from 1981-2011.
problem Improving rainfall streamflow modeling beyond simple catchments.
method Spatially resolved meteorological and ancillary data compilation.
result Dataset for neural network-driven hydrological modeling.
Despite the huge success of Long Short-Term Memory networks, their applications in environmental sciences are scarce. We argue that one reason is the difficulty to interpret the internals of trained networks. In this study, we look at the application of LSTMs for rainfall-runoff forecasting, one of the central tasks in…
Neural network model forecasts extreme flood risk.
problem Accurately estimating high quantiles of extreme events.
method EQRN model combining neural networks and extreme value theory.
result Forecasting flood risk with improved adaptability.
Study improves forecasting of ED crowding using advanced ML models.
problem Improving forecasting of emergency department crowding.
method Advanced machine learning models (N-BEATS, LightGBM, DeepAR) using multivariable input data.
result N-BEATS and LightGBM outperform benchmarks in forecasting ED occupancy.
Python package automates causal parameter estimation using Riesz regression.
problem Efficient estimation of causal and structural parameters.
method Automatic DML and generalized Riesz regression framework.
result Automatic construction of balancing link functions for generalized Riesz regression.
New method combines simple forecasting techniques for river flow predictions.
problem Improving accuracy of long-term hydrological forecasts.
method Combines at least two forecasting methods using median combiner.
result Performs well in long-term forecasts, especially with multiple methods.
Study predicts stream turbidity using surrogate data and meta-model.
problem Costly turbidity sensor deployment limits monitoring networks.
method Dynamic regression (ARIMA), LSTM, GAM models; surrogate covariates (rainfall, water level, temperature, solar exposure); meta-model combining strengths of individual models.
result ARIMA and GAM models with all covariates outperform single models; meta-model yields highest accuracy.
Transformer-based diffusion models improve hydrological time series imputation and forecasting.
problem Limited observations in hydrometeorological time series.
method Transformer-based diffusion models applied to hydrological data.
result Transformer-based models efficiently sample realistic time series distributions under variable missing data.
Introduces CHL, a new loss function for continuous similarity learning.
problem Binary similarity learning limitations.
method CHL is a novel loss function that generalizes histogram loss to continuous similarities.
result CHL solves a wider range of tasks including similarity learning, representation learning, and data visualization.
Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in many problems it may be expensive to obtain or compute similarities between the items to be clustered. This paper investigates the hierarchical clustering of N items based on a small sub…
Deconfounds neural network representation similarity metrics to improve consistency and accuracy.
problem Confounding by population structure in similarity metrics like RSA and CKA.
method Covariate adjustment regression to adjust for confounders.
result Improves detection of semantically similar neural networks and consistency in transfer learning.
Quantum networks learn task-dependent asymmetric similarity measures.
problem Challenges of conventional distance functions in capturing meaningful similarity.
method GQSim: Quantum networks for learning task-dependent (a)symmetric similarity.
result Quantum similarity measures extract salient features and achieve theoretically guaranteed performance.
In this paper, we investigate the similarity transformations in the Minkowski-n space. We study the geometric invariants of non-null curves under the similarity transformations. Besides, we extend the fundamental theorem for a non-null curve according to a similarity motion. We determine all non-null self-similar curve…
Defines a similarity measure for classification distributions.
problem Measuring similarity between classification distributions.
method Proposes task similarity, a novel measure quantifying performance of source distributions on target distributions.
result Empirical task similarity correlates with transfer efficiency and semantic similarity of source distributions.
Proposes neural similarity for CNNs to enhance flexibility and performance.
problem Limited flexibility of inner product-based convolution in CNNs.
method Introduces neural similarity as a learnable parametric similarity measure, and proposes NSL for adaptive learning from data.
result Dynamic neural similarity improves flexibility and performance in visual recognition and few-shot learning.
Automates similarity measure construction from data.
problem Defining similarity measures analytically is challenging.
method Applies machine learning to learn similarity measures from data.
result Data-driven similarity measure outperforms state of the art methods.
The performance of most the clustering methods hinges on the used pairwise affinity, which is usually denoted by a similarity matrix. However, the pairwise similarity is notoriously known for its vulnerability of noise contamination or the imbalance in samples or features, and thus hinders accurate clustering. To tackl…
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/simila…
Similarity-based clustering and semi-supervised learning methods separate the data into clusters or classes according to the pairwise similarity between the data, and the pairwise similarity is crucial for their performance. In this paper, we propose a novel discriminative similarity learning framework which learns dis…
Modified cosine distance improves similarity performance in data with variance and correlation.
problem Limitations of traditional cosine similarity in random variable spaces with variance and correlation.
method Proposed a variance-adjusted cosine distance metric to overcome limitations of traditional cosine similarity.
result Modified cosine distance shows 100% test accuracy in KNN model on the Wisconsin Breast Cancer Dataset.
Advocates Tversky's model for image similarity learning.
problem Learning Tversky similarity measures from image data.
method Computational approach using Tversky's ratio model.
result Performs well compared to existing methods on image datasets.
Paper presents a new trie for integer sketches to improve similarity searches.
problem Efficient similarity searches on integer sketches.
method Introduces a novel b-bit sketch trie that leverages succinct data structures. result Significantly improves search time and space-efficiency of similarity searches.
Method measures weight similarity in neural networks using normalization and statistical inference.
problem Quantifying weight similarity in non-convex neural networks.
method Chain normalization rule and hypothesis-training-testing statistical inference.
result Weights of identical neural networks converge to similar local solutions.
We prove that the only self-similar surfaces of Euclidean 3-space which are foliated by circles are the self-similar surfaces of revolution discovered by S. Angenent and that the only ruled, self-similar surfaces are the cylinders over planar self-similar curves.
Improves confidence calibration in neural networks by smoothing labels based on class similarity.
problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.
CatSIM measures image similarity robustly to small changes.
problem Measuring similarity between images, especially with small perturbations.
method Uses structural similarity image quality paradigm, robust to small location changes.
result Structural similarity between images rated higher when not entirely overlapping.
Proposes DNN-based speaker embedding correlated with subjective inter-speaker similarity for speech synthesis.
problem Inadequate speaker representation for open speakers not in training data.
method Two training algorithms using inter-speaker similarity matrices: similarity vector embedding and similarity matrix embedding.
result Proposed algorithms learn speaker embedding highly correlated with subjective inter-speaker similarity.
Study uses trajectory embedding to measure place function similarity at fine spatial granularity.
problem Measuring place function similarity at fine spatial granularity.
method Trajectory embedding to reduce dimensions and measure similarity of place functions.
result Embedding similarity can be a metric proxy for place functions at fine spatial granularity.
STRAPSim measures ETF portfolio similarity better than existing methods.
problem Measuring portfolio similarity for ETFs and portfolios.
method Semantic, two-level, residual-aware portfolio similarity computation.
result STRAPSim outperforms existing methods in predictive accuracy and ranking alignment.
We propose shifted inner-product similarity (SIPS), which is a novel yet very simple extension of the ordinary inner-product similarity (IPS) for neural-network based graph embedding (GE). In contrast to IPS, that is limited to approximating positive-definite (PD) similarities, SIPS goes beyond the limitation by introd…
Exploits class similarity for better machine learning models with confidence labels and projective loss functions.
problem Poor model performance due to confusing similar classes.
method Exploits class similarity with confidence labels and projective loss functions.
result Improved model performance on noisy labels.
We propose weighted inner product similarity (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…
BiLRP explains deep similarity models by decomposing scores into feature contributions.
problem Verifying meaningful patterns in complex similarity models.
method Augmenting similarity scores with feature explanations using LRP.
result BiLRP robustly explains deep neural network features and historical document similarities.
The problem of hierarchical clustering items from pairwise similarities is found across various scientific disciplines, from biology to networking. Often, applications of clustering techniques are limited by the cost of obtaining similarities between pairs of items. While prior work has been developed to reconstruct cl…
Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar sets have touching structures the problem of Lipschitz equivalence becomes much …
New method improves reinforcement learning generalization.
problem Few environments lead to poor generalization in reinforcement learning.
method Integrates sequential structure into representation learning, using a policy similarity metric (PSM) and contrastive embeddings (PSEs).
result PSEs improve generalization across various benchmarks.
New findings clarify the link between distributional closeness and representational similarity.
problem When and why do different neural network representations become similar?
method Identifiability theory, focusing on model families including autoregressive language models.
result Small Kullback-Leibler divergence does not guarantee similar representations.
Neural networks auto-denoise similar inputs, enabling new statistical analysis.
problem Estimating similarity of inputs for neural networks.
method Define and quantify similarity from neural network perspective, using parameter variation impact on outputs.
result Estimate sample density and quantify denoising effect without true labels.
Unified understanding of neural representation similarity measures.
problem Fragmented research landscape of neural network similarity measures.
method Observation and exploration of connections between shape distances and normalized Bures similarity.
result Cosine of the Riemannian shape distance equals normalized Bures similarity.
A large body of research into semantic textual similarity has focused on constructing state-of-the-art embeddings using sophisticated modelling, careful choice of learning signals and many clever tricks. By contrast, little attention has been devoted to similarity measures between these embeddings, with cosine similari…
ROTS improves sentence similarity by incorporating structural information.
problem Measuring sentence similarity with theoretical insights and structural awareness.
method Recursive Optimal Transport (ROT) framework to incorporate structural information.
result ROTS outperforms weakly supervised approaches in sentence similarity tasks.
DBSCAN clustering improved by using nearest neighbour-induced Isolation Similarity.
problem Improving clustering performance of DBSCAN.
method Proposed nearest neighbour method to implement Isolation Similarity.
result DBSCAN clustering performance surpassed by DP algorithm.