The study compares Euclidean and cosine distances in medical drug prescription prediction.
problem Comparing Euclidean and cosine distances in medical drug prescription prediction.
method Established geometric properties and compared distances in real-world medical data.
result Different distances lead to different optimizing nonlinear kernel embedding frameworks.
New method uses Cantor embeddings and Wasserstein distances to analyze predictive states in time series data.
problem Analyzing predictive states in stochastic processes using time series data.
method Wasserstein distances for detecting predictive equivalences in symbolic data, using Cantor embeddings for finite-dimensional representation.
result Exploratory analysis of temporal structure in various processes reveals insights.
The paper studies the distance from calibration in sequential prediction, proving upper and lower bounds.
problem The challenge is to measure and minimize the deviation from perfect calibration in sequential binary prediction.
method The approach involves proving an O ( T ) O(\sqrt{T}) O ( T ) upper bound and an Ω ( T 1 / 3 ) Ω(T^{1/3}) Ω ( T 1/3 ) lower bound, using structural results and minimax arguments. result An O ( T ) O(\sqrt{T}) O ( T ) upper bound on the calibration distance is achieved, with an Ω ( T 1 / 3 ) Ω(T^{1/3}) Ω ( T 1/3 ) lower bound showing the inherent difficulty. Predicting RNA base distances using a large language model.
problem Accurately predicting RNA structural information, especially distance maps.
method Using a large pretrained RNA language model coupled with a transformer.
result The model can accurately infer RNA base distances from sequence data.
In building intelligent transportation systems such as taxi or rideshare services, accurate prediction of travel time and distance is crucial for customer experience and resource management. Using the NYC taxi dataset, which contains taxi trips data collected from GPS-enabled taxis [23], this paper investigates the use…
A new method estimates uncertainty without explicit prediction models.
problem Costly data acquisition in machine learning.
method Distance-weighted Class Impurity method for uncertainty estimation.
result Distance-weighted Class Impurity effectively estimates uncertainty without prediction models.
A new conformal prediction framework for graph-valued outputs using Z-Gromov-Wasserstein distances.
problem Lack of principled uncertainty quantification for graph-valued supervised prediction.
method Proposes a conformal prediction framework using Z-Gromov-Wasserstein distances for graph-valued outputs.
result Provides distribution-free coverage guarantees for graph-valued outputs.
This work proposes unsupervised learning by predicting random distances in neural networks.
problem Lack of labelled data in unsupervised learning tasks.
method Train neural networks to predict random distances in a randomly projected space, optimizing for genuine class structures.
result Learned representations outperform state-of-the-art methods in anomaly detection and clustering.
Enhances graph comparison by incorporating edge features using Fused Gromov-Wasserstein distance.
problem Graph distances overlook edge attributes, limiting their effectiveness.
method Introduced Fused Gromov-Wasserstein distance for graph comparison with edge features. Proposed algorithms for distance and barycenter computation.
result Empirically validated the effectiveness of the novel distance in graph learning tasks.
DMLreg uses expert knowledge to improve model performance in high-dimensional settings.
problem Improving model performance in high-dimensional prediction problems.
method Learning a Mahalanobis distance metric from expert comparisons and integrating it into a regularized linear model.
result DMLreg leads to improvements in model performance when expert knowledge is relevant.
Learning to predict multi-label outputs is challenging, but in many problems there is a natural metric on the outputs that can be used to improve predictions. In this paper we develop a loss function for multi-label learning, based on the Wasserstein distance. The Wasserstein distance provides a natural notion of dissi…
Study predicts climate data at distant locations using machine learning.
problem Predict climate variables at distant locations where comprehensive data collection is not feasible.
method Uses reservoir computing and vector autoregression models for prediction.
result Machine learning improves prediction accuracy for highly correlated data.
The paper uses distance correlation for brain connectivity and a novel multi-task learning model for age prediction.
problem Estimating age-related gender differences in brain functional connectivity.
method Estimates functional connectivity using distance correlation and proposes a non-convex multi-task learning model.
result The proposed non-convex multi-task learning model outperforms other models in age prediction and gender-specific connectivity.
Enhanced travel time prediction using deep neural networks and road network information.
problem Improving travel time estimation using deep learning models.
method Proposes incorporating road network information into deep learning models for travel time prediction.
result Improved travel time prediction, especially with limited training data.
Connects robust optimization to conformal prediction for uncertainty sets.
problem Decision-making under uncertainty in sensitive data.
method Defines Mahalanobis distance as a conformity score and generates conformal uncertainty sets.
result Conformal uncertainty sets provide valid and conservative ellipsoidal regions.
Machine learning is often used in virtual screening to find compounds that are pharmacologically active on a target protein. The weave module is a type of graph convolutional deep neural network that uses not only features focusing on atoms alone (atom features) but also features focusing on atom pairs (pair features);…
The study improves model performance prediction on unseen distributions.
problem Improving model performance prediction on unseen distributions.
method Connecting domain adaptation and predictive uncertainty techniques, investigating distributional distances and DoC.
result Difference of confidences (DoC) successfully estimates classifier performance change over various distribution shifts.
DW-KNN improves KNN by integrating distance and neighbor reliability for better prediction accuracy.
problem Standard KNN assumes all neighbors are equally reliable, leading to unreliable predictions in heterogeneous feature spaces.
method DW-KNN integrates exponential distance with neighbor validity, providing instance-level interpretability and reducing hyperparameter sensitivity.
result DW-KNN achieves 0.8988 average accuracy, ranks 2nd among six methods, and has the lowest cross-validation variance.
Bayesian neural networks improve uncertainty calibration with DAP priors.
problem Improving predictive uncertainty in deep learning models outside training data.
method Distance-Aware Prior (DAP) calibration method to correct overconfidence.
result Demonstrated effectiveness in various classification and regression tasks.
Mahalanobis distance detects anomalies well, but not for classification.
problem Detecting anomalies in neural classifier outputs.
method Analyzes Mahalanobis distance-based anomaly detection method, revealing its reliance on information not useful for classification.
result Combining Mahalanobis and ODIN methods improves anomaly detection performance and robustness.
Improves uncertainty estimation and OOD detection in neural networks.
problem Accurate uncertainty estimation and OOD detection in neural networks.
method Investigates one-vs-all and distance-based logit representations for probabilities.
result One-vs-all formulations improve calibration without additional complexity.
Study predicts U.S. county COVID-19 growth using demographic and social distancing data.
problem Predicting county-level COVID-19 growth during the pandemic.
method Spectral clustering, correlation matrix, demographic features, social distancing scores, LSTM model.
result Effective prediction of future county growth using demographic and social distancing data.
SMERF improves distance learning with decision forests.
problem Subpar inference and prediction due to poor distances.
method Decision forest algorithm for distance learning.
result Empirically demonstrates ability to approximate arbitrary distances and identify features.
Novel neural network approximates exact distance for robust classification.
problem Adversarial attacks on neural networks in safety-critical systems.
method Signed Distance Classifiers (SDCs) and Unitary-Gradient Neural Network.
result Approximates exact distance from classification boundary for certifiable predictions.
DE improves GNNs by distinguishing graph substructures, enhancing accuracy.
problem Limited expressive power of GNNs in representing graph substructures.
method Introduces Distance Encoding (DE) to assist GNNs in distinguishing graph substructures.
result DE distinguishes graph substructures that traditional GNNs cannot, improving accuracy.
New method predicts spatial events like hurricanes and earthquakes with uncertainty.
problem Quantifying uncertainty in natural hazard predictions.
method Representing spatial point clouds as empirical measures, constraining prediction sets to spatial data manifold, using Wasserstein distance.
result Achieves near-nominal coverage and lower energy/manifold distances compared to baselines.
Proposes a new Sliced-Wasserstein distance for covariance matrices in M/EEG signals.
problem Efficiently dealing with distributions of covariance matrices in M/EEG multivariate time series.
method Defines a Sliced-Wasserstein distance for symmetric positive definite matrices and applies it to brain-age prediction and Brain Computer Interface applications.
result Demonstrates computational efficiency and strong theoretical guarantees for the proposed distance.
A statistical model predicts generalization in few-shot learning.
problem Lack of validation sets in few-shot learning makes generalization estimation difficult.
method Introduced a Gaussian model of feature distribution and an unbiased estimator for class-conditional density distances.
result Our approach outperforms alternatives like leave-one-out cross-validation.
Proposes ridge regression on Riemannian manifolds for time-series prediction.
problem Time-series prediction on Riemannian manifolds.
method Combines Riemannian least-squares fitting via Bézier curves, empirical covariance on manifolds, and Mahalanobis distance regularization.
result Significant error reduction in synthetic spherical experiments and hurricane forecasting.
The paper proposes a method to assess when automated predictions are reliable.
problem Ensuring reliability and safety of automated decision-making in machine learning.
method Clustering to measure distances between outputs and class centroids, defining a safety threshold based on these distances.
result The proposed metric can efficiently determine when automated predictions are acceptable and when they should be deferred.
Nearest Neighbors Algorithm is a Lazy Learning Algorithm, in which the algorithm tries to approximate the predictions with the help of similar existing vectors in the training dataset. The predictions made by the K-Nearest Neighbors algorithm is based on averaging the target values of the spatial neighbors. The selecti…
Deep learning predicts protein structures accurately.
problem Predicting the 3D structure of proteins from amino acid sequences.
method Embeddings and deep learning models for backbone atom distance matrices and torsion angles.
result Competitive results in CASP13 and CASP12, surpassing previous winners.
The paper uses distance covariance to improve fairness in machine learning models.
problem Improving fairness in machine learning models.
method Using conditional and distance covariance statistics to assess independence and add a penalty for fairness.
result The method effectively reduces the fairness gap in machine learning models.
Multi-label classification is a type of supervised learning where an instance may belong to multiple labels simultaneously. Predicting each label independently has been criticized for not exploiting any correlation between labels. In this paper we propose a novel approach, Nearest Labelset using Double Distances (NLDD)…
The paper explores fair predictors in supervised learning using IPMs and Kolmogorov distance.
problem Achieving fairness in supervised learning with significant demographic effects.
method Identifying conditions for SP-fair predictors and using IPMs to measure unfairness.
result Fair predictors can improve accuracy and are computationally efficient.
SNGP improves single-model deep uncertainty by enhancing distance-awareness.
problem Improving uncertainty estimation in deep learning models, especially for real-time applications.
method SNGP improves distance-awareness of DNNs through spectral normalization and Gaussian process layers.
result SNGP outperforms other single-model approaches in prediction, calibration, and out-of-domain detection.
WR-CP reduces prediction set size and coverage gap under distribution shift.
problem Guaranteed coverage under distribution shift not achievable with i.i.d. assumption.
method Wasserstein distance, probability measure pushforwards, importance weighting, regularized representation learning.
result Reduces coverage gap to 3.2% across different confidence levels.
Enhances forecasting of complex systems using FKMD.
problem Forecasting high-dimensional dynamical systems with unknown features.
method Featurized Koopman Mode Decomposition (FKMD) using delay embedding and learned Mahalanobis distance.
result Improves prediction accuracy for various complex systems.
Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide explanations that help the affected individuals not only to understand why a predictio…
A robust conformal method for set estimation using non-conformity scores.
problem Lack of robustness in standard conformal prediction methods for outliers or heavy tails.
method Robust conformal method based on non-conformity score defined as half-mass radius.
result Empirical conformal regions converge to robust population central set.
A new framework for measuring uncertainty in machine learning models.
problem Uncertainty measures for second-order distributions in machine learning models have theoretical flaws.
method Formal criteria and a general framework based on the Wasserstein distance.
result The Wasserstein distance-based measure satisfies all proposed criteria for meaningful uncertainty measures.
Proposes new loss functions for better handling bimodal predictive uncertainty.
problem Bimodal predictive uncertainty in machine learning models.
method Family of distribution-aware loss functions integrating normalized RMSE with Wasserstein and Cramér distances.
result Proposed loss functions reduce predictive uncertainty estimation error by 45% on complex bimodal datasets.
The paper studies and mitigates accuracy disparity in regression models.
problem Accuracy disparity between different demographic subgroups in high-stakes domains.
method Error decomposition theorem and distribution alignment algorithm.
result The proposed algorithm effectively mitigates accuracy disparity while maintaining predictive power.
SHAP Distance assesses semantic fidelity of synthetic tabular data.
problem Semantic fidelity of synthetic tabular data is not well evaluated.
method SHAP Distance, defined as cosine distance between global SHAP attribution vectors.
result SHAP Distance detects semantic discrepancies overlooked by standard measures.
Parts of Texas, Oklahoma, and Kansas have experienced increased rates of seismicity in recent years, providing new datasets of earthquake recordings to develop ground motion prediction models for this particular region of the Central and Eastern North America (CENA). This paper outlines a framework for using Artificial…
Energy distance measures feature heterogeneity in federated learning.
problem Heterogeneity across data sources hinders model aggregation in federated learning.
method Introduced Taylor approximations of energy distance for efficient computation.
result Taylor approximations accurately capture feature discrepancies, improving convergence.
A new framework enhances IDW models for complex industrial datasets.
problem Low performance of IDW models in complex industrial datasets.
method Deep reinforcement learning network to enhance IDW models and learn hyperparameters.
result The proposed framework achieves differential spatial prediction and is more accurate than current IDW models.
This paper investigates methods for quantifying similarity between audio signals, specifically for the task of of cover song detection. We consider an information-theoretic approach, where we compute pairwise measures of predictability between time series. We compare discrete-valued approaches operating on quantised au…