MD-split+ creates locally valid prediction regions for complex data.
problem Localized prediction regions for complex data.
method Localized model performance-based partitioning of feature space X.
result MD-split+ creates valid prediction regions that scale to high dimensions.
Paper introduces conformal prediction for reliable uncertainty quantification in landmark localization.
problem Systematic underestimation of total predictive uncertainty in landmark localization.
method Conformal prediction framework for multi-output regression, generating flexible prediction regions.
result Methods outperform existing approaches in validity and efficiency across 2D and 3D datasets.
We introduce a method, KL-LIME, for explaining predictions of Bayesian predictive models by projecting the information in the predictive distribution locally to a simpler, interpretable explanation model. The proposed approach combines the recent Local Interpretable Model-agnostic Explanations (LIME) method with ideas …
RbX generates local explanations for black-box models using greedy polytope construction.
problem Generating interpretable local explanations for complex models.
method Greedy algorithm for building a convex polytope to approximate feature regions.
result RbX can more accurately identify important features compared to existing methods.
This work investigates how GCNs should handle local structure discrepancies in testing nodes.
problem GCNs assume homophily but real graphs often have discrepancies in local structure.
method Using causal graph analysis, the study intervenes the graph structure to assess the local structure's impact on predictions.
result The method effectively enhances GCN predictions by eliminating local structure discrepancies.
Proposes efficient calibration for indoor localization models.
problem Calibration data scarcity in wireless indoor localization.
method Uses synthetic labels and prediction sets to fine-tune a predictor and estimate bias.
result Yields rigorous coverage guarantees for prediction sets.
LSCI provides locally adaptive prediction sets for operator models with tighter coverage.
problem Generating robust, calibrated uncertainty quantification for operator models.
method Local Sliced Conformal Inference (LSCI) for operator models.
result LSCI yields tighter prediction sets with stronger adaptivity compared to conformal baselines.
Locally adaptive interpretable regression improves linear regression's predictability.
problem Linear regression's predictability is limited; it lacks adaptability.
method Locally adaptive interpretable regression (LoAIR) uses neural networks to predict percentile of a Gaussian distribution for regression coefficients.
result LoAIR achieves comparable or better predictive performance than state-of-the-art baselines.
Proposes GPR with local explanation for feature interpretation.
problem Lack of feature interpretation in Gaussian process regression.
method Introduces a locally linear model to explain feature contributions in GPR predictions.
result Achieves comparable predictive performance to GPR and superior interpretability.
Understanding black-box machine learning models is crucial for their widespread adoption. Learning globally interpretable models is one approach, but achieving high performance with them is challenging. An alternative approach is to explain individual predictions using locally interpretable models. For locally interpre…
LCMQR improves prediction intervals by adapting to local heteroscedasticity.
problem Efficient and adaptive prediction intervals for local heteroscedasticity.
method LCMQR combines multi-quantile information with kernel-based localization.
result LCMQR constructs tighter intervals than prior methods, especially in heterogeneous environments.
Local surrogate models, to approximate the local decision boundary of a black-box classifier, constitute one approach to generate explanations for the rationale behind an individual prediction made by the back-box. This paper highlights the importance of defining the right locality, the neighborhood on which a local su…
Dividing local Gaussian processes improve real-time prediction efficiency.
problem Efficient online prediction for large data sets.
method Iterative data-driven division of input space for sublinear computational complexity.
result Sublinear computational complexity in real-time prediction.
Locally Valid and Discriminative prediction intervals for deep learning models.
problem Efficient and theoretically sound uncertainty quantification for deep learning models.
method Locally Valid and Discriminative prediction intervals (LVD) using kernel regression.
result Locally Valid and Discriminative prediction intervals (LVD) offer better performance and scalability compared to existing methods.
Paper improves predictive distributions for rare events using a simple framework.
problem Local miscalibration of predictive distributions for rare events.
method Semiparametric diagnostic transport maps to correct tail probabilities.
result Semiparametric maps improve predictions for severe weather hazards.
Adaptive method improves prediction intervals with global coverage guarantees and local error distribution.
problem Global coverage guarantees of conformal regression are often violated by local error distributions.
method Adaptive Conformal Regression with Jackknife+ Rescaled Scores
result Improves local coverage without sacrificing global coverage, especially in low-data regimes.
Measures consistency of tabular LLM predictions under fine-tuning multiplicity.
problem Conflicting predictions from fine-tuned tabular LLMs.
method Local stability measure in embedding space.
result Probabilistic guarantees on prediction consistency under multiplicity.
A new method predicts links better across various networks.
problem Adaptive link prediction for diverse network types.
method MOLI method using local information from neighbors of different distances.
result MOLI outperforms other link prediction algorithms.
New method detects drift in high-dimensional data.
problem Understanding and localizing concept drift in learning systems.
method Conformal predictions for drift localization.
result Our approach outperforms existing methods on image datasets.
Extracting actionable intelligence from distributed, heterogeneous, correlated and high-dimensional data sources requires run-time processing and learning both locally and globally. In the last decade, a large number of meta-learning techniques have been proposed in which local learners make online predictions based on…
New method identifies important features and interactions in RF models.
problem Limited theoretical understanding of local feature and interaction importance in RF models.
method Combines global and local analysis to identify frequent feature co-occurrences.
result Proves consistent recovery of true local signal features and interactions.
This paper presents a new approach for Gaussian process (GP) regression for large datasets. The approach involves partitioning the regression input domain into multiple local regions with a different local GP model fitted in each region. Unlike existing local partitioned GP approaches, we introduce a technique for patc…
L-ARC improves model fairness by localizing risk guarantees.
problem Improving model fairness in tasks like image segmentation and wireless networks.
method Localized Adaptive Risk Control (L-ARC) updates a threshold function in RKHS to target localized statistical risk guarantees.
result L-ARC produces prediction sets with improved fairness across different data subpopulations.
Protein structure prediction has been a grand challenge problem in the structure biology over the last few decades. Protein quality assessment plays a very important role in protein structure prediction. In the paper, we propose a new protein quality assessment method which can predict both local and global quality of …
Improved local multivariable regression for better inference with limited data.
problem Limited sample size hampers local polynomial/multivariable regression.
method Prediction-Powered Inference (PPI) algorithm for local multivariable regression.
result Significantly reduces estimation variance without increasing error.
Proposes a new method for localized uncertainty quantification in random forests using proximity measures.
problem Localized uncertainty quantification in random forests for improved reliability of predictions.
method Forming localized distributions of Out-Of-Bag (OOB) errors around nearby points defined by similarity measures (proximities) to create prediction intervals for regression and trust scores for classification.
result Localized prediction intervals and trust scores enhance model accuracy and provide higher accuracy-rejection AUC scores than competing methods.
LoBoost improves local conformal prediction for gradient-boosted trees without extra data splits.
problem Quantifying uncertainty in gradient-boosted tree predictions.
method Model-native local conformal prediction using leaf structure.
result Competitive interval quality and improved test MSE with large calibration speedups.
Flexible Kernels for Protein Property Prediction
problem Predicting protein properties from sparse experimental data
method Sequence kernels using evolutionary substitution matrices and local linearity
result Data-efficient models of protein property landscapes
Enhances local explainability and trust scores using RF proximities.
problem Improving local explainability and trust in random forest models.
method Rewriting RF predictions as weighted sums of training targets using proximities.
result Proximities provide a novel method to assess model predictions' correctness.
DSVNP uses global and local latent variables for improved neural process predictions.
problem Limited expressiveness of vanilla neural processes in capturing target-specific local variation.
method Introduces DSVNP combining global and local latent variables for prediction.
result Competitive prediction performance in multi-output regression and uncertainty estimation.
The paper proves ACC for local volumes under boundedness conditions.
problem Proving the ACC conjecture for local volumes of klt singularities.
method Analyzing klt singularities with bounded ambient germs.
result ACC conjecture for local volumes holds under bounded conditions.
The study evaluates how well local explanations align with model predictions.
problem Capturing the faithfulness of local explanations to model predictions.
method Introducing consistency and sufficiency as properties, and developing quantitative measures and estimators.
result Quantitative measures of consistency and sufficiency depend on test-time data distribution.
This paper improves Bayesian neural nets by using local linearization.
problem Underfitting in Bayesian neural networks.
method Local linearization of Bayesian neural networks to create a generalized linear model (GLM) for predictions.
result The GLM predictive resolves common underfitting problems of the Laplace approximation.
A new approach predicts next observations without explicit decoding for better control.
problem High-dimensional observations and unknown dynamics in real-world control tasks.
method Proposes a novel information-theoretic LCE approach using predictive coding to develop a decoder-free model.
result The model reliably learns a controllable latent space leading to superior performance.
CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.
problem Inefficient global Koopman operator approximation for distinct local dynamics.
method Cluster-Weighted EDMD (CW-EDMD) learns a soft phase-space partition and per-cluster EDMD operators using EM objective.
result CW-EDMD significantly reduces prediction errors across various systems and configurations.
Study proposes a novel local explanation method for deep learning classifiers in process mining.
problem Lack of interpretability in deep learning models for process mining.
method Defines local regions using latent space representations and visualizes explanations.
result Deep learning classifier achieves high performance and local explanations increase user trust.
Combines global and local features for better social circle prediction in ego-networks.
problem Efficiently analyzing ego-networks with hidden local structures.
method Evolved deep learning techniques to capture both global and local network features.
result Social circle prediction benefits from a combination of global and local features.
New image restoration method using localized patches and external databases.
problem Image restoration challenges.
method Localized structured prediction and non-linear multi-task learning for optimizing a penalized energy function.
result Strong statistical guarantees and practical effectiveness demonstrated on various image restoration problems.
NGSLL combines DNN accuracy with linear model interpretability.
problem Combining high accuracy of DNNs with interpretability of linear models.
method Neural generators of sparse local linear models (NGSLL) using DNNs to approximate non-linear functions.
result Effective in real-world datasets, achieving high predictive performance and interpretability.
As we rely more and more on machine learning models for real-life decision-making, being able to understand and trust the predictions becomes ever more important. Local explainer models have recently been introduced to explain the predictions of complex machine learning models at the instance level. In this paper, we p…
Improved Bayesian FL method calibrates predictions for federated learning.
problem Overconfident predictions in Bayesian FL methods for federated learning.
method β-Predictive Bayes algorithm interpolates between mixture and product of local predictive posteriors, tuning parameter β for better calibration.
result Demonstrated superior calibration compared to other baselines, even with increased data heterogeneity.
Local MDI+ improves feature importance for tree-based models, enhancing interpretability and performance.
problem Lack of instance-specific feature importance for tree-based models.
method Local MDI+ extends MDI+ framework to provide instance-specific feature importances.
result Local MDI+ outperforms existing baselines, improving predictive performance by 10%.
New method calibrates Gaussian product experts for better predictions.
problem Erratic predictions and uncalibrated uncertainty in Gaussian product experts.
method Calibration via tempered softmax and Wasserstein barycenter for predictions.
result Improved predictions with better mean and uncertainty quantification.
Proposes LSCP for spatial data uncertainty quantification.
problem Uncertainty quantification in spatial statistics, especially for complex and heterogeneous datasets.
method Localized quantile regression for spatial conformal prediction.
result LSCP provides more accurate and consistent prediction intervals.
Stochastic gradient methods are dominant in nonconvex optimization especially for deep models but have low asymptotical convergence due to the fixed smoothness. To address this problem, we propose a simple yet effective method for improving stochastic gradient methods named predictive local smoothness (PLS). First, we …
Our interest in this paper is in the construction of symbolic explanations for predictions made by a deep neural network. We will focus attention on deep relational machines (DRMs, first proposed by H. Lodhi). A DRM is a deep network in which the input layer consists of Boolean-valued functions (features) that are defi…
We introduce a new model-agnostic explanation technique which explains the prediction of any classifier called CLE. CLE gives an faithful and interpretable explanation to the prediction, by approximating the model locally using an interpretable model. We demonstrate the flexibility of CLE by explaining different models…
The paper investigates interpretability techniques for deep learning models in medical data.
problem Understanding the logic behind predictions of black-box models in medical decision-making.
method Applied deep neural networks and random forests to a medical dataset. Used autoencoders and local interpretable models to provide insights.
result Local interpretable models and autoencoders provide meaningful insights into cancer predictions, identifying distinct and non-generalizable features.